Fortunate number Fortunate number A Fortunate number, named after Reo Fortune, is the smallest integer "m" > 1 such that, for a given positive integer "n", "p"# + "m" is a prime number, where the primorial "p"# is the product of the first "n" prime numbers. For example, to find the seventh Fortunate number, one would first calculate the product of the first seven primes (2, 3, 5, 7, 11, 13 and 17), which is 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
Prime number grow to infinity as formula_1 goes to infinity (see the Basel problem). In this sense, prime numbers occur more often than squares of natural numbers, although both sets are infinite. Brun's theorem states that the sum of the reciprocals of twin primes, is finite. Because of Brun's theorem, it is not possible to use Euler's method to solve the twin prime conjecture, that there exist infinitely many twin primes. The prime counting function formula_88 is defined as the number of primes not greater than formula_1. For example, formula_90, since there are five primes less than or equal to 11. Methods