Erdős Problem #830
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Amicable pair a,b is positive integers with sigma(a)=sigma(b)=a+b; count A(x)=#{(a,b):1<=a<=b<=x, amicable}. Determine whether infinitely many such pairs exist, and stronger whether A(x)>x^(1-o(1)); 'a<=b' includes diagonal only if any such positive self-amicable interpretation satisfies sigma(a)=2a (perfect numbers), a possible source-semantic issue! Usually amicable pairs require DISTINCT a≠b, despite formula a<=b. Must not silently count perfect numbers.
A small example
sigma(220)=504=sigma(284)=220+284. Positive perfect number 6 satisfies sigma(6)=12=6+6, meaning literal a=b=6 meets displayed equations but is NOT an amicable pair under distinct-member convention. The equality is an explicit source-normalization hold.
The example can be checked exactly. A finite witness does not replace the universal, asymptotic, or infinitely-often quantifiers in the original question.
What is known
Maintained https://www.erdosproblems.com/latex/830 OPEN, example 220/284; Erdős [Er55b] shows A(x)=o(x); Pomerance [Po81] upper x exp(-(log x)^(1/3)), improved [Po15] x exp(-(1/2+o(1))sqrt(log x loglog x)). These upper bounds are compatible with x^(1-o(1)) lower, and none settles infinitude. The printed 'a<=b' perhaps allows perfect diagonals; standard amicable pair definition excludes equality. Original source theorem scopes must be locked.
The defining equation is
$$
\sigma(a)=\sigma(b)=a+b.
$$
It holds for the classical distinct pair \((220,284)\) since both divisor sums equal 504. However, it also holds for the diagonal pair \((6,6)\) because \(\sigma(6)=12\). Thus the printed inequality \(a\leq b\) and the conventional requirement that amicable numbers be distinct must be reconciled before accepting the definition of \(A(x)\). The Pomerance bounds do not establish the infinitude question.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: open amicable infinitude perfect diagonal source ambiguity. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Write exact sigma and amicable-pair enumerator with two modes (strict a<b and diagonal a<=b), verify 220,284 and 6,6, and check the original Erdős/Pomerance definition before interpreting A(x) bounds. Preserve OPEN infinity.
Independent critical review must compare the historical primary theorem to the written quantifiers, inspect the exact finite fixture, determine whether a claimed status refers to the whole question or a subcase, and validate the actual rendered mathematical output. No protected admission or formal theorem certification is claimed.
Sources and claim boundaries
- Maintained Erdős problem #830 and its LaTeX/bibliography, read 14 October 2026.
- Authenticated original GitHub source-return record. All original historical bibliography, quantified status limitations and exact source observations are recorded in that return.
- Source theorem proof: PARTIAL and identified where unread. Independent mathematical acceptance: PENDING. Protected merge: NONE. Deployed MathJax: NOT VERIFIED. External Lean certification by GCL: NONE.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2101 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.