Let u sub n be the nth Fibonacci number. Prove that the Euclidean algorithm takes precisely n steps to prove that gcd(u sub n+1, u sub n)=1
Follow Math Help Forum on Facebook and Google+
Keep on going until you reach the final step.
View Tag Cloud