MathCastle
Proof Writing & Problem SolvingSuperchallenge

Proof Writing & Problem Solving · Superchallenge problem

With F0=0F_0 = 0, F1=1F_1 = 1 and Fn+1=Fn+Fn−1F_{n+1} = F_n + F_{n-1}, induction on nn proves Fm+n=FmFn+1+Fm−1FnF_{m+n} = F_m F_{n+1} + F_{m-1} F_n, and also that consecutive Fibonacci numbers are coprime. Use these to find gcd⁡(F45,F60)\gcd(F_{45}, F_{60}).

Practice more like this