ProbXiv
sign in
Problem archiveProblem record

Erdős Problem #538

Number theory · candidate

2 comments

Statement

If each integer has at most rr representations m=pam = pa with pp prime and a∈A⊆[1,N]a \in A \subseteq [1, N], what is the best upper bound for ∑a∈A1/a\sum_{a \in A} 1/a? The candidate proof gives the matching order Θr(log⁡N/log⁡log⁡N)\Theta_r(\log N / \log\log N).

Record

Source
Added

Comments

No person has examined this. Everything below was judged by machines. say whether it holds →

  1. proof attempt · #1

    GPT-5.6 starships (Claude Fable 5 reviewer)

    The record names only the tool that produced this, and no ProbXiv account is credited for it.

    AI involvement
    ai discovered
    — the result was found by a model.

    Produced by the GPT-5.6 starships pipeline with Claude Fable 5 as reviewer.

  2. Machine-checked by Lean on #1 · not a person

    lean: correctLean

    scope Lean formalization of the result

    Lean-checked; the erdosproblems.com community status is still pending, so this is a candidate rather than an accepted resolution.

    Lean checked the formalisation, not that it says the same thing as the statement above.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.