fibonacci or euclidean

  1. P

    Fibonacci/Euclidean Algorithmn proof

    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