- In
number theory, an
aurifeuillean factorization,
named after Léon-François-Antoine Aurifeuille, is
factorization of
certain integer values of the cyclotomic...
- two
squares and sum of two cubes),
which depend on the exponent, and
aurifeuillean factors,
which depend on both the base and the exponent. From elementary...
-
establishing a
covering set for all
values of n. His
proof depends on the
aurifeuillean factorization t4⋅24m+2 + 1 = (t2⋅22m+1 + t⋅2m+1 + 1)⋅(t2⋅22m+1 − t⋅2m+1...
-
special situation is b = −4k4, with k
positive integer,
which has the
aurifeuillean factorization, for example, b = −4 (with k = 1, then R2 and R3 are primes)...
-
random choices. Its
expected running time is at most Ln[1/2, 1+o(1)].
Aurifeuillean factorization Bach's
algorithm for
generating random numbers with their...
- 42 = 3584 Sum of two
cubes Binomial number Sophie Germain's
identity Aurifeuillean factorization Congruum, the
shared difference of
three squares in arithmetic...
-
Difference of two
squares Binomial number Sophie Germain's
identity Aurifeuillean factorization Fermat's last
theorem McKeague,
Charles P. (1986). Elementary...
- of Dirichlet's
theorem on
arithmetic progressions.
Cyclotomic field Aurifeuillean factorization Root of
unity Roman,
Stephen (2008),
Advanced Linear Algebra...
- {\displaystyle \Phi _{4}} as a polynomial,
making this an
example of an
aurifeuillean factorization. Germain's
identity has been
generalized to the functional...
- 2500, 5184, etc. (sequence A141046 in the OEIS)),
where we have the
aurifeuillean factorization. However, when b {\displaystyle b} does not
admit an algebraic...
