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.
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
No source in this release retained material for this Problem beyond its catalogue entry.
Reported activity
Reported by these sources. Not reviewed here.
argument
- Machine
- Reported outcome