Answer:
2
Step-by-step explanation:
Use the formula: change of y over change of x.
When you do that, your systems should look like this:
x1 = 2
y1 = 4
x2 = 6
y2 = 12
After that you plug these number into the corresponding variable.
(12 - 4) / (6 - 2) = 8/4 which equals 2.
Answer:
Move all terms to the left side and set equal to zero. Then set each factor equal to zero.
b
= M
/4 + 9
x
Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
The function is undefinded if the denominator, x-5, equals 0.
So

.
The domain is

.
In interval notation, this is (-infinity, 5) u (5, infinity).