Primorial prime
prime number that is product of first n primes ± 1
In mathematics, a primorial prime is a prime number of the form pn# ± 1, where pn# is the primorial of pn (i.e. the product of the first n primes).
Primality tests show that:
pn# − 1 is prime for n = 2, 3, 5, 6, 13, 24, 66, 68, 167, 287, 310, 352, 564, 590, 620, 849, 1552, 1849, 67132, 85586, 234725, 334023, 435582, 446895, ... (sequence A057704 in the OEIS). (pn = 3, 5, 11, 13, 41, 89, 317, 337, 991, 1873, 2053, 2377, 4093, 4297, 4583, 6569, 13033, 15877, 843301, 1098133, 3267113, 4778027, 6354977, 6533299, ... (sequence A006794 in the OEIS))
pn# + 1 is prime for n = 0, 1, 2, 3, 4, 5, 11, 75, 171, 172, 384, 457, 616, 643, 1391, 1613, 2122, 2647, 2673, 4413, 13494, 31260, 33237, 304723, 365071, 436504, 498865, ... (sequence A014545 in the OEIS). (pn = 1, 2, 3, 5, 7, 11, 31, 379, 1019, 1021, 2657, 3229, 4547, 4787, 11549, 13649, 18523, 23801, 24029, 42209, 145823, 366439, 392113, 4328927, 5256037, 6369619, 7351117, 9562633, ..., (sequence A005234 in the OEIS))
The first term of the third sequence is 0 because p0# = 1 (we also let p0 = 1, see Primality of one , hence the first term of the fourth sequence is 1) is the empty product, and thus p0# + 1 = 2, which is prime. Similarly, the first term of the first sequence is not 1 (hence the first term of the second sequence is also not 2), because p1# = 2, and 2 − 1 = 1 is not prime.
The first few primorial primes are 2, 3, 5, 7, 29, 31, 211, 2309, 2311, 30029, 200560490131, 304250263527209, 23768741896345550770650537601358309 (sequence A228486 in the OEIS).
“Primorial prime” enters the record as prime number that is product of first n primes ± 1. Crown Archives preserves that source wording while asking what Primorial, prime and number can confirm, complicate or overturn.
Why this record matters
“Primorial prime” is worth following because a concise public description often conceals a longer documentary argument. Here, Primorial, prime and number provides the most credible route into that argument.
The citation trail is more important than the brevity of the summary: it shows where individual claims can be examined in context. The source revision retrieved here is dated Nov 29, 2025. The linked authority identifier is Q2085786. None of the 0 selected statements returned an explicit reference. The first chronological checks are 1552, 1849, 1873 and 2053.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Primorial prime”, its source revision and the description used here.
- Expand the search: follow Primorial prime primary sources, Primorial prime archive and Primorial research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Primorial prime”?
- What terminology or title could unlock a more precise catalogue search?
- Which institution is responsible for the underlying evidence?
Search terms from this dossier
This entry incorporates text from “Primorial prime” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.