Problem detail · source-aware

Erdos's Question on Shifted Pairwise-Coprime Reciprocal Sums

partialconfidence 70%

VibeMathed reports this item as partial. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.

Precise statement

Let $\mathcal{M}(n)$ be the supremum of $\sum_{a \in A} 1/(n-a)$ over pairwise coprime $A \subset [1,n)$. Erdos asked whether $\mathcal{M}(n) \le \sum_{p<n} 1/p + O(1)$ uniformly. The average order is settled: $\sum_{n \le N} \mathcal{M}(n) = e^{-\gamma} N \log\log N + O(N)$.

The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.

What AI did

ChatGPT

The declaration says ChatGPT was used for ideation and formalization during preparation, with the author responsible for the mathematics. Part of the same series of Erdos-problem resolutions in this catalog.

Provider: OpenAI · Prompt public: unknown · Independence: unknown

Verification boundary

unreviewed

Single-author arXiv preprint; not yet peer-reviewed.

Correctness: unknown · statement fidelity: unaudited · peer review: none

Timeline

  1. arXiv:2606.17955 - An Average-Order Theorem for a Shifted Pairwise-Coprime Extremal Problem

    the average order; the uniform bound Erdos asked about is not settled

Known method families

argument (source-reported)

Source-reported tools: argument.

Independent: unknown · difference confidence: 0

What remains uncertain

VibeMath has not independently audited the mathematical statement, proof, or novelty claim.

  • VibeMath has not independently verified the mathematical claim.
  • AI-attempt independence and training-data exposure are unknown unless explicitly documented.
  • VibeMath has not independently audited the mathematical statement, proof, or novelty claim.