Primorial prime

Primorial prime

In mathematics, primorial primes are prime numbers of the form "pn"# ± 1, where:

: "pn"# is the primorial of "pn".

: "pn"# − 1 is prime for "n" = 2, 3, 5, 6, 13, 24, ... OEIS|id=A057704

: "pn"# + 1 is prime for "n" = 1, 2, 3, 4, 5, 11, ... (OEIS2C|id=A014545)

The first few primorial primes are

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

As of|2008|url=http://primes.utm.edu/top20/page.php?id=5, the largest known primorial prime is 392113#+1 with 169966 digits, found in 2001 by Daniel Heuer.

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 "n"th 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. [http://aleph0.clarku.edu/~djoyce/java/elements/bookIX/propIX20.html]

See also

* Primorial
* Factorial prime
* Euclid number

References

* A. Borning, "Some Results for k! + 1 and 2 cdot 3 cdot 5 cdot p + 1" "Math. Comput." 26 (1972): 567 - 570.
* Chris Caldwell, [http://primes.utm.edu/top20/page.php?id=5 "The Top Twenty: Primorial"] at The Prime Pages.
*
* Harvey Dubner, "Factorial and Primorial Primes." "J. Rec. Math." 19 (1987): 197 - 203.
* Paulo Ribenboim, "The New Book of Prime Number Records". New York: Springer-Verlag (1989): 4.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Primorial — The primorial has two similar but distinct meanings. The name is attributed to Harvey Dubner and is a portmanteau of prime and factorial . The primorial pn# is defined as the product of the first n primes:Mathworld | urlname=Primorial |… …   Wikipedia

  • Prime quadruplet — A prime quadruplet (sometimes called prime quadruple) is four primes of the form { p , p +2, p +6, p +8}. [MathWorld|urlname=PrimeQuadruplet|title=Prime Quadruplet Retrieved on 2007 06 15.] It is the closest four primes above 3 can be together,… …   Wikipedia

  • Prime gap — A prime gap is the difference between two successive prime numbers. The n th prime gap, denoted g n , is the difference between the ( n +1) th and the n th prime number, i.e.: g n = p n + 1 − p n .We have g 1 = 1, g 2 = g 3 = 2, and g 4 = 4. The… …   Wikipedia

  • Prime k-tuple — In number theory, a prime k tuple is an ordered set of values (i.e. a vector) representing a repeatable pattern of prime numbers. A k tuple is represented as ( a , b , ...) to represent any set of values ( n + a , n + b , ...) for all values of n …   Wikipedia

  • Prime signature — The prime signature of a number is the sequence of exponents of its prime factorisation sorted in order of size.For example, all prime numbers have a prime signature of {1}, the squares of primes have a prime signature of {2}, the products of 2… …   Wikipedia

  • Prime triplet — In mathematics, a prime triplet is a set of three prime numbers of the form ( p , p +2, p +6) or ( p , p +4, p +6). [Chris Caldwell. [http://primes.utm.edu/glossary/page.php?sort=Triplet The Prime Glossary: triplet] from the Prime Pages.… …   Wikipedia

  • Integer sequence prime — In mathematics, an integer sequence prime is a prime number found as a member of an integer sequence. For example, the 8th Delannoy number, 265729, is prime. A challenge in empirical mathematics is to identify large prime values in rapidly… …   Wikipedia

  • List of prime numbers — This is an incomplete list, which may never be able to satisfy particular standards for completeness. You can help by expanding it with reliably sourced entries. By Euclid s theorem, there are an infinite number of prime numbers. Subsets of the… …   Wikipedia

  • Mersenne prime — Named after Marin Mersenne Publication year 1536[1] Author of publication Regius, H. Number of known terms 47 Conjectured number of terms Infinite …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”