Math Help Forum
Menu
Math Help Forum
Home
Algebra
Pre-Calculus
Geometry
Trigonometry
Calculus
Advanced Algebra
Discrete Math
Differential Geometry
Differential Equations
Number Theory
Statistics & Probability
Business Math
Challenge Problems
Math Software
Forums
Physics Help
Chemistry Help
Login
Register
Menu
fibonacci or euclidean
Home
Tags
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
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
padsinseven
Thread
Nov 7, 2007
Replies: 1
Forum:
Advanced Algebra
Home
Tags
Top
Bottom