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.
Workspace
public preview
- #1189
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
argument
- Machine
- Reported outcome