Skip to content

Erdős problem 275

If a finite system of rr congruences {ai(modni):1≤i≤r}\{ a_i\pmod{n_i} : 1\leq i\leq r\} (the nin_i are not necessarily distinct) covers 2r2^r consecutive integers then it covers all integers.

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:4f0c50e13fbf3e90316aea81ad01e3dbdcf7c76498434c1f9e50594bb5896231
Metadata
sha256:34adcfd09992ff803ccaa604856b6e886b15dffa44b7c2c22d730bc52ab42c0b
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:dd8f3b7d6da12ec9c673c2b71bc0cfd47e7d70a64a53f47efcd391350d93604b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb