Skip to content

Erdős problem 1059

Are there infinitely many primes pp such that p−k!p - k! is composite for each kk such that 1≤k!<p1 ≤ k! < p?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1059.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1059.leanErdos1059.allFactorialSubtractionsComposite_1011 lineExact file
Erdos1059.AllFactorialSubtractionsComposite 101
TestStatement only, no proof

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page