Lamé's Theorem
If 
is the smallest Integer for which there is a smaller Integer 
such that and generate aEuclidean Algorithm remainder sequence with 
steps, then is the Fibonacci Number 
. Furthermore, the number of steps in the Euclidean Algorithm never exceeds 5 times the number of digits in thesmaller number.
References
Honsberger, R. ``A Theorem of Gabriel Lamé.'' Ch. 7 in Mathematical Gems II. Washington, DC: Math. Assoc. Amer., pp. 54-57, 1976.
- Continuity Principle
- Continuous
- Continuous Distribution
- Continuous Function
- Continuous Space
- Continuum
- Continuum Hypothesis
- Contour
- Contour Integral
- Contour Integration
- Contracted Cycloid
- Contraction
- Contraction (Graph)
- Contraction (Tensor)
- Contradiction Law
- Contravariant Tensor
- Contravariant Vector
- Control Theory
- Convective Acceleration
- Convective Derivative
- Convective Operator
- Convergence Acceleration
- Convergence Improvement
- Convergence Tests
- Convergent