Skip to content

Erdős problem 7

Start work

Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than 11?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:a9d756c8a44bbd81956b1cb4589fec72af90e173920e19886102e857b2eb5a23
Metadata
sha256:fea2318fddca73db290dd29ae22d110d77148a10b13f44b210b323a10b804433
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:6c349d0cbddb8796b85ffbd175b1dc436c388b0faf90f03f77ba733a445a8d98
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON