Square root of 2
Template:Short description Template:Use dmy dates Template:Cs1 config Template:Redirect-distinguish Template:Infobox non-integer number
The square root of 2 (approximately 1.4142) is the positive real number that, when multiplied by itself or squared, equals the number 2. It may be written as or . It is an algebraic number, and therefore not a transcendental number. Technically, it should be 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.[1] The fraction Template:Sfrac (≈ 1.4142857) is sometimes used as a good rational approximation with a reasonably small denominator.
Sequence A002193 in the On-Line Encyclopedia of Integer Sequences consists of the digits in the decimal expansion of the square root of 2, here truncated to 60 decimal places:[2]
History
The Babylonian clay tablet YBC 7289 (c. Template:TrimScript error: No such module "Check for unknown parameters".–1600 BC) gives an approximation of in four sexagesimal figures, 1 24 51 10, which is accurate to about six decimal digits,[3] and is the closest possible three-place sexagesimal representation of , representing a margin of error of only –0.000042%:
Another early approximation is given in ancient Indian mathematical texts, the Sulbasutras (c. Template:TrimScript error: No such module "Check for unknown parameters".–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.[4] 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, though this has little to any substantial evidence in traditional historian practice.[5][6] The square root of two is occasionally called Pythagoras's number[7] or Pythagoras's constant.
Ancient Roman architecture
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. Vitruvius attributes the idea to Plato. The system was employed to build pavements by creating a square tangent to the corners of the original square at 45 degrees of it. The proportion was also used to design atria by giving them a length equal to a diagonal taken from a square, whose sides are equivalent to the intended atrium's width.[8]
Decimal value
Computation algorithms
Script error: No such module "labelled list hatnote". There are many algorithms for approximating as a ratio of integers or as a decimal. The most common algorithm for this, which is used as a basis in many computers and calculators, is the Babylonian method[9] for computing square roots, an example of Newton's method for computing roots of arbitrary functions. It goes as follows:
First, pick a guess, ; 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:
Each iteration improves the approximation, roughly doubling the number of correct digits. Starting with , the subsequent iterations yield:
Rational approximations
The Babylonians had approximated the number as .[3][10]
The rational approximation Template:Sfrac (≈ 1.4142857) differs from the correct value by less than Template:Sfrac (approx. Script error: No such module "val".). Likewise, Template:Sfrac (≈ 1.4141414...) has a marginally smaller error (approx. Script error: No such module "val".), and Template:Sfrac (≈ 1.4142012) has an error of approximately Script error: No such module "val"..
The rational approximation of the square root of two derived from four iterations of the Babylonian method after starting with a0 = 1Script error: No such module "Check for unknown parameters". (Template:Sfrac) is too large by about Script error: No such module "val".; its square is ≈ Script error: No such module "val"..[10]
Records in computation
In 1997, the value of was calculated to 137,438,953,444 decimal places by Yasumasa Kanada's team. In February 2006, the record for the calculation of was eclipsed with the use of a home computer. Shigeru Kondo calculated one trillion decimal places in 2010.[11] Other mathematical constants whose decimal expansions have been calculated to similarly high precision include [[pi|Template:Pi]], [[e (mathematical constant)|Template:Mvar]], and the golden ratio.[12] Such computations provide empirical evidence of whether these numbers are normal.
This is a table of recent records in calculating the digits of .[12]
| Date | Name | Number of digits |
|---|---|---|
| 4 April 2025 | Teck Por Lim | Script error: No such module "val". |
| 26 December 2023 | Jordan Ranous | Script error: No such module "val". |
| 5 January 2022 | Tizian Hanselmann | Script error: No such module "val". |
| 28 June 2016 | Ron Watkins | Script error: No such module "val". |
| 3 April 2016 | Ron Watkins | Script error: No such module "val". |
| 20 January 2016 | Ron Watkins | Script error: No such module "val". |
| 9 February 2012 | Alexander Yee | Script error: No such module "val". |
| 22 March 2010 | Shigeru Kondo | Script error: No such module "val". |
Proofs of irrationality
Proof by infinite descent
One proof of the number's irrationality is the following proof by infinite descent. It is also a proof of a negation by refutation: it proves the statement " is not rational" by assuming that it is rational and then deriving a falsehood.
- Assume that is a rational number, meaning that there exists a pair of integers whose ratio is exactly .
- If the two integers have a common factor, it can be eliminated using the Euclidean algorithm.
- Then can be written as an irreducible fraction such that aScript error: No such module "Check for unknown parameters". and bScript error: No such module "Check for unknown parameters". are coprime integers (having no common factor) which additionally means that at least one of aScript error: No such module "Check for unknown parameters". or bScript error: No such module "Check for unknown parameters". must be odd.
- It follows that and . ( [[Exponent#Identities and properties|(Template:Sfrac)n = Template:Sfrac]]Script error: No such module "Check for unknown parameters". ) ( a2 and b2Script error: No such module "Check for unknown parameters". are integers)
- Therefore, a2Script error: No such module "Check for unknown parameters". is even because it is equal to 2b2Script error: No such module "Check for unknown parameters".. (2b2Script error: No such module "Check for unknown parameters". is necessarily even because it is 2 times another whole number.)
- It follows that aScript error: No such module "Check for unknown parameters". must be even (as squares of odd integers are never even).
- Because aScript error: No such module "Check for unknown parameters". is even, there exists an integer kScript error: No such module "Check for unknown parameters". that fulfills .
- Substituting 2kScript error: No such module "Check for unknown parameters". from step 7 for aScript error: No such module "Check for unknown parameters". in the second equation of step 4: , which is equivalent to .
- Because 2k2Script error: No such module "Check for unknown parameters". is divisible by two and therefore even, and because , it follows that b2Script error: No such module "Check for unknown parameters". is also even which means that bScript error: No such module "Check for unknown parameters". is even.
- By steps 5 and 8, aScript error: No such module "Check for unknown parameters". and bScript error: No such module "Check for unknown parameters". are both even, which contradicts step 3 (that is irreducible).
Since we have derived a falsehood, the assumption (1) that is a rational number must be false. This means that is not a rational number; that is to say, is irrational.
This proof was hinted at by Aristotle, in his Analytica Priora, §I.23.[13] 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.[14]
Proof using reciprocals
Assume by way of contradiction that were rational. Then we may write as an irreducible fraction in lowest terms, with coprime positive integers . Since , it follows that can be expressed as the irreducible fraction . However, since and differ by an integer, it follows that the denominators of their irreducible fraction representations must be the same, i.e. . This gives the desired contradiction.
Proof by unique factorization
As with the proof by infinite descent, we obtain . Being the same quantity, each side has the same prime factorization by the fundamental theorem of arithmetic, and in particular, would have to have the factor 2 occur the same number of times. However, the factor 2 appears an odd number of times on the right, but an even number of times on the left—a contradiction.
Application of the rational root theorem
The irrationality of also follows from the rational root theorem, which states that a rational root of a polynomial, if it exists, must be the quotient of a factor of the constant term and a factor of the leading coefficient. In the case of , the only possible rational roots are and . As is not equal to or , it follows that is irrational. This application also invokes the integer root theorem, a stronger version of the rational root theorem for the case when is a monic polynomial with integer coefficients; for such a polynomial, all roots are necessarily integers (which is not, as 2 is not a perfect square) or irrational.
The rational root theorem (or integer root theorem) may be used to show that any square root of any natural number that is not a perfect square is irrational. For other proofs that the square root of any non-square natural number is irrational, see Quadratic irrational number or Infinite descent.
Geometric proofs
Tennenbaum's proof
A simple proof is attributed to Stanley Tennenbaum when he was a student in the early 1950s.[15][16] Assume that , where and are coprime positive integers. Then and are the smallest positive integers for which . Geometrically, this implies that a square with side length will have an area equal to two squares of (lesser) side length . Call these squares A and B. We can draw these squares and compare their areas - the simplest way to do so is to fit the two B squares into the A squares. When we try to do so, we end up with the arrangement in Figure 1., in which the two B squares overlap in the middle and two uncovered areas are present in the top left and bottom right. In order to assert , we would need to show that the area of the overlap is equal to the area of the two missing areas, i.e. = . In other terms, we may refer to the side lengths of the overlap and missing areas as and , respectively, and thus we have . But since we can see from the diagram that and , and we know that and are integers from their definitions in terms of and , this means that we are in violation of the original assumption that and are the smallest positive integers for which .
Hence, even in assuming that and are the smallest positive integers for which , we may prove that there exists a smaller pair of integers and which satisfy the relation. This contradiction within the definition of and implies that they cannot exist, and thus must be irrational.
Apostol's proof
Tom M. Apostol made another geometric reductio ad absurdum argument showing that is irrational.[17] 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 same algebraic proof as Tennebaum's proof, viewed geometrically in another way.
Let △ ABCScript error: No such module "Check for unknown parameters". be a right isosceles triangle with hypotenuse length mScript error: No such module "Check for unknown parameters". and legs nScript error: No such module "Check for unknown parameters". as shown in Figure 2. By the Pythagorean theorem, . Suppose mScript error: No such module "Check for unknown parameters". and nScript error: No such module "Check for unknown parameters". are integers. Let m:nScript error: No such module "Check for unknown parameters". be a ratio given in its lowest terms.
Draw the arcs BDScript error: No such module "Check for unknown parameters". and CEScript error: No such module "Check for unknown parameters". with centre AScript error: No such module "Check for unknown parameters".. Join DEScript error: No such module "Check for unknown parameters".. It follows that AB = ADScript error: No such module "Check for unknown parameters"., AC = AEScript error: No such module "Check for unknown parameters". and ∠BACScript error: No such module "Check for unknown parameters". and ∠DAEScript error: No such module "Check for unknown parameters". coincide. Therefore, the triangles ABCScript error: No such module "Check for unknown parameters". and ADEScript error: No such module "Check for unknown parameters". are congruent by SAS.
Because ∠EBFScript error: No such module "Check for unknown parameters". is a right angle and ∠BEFScript error: No such module "Check for unknown parameters". is half a right angle, △ BEFScript error: No such module "Check for unknown parameters". is also a right isosceles triangle. Hence BE = m − nScript error: No such module "Check for unknown parameters". implies BF = m − nScript error: No such module "Check for unknown parameters".. By symmetry, DF = m − nScript error: No such module "Check for unknown parameters"., and △ FDCScript error: No such module "Check for unknown parameters". is also a right isosceles triangle. It also follows that FC = n − (m − n) = 2n − mScript error: No such module "Check for unknown parameters"..
Hence, there is an even smaller right isosceles triangle, with hypotenuse length 2n − mScript error: No such module "Check for unknown parameters". and legs m − nScript error: No such module "Check for unknown parameters".. These values are integers even smaller than mScript error: No such module "Check for unknown parameters". and nScript error: No such module "Check for unknown parameters". and in the same ratio, contradicting the hypothesis that m:nScript error: No such module "Check for unknown parameters". is in lowest terms. Therefore, mScript error: No such module "Check for unknown parameters". and nScript error: No such module "Check for unknown parameters". cannot be both integers; hence, is irrational.
Constructive proof
While the proofs by infinite descent are constructively valid when "irrational" is defined to mean "not rational", we can obtain a constructively stronger statement by using a positive definition of "irrational" as "quantifiably apart from every rational". Let aScript error: No such module "Check for unknown parameters". and bScript error: No such module "Check for unknown parameters". be positive integers such that 1<Template:Sfrac< 3/2Script error: No such module "Check for unknown parameters". (as 1<2< 9/4Script error: No such module "Check for unknown parameters". satisfies these bounds). Now 2b2 Script error: No such module "Check for unknown parameters". and a2 Script error: No such module "Check for unknown parameters". cannot be equal, since the first has an odd number of factors 2 whereas the second has an even number of factors 2. Thus Template:Abs ≥ 1Script error: No such module "Check for unknown parameters".. Multiplying the absolute difference Template:AbsScript error: No such module "Check for unknown parameters". by b2(√2 + Template:Sfrac)Script error: No such module "Check for unknown parameters". in the numerator and denominator, we get[18]
the latter inequality being true because it is assumed that 1<Template:Sfrac< 3/2Script error: No such module "Check for unknown parameters"., giving Template:Sfrac + √2 ≤ 3 Script error: No such module "Check for unknown parameters". (otherwise the quantitative apartness can be trivially established). This gives a lower bound of Template:SfracScript error: No such module "Check for unknown parameters". for the difference Template:AbsScript error: No such module "Check for unknown parameters"., yielding a direct proof of irrationality in its constructively stronger form, not relying on the law of excluded middle.[19] This proof constructively exhibits an explicit discrepancy between and any rational.
Proof by Pythagorean triples
This proof uses the following property of primitive Pythagorean triples:
- If aScript error: No such module "Check for unknown parameters"., bScript error: No such module "Check for unknown parameters"., and cScript error: No such module "Check for unknown parameters". are coprime positive integers such that a2 + b2 = c2Script error: No such module "Check for unknown parameters"., then cScript error: No such module "Check for unknown parameters". is never even.[20]
This lemma can be used to show that two identical perfect squares can never be added to produce another perfect square.
Suppose the contrary that is rational. Therefore,
- where and
- Squaring both sides,
Here, (b, b, a)Script error: No such module "Check for unknown parameters". is a primitive Pythagorean triple, and from the lemma aScript error: No such module "Check for unknown parameters". is never even. However, this contradicts the equation 2b2 = a2Script error: No such module "Check for unknown parameters". which implies that aScript error: No such module "Check for unknown parameters". must be even.
Multiplicative inverse
The multiplicative inverse (reciprocal) of the square root of two is a widely used constant, with the decimal value:[21]
It is often encountered in geometry and trigonometry because the unit vector, which makes a 45° angle with the axes in a plane, has the coordinates
Each coordinate satisfies
Properties
One interesting property of is
since
This is related to the property of silver ratios.
can also be expressed in terms of copies of the imaginary unit iScript error: No such module "Check for unknown parameters". using only the square root and arithmetic operations, if the square root symbol is interpreted suitably for the complex numbers iScript error: No such module "Check for unknown parameters". and −iScript error: No such module "Check for unknown parameters".:
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 > 1Script error: No such module "Check for unknown parameters"., x1 = cScript error: No such module "Check for unknown parameters". and xn+1 = cxnScript error: No such module "Check for unknown parameters". for n > 1Script error: No such module "Check for unknown parameters"., the limit of xnScript error: No such module "Check for unknown parameters". as n → ∞Script error: No such module "Check for unknown parameters". will be called (if this limit exists) f(c)Script error: No such module "Check for unknown parameters".. Then is the only number c > 1Script error: No such module "Check for unknown parameters". for which f(c) = c2Script error: No such module "Check for unknown parameters".. Or symbolically:
appears in Viète's formula for Template:Pi,
which is related to the formula[22]
Similar in appearance but with a finite number of terms, appears in various trigonometric constants:[23]
It is not known whether is a normal number, which is a stronger property than irrationality, but statistical analyses of its binary expansion are consistent with the hypothesis that it is normal to base two.[24]
Representations
Series and product
The identity cos Template:Sfrac = sin Template:Sfrac = Template:SfracScript error: No such module "Check for unknown parameters"., along with the infinite product representations for the sine and cosine, leads to products such as
and
or equivalently,
The number can also be expressed by taking the Taylor series of a trigonometric function. For example, the series for cos Template:SfracScript error: No such module "Check for unknown parameters". gives
The Taylor series of with x = 1Script error: No such module "Check for unknown parameters". and using the double factorial n!!Script error: No such module "Check for unknown parameters". gives
The convergence of this series can be accelerated with an Euler transform, producing
It is not known whether can be represented with a BBP-type formula. BBP-type formulas are known for Template:Tmath and , however.[25]
The number can be represented by an infinite series of Egyptian fractions, with denominators defined by 2nth terms of a Fibonacci-like recurrence relation a(n) = 34a(n−1) − a(n−2), a(0) = 0, a(1) = 6:[26]
Continued fraction
The square root of two has the following continued fraction representation:
The convergents Template:SfracScript error: No such module "Check for unknown parameters". 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 (i.e., p2 − 2q2 = ±1Script error: No such module "Check for unknown parameters".). The first convergents are: Template:Sfrac, Template:Sfrac, Template:Sfrac, Template:Sfrac, Template:Sfrac, Template:Sfrac, Template:Sfrac, Template:SfracScript error: No such module "Check for unknown parameters". and the convergent following Template:SfracScript error: No such module "Check for unknown parameters". is Template:SfracScript error: No such module "Check for unknown parameters".. The convergent Template:SfracScript error: No such module "Check for unknown parameters". differs from by almost exactly , which follows from:
Nested square
The following nested square expressions converge to :
- Script error: No such module "Unsubst".
Applications
Paper size
In 1786, German physics professor Georg Christoph Lichtenberg[27] found that any sheet of paper whose long edge is times longer than its short edge could be folded in half and aligned with its shorter side to produce a sheet with exactly the same proportions as the original. This ratio of lengths of the longer over the shorter side guarantees that cutting a sheet in half along a line results in the smaller sheets having the same (approximate) ratio as the original sheet. When Germany standardised paper sizes at the beginning of the 20th century, they used Lichtenberg's ratio to create the "A" series of paper sizes.[27] Today, the (approximate) aspect ratio of paper sizes under ISO 216 (A4, A0, etc.) is 1:.
Proof:
Let shorter length and longer length of the sides of a sheet of paper, with
- as required by ISO 216.
Let be the analogous ratio of the halved sheet, then
Physical sciences
There are some interesting properties involving the square root of 2 in the physical sciences:
- 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 .
- In the brain there are lattice cells, discovered in 2005 by a group led by May-Britt and Edvard Moser. "The grid cells were found in the cortical area located right next to the hippocampus [...] At one end of this cortical area the mesh size is small and at the other it is very large. However, the increase in mesh size is not left to chance, but increases by the squareroot of two from one area to the next."[28]
See also
- List of mathematical constants
- Square root of 3
- Square root of 5
- Gelfond–Schneider constant, 2√2Script error: No such module "Check for unknown parameters".
- Silver ratio, 1 + √2Script error: No such module "Check for unknown parameters".
Notes
<templatestyles src="Reflist/styles.css" />
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".Script error: No such module "Check for unknown parameters".
- ↑ a b Script error: No such module "Citation/CS1". See p. 368.
Photograph, illustration, and description of the root(2) tablet from the Yale Babylonian Collection Template:Webarchive
High resolution photographs, descriptions, and analysis of the root(2) tablet (YBC 7289) from the Yale Babylonian Collection - ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ 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. - ↑ a b Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ a b Script error: No such module "citation/CS1".
- ↑ 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).
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ See Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".Script error: No such module "Check for unknown parameters".
- ↑ Script error: No such module "citation/CS1".
- ↑ Julian D. A. Wiseman Sin and cos in surds Template:Webarchive
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".Script error: No such module "Check for unknown parameters".
- ↑ a b Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
Script error: No such module "Check for unknown parameters".
References
- Script error: No such module "citation/CS1".
- Script error: No such module "citation/CS1".
- Script error: No such module "citation/CS1".
External links
- Script error: No such module "citation/CS1"..
- 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
- Script error: No such module "citation/CS1".
- Template:Tmath Search Engine 2 billion searchable digits of √2, π, and Template:Mvar
Template:Algebraic numbers Template:Irrational number Template:Authority control