Erdős problem 1059

Are there infinitely many primes $p$ such that $p - k!$ is composite for each $k$ such that $1 ≤ k! < p$ ?

Sources

The source's own material, retained exactly.

8 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

1059.lean

Retained formal statement5 of 8

FormalConjectures/ErdosProblems/1059.leanErdos1059.factorialsLessThanN_equivalent1 lineExact file

1∀ (n : ℕ), Erdos1059.factorialsLessThanN n = ↑(Erdos1059.decidableFactorialsLessThanN n)

TestStatement only, no proof