<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.
Answer:
Triangle and square!
Step-by-step explanation:
Let me know if im wrong and I will fix it.
Answer:
Option A
Step-by-step explanation:
c - 12 > - 16
c > -16 + 12
c > -4
Answer:
the artist cuts off 10 inches of ribbon in total
Step-by-step explanation:
2.5 × 4 = 10