- to the
order of the factors)
factorization into
prime numbers,
which are
those integers which cannot be
further factorized into the
product of integers...
-
Unsolved problem in
computer science: Can
integer factorization be
solved in
polynomial time on a
classical computer? (more
unsolved problems in computer...
- the
Stein factorization,
introduced by Karl Stein (1956) for the case of
complex spaces,
states that a
proper morphism can be
factorized as a composition...
- An RRQR
factorization or rank-revealing QR
factorization is a
matrix decomposition algorithm based on the QR
factorization which can be used to determine...
- eigenvectors. Only
diagonalizable matrices can be
factorized in this way. When the
matrix being factorized is a
normal or real
symmetric matrix, the decomposition...
- and
particularly in the
field of
complex analysis, the Weierstr****
factorization theorem ****erts that
every entire function can be
represented as a (possibly...
- In
number theory, an
aurifeuillean factorization,
named after Léon-François-Antoine Aurifeuille, is
factorization of
certain integer values of the cyclotomic...
- In mathematics, a
unique factorization domain (UFD) (also
sometimes called a
factorial ring
following the
terminology of Bourbaki) is a ring in which...
- a k-
factorization partitions the
edges of the
graph into
disjoint k-factors. A
graph G is said to be k-factorable if it
admits a k-
factorization. In particular...
- primes. The
trial division method consists of
dividing the
number to be
factorized by the
integers in
increasing order (2, 3, 4, 5, ...) successively. A...
