Skip to content

Erdős problem 1059

Start work

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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:282ead58d4d2b0438e7bea26dfb5dd92a1af15319696123e2a9d56f3f5f9d652
Metadata
sha256:096aa60b18239277841c24c71ce8b3ec719718a161a32d8741e853718b06b575
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:3c29a9497ad20f2dae02ee402cfbe8bd0e01a46b36028877e0942f866f80aee5
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON