Thursday, 9 January 2020

summation - How can you prove that 1+5+9+cdots+(4n3)=2n2n without using induction?

Using mathematical induction, I have proved that



1+5+9++(4n3)=2n2n



for every integer n>0.



I would like to know if there is another way of proving this result without using PMI. Is there any geometric solution to prove this problem? Also, are there examples of problems where only PMI is our only option?



Here is the way I have solved this using PMI.




Base Case: since 1=2·121, the formula holds for n=1.



Assuming that the
formula holds for some integer k1, that is,



1+5+9++(4k3)=2k2k



I show that



1+5+9++[4(k+1)3]=2(k+1)2(k+1).




Now if I use hypothesis I observe.



1+5+9++[4(k+1)3]=[1+5+9++(4k3)]+4(k+1)3=(2k2k)+(4k+1)=2k2+3k+1=2(k+1)2(k+1)



No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...