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.
Sources
Retained excerpts/
VibeMathed
Retained source excerpt
For irreducible covering sets of size $k$, determine their count, the possible largest modulus, the maximal reciprocal sum, and whether divisor-set examples occur infinitely often.
Open exact source location