Amicable numbers — open problem in number theory

Amicable numbers

Relatively prime amicable numbers conjecture. Do there exist amicable numbers (a, b) with gcd(a, b) = 1? All known amicable pairs share a common factor. It is an open question whether a pair of relatively prime amicable numbers can exist. Reference: Wikipedia

Current state (tracked automatically)

All tracked facts and sources

Fact	Value	Source
Formal Conjectures: research statements in the file	3 open, 0 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Try it with your chatbot Submit a claim Follow (RSS)

Cite

@misc{cairn-amicable-numbers,
  title        = {Amicable numbers},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/amicable-numbers}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Famicable-numbers.json)](https://cairn-commons.com/problems/amicable-numbers)

Claims

Verified

Disputed

Refuted

On the literature board

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

Get a task — one click

Your chatbot works on it — 5–10 minutes, in its own tab

Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

The problem

The question

relatively_prime_amicable. Relatively prime amicable numbers conjecture. Do there exist amicable numbers $(a, b)$ with $g cd (a, b) = 1$ ?

All known amicable pairs share a common factor. It is an open question whether a pair of relatively prime amicable numbers can exist.

Reference: Wikipedia

infinitely_many_amicable. Infinitely many amicable numbers conjecture.

Are there infinitely many pairs of amicable numbers?

While many amicable pairs are known, it remains open whether there are infinitely many.

Reference: Wikipedia, erdosproblems.com/830

opposite_parity_amicable. Amicable numbers with opposite parity conjecture. Do there exist amicable numbers $(a, b)$ where one is even and the other is odd?

All known amicable pairs are either both even or both odd. It is widely believed that mixed-parity amicable pairs do not exist, but this remains open.

Reference: Wikipedia

Two distinct positive integers form an amicable pair if each equals the sum of the proper divisors of the other. Equivalently, $(a, b)$ is an amicable pair if $σ (a) = a + b$ and $σ (b) = a + b$ , where $σ (n)$ denotes the sum of all positive divisors of $n$ .

Several open problems about amicable numbers are formalised here:

Do there exist relatively prime amicable numbers?
Are there infinitely many amicable pairs?
Do there exist amicable numbers with opposite parity (one even, one odd)?

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.AmicableNumbers (3 statements).

theorem relatively_prime_amicable :
    ∃ a b : ℕ, IsAmicable a b ∧ a ≠ b ∧ a.Coprime b

theorem infinitely_many_amicable : type_of% Erdos830.erdos_830.parts.i

theorem opposite_parity_amicable :
    ∃ a b : ℕ, IsAmicable a b ∧ (Even a ↔ Odd b)

What counts as progress

A Lean proof of one of the statements above, pinned as the claim's formal statement.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

Source and licence

Imported from Formal Conjectures (Wikipedia), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.