Erdős problem 1188
Estimate the number of minimal distinct covering systems whose moduli all lie in . The candidate proof gives , i.e. .
Nothing has been recorded here yet.
How far the record reaches3 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal1 retained
- ResolutionNone filed
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingResolution
No source retained here records an outcome for this question.
Its collection still marks it open.
Where the source files it579 share a topic
Erdős problem 321acceptedCarrying a Standing. Browse the topic.