Skip to content

Erdős problem 1056

Start work

Let k≥2k ≥ 2. Does there exist a prime pp and consecutive intervals I0,…,IkI_0,\dots,I_k such that ∏n∈Iin≡1mod  n\prod\limits_{n{\in}I_i}n \equiv 1 \mod n for all 1≤i≤k1 \le i \le k?

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:74fd412773e4089bce57d041d3799e0d8e4efcf7da4e9a641c48514eea93c4a6
Metadata
sha256:ce26ba24a3f72ca0522a1cafdeae530dd0368506dc56632efd53c9c88db0434f
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:b47b441261a9963cb1cdb490ea2cd6d8ade1ad3164540777ed8527bde9d90936
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON