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 theorem function that gives the number of primes less than or equal to , for any real number . For example, because there are four prime numbers (2, 3, 5 and 7) less than or equal to 10. The prime number theorem then states that is a good approximation to , in the sense that the limit of the "quotient" of the two functions and as increases without bound is 1: known as the asymptotic law of distribution of prime numbers. Using asymptotic notation this result can be restated as This notation (and the theorem) does "not" say anything about the