Square root of 2(Redirected from Square root of two)
The square root of 2, or the (1/2)th power of 2, written in mathematics as √ or 21⁄2, is the positive algebraic number that, when multiplied by itself, gives the number 2. Technically, it is called the principal square root of 2, to distinguish it from the negative number with the same property.
Geometrically the square root of 2 is the length of a diagonal across a square with sides of one unit of length; this follows from the Pythagorean theorem. It was probably the first number known to be irrational.
As a good rational approximation for the square root of two, with a reasonable small denominator, the fraction 99/ (≈ 1.4142857) is sometimes used.
The Babylonian clay tablet YBC 7289 (c. 1800–1600 BC) gives an approximation of √ in four sexagesimal figures, 1 24 51 10, which is accurate to about six decimal digits, and is the closest possible three-place sexagesimal representation of √:
Another early close approximation is given in ancient Indian mathematical texts, the Sulbasutras (c. 800–200 BC) as follows: Increase the length [of the side] by its third and this third by its own fourth less the thirty-fourth part of that fourth. That is,
This approximation is the seventh in a sequence of increasingly accurate approximations based on the sequence of Pell numbers, which can be derived from the continued fraction expansion of √. Despite having a smaller denominator, it is only slightly less accurate than the Babylonian approximation.
Pythagoreans discovered that the diagonal of a square is incommensurable with its side, or in modern language, that the square root of two is irrational. Little is known with certainty about the time or circumstances of this discovery, but the name of Hippasus of Metapontum is often mentioned. For a while, the Pythagoreans treated as an official secret the discovery that the square root of two is irrational, and, according to legend, Hippasus was murdered for divulging it. The square root of two is occasionally called "Pythagoras' number" or "Pythagoras' constant", for example by Conway & Guy (1996).
There are a number of algorithms for approximating √, which in expressions as a ratio of integers or as a decimal can only be approximated. The most common algorithm for this, one used as a basis in many computers and calculators, is the Babylonian method of computing square roots, which is one of many methods of computing square roots. It goes as follows:
First, pick a guess, a0 > 0; the value of the guess affects only how many iterations are required to reach an approximation of a certain accuracy. Then, using that guess, iterate through the following recursive computation:
The more iterations through the algorithm (that is, the more computations performed and the greater "n"), the better approximation of the square root of 2 is achieved. Each iteration approximately doubles the number of correct digits. Starting with a0 = 1 the next approximations are
- 3/ = 1.5
- 17/ = 1.416...
- 577/ = 1.414215...
- 665857/ = 1.4142135623746...
The value of √ was calculated to 137,438,953,444 decimal places by Yasumasa Kanada's team in 1997. In February 2006 the record for the calculation of √ was eclipsed with the use of a home computer. Shigeru Kondo calculated 1 trillion decimal places in 2010. For a development of this record, see the table below. Among mathematical constants with computationally challenging decimal expansions, only π has been calculated more precisely. Such computations aim to check empirically whether such numbers are normal.
A simple rational approximation 99/ (≈ 1.4142857) is sometimes used. Despite having a denominator of only 70, it differs from the correct value by less than 1/ (approx. ×10−4). Since it is a convergent of the +0.72continued fraction representation of the square root of two, any better rational approximation has a denominator not less than 169, since 239/ (≈ 1.4142012) is the next convergent with an error of approx. ×10−4. −0.12
The rational approximation of the square root of two, 665,857/, derived from the fourth step in the Babylonian algorithm starting with a0 = 1, is too large by approx. ×10−12: its square is 1.60000000045… 2.000
This is a table of recent records in calculating digits of √ ( 1 trillion = 1012 = 1,000,000,000,000 ).
|Date||Name||Number of digits|
|June 28, 2016||Ron Watkins||10 trillion|
|April 3, 2016||Ron Watkins||5 trillion|
|February 9, 2012||Alexander Yee||2 trillion|
|March 22, 2010||Shigeru Kondo||1 trillion= 1012|
Proofs of irrationalityEdit
A short proof of the irrationality of √ can be obtained from the rational root theorem, that is, if p(x) is a monic polynomial with integer coefficients, then any rational root of p(x) is necessarily an integer. Applying this to the polynomial p(x) = x2 − 2, it follows that √ is either an integer or irrational. Because √ is not an integer (2 is not a perfect square), √ must therefore be irrational. This proof can be generalized to show that any root of any natural number which is not the square of a natural number is irrational.
Proof by infinite descentEdit
One proof of the number's irrationality is the following proof by infinite descent. It is also a proof by contradiction, also known as an indirect proof, in that the proposition is proved by assuming that the opposite of the proposition is true and showing that this assumption is false, thereby implying that the proposition must be true.
- Assume that √ is a rational number, meaning that there exists a pair of integers whose ratio is √.
- If the two integers have a common factor, it can be eliminated using the Euclidean algorithm.
- Then √ can be written as an irreducible fraction a/ such that a and b are coprime integers (having no common factor).
- It follows that a2/ = 2 and a2 = 2b2. ( (a/)n = an/ ) ( a2 and b2 are integers)
- Therefore, a2 is even because it is equal to 2b2. (2b2 is necessarily even because it is 2 times another whole number and multiples of 2 are even.)
- It follows that a must be even (as squares of odd integers are never even).
- Because a is even, there exists an integer k that fulfills: a = 2k.
- Substituting 2k from step 7 for a in the second equation of step 4: 2b2 = (2k)2 is equivalent to 2b2 = 4k2, which is equivalent to b2 = 2k2.
- Because 2k2 is divisible by two and therefore even, and because 2k2 = b2, it follows that b2 is also even which means that b is even.
- By steps 5 and 8 a and b are both even, which contradicts that a/ is irreducible as stated in step 3.
Because there is a contradiction, the assumption (1) that √ is a rational number must be false. This means that √ is not a rational number; i.e., √ is irrational.
This proof was hinted at by Aristotle, in his Analytica Priora, §I.23. It appeared first as a full proof in Euclid's Elements, as proposition 117 of Book X. However, since the early 19th century historians have agreed that this proof is an interpolation and not attributable to Euclid.
Proof by unique factorizationEdit
An alternative proof uses the same approach with the fundamental theorem of arithmetic which says every integer greater than 1 has a unique factorization into powers of primes.
- Assume that √ is a rational number. Then there are integers a and b such that a is coprime to b and √ = a/. In other words, √ can be written as an irreducible fraction.
- The value of b cannot be 1 as there is no integer a the square of which is 2.
- There must be a prime p which divides b and which does not divide a, otherwise the fraction would not be irreducible.
- The square of a can be factored as the product of the primes into which a is factored but with each power doubled.
- Therefore, by unique factorization the prime p which divides b, and also its square, cannot divide the square of a.
- Therefore, the square of an irreducible fraction cannot be reduced to an integer.
- Therefore, √ cannot be a rational number.
This proof can be generalized to show that if an integer is not an exact kth power of another integer then its kth root is irrational. For a proof of the same result which does not rely on the fundamental theorem of arithmetic, see: quadratic irrational.
Proof by infinite descent, not involving factoringEdit
- Assume that √ is a rational number. This would mean that there exist positive integers m and n with n ≠ 0 such that m/ = √. Then m = n√ and m√ = 2n.
- We may assume that n is the smallest integer so that n√ is an integer. That is, that the fraction m/ is in lowest terms.
- Because 1 > √ − 1 > 0, it follows from (1) that n > n(√ − 1) = m − n > 0. So n > m − n > 0.
- Also from (1), we have √ = m/ = m(√ − 1)/ = 2n − m/.
- Thus the fraction m/ for √, which according to (2) is already in lowest terms, is represented by (4) in yet lower terms (which follows from the result (3)). This is a contradiction, so the assumption that √ is rational must be false.
This argument may be tightened as follows.
Let b be the least positive integer for which √ is a rational a/b. Then b has the property that twice its square is a square, that is, 2b2 = a2. For a contradiction, we show that a − b is a smaller positive integer with the same property. Multiply the inequalities 1 > √ − 1 > 0 by b to show b > a − b > 0. Now twice the square of a − b is 2a2 − 4ab + 2b2. Rewrite the first and last terms using b's property to yield a2 − 4ab + 4b2, which is just the expansion of (2b − a)2, the promised square. Thus, √ can also be written as (a − b)/(2 b − a). This procedure can be iterated and understood geometrically, as shown below.
The immediately preceding argument has a simple geometric formulation attributed by John Horton Conway to Stanley Tennenbaum when the latter was a student in the early 1950s and whose most recent appearance is in an article by Noson Yanofsky in the May–June 2016 issue of American Scientist. Given two squares with integer sides respectively a and b, one of which has twice the area of the other, place two copies of the smaller square in the larger as shown in Figure 1. The square overlap region in the middle ((2b − a)2) must equal the sum of the two uncovered squares (2(a − b)2). But these squares on the diagonal have positive integer sides that are smaller than the original squares. Repeating this process we can find arbitrarily small squares one twice the area of the other, yet both having positive integer sides, which is impossible since positive integers cannot be less than 1.
Another geometric reductio ad absurdum argument showing that √ is irrational appeared in 2000 in the American Mathematical Monthly. It is also an example of proof by infinite descent. It makes use of classic compass and straightedge construction, proving the theorem by a method similar to that employed by ancient Greek geometers. It is essentially the algebraic proof of the previous section viewed geometrically in yet another way.
Let △ABC be a right isosceles triangle with hypotenuse length m and legs n as shown in Figure 2. By the Pythagorean theorem, m/ = √. Suppose m and n are integers. Let m:n be a ratio given in its lowest terms.
Because ∠EBF is a right angle and ∠BEF is half a right angle, △BEF is also a right isosceles triangle. Hence BE = m − n implies BF = m − n. By symmetry, DF = m − n, and △FDC is also a right isosceles triangle. It also follows that FC = n − (m − n) = 2n − m.
Hence we have an even smaller right isosceles triangle, with hypotenuse length 2n − m and legs m − n. These values are integers even smaller than m and n and in the same ratio, contradicting the hypothesis that m:n is in lowest terms. Therefore, m and n cannot be both integers, hence √ is irrational.
Pythagorean theorem proofEdit
This is another proof by contradiction, supposing that √ is rational.
- That means that we can make a right isosceles triangle where the side lengths are natural numbers and the legs and the hypotenuse do not share any common factors (except 1).
- Since the legs are equal, so are their squares. So in order for the Pythagorean theorem to work for this special right triangle, the square of the hypotenuse has to be an even number (and if we cut it in half once then we have the area of the square of the leg).
- Recall that the square of an even number is even and the square of an odd number is odd. So if the square of the hypotenuse is even the hypotenuse is even as well.
- Remember that a square is a quadrilateral with 2 pairs of parallel sides which are equal in length and has 4 right angles. So both sides of the square of the hypotenuse are even.
- So the square of the hypotenuse of this right triangle can be cut in half twice and still have integer area. Since we only want to cut it in half once, then we'll get an even number.
- So the square of the leg is even. Now according to (2) the leg must be even.
- This contradicts our assumption at (1) that the leg and hypotenuse have no common factors (except 1). Because if they're both even they share a common factor of 2. So the assumption that √ was rational has to be false. Or in other words √ is an irrational number. Q. E. D.
- Lemma: let α ∈ ℝ+ and p1, p2,… q1, q2,… ∈ ℕ such that |αqn − pn| ≠ 0 for all n ∈ ℕ and
- Then α is irrational.
- Proof: suppose α = a/ with a,b ∈ ℕ+.
- For sufficiently big n
- but aqn − bpn is an integer, absurd, then α is irrational.
- √ is irrational.
- Proof: let p1 = q1 = 1 and
- for all n ∈ ℕ.
- By induction,
- for all n ∈ ℕ. For n = 1,
- and if this is true for n then it is true for n + 1. In fact
- By application of the lemma, √ is irrational.
In a constructive approach, one distinguishes between on the one hand not being rational, and on the other hand being irrational (i.e., being quantifiably apart from every rational), the latter being a stronger property. Given positive integers a and b, because the valuation (i.e., highest power of 2 dividing a number) of 2b2 is odd, while the valuation of a2 is even, they must be distinct integers; thus |2b2 − a2| ≥ 1. Then
the latter inequality being true because we assume a/ ≤ 3 − √ (otherwise the quantitative apartness can be trivially established). This gives a lower bound of 1/ for the difference |√ − a/|, yielding a direct proof of irrationality not relying on the law of excluded middle; see Errett Bishop (1985, p. 18). This proof constructively exhibits a discrepancy between √ and any rational.
Proof by Diophantine equationsEdit
- Lemma: For the Diophantine equation in its primitive (simplest) form, integer solutions exist if and only if either or is odd, but never when both and are odd.
Proof: For the given equation, there are only six possible combinations of oddness and evenness for whole-number values of and that produce a whole-number value for . A simple enumeration of all six possibilities shows why four of these six are impossible. Of the two remaining possibilities, one can be proven to not contain any solutions using modular arithmetic, leaving the sole remaining possibility as the only one to contain solutions, if any.
|Both even||Even||Impossible. The given Diophantine equation is primitive and therefore contains no common factors throughout|
|Both odd||Odd||Impossible. The sum of two odd numbers does not produce an odd number.|
|Both even||Odd||Impossible. The sum of two even numbers does not produce an odd number.|
|One even, another odd||Even||Impossible. The sum of an even number and an odd number does not produce an even number.|
|One even, another odd||Odd||Possible.|
The fifth possibility (both and odd and even) can be shown to contain no solutions as follows.
Since is even, must be divisible by , which makes the entire equation congruent to modulo :
The square of any odd number is always . The square of any even number is always . Since both and are odd and is even, we have:
which is impossible. Therefore, the fifth possibility is also ruled out, leaving the sixth to be the only possible combination to contain solutions, if any.
An extension of this lemma is the result that two identical whole-number squares can never be added to produce another whole-number square, even when the equation is not in its simplest form.
- Theorem: is irrational.
Proof: Assume is rational. Therefore,
- Squaring both sides,
But the lemma proves that the sum of two identical whole-number squares cannot produce another whole-number square.
Therefore, the assumption that is rational is contradicted.
is irrational. Q. E. D.
Properties of the square root of twoEdit
One-half of √, also the reciprocal of √, approximately 0.707106781186548, is a common quantity in geometry and trigonometry because the unit vector that makes a 45° angle with the axes in a plane has the coordinates
This number satisfies
One interesting property of √ is as follows:
This is related to the property of silver ratios.
if the square root symbol is interpreted suitably for the complex numbers i and −i.
√ is also the only real number other than 1 whose infinite tetrate (i.e., infinite exponential tower) is equal to its square. In other words: if for c > 1 we define x1 = c and xn+1 = cxn for n > 1, we will call the limit of xn as n → ∞ (if this limit exists) f(c). Then √ is the only number c > 1 for which f(c) = c2. Or symbolically:
√ appears in Viète's formula for π:
for m square roots and only one minus sign.
Similar in appearance but with a finite number of terms, √ appears in various trigonometric constants:
It is not known whether √ is a normal number, a stronger property than irrationality, but statistical analyses of its binary expansion are consistent with the hypothesis that it is normal to base two.
Series and product representationsEdit
The identity cos π/ = sin π/ = 1/, along with the infinite product representations for the sine and cosine, leads to products such as
The number can also be expressed by taking the Taylor series of a trigonometric function. For example, the series for cos π/ gives
The Taylor series of √ with x = 1 and using the double factorial n!! gives
The convergence of this series can be accelerated with an Euler transform, producing
Continued fraction representationEdit
The square root of two has the following continued fraction representation:
The convergents formed by truncating this representation form a sequence of fractions that approximate the square root of two to increasing accuracy, and that are described by the Pell numbers (known as side and diameter numbers to the ancient Greeks because of their use in approximating the ratio between the sides and diagonal of a square). The first convergents are: 1/, 3/, 7/, 17/, 41/, 99/, 239/, 577/. The convergent p/ differs from √ by almost exactly 1/ and then the next convergent is p + 2q/.
Nested square representationsEdit
The following nested square expressions converge to :
The reciprocal of the square root of two (the square root of 1/) is a widely used constant.
The (approximate) aspect ratio of paper sizes under ISO 216 (A4, A0, etc.) is 1:√. This ratio of lengths of the shorter over the longer side guarantees that cutting a sheet in half along a line parallel to its shorter side results in the smaller sheets having the same (approximate) ratio as the original sheet.
Let shorter length and longer length of the sides of a sheet of paper, with
- as required by ISO 216.
Let be the analogue ratio of the halved sheet, then
- Square root of 3
- Square root of 5
- Silver ratio, 1 + √
- The square root of two is the frequency ratio of a tritone interval in twelve-tone equal temperament music.
- The square root of two forms the relationship of f-stops in photographic lenses, which in turn means that the ratio of areas between two successive apertures is 2.
- The celestial latitude (declination) of the Sun during a planet's astronomical cross-quarter day points equals the tilt of the planet's axis divided by √.
- Gelfond–Schneider constant, 2√.
- Viète's formula
- Fowler and Robson, p. 368.
Photograph, illustration, and description of the root(2) tablet from the Yale Babylonian Collection Archived 2012-08-13 at the Wayback Machine.
High resolution photographs, descriptions, and analysis of the root(2) tablet (YBC 7289) from the Yale Babylonian Collection
- Stephanie J. Morris, "The Pythagorean Theorem" Archived 2013-05-30 at the Wayback Machine., Dept. of Math. Ed., University of Georgia.
- Brian Clegg, "The Dangerous Ratio ..." Archived 2013-06-27 at the Wayback Machine., Nrich.org, November 2004.
- Kurt von Fritz, "The discovery of incommensurability by Hippasus of Metapontum", Annals of Mathematics, 1945.
- Conway, John H.; Guy, Richard K. (1996), The Book of Numbers, Copernicus, p. 25
- Although the term "Babylonian method" is common in modern usage, there is no direct evidence showing how the Babylonians computed the approximation of √ seen on tablet YBC 7289. Fowler and Robson offer informed and detailed conjectures.
Fowler and Robson, p. 376. Flannery, p. 32, 158.
- "Constants and Records of Computation". Numbers.computation.free.fr. 2010-08-12. Archived from the original on 2012-03-01. Retrieved 2012-09-07.
- "Number of known digits". Numbers.computation.free.fr. 2010-08-12. Archived from the original on 2012-03-01. Retrieved 2012-09-07.
- "Archived copy". Archived from the original on 2015-10-20. Retrieved 2015-12-03.
- All that Aristotle says, while writing about proofs by contradiction, is that “the diagonal of the square is incommensurate with the side, because odd numbers are equal to evens if it is supposed to be commensurate”.
- The edition of the Greek text of the Elements published by E. F. August in Berlin in 1826–1829 already relegates this proof to an Appendix. The same thing occurs with J. L. Heiberg's edition (1883–1888).
- Gardner, Martin (2001), A Gardner's workout: training the mind and entertaining the spirit, A K Peters, Ltd., ISBN 978-1-56881-120-8, p. 16
- Proof 8‴ Archived 2016-04-22 at the Wayback Machine.
- Yanofsky, N. (2016). "Paradoxes, Contradictions, and the Limits of Science". Archived from the original on 2016-06-30.
- Tom M. Apostol (Nov 2000), "Irrationality of The Square Root of Two -- A Geometric Proof", The American Mathematical Monthly, 107 (9): 841–842, doi:10.2307/2695741
- See Katz, Karin Usadi; Katz, Mikhail G. (2011), "Meaning in Classical Mathematics: Is it at Odds with Intuitionism?", Intellectica, 56 (2): 223–302 (see esp. Section 2.3, footnote 15), arXiv: , Bibcode:2011arXiv1110.5456U
- Burton, David (2007). Elementary Number Theory. McGraw-Hill Education. p. 247. ISBN 978-0-07-305188-8.
- Courant, Richard; Robbins, Herbert (1941), What is mathematics? An Elementary Approach to Ideas and Methods, London: Oxford University Press, p. 124
- Julian D. A. Wiseman Sin and cos in surds Archived 2009-05-06 at the Wayback Machine.
- Good & Gover (1967).
- "Archived copy" (PDF). Archived (PDF) from the original on 2011-06-10. Retrieved 2010-04-30.
- Sloane, N.J.A. (ed.). "Sequence A082405 (a(n) = 34*a(n-1) - a(n-2); a(0)=0, a(1)=6)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-09-05.
- Apostol, Tom M. (2000), "Irrationality of the square root of two – A geometric proof", American Mathematical Monthly, 107 (9): 841–842, doi:10.2307/2695741, JSTOR 2695741.
- Aristotle (2007), Analytica priora, eBooks@Adelaide
- Bishop, Errett (1985), Schizophrenia in contemporary mathematics. Errett Bishop: reflections on him and his research (San Diego, Calif., 1983), 1–32, Contemp. Math. 39, Amer. Math. Soc., Providence, RI.
- Flannery, David (2005), The Square Root of Two, Springer-Verlag, ISBN 0-387-20220-X.
- Fowler, David; Robson, Eleanor (1998), "Square Root Approximations in Old Babylonian Mathematics: YBC 7289 in Context" (PDF), Historia Mathematica, 25 (4): 366–378, doi:10.1006/hmat.1998.2209, archived from the original (PDF) on 2006-09-03.
- Good, I. J.; Gover, T. N. (1967), "The generalized serial test and the binary expansion of √", Journal of the Royal Statistical Society, Series A, 130 (1): 102–107, doi:10.2307/2344040, JSTOR 2344040.
- Henderson, David W. (2000), "Square roots in the Śulba Sūtras", in Gorini, Catherine A., Geometry At Work: Papers in Applied Geometry, Cambridge University Press, pp. 39–45, ISBN 978-0-88385-164-7.
- Gourdon, X.; Sebah, P. (2001), "Pythagoras' Constant: √", Numbers, Constants and Computation.
- Weisstein, Eric W. "Pythagoras's Constant". MathWorld.
- The Square Root of Two to 5 million digits by Jerry Bonnell and Robert J. Nemiroff. May, 1994.
- Square root of 2 is irrational, a collection of proofs
- Grime, James; Bowley, Roger. "The Square Root √ of Two". Numberphile. Brady Haran.