Erdős problem 1189
For irreducible covering sets of size , determine their count, the possible largest modulus, the maximal reciprocal sum, and whether divisor-set examples occur infinitely often.
Nothing has been recorded here yet.
How far the record reaches2 of 6 stages
- Sourceerdos-problems
- StatementRetained
- FormalNone associated
- ResolutionNone filed
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingFormal declaration
No formal declaration is associated with this question.
A formal statement is the first thing a check can run against.
Where the source files it579 share a topic
Erdős problem 321acceptedCarrying a Standing. Browse the topic.