|
|
It has been suggested that this article or section be merged with Euclid number. (Discuss) Proposed since February 2012. |
|
|
This article includes a list of references, but its sources remain unclear because it has insufficient inline citations. Please help to improve this article by introducing more precise citations. (December 2011) |
In mathematics, primorial primes are prime numbers of the form pn# ± 1, where pn# is the primorial of pn (that is, the product of the first n primes).
It follows that
The first few primorial primes are
As of 28 February 2012[ref], the largest known primorial prime is 1098133# − 1 with 476,311 digits, found by the PrimeGrid project.[1]
It is widely believed, but false, that the idea of primorial primes appears in Euclid's proof of the infinitude of the prime numbers: First, assume that the first n primes are the only primes that exist. If either pn# + 1 or pn# − 1 is a primorial prime, it means that there are larger primes than the nth prime (if neither is a prime, that also proves the infinitude of primes, but less directly; note that each of these two numbers has a remainder of either p − 1 or 1 when divided by any of the first n primes, and hence cannot be a multiple of any of them).
In fact, Euclid's proof did not assume that a finite set contains all primes that exist. Rather, it said: consider any finite set of primes (not necessarily the first n primes; e.g. it could have been the set {3, 11, 47}), and then went on from there to the conclusion that at least one prime exists that is not in that set.[2]
and
" Math. Comput. 26 (1972): 567–570.| This number article is a stub. You can help Wikipedia by expanding it. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)