Aurifeuillian Factorization

In number theory, an aurifeuillean factorization, named after Léon-François-Antoine Aurifeuille, is factorization of certain integer values of the cyclotomic polynomials. Because cyclotomic polynomials are irreducible polynomials over the integers, such a factorization cannot come from an algebraic factorization of the polynomial. Nevertheless, certain families of integers coming from cyclotomic polynomials have factorizations given by formulas applying to the whole family, as in the examples below.

Examples

* Numbers of the form $a^4 + 4b^4$ have the following factorization ( Sophie Germain's identity): $a^4 + 4b^4 = (a^2 - 2ab + 2b^2)\cdot (a^2 + 2ab + 2b^2).$ Setting $a=1$ and $b=2^k$, one obtains the following aurifeuillean factorization of $\Phi_4(2^)=2^+1$, where $\Phi_4(x)=x^2+1$ is the fourth cyclotomic polynomial: $2^+1 = (2^-2^+1)\cdot (2^+2^+1).$
* Numbers of the form $a^6 + 27b^6$ have the following factorization, where the first factor ($a^2 + 3b^2$) is the algebraic factorization of sum of two cubes: $a^6 + 27b^6 = (a^2 + 3b^2)\cdot (a^2 - 3ab + 3b^2)\cdot (a^2 + 3ab + 3b^2).$ Setting $a=1$ and $b=3^k$, one obtains the following factorization of $3^+1$: $3^+1 = (3^+1)\cdot (3^-3^+1)\cdot (3^+3^+1).$ Here, the first of the three terms in the factorization is $\Phi_2(3^)$ and the remaining two terms provide an aurifeuillean factorization of $\Phi_6(3^)$, where $\Phi_6(x)=x^2-x+1$.
* Numbers of the form $b^n - 1$ or their factors $\Phi_n(b)$, where $b = s^2 \cdot t$ with square-free $t$, have aurifeuillean factorization if and only if one of the following conditions holds:
** $t\equiv 1 \pmod 4$ and $n\equiv t \pmod$
** $t\equiv 2, 3 \pmod 4$ and $n\equiv 2t \pmod$
: Thus, when $b = s^2\cdot t$ with square-free $t$, and $n$ is congruent to $t$ modulo $2t$, then if $t$ is congruent to 1 mod 4, $b^n-1$ have aurifeuillean factorization, otherwise, $b^n+1$ have aurifeuillean factorization.

* When the number is of a particular form (the exact expression varies with the base), aurifeuillean factorization may be used, which gives a product of two or three numbers. The following equations give aurifeuillean factors for the Cunningham project bases as a product of ''F'', ''L'' and ''M'':

: If we let ''L'' = ''C'' − ''D'', ''M'' = ''C'' + ''D'', the aurifeuillean factorizations for ''b''^''n'' ± 1 of the form ''F'' · (''C'' − ''D'') · (''C'' + ''D'') = ''F'' · ''L'' · ''M'' with the bases (perfect powers excluded, since a power of ''b''^''n'' is also a power of ''b'') are:

: (for the coefficients of the polynomials for all square-free bases up to 199 and up to 998, see )

:

* Lucas numbers $L_$ have the following aurifeuillean factorization:Lucas Aurifeuilliean primitive part
/ref>
:: $L_ = L_\cdot (5^2-5F_+1)\cdot (5^2+5F_+1)$
: where $L_n$ is the $n$th Lucas number, and $F_n$ is the $n$th Fibonacci number.

History

In 1869, before the discovery of aurifeuillean factorizations, , through a tremendous manual effort,Integer Arithmetic, Number Theory – Aurifeuillean Factorizations
NumericanaGaussian Mersenne in the Prime Glossary
/ref>Gaussian Mersenne in the Top Twenty
/ref> obtained the following factorization into primes:

:$2^+1 = 5 \cdot 107367629 \cdot 536903681.$

Three years later, in 1871, Aurifeuille discovered the nature of this factorization; the number $2^+1$ for $k=14$, with the formula from the previous section, factors as:

:$2^+1 = (2^-2^+1)(2^+2^+1) = 536838145 \cdot 536903681.$

Of course, Landry's full factorization follows from this (taking out the obvious factor of 5). The general form of the factorization was later discovered by Lucas.

536903681 is an example of a Gaussian Mersenne norm.

References

{{reflist, colwidth=30em

External links

Aurifeuillean Factorisation
Colin Barker


Gérard P. Michon

The Search for Aurifeuillean-Like Factorizations

Online factor collection





Number theory
factorization