Answer:
opo miss sorry di ko po Alam yan
sorry
po
<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.
The answer is B
step by step explanation:
Answer:
Hello! Your answer would be, BELOW!
Step-by-step explanation:
A)
40
D)
Hope I helped! Ask me anything if you have more questions! Have a nice mourning! Brainiest plz! Hope you make an 100%! -Amelia♥