Lucky number

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. In the same work they also suggested calling another 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. Twin lucky numbers and twin primes also appear to occur with similar frequency. 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 their apparent similarities with the prime numbers, some mathematicians have suggested that some of their common properties may also be found in other sets of numbers generated by sieves of a certain unknown form, but there is little theoretical basis for this conjecture.

  1. ^ Weisstein, Eric W. "Lucky Number". mathworld.wolfram.com. Retrieved 2020-08-11.
  2. ^ Gardiner, Verna; Lazarus, R.; Metropolis, N.; Ulam, S. (1956). "On certain sequences of integers defined by sieves". Mathematics Magazine. 29 (3): 117–122. doi:10.2307/3029719. ISSN 0025-570X. JSTOR 3029719. Zbl 0071.27002.
  3. ^ Hawkins, D.; Briggs, W.E. (1957). "The lucky number theorem". Mathematics Magazine. 31 (2): 81–84, 277–280. doi:10.2307/3029213. ISSN 0025-570X. JSTOR 3029213. Zbl 0084.04202.

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search