Answer:
yesssiriytrewqsdfgh
Step-by-step explanation:
(1, 2), (2, 4), (3, 8), (4, 16)
Use a recursive formula to determine the time she will complete station 5. Show your work.
Geometric Recursive Formula
f(n) = f(n − 1) • r
Answer:
Michael buys 800 hockey cards from jackson
For some number to be divisible by 12 it has to be divisible by 6 and by 2.
we can write number n as:
n = 6 + 12*k where k is positive integer.
If we divide n by 12 we will get remainder 6 because 12*k part is divisible by 12.
The part 12*k is as said divisible by 12 which means it is divisible by 6 (as first stated) and it has remainder 0. That leaves us with 6/6 which again has 0 as remainder. That means that number n is divisible by 6
The answer is 0
The other answer is 12x2 – 8xy + 12x + y2 – 2<span>y</span><span />
