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.
- Parallelogram
- Parallelogram Illusion
- Parallelogram Law
- Parallelohedron
- Parallelotope
- Parallel Postulate
- Parallel (Surface of Revolution)
- Paralogic Triangles
- Parameter
- Parameterization
- Parameter (Quadric)
- Parametric Latitude
- Parametric Test
- Pareto Distribution
- Parity
- Parity Constant
- Parking Constant
- Parodi's Theorem
- Parry Circle
- Parry Point
- Parseval's Integral
- Parseval's Relation
- Parseval's Theorem
- Partial Derivative
- Partial Differential Equation