Factorial primes

formal-conjectures · wikipedia · ams-11

A factorial prime is a prime that is one more or one less than a factorial. It
is conjectured that there are infinitely many factorial primes.

There are infinitely many factorial primes.

Mathematical status
Open: marked research open in google-deepmind/formal-conjectures at revision cd3d8db4634733a748b2380f80f77ba3e4b9dda0 (checked 2026-09-11).

Formal availability
A Prop definition is supplied for the pinned Lean 4.33.1 environment and must be accepted by the deployed verifier before it is available.

Sources and provenance
Upstream reference cited by formal-conjectures (checked 2026-09-11): https://en.wikipedia.org/wiki/Factorial_prime
Upstream reference cited by formal-conjectures (checked 2026-09-11): https://oeis.org/A088054
Formal statement provenance (Apache-2.0) (checked 2026-09-11): https://github.com/google-deepmind/formal-conjectures/blob/cd3d8db4634733a748b2380f80f77ba3e4b9dda0/FormalConjectures/Wikipedia/FactorialPrime.lean
Local target: Corpus.WikipediaFactorialPrime.infinitely_many_factorial_primes
Source SHA-256: 5dafbe472b7ba37d7747f5c40ca04c0e97550752f472a545ad58a3e2b39677d8
Lean v4.33.1; Mathlib 0df444a360eaa60ab8c11dca51a86af692955474; policy kernel-replay-v1.
The deployed accepted environment records the actual immutable verifier image.

Research discussions are not verified proofs. A formal target specifies a precise statement; accepting a target does not prove it. Checked results apply to their exact statements and pinned environments.

Public JSON record