When.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...

    From the multiplication tables, the square root of the mantissa must be 8 point something because a is between 8×8 = 64 and 9×9 = 81, so k is 8; something is the decimal representation of R. The fraction R is 75 − k 2 = 11, the numerator, and 81 − k 2 = 17, the denominator. 11/17 is a little less than 12/18 = 2/3 = .67, so guess .66 (it's ...

  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. Tonelli–Shanks algorithm - Wikipedia

    en.wikipedia.org/wiki/Tonelli–Shanks_algorithm

    If many square-roots must be done in the same cyclic group and S is not too large, a table of square-roots of the elements of 2-power order can be prepared in advance and the algorithm simplified and sped up as follows. Factor out powers of 2 from p − 1, defining Q and S as: = with Q odd.

  5. Newton's method - Wikipedia

    en.wikipedia.org/wiki/Newton's_method

    The following three tables show examples of the result of this computation for finding the square root of 612, with the iteration initialized at the values of 1, 10, and −20. Each row in a " x n " column is obtained by applying the preceding formula to the entry above it, for instance

  6. Integer factorization - Wikipedia

    en.wikipedia.org/wiki/Integer_factorization

    A general-purpose factoring algorithm, also known as a Category 2, Second Category, or Kraitchik family algorithm, [10] has a running time which depends solely on the size of the integer to be factored. This is the type of algorithm used to factor RSA numbers. Most general-purpose factoring algorithms are based on the congruence of squares method.

  7. Root mean square - Wikipedia

    en.wikipedia.org/wiki/Root_mean_square

    In the physics of gas molecules, the root-mean-square speed is defined as the square root of the average squared-speed. The RMS speed of an ideal gas is calculated using the following equation: v RMS = 3 R T M {\displaystyle v_{\text{RMS}}={\sqrt {3RT \over M}}}

  8. nth root - Wikipedia

    en.wikipedia.org/wiki/Nth_root

    A square root of a number x is a number r which, when squared, becomes x: =. Every positive real number has two square roots, one positive and one negative. For example, the two square roots of 25 are 5 and −5. The positive square root is also known as the principal square root, and is denoted with a radical sign:

  9. Fermat's factorization method - Wikipedia

    en.wikipedia.org/wiki/Fermat's_factorization_method

    Fermat's method works best when there is a factor near the square-root of N. If the approximate ratio of two factors ( d / c {\displaystyle d/c} ) is known, then a rational number v / u {\displaystyle v/u} can be picked near that value.