Loading AI tools
Set of numbers used in the smoothsort algorithm From Wikipedia, the free encyclopedia
The Leonardo numbers are a sequence of numbers given by the recurrence:
Edsger W. Dijkstra[1] used them as an integral part of his smoothsort algorithm,[2] and also analyzed them in some detail.[3] [4]
A Leonardo prime is a Leonardo number that's also prime.
The first few Leonardo numbers are
The first few Leonardo primes are
The Leonardo numbers form a cycle in any modulo n≥2. An easy way to see it is:
The cycles for n≤8 are:
Modulo | Cycle | Length |
2 | 1 | 1 |
3 | 1,1,0,2,0,0,1,2 | 8 |
4 | 1,1,3 | 3 |
5 | 1,1,3,0,4,0,0,1,2,4,2,2,0,3,4,3,3,2,1,4 | 20 |
6 | 1,1,3,5,3,3,1,5 | 8 |
7 | 1,1,3,5,2,1,4,6,4,4,2,0,3,4,1,6 | 16 |
8 | 1,1,3,5,1,7 | 6 |
The cycle always end on the pair (1,n-1), as it's the only pair which can precede the pair (1,1).
The Leonardo numbers are related to the Fibonacci numbers by the relation .
From this relation it is straightforward to derive a closed-form expression for the Leonardo numbers, analogous to Binet's formula for the Fibonacci numbers:
where the golden ratio and are the roots of the quadratic polynomial .
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.