# Lucky Numbers

The *lucky numbers* are obtained by a sieving process that resembles the Sieve of Eratosthenes and the procedure in the Josephus Flavius problem. The lucky numbers sieve has been invented in the 1950 by a group in the Mathematics Division at the Los Alamos National Laboratory, at the time when Stanislaw Ulam was its director.

Start with a sequence of positive integers listed in the natural order. Remove every other number. The first (after 1) left-over number is 3. Mark 3 and remove every third number among the remaining ones. The first left-over number past three is 7. Mark 7 and remove every seventh number among the remaining ones. Continue this way. (The next number is 9.) ...

What if applet does not run? |

The numbers that remain after the *sieve* have been sensibly dubbed *lucky*. One may observe that 13 belongs to the sequence.

To every one surprise the lucky numbers share some distributive properties with the primes. The fact is startling because the definition of primes depends on their role in the multiplication and products of numbers, whereas the lucky numbers are defined by pure counting. Nonetheless, the distribution of the lucky numbers obeys the same law as that of the primes. The same is true about the twin pairs.

### References

- R. K. Guy,
__Lucky Numbers__, in*Unsolved Problems in Number Theory*, 2nd ed, Springer-Verlag, pp. 108-109, 1994. - C. S. Ogilvy and J. T. Anderson,
*The Book of Numbers*, Oxford University Press, 1966, 102-103 - N. J. A. Sloane, Sequence A000959 in
*The On-Line Encyclopedia of Integer Sequences*. - S. M. Ulam,
*A Collection of Mathematical Problems*, Interscience Publishers, 1960, p 120 - S. M. Ulam,
*Adventures of a Mathematician*, University of California Press, 1991 - D. G. Wells,
*The Penguin Dictionary of Curious and Interesting Numbers*, Penguin, 1986, #32

## Related material
| |

## Sieves | |

| |

| |

| |

| |

| |

| |

|Contact| |Front page| |Contents| |Algebra|

Copyright © 1996-2018 Alexander Bogomolny

69843973