Answer:
6.26666666667, your welcome :)
<h2>
Answer with explanation:</h2>
We are asked to prove by the method of mathematical induction that:

where n is a positive integer.
then we have:

Hence, the result is true for n=1.
- Let us assume that the result is true for n=k
i.e.

- Now, we have to prove the result for n=k+1
i.e.
<u>To prove:</u> 
Let us take n=k+1
Hence, we have:

( Since, the result was true for n=k )
Hence, we have:

Also, we know that:

(
Since, for n=k+1 being a positive integer we have:
)
Hence, we have finally,

Hence, the result holds true for n=k+1
Hence, we may infer that the result is true for all n belonging to positive integer.
i.e.
where n is a positive integer.
I think it might be B.. but i’m not sure bc I would think it would be amen who prefer dance
(3,52)(7,108)
slope = (108 - 52) / (7 - 3) = 56/4 = 14
y = mx + b
slope(m) = 14
(3,52)...x = 3 and y = 52
sub and find b, the y int (the original amount of cards)
52 = 3(14) + b
52 = 42 + b
52 - 42 = b
10 = b
so ur equation is y = 14x + 10....with x being the number of years and y being the total cards. <== ur equation is y = 14x + 10
He started with 10 cards....and has been adding 14 cards every year.
so after 10 years...
y = 14(10) + 10
y = 140 + 10
y = 150 <== after 10 years, he will have 150 cards
Answer:
letter a
Step-by-step explanation:
a plus b equal to a