fortunate number

Uses your system voice; voice and rate in settings.

Q5151604Snapshot

≈ 4 min read

Names in other languages

  • Españolnúmero afortunado
  • Englishfortunate number
  • EnglishFortunate number
  • Englishfortunate number
  • Magyarfortunátus szám
  • Françaisnombre fortuné
  • 日本語フォーチュン数
  • 中文幸福數

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In number theory, a Fortunate number is the smallest integer m > 1 such that, for a given positive integer n , p_n\#+m is a prime number, where the primorial p_n\# is the product of the first n prime numbers. They are named after Reo Fortune. For example, to find the seventh Fortunate number, one would first calculate the product of the first seven primes, which is : 2\cdot 3\cdot 5\cdot 7\cdot 11\cdot 13\cdot 17 = 510510. Adding 2 to that gives another even number, while adding 3 would give another multiple of 3. One would similarly rule out the integers up to 18. Adding 19, however, gives 510529, which is prime. Hence 19 is a Fortunate number. The Fortunate numbers for the first primorials are: : 3, 5, 7, 13, 23, 17, 19, 23, 37, 61, 67, 61, 71, 47, 107, 59, 61, 109, 89, 103, 79, 151, 197,\dots . The Fortunate numbers sorted in numerical order with duplicates removed are : 3, 5, 7, 13, 17, 19, 23, 37, 47, 59, 61, 67, 71, 79, 89, 101, 103, 107, 109, 127, 151, 157, 163, 167, 191, 197, \dots . Fortune conjectured that no Fortunate number is composite. A Fortunate prime is a Fortunate number which is also a prime number. , all known Fortunate numbers are prime, checked up to n=3000 . The Fortunate number for p_n\# is always above p_n and all its divisors are larger than p_n . This is because p_n\#+m is divisible by the prime factors of m not larger than p_n .…

In number theory, a Fortunate number is the smallest integer m > 1 such that, for a given positive integer n , p_n\#+m is a prime number, where the primorial p_n\# is the product of the first n prime numbers. They are named after Reo Fortune. For example, to find the seventh Fortunate number, one would first calculate the product of the first seven primes, which is 2\cdot 3\cdot 5\cdot 7\cdot 11\cdot 13\cdot 17 = 510510. Adding 2 to that gives another even number, while adding 3 would give another multiple of 3. One would similarly rule out the integers up to 18. Adding 19, however, gives 510529, which is prime. Hence 19 is a Fortunate number. The Fortunate numbers for the first primorials are: 3, 5, 7, 13, 23, 17, 19, 23, 37, 61, 67, 61, 71, 47, 107, 59, 61, 109, 89, 103, 79, 151, 197,\dots . The Fortunate numbers sorted in numerical order with duplicates removed are 3, 5, 7, 13, 17, 19, 23, 37, 47, 59, 61, 67, 71, 79, 89, 101, 103, 107, 109, 127, 151, 157, 163, 167, 191, 197, \dots . Fortune conjectured that no Fortunate number is composite. A Fortunate prime is a Fortunate number which is also a prime number. , all known Fortunate numbers are prime, checked up to n=3000 . The Fortunate number for p_n\# is always above p_n and all its divisors are larger than p_n . This is because p_n\#+m is divisible by the prime factors of m not larger than p_n . It follows that if a composite Fortunate number does exist, it must be greater than or equal to p_{n+1}^2 . Paul Carpenter defines the less Fortunate numbers as the differences between p_n\# and the largest prime less than p_n\# - 1 . These are also conjectured to be always prime.

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1371131968 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot fortunate-number-587023-dd45b00abb9cf677 · hash dd45b00abb9cf6770cd10bf3f3bead41c3d253c8968043594137b6d32b072463 · captured 1787594143.0 · version history

Cite this page as: encyclopegia.org, “fortunate number”, snapshot fortunate-number-587023-dd45b00abb9cf677. https://encyclopegia.org/a/fortunate-number

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.