Erdős Problem #538
If each integer has at most $r$ representations $m = pa$ with $p$ prime and $a \in A \subseteq [1, N]$, what is the best upper bound for $\sum_{a \in A} 1/a$? The candidate proof gives the matching order $\Theta_r(\log N / \log\log N)$.
Exact FrontierDelta
Scope and record
Occurred: Jul 13, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Erdős Problem #538 · Erdős #538 · Problem 538
Confidence: Not scored
Registry verification: lean verified · announcement · candidate
Attribution
VibeMathed
registry · event recorded by
GPT-5.6 starships (Claude Fable 5 reviewer)
model · ai model contributor · OpenAI / Anthropic
Lineage and corrections
This event attributed to GPT-5.6 starships (Claude Fable 5 reviewer)