Skip to content

Erdős problem 1189

Start work

For irreducible covering sets of size kk, determine their count, the possible largest modulus, the maximal reciprocal sum, and whether divisor-set examples occur infinitely often.

Sources

The source's own material, retained exactly.

1 retained statement36c6d0fef71a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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