Maths WorkshopMaths problems with full solutions
Exercise 1038Logic, sets and proofs › Proof techniques › InductionL1Added 3 Nov 2026

Fibonacci growth bound

#induction#Fibonacci#growth

Statement

Prove by induction that Fn≤φnF_n\le\varphi^n where φ=(1+5)/2\varphi=(1+\sqrt5)/2 and F0=0,F1=1F_0=0,F_1=1.

Hint

φ2=φ+1\varphi^2=\varphi+1. Strong induction: Fn+2=Fn+1+Fn≤φn+1+φn=φn(φ+1)=φn+2F_{n+2}=F_{n+1}+F_n\le\varphi^{n+1}+\varphi^n=\varphi^n(\varphi+1)=\varphi^{n+2}.

Show solutionHide solution

Solution

Base cases. F0=0≤1=φ0F_0=0\le1=\varphi^0. F1=1≤φ≈1.618F_1=1\le\varphi\approx1.618. ✓

Inductive step. Assume Fn≤φnF_n\le\varphi^n and Fn+1≤φn+1F_{n+1}\le\varphi^{n+1}. Then
Fn+2=Fn+1+Fn≤φn+1+φn=φn(φ+1)=φn⋅φ2=φn+2.F_{n+2}=F_{n+1}+F_n\le\varphi^{n+1}+\varphi^n=\varphi^n(\varphi+1)=\varphi^n\cdot\varphi^2=\varphi^{n+2}.

Conclusion. Fn≤φnF_n\le\varphi^n for all nn.