enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Methods of computing square roots - Wikipedia

    en.wikipedia.org/wiki/Methods_of_computing...

    A method analogous to piece-wise linear approximation but using only arithmetic instead of algebraic equations, uses the multiplication tables in reverse: the square root of a number between 1 and 100 is between 1 and 10, so if we know 25 is a perfect square (5 × 5), and 36 is a perfect square (6 × 6), then the square root of a number greater than or equal to 25 but less than 36, begins with ...

  3. Square root - Wikipedia

    en.wikipedia.org/wiki/Square_root

    The square root of a positive integer is the product of the roots of its prime factors, because the square root of a product is the product of the square roots of the factors. Since p 2 k = p k , {\textstyle {\sqrt {p^{2k}}}=p^{k},} only roots of those primes having an odd power in the factorization are necessary.

  4. Square root of a matrix - Wikipedia

    en.wikipedia.org/wiki/Square_root_of_a_matrix

    The principal square root of a real positive semidefinite matrix is real. [3] The principal square root of a positive definite matrix is positive definite; more generally, the rank of the principal square root of A is the same as the rank of A. [3] The operation of taking the principal square root is continuous on this set of matrices. [4]

  5. nth root - Wikipedia

    en.wikipedia.org/wiki/Nth_root

    A root of degree 2 is called a square root and a root of degree 3, a cube root. Roots of higher degree are referred by using ordinal numbers, as in fourth root, twentieth root, etc. The computation of an n th root is a root extraction. For example, 3 is a square root of 9, since 3 2 = 9, and −3 is also a square root of 9, since (−3) 2 = 9.

  6. Tonelli–Shanks algorithm - Wikipedia

    en.wikipedia.org/wiki/Tonelli–Shanks_algorithm

    The Tonelli–Shanks algorithm (referred to by Shanks as the RESSOL algorithm) is used in modular arithmetic to solve for r in a congruence of the form r 2 ≡ n (mod p), where p is a prime: that is, to find a square root of n modulo p.

  7. Quadratic equation - Wikipedia

    en.wikipedia.org/wiki/Quadratic_equation

    This "completes the square", converting the left side into a perfect square. Write the left side as a square and simplify the right side if necessary. Produce two linear equations by equating the square root of the left side with the positive and negative square roots of the right side. Solve each of the two linear equations.

  8. Kunerth's algorithm - Wikipedia

    en.wikipedia.org/wiki/Kunerth's_algorithm

    The modular square root of can be taken this way. Having solved the associated quadratic equation we now have the variables w and set v = r (if C in the quadratic is a natural square). Solve for variables α {\displaystyle \alpha } and β {\displaystyle \beta } the following equation:

  9. Principal value - Wikipedia

    en.wikipedia.org/wiki/Principal_value

    A simple case arises in taking the square root of a positive real number. For example, 4 has two square roots: 2 and −2; of these the positive root, 2, is considered the principal root and is denoted as 4 . {\displaystyle {\sqrt {4}}.}