Prove that $\gcd(F_{n+1},F_n)$ takes exactly $n-1$ iteration steps for computation.

97 Views Asked by At

I'm struggling with the proof, that $\gcd\left(F_{n+1},F_n\right)$ takes exactly $n-1$ iteration steps. I'm not quite sure how to start - any help would be really appreciated!