enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Factorization

    A typical use of this is the completing the square method for getting the quadratic formula. Another example is the factorization of x 4 + 1. {\displaystyle x^{4}+1.} If one introduces the non-real square root of –1 , commonly denoted i , then one has a difference of squares x 4 + 1 = ( x 2 + i ) ( x 2 − i ) . {\displaystyle x^{4}+1=(x^{2 ...

  3. Quadratic formula - Wikipedia

    en.wikipedia.org/wiki/Quadratic_formula

    The modern quadratic formula is sometimes called Sridharacharya's formula in India and Bhaskara's formula in Brazil. [33] The 9th-century Persian mathematician Muḥammad ibn Mūsā al-Khwārizmī solved quadratic equations algebraically. [34] The quadratic formula covering all cases was first obtained by Simon Stevin in 1594. [35]

  4. Quadratic equation - Wikipedia

    en.wikipedia.org/wiki/Quadratic_equation

    Figure 1. Plots of quadratic function y = ax 2 + bx + c, varying each coefficient separately while the other coefficients are fixed (at values a = 1, b = 0, c = 0). A quadratic equation whose coefficients are real numbers can have either zero, one, or two distinct real-valued solutions, also called roots.

  5. 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).

  6. Factorization of polynomials - Wikipedia

    en.wikipedia.org/wiki/Factorization_of_polynomials

    A simplified version of the LLL factorization algorithm is as follows: calculate a complex (or p-adic) root α of the polynomial () to high precision, then use the Lenstra–Lenstra–Lovász lattice basis reduction algorithm to find an approximate linear relation between 1, α, α 2, α 3, . . . with integer coefficients, which might be an ...

  7. Jacobi symbol - Wikipedia

    en.wikipedia.org/wiki/Jacobi_symbol

    If a is a quadratic residue modulo n and gcd(a,n) = 1, then (⁠ a / n ⁠) = 1. But, unlike the Legendre symbol: If (⁠ a / n ⁠) = 1 then a may or may not be a quadratic residue modulo n. This is because for a to be a quadratic residue modulo n, it has to be a quadratic residue modulo every prime factor of n.

  8. Solving quadratic equations with continued fractions - Wikipedia

    en.wikipedia.org/wiki/Solving_quadratic...

    The quadratic equation on a number can be solved using the well-known quadratic formula, which can be derived by completing the square. That formula always gives the roots of the quadratic equation, but the solutions are expressed in a form that often involves a quadratic irrational number, which is an algebraic fraction that can be evaluated ...

  9. Difference of two squares - Wikipedia

    en.wikipedia.org/wiki/Difference_of_two_squares

    The formula for the difference of two squares can be used for factoring polynomials that contain the square of a first quantity minus the square of a second quantity. For example, the polynomial x 4 − 1 {\displaystyle x^{4}-1} can be factored as follows: