Search results
Results from the WOW.Com Content Network
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 ...
Notation for the (principal) square root of x. For example, √ 25 = 5, since 25 = 5 ⋅ 5, or 5 2 (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]
Kunerth's algorithm is an algorithm for computing the modular square root of a given number. [ 1 ] [ 2 ] The algorithm does not require the factorization of the modulus, and uses modular operations that are often easy when the given number is prime.
In the example above, 6839925 is less than 11669900, so the root needs to be rounded up to 6840.0. To find the square root of a number that isn't an integer, say 54782.917, everything is the same, except that the digits to the left and right of the decimal point are grouped into twos. So 54782.917 would be grouped as 05 47 82.91 70
One side of the square is labeled with the sexagesimal number 30. The diagonal of the square is labeled with two sexagesimal numbers. The first of these two, 1;24,51,10 represents the number 305470/216000 ≈ 1.414213, a numerical approximation of the square root of two that is off by less than one part in two million.
The diagonal displays an approximation of the square root of 2 in four sexagesimal figures, 1 24 51 10, which is good to about six decimal digits. 1 + 24/60 + 51/60 2 + 10/60 3 = 1.41421296... The tablet also gives an example where one side of the square is 30, and the resulting diagonal is 42 25 35 or 42.4263888...
Tonelli–Shanks cannot be used for composite moduli: finding square roots modulo composite numbers is a computational problem equivalent to integer factorization. [ 1 ] An equivalent, but slightly more redundant version of this algorithm was developed by Alberto Tonelli [ 2 ] [ 3 ] in 1891.
A solution in radicals or algebraic solution is an expression of a solution of a polynomial equation that is algebraic, that is, relies only on addition, subtraction, multiplication, division, raising to integer powers, and extraction of n th roots (square roots, cube roots, etc.). A well-known example is the quadratic formula