In number theory, an aurifeuillean factorization, named after Léon-François-Antoine Aurifeuille, is factorization of certain integer values of the cyclotomic polynomials.
Nevertheless, certain families of integers coming from cyclotomic polynomials have factorizations given by formulas applying to the whole family, as in the examples below.
In 1869, before the discovery of aurifeuillean factorizations, Landry [fr; es; de], through a tremendous manual effort,[8][9] obtained the following factorization into primes: Three years later, in 1871, Aurifeuille discovered the nature of this factorization; the number
The general form of the factorization was later discovered by Lucas.
[2] 536903681 is an example of a Gaussian Mersenne norm.