Amicable numbers

Demonstration with Cuisenaire rods of the amicability of the pair of numbers (220,284), the first of the series.

In mathematics, the amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number. That is, s(a)=b and s(b)=a, where s(n)=σ(n)-n is equal to the sum of positive divisors of n except n itself (see also divisor function).

The smallest pair of amicable numbers is (220, 284). They are amicable because the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110, of which the sum is 284; and the proper divisors of 284 are 1, 2, 4, 71 and 142, of which the sum is 220.

The first ten amicable pairs are: (220, 284), (1184, 1210), (2620, 2924), (5020, 5564), (6232, 6368), (10744, 10856), (12285, 14595), (17296, 18416), (63020, 76084), and (66928, 66992) Template:OEIS. It is unknown if there are infinitely many pairs of amicable numbers.

A pair of amicable numbers constitutes an aliquot sequence of period 2. A related concept is that of a perfect number, which is a number that equals the sum of its own proper divisors, in other words a number which forms an aliquot sequence of period 1. Numbers that are members of an aliquot sequence with period greater than 2 are known as sociable numbers.

History

Template:Unsolved Amicable numbers were known to the Pythagoreans, who credited them with many mystical properties. A general formula by which some of these numbers could be derived was invented circa 850 by the Iraqi mathematician Thābit ibn Qurra (826–901). Other Arab mathematicians who studied amicable numbers are al-Majriti (died 1007), al-Baghdadi (980–1037), and al-Fārisī (1260–1320). The Iranian mathematician Muhammad Baqir Yazdi (16th century) discovered the pair (9363584, 9437056), though this has often been attributed to Descartes. Much of the work of Eastern mathematicians in this area has been forgotten.

Thābit ibn Qurra's formula was rediscovered by Fermat (1601–1665) and Descartes (1596–1650), to whom it is sometimes ascribed, and extended by Euler (1707–1783). It was extended further by Borho in 1972. Fermat and Descartes also rediscovered pairs of amicable numbers known to Arab mathematicians. Euler also discovered dozens of new pairs. The second smallest pair, (1184, 1210), was discovered in 1867 by 16-year-old B. Nicolò I. Paganini (not to be confused with the composer and violinist), having been overlooked by earlier mathematicians.

The first ten amicable pairs

#	m	n
1	220	284
2	1,184	1,210
3	2,620	2,924
4	5,020	5,564
5	6,232	6,368
6	10,744	10,856
7	12,285	14,595
8	17,296	18,416
9	63,020	76,084
10	66,928	66,992

There are over 1 billion known amicable pairs.

Rules for generation

While these rules do generate some pairs of amicable numbers, many other pairs are known, so these rules are by no means comprehensive.

In particular, the two rules below produce only even amicable pairs, so they are of no interest for the open problem of finding amicable pairs coprime to 210 = 2·3·5·7, while over 1000 pairs coprime to 30 = 2·3·5 are known [García, Pedersen & te Riele (2003), Sándor & Crstici (2004)].

Thābit ibn Qurrah theorem

The Thābit ibn Qurrah theorem is a method for discovering amicable numbers invented in the 9th century by the Arab mathematician Thābit ibn Qurrah.

It states that if $$\begin{array}{cc}p& =3\times 2^{n-1}-1,\\ q& =3\times 2^n-1,\\ r& =9\times 2^{2n-1}-1,\end{array}$$

where Template:Math is an integer and Template:Mvar are prime numbers, then Template:Math and Template:Math are a pair of amicable numbers. This formula gives the pairs Template:Math for Template:Math, Template:Math for Template:Math, and Template:Math for Template:Math, but no other such pairs are known. Numbers of the form Template:Math are known as Thabit numbers. In order for Ibn Qurrah's formula to produce an amicable pair, two consecutive Thabit numbers must be prime; this severely restricts the possible values of Template:Mvar.

To establish the theorem, Thâbit ibn Qurra proved nine lemmas divided into two groups. The first three lemmas deal with the determination of the aliquot parts of a natural integer. The second group of lemmas deals more specifically with the formation of perfect, abundant and deficient numbers.

Euler's rule

Euler's rule is a generalization of the Thâbit ibn Qurra theorem. It states that if $$\begin{array}{cc}p& =(2^{n-m}+1)\times 2^m-1,\\ q& =(2^{n-m}+1)\times 2^n-1,\\ r& =(2^{n-m}+1{)}^2\times 2^{m+n}-1,\end{array}$$ where Template:Math are integers and Template:Mvar are prime numbers, then Template:Math and Template:Math are a pair of amicable numbers. Thābit ibn Qurra's theorem corresponds to the case Template:Math. Euler's rule creates additional amicable pairs for Template:Math with no others being known. Euler (1747 & 1750) overall found 58 new pairs increasing the number of pairs that were then known to 61.

Regular pairs

Let (Template:Mvar, Template:Mvar) be a pair of amicable numbers with Template:Math, and write Template:Math and Template:Math where Template:Mvar is the greatest common divisor of Template:Mvar and Template:Mvar. If Template:Mvar and Template:Mvar are both coprime to Template:Mvar and square free then the pair (Template:Mvar, Template:Mvar) is said to be regular Template:OEIS; otherwise, it is called irregular or exotic. If (Template:Mvar, Template:Mvar) is regular and Template:Mvar and Template:Mvar have Template:Mvar and Template:Mvar prime factors respectively, then Template:Math is said to be of type Template:Math.

For example, with Template:Math, the greatest common divisor is Template:Math and so Template:Math and Template:Math. Therefore, Template:Math is regular of type Template:Math.

Twin amicable pairs

An amicable pair Template:Math is twin if there are no integers between Template:Mvar and Template:Mvar belonging to any other amicable pair Template:OEIS.

Other results

In every known case, the numbers of a pair are either both even or both odd. It is not known whether an even-odd pair of amicable numbers exists, but if it does, the even number must either be a square number or twice one, and the odd number must be a square number. However, amicable numbers where the two members have different smallest prime factors do exist: there are seven such pairs known. Also, every known pair shares at least one common prime factor. It is not known whether a pair of coprime amicable numbers exists, though if any does, the product of the two must be greater than 10⁶⁵. Also, a pair of co-prime amicable numbers cannot be generated by Thabit's formula (above), nor by any similar formula.

In 1955 Paul Erdős showed that the density of amicable numbers, relative to the positive integers, was 0.

In 1968 Martin Gardner noted that most even amicable pairs sumsdivisible by 9, and that a rule for characterizing the exceptions Template:OEIS was obtained.

According to the sum of amicable pairs conjecture, as the number of the amicable numbers approaches infinity, the percentage of the sums of the amicable pairs divisible by ten approaches 100% Template:OEIS. Although all amicable pairs up to 10,000 are even pairs, the proportion of odd amicable pairs increases steadily towards higher numbers, and presumably there are more of them than of the even amicable pairs (A360054 in OEIS).

Gaussian integer amicable pairs exist, e.g. s(8008+3960i) = 4232-8280i and s(4232-8280i) = 8008+3960i.

Generalizations

Amicable tuples

Amicable numbers $(m,n)$ satisfy $\sigma (m)-m=n$ and $\sigma (n)-n=m$ which can be written together as $\sigma (m)=\sigma (n)=m+n$. This can be generalized to larger tuples, say $(n_1,n_2,\dots ,n_k)$, where we require

$\sigma (n_1)=\sigma (n_2)=\dots =\sigma (n_k)=n_1+n_2+\dots +n_k$

For example, (1980, 2016, 2556) is an amicable triple Template:OEIS, and (3270960, 3361680, 3461040, 3834000) is an amicable quadruple Template:OEIS.

Amicable multisets are defined analogously and generalizes this a bit further Template:OEIS.

Sociable numbers

Sociable numbers are the numbers in cyclic lists of numbers (with a length greater than 2) where each number is the sum of the proper divisors of the preceding number. For example, $1264460\mapsto 1547860\mapsto 1727636\mapsto 1305184\mapsto 1264460\mapsto \dots$ are sociable numbers of order 4.

Searching for sociable numbers

The aliquot sequence can be represented as a directed graph, $G_{n,s}$, for a given integer $n$, where $s(k)$ denotes the sum of the proper divisors of $k$. Cycles in $G_{n,s}$ represent sociable numbers within the interval $[1,n]$. Two special cases are loops that represent perfect numbers and cycles of length two that represent amicable pairs.

References in popular culture

• Amicable numbers are featured in the novel The Housekeeper and the Professor by Yōko Ogawa, and in the Japanese film based on it.
• Paul Auster's collection of short stories entitled True Tales of American Life contains a story ('Mathematical Aphrodisiac' by Alex Galt) in which amicable numbers play an important role.
• Amicable numbers are featured briefly in the novel The Stranger House by Reginald Hill.
• Amicable numbers are mentioned in the French novel The Parrot's Theorem by Denis Guedj.
• Amicable numbers are mentioned in the JRPG Persona 4 Golden.
• Amicable numbers are featured in the visual novel Rewrite.
• Amicable numbers (220, 284) are referenced in episode 13 of the 2017 Korean drama Andante.
• Amicable numbers are featured in the Greek movie The Other Me (2016 film).
• Amicable numbers are discussed in the book Are Numbers Real? by Brian Clegg.
• Amicable numbers are mentioned in the 2020 novel Apeirogon by Colum McCann.

See also

• Betrothed numbers (quasi-amicable numbers)
• Amicable triple - Three-number variation of Amicable numbers.

References

• Template:EB1911
• Template:Cite book
• Template:Cite book
• Template:MathWorld
• Template:MathWorld
• Template:MathWorld

External links

• Template:Cite journal
• Template:Cite web
• Template:Cite webTemplate:Cbignore
• Template:Cite web
• Template:Cite web (database of all known amicable numbers)