Erdős problem 1188
Estimate the number of minimal distinct covering systems whose moduli all lie in . The candidate proof gives , i.e. .
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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:24a38304073c7006ca91482a81c658812bea76f045304e2d48d05c17225e7bb4
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207