How do I prove by mathmatical induction that 211221231241

How do I prove by mathmatical induction that:
(2(1)-1)+(2(2)-1)+(2(3)-1+(2(4)-1) +.............. + (2(n)-1) = n^2

Prove by mathematical induction: (2(1) - 1) + (2(2) - 1) + (2(3) - 1) + (2(4) - 1) + + (2(n) - 1) = n^2

Solution

We have (2*1-1) = 2-1= 1 = 12, (2*1-1) + (2*2-1)= (2-1)+ (4-1) = 1+3 = 4 = 22, (2*1-1) + (2*2-1)+(2*3-1) = 4+(6-1) = 4+5 = 9 = 32

Hence, by induction, we have (2*1-1) + (2*2-1)+(2*3-1) +…+ ( 2*n-1) = n2

How do I prove by mathmatical induction that: (2(1)-1)+(2(2)-1)+(2(3)-1+(2(4)-1) +.............. + (2(n)-1) = n^2 Prove by mathematical induction: (2(1) - 1) +

Get Help Now

Submit a Take Down Notice

Tutor
Tutor: Dr Jack
Most rated tutor on our site