Erdős problem 1188
Estimate the number of minimal distinct covering systems whose moduli all lie in . The candidate proof gives , i.e. .
Workspace
public preview
- #1188
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
argument
- Machine
- Reported outcome