Money A2Z 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. Integer square root - Wikipedia

    en.wikipedia.org/wiki/Integer_square_root

    Digit-by-digit algorithm. The traditional pen-and-paper algorithm for computing the square root is based on working from higher digit places to lower, and as each new digit pick the largest that will still yield a square . If stopping after the one's place, the result computed will be the integer square root.

  4. Square root - Wikipedia

    en.wikipedia.org/wiki/Square_root

    Square root. Notation for the (principal) square root of x. For example, √ 25 = 5, since 25 = 5 ⋅ 5, or 52 (5 squared). In mathematics, a square root of a number x is a number y such that ; in other words, a number y whose square (the result of multiplying the number by itself, or ) is x. [ 1] For example, 4 and −4 are square roots of 16 ...

  5. Square number - Wikipedia

    en.wikipedia.org/wiki/Square_number

    The difference between any perfect square and its predecessor is given by the identity n 2 − (n − 1) 2 = 2n − 1.Equivalently, it is possible to count square numbers by adding together the last square, the last square's root, and the current root, that is, n 2 = (n − 1) 2 + (n − 1) + n.

  6. Quadratic residue - Wikipedia

    en.wikipedia.org/wiki/Quadratic_residue

    Say there were an efficient algorithm for finding square roots modulo a composite number. The article congruence of squares discusses how finding two numbers x and y where x 2 ≡ y 2 (mod n) and x ≠ ±y suffices to factorize n efficiently. Generate a random number, square it modulo n, and have the efficient square root algorithm find a root.

  7. Square root of 2 - Wikipedia

    en.wikipedia.org/wiki/Square_root_of_2

    The square root of 2 (approximately 1.4142) is a real number that, when multiplied by itself or squared, equals the number 2. It may be written in mathematics as or . It is an algebraic number, and therefore not a transcendental number.

  8. Pell number - Wikipedia

    en.wikipedia.org/wiki/Pell_number

    In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational approximations to the square root of 2. This sequence of approximations begins ⁠ 1 1 ⁠, ⁠ 3 2 ⁠, ⁠ 7 5 ⁠, ⁠ 17 12 ⁠, and ⁠ 41 29 ⁠, so the sequence of Pell numbers begins ...

  9. Pell's equation - Wikipedia

    en.wikipedia.org/wiki/Pell's_equation

    These solutions may be used to accurately approximate the square root of n by rational numbers of the form x/y. This equation was first studied extensively in India starting with Brahmagupta , [ 1 ] who found an integer solution to 92 x 2 + 1 = y 2 {\displaystyle 92x^{2}+1=y^{2}} in his Brāhmasphuṭasiddhānta circa 628. [ 2 ]