Assertion: euclidean algorithm | /r/Desires | n steps
Facets:
value: for the pair
type: TRANSITIVE-OBJECT
value: for a pair of natural numbers
type: OTHER
Source sentences:
text: If the Euclidean algorithm requires N steps for a pair of natural numbers a > b > 0, the smallest values of a and b for which this is true are the Fibonacci numbers F N+2 and F N+1 , respectively.
text: More precisely, if the Euclidean algorithm requires N steps for the pair a > b, then one has a ≥ F N+2 and b ≥ F N+1 .