Skip to content

Erdős problem 204

Start work

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

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:d348bae799786637a87046c393f4e72b6d3ffdb8f1e301413aa24262d658dd20
Metadata
sha256:fba53dcd009bebde3d1d1d9c2fa20382410800b033dec237b78c5c11927c3dc6
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:7f19df23b994e6c7c049417c8c20e664a184c95056db2b227e6561791994f4c3
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON