On the primality of $n! \pm 1$ and $2 \times 3 \times 5 \times \dotsm \times p \pm 1$

DOI10.1090/S0025-5718-01-01315-1zbMath0992.11006MaRDI QIDQ2759112

Yves Gallot, Chris K. Caldwell

Publication date: 10 December 2001

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

prime numbersfactorial primesprimality proving algorithms

Mathematics Subject Classification ID

Distribution of primes (11N05) Factorization; primality (11A51) Primes (11A41)

Related Items

Prime Running Functions, On the non-commuting graph in finite Moufang loops

Cites Work

• Where is the next Mersenne prime hiding ?
• Distribution of generalized Fermat prime numbers
• A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
• On the Primality of k! + 1 and 2 ∗ 3 ∗ 5 ∗ ⋯∗ p + 1
• Primes of the Form n! ± 1 and 2 ⋅3 ⋅5 ⋯p ± 1
• New Primality Criteria and Factorizations of 2 m ± 1
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• New Fibonacci and Lucas primes
• Factors of generalized Fermat numbers
• Divisors of Mersenne Numbers
• New Cullen Primes
• Large Sophie Germain primes
• Some Results for k ! ± 1 and 2⋅3⋅5 ⋯p ± 1
• A search for Wieferich and Wilson primes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item