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.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:dd8f3b7d6da12ec9c673c2b71bc0cfd47e7d70a64a53f47efcd391350d93604b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page