Skip to content

Erdős problem 1188

Estimate the number F(x)F(x) of minimal distinct covering systems whose moduli all lie in [1,x][1, x]. The candidate proof gives loglogF(x)/logx1\log\log F(x)/\log x \to 1, i.e. F(x)=exp(x1+o(1))F(x) = \exp(x^{1+o(1)}).

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#1188
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

  • argument

    VibeMathed

    Machine
    GPT-5.6 starships (Claude Fable 5 reviewer)
    Reported outcome
    candidate
    Open the source record

Search problems.science

Find a Problem, Result, source, or page