Euler's factorization method

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Euler's factorization method is a technique for factoring a number by writing it as a sum of two squares in two different ways. For example the number can be written as or as and Euler's method gives the factorization .

The idea that two distinct representations of an odd positive integer may lead to a factorization was apparently first proposed by Marin Mersenne. However, it was not put to use extensively until one hundred years later by Euler. His most celebrated use of the method that now bears his name was to factor the number , which apparently was previously thought to be prime even though it is not a pseudoprime by any major primality test.

Euler's factorization method is more effective than Fermat's for integers whose factors are not close together and potentially much more efficient than trial division if one can find representations of numbers as sums of two squares reasonably easily. Euler's development ultimately permitted much more efficient factoring of numbers and, by the 1910s, the development of large factor tables going up to about ten million[citation needed]. The methods used to find representations of numbers as sums of two squares are essentially the same as with finding differences of squares in Fermat's factorization method.

The great disadvantage of Euler's factorization method is that it cannot be applied to factoring an integer with any prime factor of the form 4k + 3 occurring to an odd power in its prime factorization, as such a number can never be the sum of two squares. Even odd composite numbers of the form 4k + 1 are often the product of two primes of the form 4k + 3 (e.g. 3053 = 43 × 71) and again cannot be factored by Euler's method.

This restricted applicability has made Euler's factorization method disfavoured for computer factoring algorithms, since any user attempting to factor a random integer is unlikely to know whether Euler's method can actually be applied to the integer in question. It is only relatively recently that there have been attempts to develop Euler's method into computer algorithms for use on specialised numbers where it is known Euler's method can be applied.

Theoretical basis[edit]

The Brahmagupta–Fibonacci identity states that the product of two sums of two squares is a sum of two squares. Euler's method relies on this theorem but it can be viewed as the converse, given we find as a product of sums of two squares.

First deduce that

and factor both sides to get


Now let and so that there exists some constants satisfying

  • ,
  • ,

  • ,
  • ,

Substituting these into equation (1) gives

Canceling common factors yields

Now using the fact that and are pairs of relatively prime numbers, we find that


We now see that and

Applying the Brahmagupta–Fibonacci identity we get

As each factor is a sum of two squares, one of these must contain both even numbers: either or . Without loss of generality, assume that pair is even. The factorization then becomes


Worked example[edit]


we have from the formula above:

a = 1000 (A) ac = 28 gcd[A,C] k = 4
b = 3 (B) a + c = 1972 gcd[B,D] h = 34
c = 972 (C) db = 232 l = 7
d = 235 (D) d + b = 238 m = 58



  • Ore, Oystein. "Euler's Factorization Method". Number Theory and Its History. pp. 59–64. ISBN 0-486-65620-9. 
  • McKee, James (1996). "Turning Euler's Factoring Method into a Factoring Algorithm". Bulletin of the London Mathematical Society. 4 (28): 351–355. doi:10.1112/blms/28.4.351.