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 limit of the "difference" of the two functions as increases without bound. Instead, the theorem states that approximates in the sense that the relative error of this approximation approaches 0 as increases without bound. The prime number theorem is equivalent to the statement that the th prime number satisfies the asymptotic notation meaning, again, that the relative error of this approximation approaches 0 as increases without bound. For example, the th prime number is , and ()log() rounds to , a relative error of about 6.4%. The prime number theorem is also equivalent to where and are the first and