Skip to content

Erdős problem 1059

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

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#1059
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page