When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Quadratic formula - Wikipedia

    en.wikipedia.org/wiki/Quadratic_formula

    The roots of the quadratic function y = ⁠ 1 / 2x 2 − 3x + ⁠ 5 / 2 ⁠ are the places where the graph intersects the x-axis, the values x = 1 and x = 5. They can be found via the quadratic formula. In elementary algebra, the quadratic formula is a closed-form expression describing the solutions of a quadratic equation.

  3. Irreducible polynomial - Wikipedia

    en.wikipedia.org/wiki/Irreducible_polynomial

    In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials.The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the ring to which the coefficients of the polynomial and its possible factors are supposed to belong.

  4. Quadratic equation - Wikipedia

    en.wikipedia.org/wiki/Quadratic_equation

    Because (a + 1) 2 = a, a + 1 is the unique solution of the quadratic equation x 2 + a = 0. On the other hand, the polynomial x 2 + ax + 1 is irreducible over F 4, but it splits over F 16, where it has the two roots ab and ab + a, where b is a root of x 2 + x + a in F 16. This is a special case of Artin–Schreier theory.

  5. Swinnerton-Dyer polynomial - Wikipedia

    en.wikipedia.org/wiki/Swinnerton-Dyer_polynomial

    In algebra, the Swinnerton-Dyer polynomials are a family of polynomials, introduced by Peter Swinnerton-Dyer, that serve as examples where polynomial factorization algorithms have worst-case runtime.

  6. Eisenstein's criterion - Wikipedia

    en.wikipedia.org/wiki/Eisenstein's_criterion

    For example, in the case x 2 + x + 2 given above, the discriminant is −7 so that 7 is the only prime that has a chance of making it satisfy the criterion. Modulo 7, it becomes (x − 3) 2 — a repeated root is inevitable, since the discriminant is 0 mod 7. Therefore the variable shift is actually something predictable.

  7. Completing the square - Wikipedia

    en.wikipedia.org/wiki/Completing_the_square

    That is, h is the x-coordinate of the axis of symmetry (i.e. the axis of symmetry has equation x = h), and k is the minimum value (or maximum value, if a < 0) of the quadratic function. One way to see this is to note that the graph of the function f ( x ) = x 2 is a parabola whose vertex is at the origin (0, 0).

  8. Primitive polynomial (field theory) - Wikipedia

    en.wikipedia.org/wiki/Primitive_polynomial...

    Over GF(3) the polynomial x 2 + 1 is irreducible but not primitive because it divides x 4 − 1: its roots generate a cyclic group of order 4, while the multiplicative group of GF(3 2) is a cyclic group of order 8. The polynomial x 2 + 2x + 2, on the other hand, is primitive. Denote one of its roots by α.

  9. Geometrical properties of polynomial roots - Wikipedia

    en.wikipedia.org/wiki/Geometrical_properties_of...

    takes a negative value for some positive real value of x. In the remaining of the section, suppose that a 00. If it is not the case, zero is a root, and the localization of the other roots may be studied by dividing the polynomial by a power of the indeterminate, getting a polynomial with a nonzero constant term.