Erdős Problem #1059 — Are there infinitely many primes pp such that p−k!p-k! is composite for each kk such that 1≤k!<p1\leq k!<p?

At least 21 years old · documented by

Are there infinitely many primes pp such that p−k!p-k! is composite for each kk such that 1≤k!<p1\leq k!<p?

References

Progress summary

Refreshed
Open

The problem has been formalized, but no proof, disproof, or other progress specific to it was found.

The problem is recorded in a Lean 4 formalization, but the retrieved record reports no proof, counterexample, claimed solution, or verification specific to it.

Current status (as of September 2026): The conjecture remains open; only its formalization is recorded, with no verified or claimed progress found.

Sources

Solutions 0

No solutions have been posted yet.