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 corresponds to "congruence" in modular arithmetic: formula_22 and formula_121 are congruent (written formula_122 mod formula_1) when they have the same remainder after division by formula_1. However, in this system of numbers, division by all nonzero numbers is possible if and only if the modulus is prime. For instance, with the prime number formula_125 as modulus, division by formula_28 is possible: formula_127, because clearing denominators by multiplying both sides by formula_28 gives the valid formula formula_129. However, with the composite modulus formula_130, division by formula_28 is impossible. There is no valid solution to formula_132: clearing denominators by multiplying by formula_28 causes