enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Factorization of polynomials - Wikipedia

    en.wikipedia.org/wiki/Factorization_of_polynomials

    If the original polynomial is the product of factors at least two of which are of degree 2 or higher, this technique only provides a partial factorization; otherwise the factorization is complete. In particular, if there is exactly one non-linear factor, it will be the polynomial left after all linear factors have been factorized out.

  3. Factorization of polynomials over finite fields - Wikipedia

    en.wikipedia.org/wiki/Factorization_of...

    Polynomial factoring algorithms use basic polynomial operations such as products, divisions, gcd, powers of one polynomial modulo another, etc. A multiplication of two polynomials of degree at most n can be done in O(n 2) operations in F q using "classical" arithmetic, or in O(nlog(n) log(log(n)) ) operations in F q using "fast" arithmetic.

  4. Cubic function - Wikipedia

    en.wikipedia.org/wiki/Cubic_function

    The roots, stationary points, inflection point and concavity of a cubic polynomial x 3 − 6x 2 + 9x − 4 (solid black curve) and its first (dashed red) and second (dotted orange) derivatives. The critical points of a cubic function are its stationary points, that is the points where the slope of the function is zero. [2]

  5. Cubic equation - Wikipedia

    en.wikipedia.org/wiki/Cubic_equation

    The discriminant of a polynomial is a function of its coefficients that is zero if and only if the polynomial has a multiple root, or, if it is divisible by the square of a non-constant polynomial. In other words, the discriminant is nonzero if and only if the polynomial is square-free.

  6. Degree of a polynomial - Wikipedia

    en.wikipedia.org/wiki/Degree_of_a_polynomial

    The following names are assigned to polynomials according to their degree: [2] [3] [4] Special case – zero (see § Degree of the zero polynomial, below) Degree 0 – non-zero constant [5] Degree 1 – linear; Degree 2 – quadratic; Degree 3 – cubic; Degree 4 – quartic (or, if all terms have even degree, biquadratic) Degree 5 – quintic

  7. Cantor–Zassenhaus algorithm - Wikipedia

    en.wikipedia.org/wiki/Cantor–Zassenhaus_algorithm

    The Cantor–Zassenhaus algorithm takes as input a square-free polynomial (i.e. one with no repeated factors) of degree n with coefficients in a finite field whose irreducible polynomial factors are all of equal degree (algorithms exist for efficiently factoring arbitrary polynomials into a product of polynomials satisfying these conditions, for instance, () / ((), ′ ()) is a squarefree ...

  8. Complex conjugate root theorem - Wikipedia

    en.wikipedia.org/wiki/Complex_conjugate_root_theorem

    Since every polynomial with complex coefficients can be factored into 1st-degree factors (that is one way of stating the fundamental theorem of algebra), it follows that every polynomial with real coefficients can be factored into factors of degree no higher than 2: just 1st-degree and quadratic factors.

  9. Cyclotomic polynomial - Wikipedia

    en.wikipedia.org/wiki/Cyclotomic_polynomial

    These formulas may be applied repeatedly to get a simple expression for any cyclotomic polynomial () in terms of a cyclotomic polynomial of square free index: If q is the product of the prime divisors of n (its radical), then [5] = (/).