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.

Workspace

Continue locallyOpen sourceSign in to contribute

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public

  2. Work on it, wherever you work.

    Your machine

  3. Keep an Approach and its Attempts here.

    Needs an account

  4. Attach evidence by its content root.

    Needs an account

  5. Prepare an unsigned Submission draft.

    Needs an account

  6. Sign it with your own key.

    Your machine

  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.

  • argument

    VibeMathed

    Machine
    GPT-5.6 Star Fleet (Claude Fable 5 referee)
    Reported outcome
    partial
    Open the source record