I don't know if there are any options....so I did reasearch I found the question and I believe it is graph 4 because it intersects at (1,5)!
X= -7 y=2 (-7,2).
You multiply the first equation by 2 and the second by 3, then you can cancel out the x values to get the y value. Then you go back and plug in the y value to get x.
Answer:
150×500=30, i got you man
Answer:
-8
Step-by-step explanation:
If we let x and y represent the first and second numbers, respectively, we can write the problem statement as the equations ...
We can multiply the first equation by -9 and add 4 times the second equation to get an equation in y alone:
-9(4x +5y) +4(9x +2y) = -9(-28) +4(11)
-37y = 296 . . . . . simplify
296/-37 = y = -8 . . . . . divide by the coefficient of y
The second number is -8.
Answer:
336 ways ;
56 ways
Step-by-step explanation:
Number of ways to have the officers :
Number of qualified candidates, n = 8
Number of officer positions to be filled = 3
A.)
Using permutation (since the ordering matters):
nPr = n! ÷(n-r)!
8P3 = 8! ÷ (8-3)!
8P3 = 8! ÷ 5!
8P3 = (8*7*6)
8P3 = 336 ways
B.) Different ways of appointing committee: (ordering doesn't count as officers can also be appointed)
Using the combination relation :
nPr = n! ÷(n-r)!r!
8C3 = 8! ÷ (8-3)! 3!
8C3 = 8! ÷ 5!3!
8C3 = (8*7*6) ÷ (3*2*1)
8C3 = 336 / 6
8C3 = 56 ways
