Fortunate number

Unsolved problem in mathematics
Are any Fortunate numbers composite? (Fortune's conjecture)

In number theory, a Fortunate number is the smallest integer m>1 such that, for a given positive integer n, pn#+m is a prime number, where the primorial pn# 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⋅3⋅5⋅7⋅11⋅13⋅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,…

(sequence A005235 in the OEIS). 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,…

(sequence A046066 in the OEIS).

Fortune conjectured that no Fortunate number is composite. A Fortunate prime is a Fortunate number which is also a prime number. As of 2017, all known Fortunate numbers are prime, checked up to n=3000.

The Fortunate number for pn# is always above pn and all its divisors are larger than pn. This is because pn#+m is divisible by the prime factors of m not larger than pn. It follows that if a composite Fortunate number does exist, it must be greater than or equal to pn+12.

Paul Carpenter defines the less Fortunate numbers as the differences between pn# and the largest prime less than pn#−1. These are also conjectured to be always prime.

References

  1. ↑ Guy (1994), pp. 7–8.
  2. 1 2 "Prime Glossary: Fortunate number". PrimePages. Retrieved 24 August 2026.