Skip to content

Erdős problem 7

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

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:6c349d0cbddb8796b85ffbd175b1dc436c388b0faf90f03f77ba733a445a8d98
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page