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$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:282ead58d4d2b0438e7bea26dfb5dd92a1af15319696123e2a9d56f3f5f9d652
Metadata: sha256:096aa60b18239277841c24c71ce8b3ec719718a161a32d8741e853718b06b575
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:3c29a9497ad20f2dae02ee402cfbe8bd0e01a46b36028877e0942f866f80aee5

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207