Primorial prime

Share on Facebook Share on Twitter Email
Top

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

pn# − 1 is prime for n = 2, 3, 5, 6, 13, 24, ... (sequence A057704 in OEIS)
pn# + 1 is prime for n = 1, 2, 3, 4, 5, 11, ... (sequence A014545 in OEIS)

The first few primorial primes are

3, 5, 7, 29, 31, 211, 2309, 2311, 30029, 200560490131, 304250263527209


As of 28 February 2012 (2012 -02-28), 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]

See also

References

  1. ^ Primegrid.com; forum announcement, 2 March 2011
  2. ^ [1]

Post a question - any question - to the WikiAnswers community:

Copyrights:

Mentioned in

211 (number)
30000 (number)
29 (number)
31 (number)