Let P(n) be the proposition that Tn<2n.
Basis Step
P(4) is true, because T4=T1+T2+T3=1+1+1=3<16=24.
Inductive Step
We assume that
Tk−1<2k−1
Tk−2<2k−2
Tk−3<2k−3
Tk=Tk−1+Tk−2+Tk−3<2k Under this assumption
Tk+1=Tk+Tk−1+Tk−2<2k+2k−1+2k−2
=2k+1(21+41+81)=2k+1(87)<2k+1P(k+1) is true under the assumption that P(k) is true. This completes the inductive step.
We have completed the basis step and the inductive step, so by mathematical induction we
know that P(n) is true for all n≥4. That is, we have proved that
Tn=Tn−1+Tn−2+Tn−3<2n,n≥4
Comments