No label defined (Q4664845)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2154281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2154281 |
Statements
8 April 2005
0 references
amicable numbers
0 references
Euler's rule
0 references
0.9045856
0 references
0.8711138
0 references
0 references
0 references
0.8187443
0 references
0.8022917
0 references
The pair \((m, n)\) of positive integers with \(m< n\) is called an amicable pair if \(\sigma(m)= \sigma(n)= m +n\) where \(\sigma(m)\) denotes the sum of all positive divisors of \(m\) (including \(1\) and \(m\)). The smallest amicable pair was known to the Pythagoreans, and by 2003 over four million had been found, the largest pair having 5577 digits each. In this article the authors give a survey, illustrated by many examples, of the theoretical and computational methods and rules used to find new amicable pairs. This provides an update to the historical survey by \textit{E. J. Lee} and \textit{J. S. Madachy} in [J. Recreational Math. 5, 77--93, 153--173, 231--249 (1972; Zbl 0362.10005)] with errata in [ibid. 6, pp 53, 164, 229 (1973)]. Up to Euler's time, three amicable pairs were known, and he found 59 new ones. A number of rules for finding amicable pairs are stated and illustrated in this article but lack of space means that only Euler's rule is proved. There is an extensive list of references at the end, and the last section contains some unsolved questions including the obvious one of whether there are infinitely many amicable pairs. For the entire collection see [Zbl 1051.11008].
0 references