Amicable Numbers and Euler

-

 Two distinct positive integers a and b are said to form an amicable pair if the sum of the proper divisors of a is equal to b, and the sum of the proper divisors of b is equal to a.

A proper divisor of a number is a positive factor of that number other than the number itself. For example, the proper divisors of 6 are 1,2, and 3.



The ancient Greeks were already interested in amicable pairs, and they knew of an example: 220 and 284. The proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, and 110. The proper divisors of 284 are 1, 2, 4, 71, and 142.

If we write s(n) for the sum of the proper divisors of n. We have



220 and 284 was the only amicable pair known to the ancient Greeks, but over the centuries, two more pairs were found: 17296 and 18416, and 9363584 and 9437056. Those three pairs were all that were known before Euler tackled the problem of finding amicable pairs, and he found 58 more pairs, thus increasing the supply of known pairs from 3 all the way up to 61. Not bad!

The Sum of Divisors Function

In order to say anything about amicable numbers and how to find them, it is helpful to know how to compute the sum of the divisors of a number. It turns out to be better to consider the sum of all divisors, rather than just the proper divisors, and we’ll turn the amicable number problem into a problem about the sum of all divisors momentarily.

Let n be a positive integer. We let σ(n) denote the sum of all the positive divisors of n.

Example.

There is a clean way to compute σ(n), at least if we know the prime factorization of n.

 Theorem: Suppose the prime factorization of n is 

Then 



Example. Since the prime factorizations of 220 and 284 are  

we have

Note the following consequence of the theorem

Let us now rephrase the amicable number problem in terms of the σ function. The sum of the proper divisors of a number n is simply s(n) = σ(n) − n: the sum of all the divisors, except for n itself. So, if a and b are amicable, that means that

or

So, finding amicable pairs is the same as finding pairs (a, b) with σ(a) = σ(b) = a + b

By 1946 there were 390 known pairs, but the advent of computers has allowed the discovery of many thousands since then. As of December 2020, there are over 1,22,6,469,501 known amicable pairs.

Can you find some other pairs of amicable numbers?
The genius of Euler percolates through all of mathematics. His accomplishments were truly extraordinary. 


References:
1) Amicable Numbers, Wikipedia

2) The mathematics of Euler, Simon Rubinstein-Salzedo, Euler Circle.


Comments

Post a Comment

Popular posts from this blog

How to make a cool million Dollars by solving a math problem?

-
Image
The Millennium Prize Problems are seven problems in mathematics that were stated by the Clay Mathematics Institute in 2000. As of June 2020, six of the problems remain unsolved. A correct solution to any of the problems results in a US $1,000,000 prize sometimes called a Millennium Prize being awarded by the institute.  Solved Problem: -  Poincare conjecture. When the Clay institute first announced these seven problems, it was generally perceived by the mathematics community that these seven problems would remain unsolved for the foreseeable future. To their surprise, Grigori Perelman a recluse Russian mathematician solved the Poincare conjecture and in July 2010 he famously declined the 1 million dollar prize!   Furthermore, in August 2006, he declined the Fields medal which is considered even more prestigious than the Nobel Prize as it is given every four years to a mathematician under the age of 40. The Nobel Prize is given every year with n...
Read more

The Famous Basel Problem: The process that led Euler to the answer!

-
Image
Euler is considered to be one of the greatest mathematician of the 18 th century and many believe that he was among the greatest of all time. The answer to the Basel problem is considered to be among his many gems. It is the sum of the series shown below and the answer is astounding! What is π doing there? Mathematician at the time summed up the series to the first 10, 100, and 1000 terms and the slow rate of convergence gave very little clue to what the answer could be.  Euler realized that he would have to find a function that would converge much faster. After some trial and error he found the function shown below whose power series expansion is shown.   So if we integrate the above expression from 0 to 1 This is what he was looking for! To evaluate the integral in the left, he broke it into two parts. Then he evaluated each of the integrals in turn. Then the next integral Put x=1-t When x=1/2, t=1/2 When ...
Read more

Millennium Problem: Riemann Hypothesis

-
Image
A prime number is a number that is divisible only by itself and 1. Some examples being  2, 3, 5, 7, 9, 11, 13.…   The great mathematician Euclid proved centuries ago that there are an infinite number of them continuing without pattern ad infinitum. However, their real importance is given by what is known as the Fundamental Theorem of Arithmetic. It states that every number can be uniquely expressed as a product of prime numbers. Let’s take the example of 364 = 2 × 2 × 7 × 13. This is the only way that 364 can be obtained by prime numbers! Therefore, they are the atoms or building blocks of numbers. But in 1859, the great German mathematician Bernhard Riemann hypothesized that the spacing of the primes logically follows from other numbers, now known as the “nontrivial zeros” of the Riemann zeta function. The Riemann zeta function takes inputs not only real numbers but also  complex numbers — meaning they have both “real” and “imaginary” components — and yields ...
Read more