We have the sequence dn={1 if n=0ndn−1 if n>0
for all natural numbers n.
(dn−1 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 ∀n∈N∖{0}, d2n−1 ≤ √2n−1.
so far, I've figured out the pattern that for every n greater than or equal to 2, d2n−1=d2n−32n−12n−2.
i.e. d5=d354
In the hints section, they told me to write d2k+1 in terms of d2k−1 and to use the difference of squares: (2k−1)(2k+1)=4k2−1 for the induction step.
Any hints/tips/advice on how to solve this problem is much appreciated!
Thank you!
Answer
Your observation d2n−1=d2n−32n−12n−2
d2k−12k+12k≤√2k−12k+12k≤√2k−1√2k+12k√2k+1≤√4k2−12k√2k+1≤1⋅√2k+1=√2k+1
No comments:
Post a Comment