I know the correct answer but I need you to answer my questions first
9514 1404 393
Answer:
see the attachment
Step-by-step explanation:
The x- and y-intercepts are easily found:
<u><em>X-intercept</em></u>
Set y = 0 and divide by the coefficient of x.
-x +0 = 8
x = -8
__
<u><em>Y-intercept</em></u>
Set x = 0 and divide by the coefficient of y.
0 -2y = 8
y = -4
__
Now, we have two points on the graph: (-8, 0) and (0, -4). A third point can be one that is halfway between these: (-4, -2). The graph is attached.
No, by definition a prime number is one where the only factors are 1 and itself. If some prime number is a multiple of another number, then that other number is a factor of the prime number. But that would make it composite (non-prime)
For example, the number 11 is prime. The only factors are 1 and itself. If we made the claim that 11 is a multiple of 2, then 2 would be a factor of 11 making 11 non-prime (as it doesn't just have 1 and itself as factors).
Note: If you have two numbers A and B, and you say that A is a factor of B, then A is the smaller value. Though there is the exception when A = B. For example, saying "8 is a factor of 16" has 8 being the smaller value.
Another note: if you say "A is a multiple of B", then B is larger than A. The exception is when A = B. Example: "100 is a multiple of 5"
Answer:
-5n + 8
Step-by-step explanation:
<u>1. What is the difference?</u>
The sequence goes down by 5. This means that the formula will have -5n in it.
<u>2. Work out the term before the first term.</u>
The first term is 3, and we know that the sequence goes up by 5. So, to get the term before 3 we would add 5.
3 + 5 = 8 Remember, this is positive 8. (+8)
<u>3. Put that term at the end of the equation. </u>
We have -5n already and we just worked out the term before the first one which is positive 8 - so put that at the end of the equation.
-5n + 8 This is our answer!
Just to prove it works:
<em>Substitute: n = term</em>
Lets see if we can get the 3rd term which is -7. (n = 3)
-5(3) + 8
-15 + 8 = -7
See, it works!
