| == |
In mathematics, Euclid numbers are integers of the form En = pn# + 1, where pn# is the primorial of pn which is the nth prime. They are named after the ancient Greek mathematician Euclid. It is sometimes falsely stated that Euclid's celebrated proof of the infinitude of prime numbers relied on these numbers. In fact, Euclid did not begin with the assumption that the set of all primes is finite. Rather, he said: consider any finite set of primes (he did not assume it contained just the first n primes, e.g. it could have been {3, 41, 53}) and reasoned from there to the conclusion that at least one prime exists that is not in that set.[1] The first few Euclid numbers are 3, 7, 31, 211, 2311, 30031, 510511 (sequence A006862 in OEIS). It is not known whether or not there are an infinite number of prime Euclid numbers. E6 = 13# + 1 = 30031 = 59 x 509 is the first composite Euclid number, demonstrating that not all Euclid numbers are prime. A Euclid number can not be a perfect square. For all n ≥ 3 the last digit of En is 1, since En−1 is divisible by 2 and 5. References 1. ^ Proposition 20. See also * Euclid-Mullin sequence * Proof of the infinitude of the primes Retrieved from "http://en.wikipedia.org/"
 |
|