English

About the Primality of Primorials

Number Theory 2021-10-12 v1

Abstract

A primorial prime is a prime number of the form pn#±1p_n\# \pm 1 where pn#p_n\# denotes the product of all primes less than or equal to pnp_{n}, the nn-th prime. We show that the probability along the lines of Mertens' Theorem that either pn#1p_n\# -1 or pn#+1p_n\# +1 is prime is O(n1)O(n^{-1}) and that the probability that both pn#1p_n\# -1 and pn#+1p_n\# +1 are prime is O(n2)O(n^{-2}), for n>1n>1. The latter result provides evidence that there are in total three instances where both pn#1p_n\# -1 and pn#+1p_n\# +1 are prime. We provide proof that numbers of the from pn#±1p_n\# \pm 1 have the highest probability of being prime.

Keywords

Cite

@article{arxiv.2110.04302,
  title  = {About the Primality of Primorials},
  author = {George Lillie},
  journal= {arXiv preprint arXiv:2110.04302},
  year   = {2021}
}
R2 v1 2026-06-24T06:44:50.617Z