In number theory, a lucky number is a natural number in a set which is generated by a certain "sieve". This sieve is similar to the Sieve of Eratosthenes that generates the primes, but it eliminates numbers based on their position in the remaining set, instead of their value (or position in the initial set of natural numbers).[1]
The term was introduced in 1956 in a paper by Gardiner, Lazarus, Metropolis and Ulam. They suggest also calling its defining sieve, "the sieve of Josephus Flavius"[2] because of its similarity with the counting-out game in the Josephus problem.
Lucky numbers share some properties with primes, such as asymptotic behaviour according to the prime number theorem; also, a version of Goldbach's conjecture has been extended to them. There are infinitely many lucky numbers. However, if Ln denotes the n-th lucky number, and pn the n-th prime, then Ln > pn for all sufficiently large n.[3]
Because of these apparent connections with the prime numbers, some mathematicians have suggested that these properties may be found in a larger class of sets of numbers generated by sieves of a certain unknown form, although there is little theoretical basis for this conjecture. Twin lucky numbers and twin primes also appear to occur with similar frequency
Every second number (all even numbers) in the list is eliminated, leaving only the odd integers:
1
3
5
7
9
11
13
15
17
19
21
23
25
The first number remaining in the list after 1 is 3, so every third number which remains in the list (not every multiple of 3) is eliminated. The first of these is 5:
1
3
7
9
13
15
19
21
25
The next surviving number is now 7, so every seventh remaining number is eliminated. The first of these is 19:
1
3
7
9
13
15
21
25
Continue removing the nth remaining numbers, where n is the next number in the list after the last surviving number. Next in this example is 9.
An animation demonstrating the lucky number sieve. The numbers on a red background are lucky numbers. When a number is eliminated its background changes from grey to purple.
One way that the application of the procedure differs from that of the Sieve of Eratosthenes is that for n being the number being multiplied on a specific pass, the first number eliminated on the pass is the n-th remaining number that has not yet been eliminated, as opposed to the number 2n. That is to say, the list of numbers this sieve counts through is different on each pass (for example 1, 3, 7, 9, 13, 15, 19... on the third pass), whereas in the Sieve of Eratosthenes, the sieve always counts through the entire original list (1, 2, 3...).
When this procedure has been carried out completely, the remaining integers are the lucky numbers:
