Aurifeuillean 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. Numbers of the form have the following factorization (Sophie Germain's identity): Setting and , one obtains the following aurifeuillean factorization of , where is the fourth cyclotomic polynomial: Numbers of the form have the following factorization, where the first factor () is the algebraic factorization of sum of two cubes: Setting and , one obtains the following factorization of : Here, the first of the three terms in the factorization is and the remaining two terms provide an aurifeuillean factorization of , where . Numbers of the form or their factors , where with square-free , have aurifeuillean factorization if and only if one of the following conditions holds: and and Thus, when with square-free , and is congruent to modulo , then if is congruent to 1 mod 4, have aurifeuillean factorization, otherwise, 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.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (2)

Related courses (12)

Related lectures (120)

Aurifeuillean factorization

Factorization

In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4. Factorization is not usually considered meaningful within number systems possessing division, such as the real or complex numbers, since any can be trivially written as whenever is not zero.

CS-526: Learning theory

Machine learning and data analysis are becoming increasingly central in many sciences and applications. This course concentrates on the theoretical underpinnings of machine learning.

MATH-505: HPC for numerical methods and data analysis

The objective of this course is to provide the necessary background for designing efficient parallel algorithms in scientific computing as well as in the analysis of large volumes of data. The operati

CS-308: Introduction to quantum computation

The course introduces the paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch

Phenomenological Applications of the Standard Model

Explores the verification of the standard model through scattering experiments and the implications of minimal dark matter models.

Understanding Chaos in Quantum Field Theories

Explores chaos in quantum field theories, focusing on conformal symmetry, OPE coefficients, and random matrix universality.

Completing the Square in Quadratic Polynomials

Demonstrates completing the square in quadratic polynomials for factorization simplification.