Erdős problem 204 · problems.science

Are there $n$ such that there is a covering system with moduli the divisors of $n$ which is 'as disjoint as possible'?

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:d348bae799786637a87046c393f4e72b6d3ffdb8f1e301413aa24262d658dd20
Metadata: sha256:fba53dcd009bebde3d1d1d9c2fa20382410800b033dec237b78c5c11927c3dc6
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:7f19df23b994e6c7c049417c8c20e664a184c95056db2b227e6561791994f4c3

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207