Search results
Results From The WOW.Com Content Network
In ancient Roman architecture, Vitruvius describes the use of the square root of 2 progression or ad quadratum technique. It consists basically in a geometric, rather than arithmetic, method to double a square, in which the diagonal of the original square is equal to the side of the resulting square.
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 ...
For example, the sequence 2, 6, 18, 54, ... is a geometric progression with a common ratio of 3. Similarly 10, 5, 2.5, 1.25, ... is a geometric sequence with a common ratio of 1/2. Examples of a geometric sequence are powers r k of a fixed non-zero number r, such as 2 k and 3 k. The general form of a geometric sequence is
A table of constants that includes the same approximation of the square root of 2 as YBC 7289 is the tablet YBC 7243. The constant appears on line 10 of the table along with the inscription, "the diagonal of a square". [2] [4] [5] The mathematical significance of this tablet was first recognized by Otto E. Neugebauer and Abraham Sachs in 1945.
The root-3 rectangle is also called sixton, [6] and its short and longer sides are proportionally equivalent to the side and diameter of a hexagon. [7] Since 2 is the square root of 4, the root-4 rectangle has a proportion 1:2, which means that it is equivalent to two squares side-by-side. [7] The root-5 rectangle is related to the golden ratio ...
2.3 Trigonometric, inverse trigonometric, hyperbolic, and inverse hyperbolic functions relationship. 2.4 Modified-factorial denominators. 2.5 Binomial coefficients.
A small change of coefficients may induce a dramatic change of the roots, including the change of a real root into a complex root with a rather large imaginary part (see Wilkinson's polynomial). A consequence is that, for classical numeric root-finding algorithms , the problem of approximating the roots given the coefficients can be ill ...
Square roots that are not the all-zeros matrix come in pairs: if R is a square root of M, then −R is also a square root of M, since (−R)(−R) = (−1)(−1)(RR) = R 2 = M. A 2×2 matrix with two distinct nonzero eigenvalues has four square roots. A positive-definite matrix has precisely one positive-definite square root.