Erdős problem 1059 · problems.science

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

Sources

Browse retained paths and inspect the exact material available for this Problem.

8 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

1059.lean

Retained formal statement4 of 8

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

FormalConjectures/ErdosProblems/1059.leanErdos1059.erdos_10591 lineExact file

1True ↔ {p | Nat.Prime p ∧ Erdos1059.AllFactorialSubtractionsComposite p}.Infinite

OpenStatement only, no proof