Erdős problem 1188
Estimate the number of minimal distinct covering systems whose moduli all lie in . The candidate proof gives , i.e. .
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded here
- Next gapNot recorded
Result history
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 details
Exact provenance
- Problem row
- sha256:bacceb1d2567bd663ef9bf9a4b7f2d2307733742450581ec72eca8e085074320
- Metadata
- sha256:20a0c35517848c55a1c347e016038c9991292b1cb37124e7c16f36fee1c6979b
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:24a38304073c7006ca91482a81c658812bea76f045304e2d48d05c17225e7bb4
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb