The same is also true for the integer coefficients of the polynomial remainders in a modified subresultant prs, provided that the leading coefficient of f is 1.
42.
Brauer's theorem on induced characters states that a character on a finite group is a linear combination with integer coefficients of characters induced from elementary subgroups.
43.
While homology with rational coefficients H \ mathbb { Q } is Landweber exact, homology with integer coefficients H \ mathbb { Z } is not Landweber exact.
44.
For matrices with integer coefficients, the Hermite normal form is a row echelon form that may be calculated using Euclidean division and without introducing any rational number or denominator.
45.
The fundamental theorem of algebra tells us that if we have a non-zero polynomial with integer coefficients then that polynomial will have a root in the complex numbers.
46.
Equivalently, a divisor on a compact Riemann surface " X " is a finite linear combination of points of " X " with integer coefficients.
47.
For computing a resultant of polynomials with integer coefficients, it is generally faster to compute it modulo several primes and to retrieve the desired resultant with Chinese remainder theorem.
48.
A divisor on is a formal sum of prime numbers with integer coefficients and therefore corresponds to a non-zero fractional ideal in "'Q " '.
49.
Im ( " z " ) > 0 } | } } which is invariant under linear fractional transformations with integer coefficients and determinant 1 is called a modular function.
50.
On the other hand, the factorization over the integers of a polynomial with integer coefficients is the product of the factorization of its primitive part by the factorization of its content.
