enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Eisenstein's criterion - Wikipedia

    en.wikipedia.org/wiki/Eisenstein's_criterion

    The fact that the polynomial after substitution is irreducible then allows concluding that the original polynomial is as well. This procedure is known as applying a shift. For example consider H = x 2 + x + 2, in which the coefficient 1 of x is not divisible by any prime, Eisenstein's criterion does not apply to H.

  3. Irreducibility (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Irreducibility_(mathematics)

    Irreducibility (mathematics) In mathematics, the concept of irreducibility is used in several ways. A polynomial over a field may be an irreducible polynomial if it cannot be factored over that field. In abstract algebra, irreducible can be an abbreviation for irreducible element of an integral domain; for example an irreducible polynomial.

  4. Gauss's lemma (polynomials) - Wikipedia

    en.wikipedia.org/wiki/Gauss's_lemma_(polynomials)

    (A polynomial with integer coefficients is primitive if it has 1 as a greatest common divisor of its coefficients. [note 2]) A corollary of Gauss's lemma, sometimes also called Gauss's lemma, is that a primitive polynomial is irreducible over the integers if and only if it is irreducible over the rational numbers. More generally, a primitive ...

  5. Perron–Frobenius theorem - Wikipedia

    en.wikipedia.org/wiki/Perron–Frobenius_theorem

    A problem that causes confusion is a lack of standardisation in the definitions. For example, some authors use the terms strictly positive and positive to mean > 0 and ≥ 0 respectively. In this article positive means > 0 and non-negative means ≥ 0. Another vexed area concerns decomposability and reducibility: irreducible is an

  6. Casus irreducibilis - Wikipedia

    en.wikipedia.org/wiki/Casus_irreducibilis

    Casus irreducibilis can be generalized to higher degree polynomials as follows. Let p ∈ F[x] be an irreducible polynomial which splits in a formally real extension R of F (i.e., p has only real roots). Assume that p has a root in which is an extension of F by radicals.

  7. Partial fraction decomposition - Wikipedia

    en.wikipedia.org/wiki/Partial_fraction_decomposition

    In algebra, the partial fraction decomposition or partial fraction expansion of a rational fraction (that is, a fraction such that the numerator and the denominator are both polynomials) is an operation that consists of expressing the fraction as a sum of a polynomial (possibly zero) and one or several fractions with a simpler denominator. [ 1 ]

  8. Cyclotomic polynomial - Wikipedia

    en.wikipedia.org/wiki/Cyclotomic_polynomial

    In mathematics, the nth cyclotomic polynomial, for any positive integer n, is the unique irreducible polynomial with integer coefficients that is a divisor of and is not a divisor of for any k < n. Its roots are all n th primitive roots of unity e 2 i π k n {\displaystyle e^{2i\pi {\frac {k}{n}}}} , where k runs over the positive integers less ...

  9. Splitting field - Wikipedia

    en.wikipedia.org/wiki/Splitting_field

    A splitting field of a polynomial p (X) over a field K is a field extension L of K over which p factors into linear factors. where and for each we have with ai not necessarily distinct and such that the roots ai generate L over K. The extension L is then an extension of minimal degree over K in which p splits.