Saturday, 28 May 2016

Using induction to prove an inequality for a sequence of numbers



We have the sequence dn={1 if n=0ndn1 if n>0




for all natural numbers n.
(dn1 is the previous number of the sequence.)



examples: d0=1, d1=1, d2=2, d3=32, d4=83



I have to prove using induction that nN{0}, d2n1 2n1.



so far, I've figured out the pattern that for every n greater than or equal to 2, d2n1=d2n32n12n2.
i.e. d5=d354



In the hints section, they told me to write d2k+1 in terms of d2k1 and to use the difference of squares: (2k1)(2k+1)=4k21 for the induction step.




Any hints/tips/advice on how to solve this problem is much appreciated!
Thank you!


Answer



Your observation d2n1=d2n32n12n2

is homologous with d2k+1=d2k12k+12k.



d2k12k+12k2k12k+12k2k12k+12k2k+14k212k2k+112k+1=2k+1


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

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