Square root of 5

From Wikipedia, the free encyclopedia
(Redirected from Square root of five)
Jump to navigation Jump to search

Template:Short description Template:Infobox non-integer number

The square root of 5 is the positive real number that, when multiplied by itself, gives the prime number 5. It is more precisely called the principal square root of 5, to distinguish it from the negative number with the same property. This number appears in the fractional expression for the golden ratio. It can be denoted in surd form as 5.

It is an irrational algebraic number.[1] The first sixty significant digits of its decimal expansion are:

Template:Gaps (sequence A002163 in the OEIS),

which can be rounded down to 2.236 to within 99.99% accuracy. The approximation Template:Sfrac (≈ 2.23611) for the square root of five can be used. Despite having a denominator of only 72, it differs from the correct value by less than Template:Sfrac (approx. Script error: No such module "val".). As of January 2022, the numerical value in decimal of the square root of 5 has been computed to at least 2,250,000,000,000 digits.[2]

Rational approximations

The square root of 5 can be expressed as the simple continued fraction

[2;4,4,4,4,4,]=2+14+14+14+14+. (sequence A040002 in the OEIS)

The successive partial evaluations of the continued fraction, which are called its convergents, approach 5:

21,94,3817,16172,682305,28891292,122385473,5184123184,

Their numerators are 2, 9, 38, 161, … (sequence A001077 in the OEIS), and their denominators are 1, 4, 17, 72, … (sequence A001076 in the OEIS).

Each of these is a best rational approximation of 5; in other words, it is closer to 5 than any rational number with a smaller denominator.

The convergents, expressed as Template:SfracScript error: No such module "Check for unknown parameters"., satisfy alternately the Pell's equations[3]

x25y2=1andx25y2=1

When 5 is approximated with the Babylonian method, starting with x0 = 2Script error: No such module "Check for unknown parameters". and using xn+1 = Template:Sfrac(xn + Template:Sfrac)Script error: No such module "Check for unknown parameters"., the nScript error: No such module "Check for unknown parameters".th approximant xnScript error: No such module "Check for unknown parameters". is equal to the 2nScript error: No such module "Check for unknown parameters".th convergent of the continued fraction:

x0=2.0,x1=94=2.25,x2=16172=2.23611,x3=5184123184=2.2360679779,x4=53749785612403763488=2.23606797749979

The Babylonian method is equivalent to Newton's method for root finding applied to the polynomial x25. The Newton's method update, xn+1=xnf(xn)/f(xn), is equal to (xn+5/xn)/2 when f(x)=x25. The method therefore converges quadratically.

Relation to the golden ratio and Fibonacci numbers

File:Golden Rectangle Construction.svg
The 52 diagonal of a half square forms the basis for the geometrical construction of a golden rectangle.

The golden ratio φScript error: No such module "Check for unknown parameters". is the arithmetic mean of 1 and 5.[4] The algebraic relationship between 5, the golden ratio and the conjugate of the golden ratio (Φ = −Template:Sfrac = 1 − φScript error: No such module "Check for unknown parameters".) is expressed in the following formulae:

5=φΦ=2φ1=12Φφ=1+52Φ=152.

(See the section below for their geometrical interpretation as decompositions of a 5 rectangle.)

5 then naturally figures in the closed form expression for the Fibonacci numbers, a formula which is usually written in terms of the golden ratio:

F(n)=φn(1φ)n5.

The quotient of 5 and φScript error: No such module "Check for unknown parameters". (or the product of 5 and ΦScript error: No such module "Check for unknown parameters".), and its reciprocal, provide an interesting pattern of continued fractions and are related to the ratios between the Fibonacci numbers and the Lucas numbers:[5]

5φ=Φ5=552=1.3819660112501051518=[1;2,1,1,1,1,1,1,1,]φ5=1Φ5=5+510=0.72360679774997896964=[0;1,2,1,1,1,1,1,1,].

The series of convergents to these values feature the series of Fibonacci numbers and the series of Lucas numbers as numerators and denominators, and vice versa, respectively:

1,32,43,75,118,1813,2921,4734,7655,12389,[1;2,1,1,1,1,1,1,1,]1,23,34,57,811,1318,2129,3447,5576,89123,[0;1,2,1,1,1,1,1,1,].

In fact, the limit of the quotient of the nth Lucas number Ln and the nth Fibonacci number Fn is directly equal to the square root of 5:

limnLnFn=5.

Geometry

File:Pinwheel 1.svg
Decomposition of a 1×2 right triangle into five similar triangles, the basis for the aperiodic pinwheel tiling
File:Root rectangles Hambidge 1920.png
Jay Hambidge's construction of "root rectangles"

Template:Distances between double cube corners.svg

Geometrically, 5 corresponds to the diagonal of a rectangle whose sides are of length 1 and 2, as is evident from the Pythagorean theorem. Such a rectangle can be obtained by halving a square, or by placing two equal squares side by side. This can be used to subdivide a square grid into a tilted square grid with five times as many squares, forming the basis for a subdivision surface.[6] Together with the algebraic relationship between 5 and φScript error: No such module "Check for unknown parameters"., this forms the basis for the geometrical construction of a golden rectangle from a square, and for the construction of a regular pentagon given its side (since the side-to-diagonal ratio in a regular pentagon is φScript error: No such module "Check for unknown parameters".).

Since two adjacent faces of a cube would unfold into a 1:2 rectangle, the ratio between the length of the cube's edge and the shortest distance from one of its vertices to the opposite one, when traversing the cube surface, is 5. By contrast, the shortest distance when traversing through the inside of the cube corresponds to the length of the cube diagonal, which is the square root of three times the edge.[7]

A rectangle with side proportions 1:5 is called a root-five rectangle and is part of the series of root rectangles, a subset of dynamic rectangles, which are based on 1 (= 1), 2, 3, 4 (= 2), 5... and successively constructed using the diagonal of the previous root rectangle, starting from a square.[8] A root-5 rectangle is particularly notable in that it can be split into a square and two equal golden rectangles (of dimensions ΦScript error: No such module "Check for unknown parameters". × 1), or into two golden rectangles of different sizes (of dimensions ΦScript error: No such module "Check for unknown parameters". × 1 and 1 × φScript error: No such module "Check for unknown parameters".).[9] It can also be decomposed as the union of two equal golden rectangles (of dimensions 1 × φScript error: No such module "Check for unknown parameters".) whose intersection forms a square. All this is can be seen as the geometric interpretation of the algebraic relationships between 5, φScript error: No such module "Check for unknown parameters". and ΦScript error: No such module "Check for unknown parameters". mentioned above. The root-5 rectangle can be constructed from a 1:2 rectangle (the root-4 rectangle), or directly from a square in a manner similar to the one for the golden rectangle shown in the illustration, but extending the arc of length 5/2 to both sides.

Trigonometry

Like 2 and 3, the square root of 5 appears extensively in the formulae for exact trigonometric constants, including in the sines and cosines of every angle whose measure in degrees is divisible by 3 but not by 15.[10] The simplest of these are

sinπ10=sin18=14(51)=15+1,sinπ5=sin36=142(55),sin3π10=sin54=14(5+1)=151,sin2π5=sin72=142(5+5).

As such, the computation of its value is important for generating trigonometric tables. Since 5 is geometrically linked to half-square rectangles and to pentagons, it also appears frequently in formulae for the geometric properties of figures derived from them, such as in the formula for the volume of a dodecahedron.[7]

Diophantine approximations

Hurwitz's theorem in Diophantine approximations states that every irrational number xScript error: No such module "Check for unknown parameters". can be approximated by infinitely many rational numbers Template:SfracScript error: No such module "Check for unknown parameters". in lowest terms in such a way that

|xmn|<15n2

and that 5 is best possible, in the sense that for any larger constant than 5, there are some irrational numbers xScript error: No such module "Check for unknown parameters". for which only finitely many such approximations exist.[11]

Closely related to this is the theorem[12] that of any three consecutive convergents Template:SfracScript error: No such module "Check for unknown parameters"., Template:SfracScript error: No such module "Check for unknown parameters"., Template:SfracScript error: No such module "Check for unknown parameters"., of a number αScript error: No such module "Check for unknown parameters"., at least one of the three inequalities holds:

|αpiqi|<15qi2,|αpi+1qi+1|<15qi+12,|αpi+2qi+2|<15qi+22.

And the 5 in the denominator is the best bound possible since the convergents of the golden ratio make the difference on the left-hand side arbitrarily close to the value on the right-hand side. In particular, one cannot obtain a tighter bound by considering sequences of four or more consecutive convergents.[12]

Algebra

The ring [5] contains numbers of the form a+b5, where aScript error: No such module "Check for unknown parameters". and bScript error: No such module "Check for unknown parameters". are integers and 5 is the imaginary number i5. This ring is a frequently cited example of an integral domain that is not a unique factorization domain.[13] The number 6 has two inequivalent factorizations within this ring:

6=23=(15)(1+5).

On the other hand, the real quadratic integer ring [5+12], adjoining the Golden ratio ϕ=5+12, was shown to be Euclidean, and hence a unique factorization domain, by Dedekind.

The field [5], like any other quadratic field, is an abelian extension of the rational numbers. The Kronecker–Weber theorem therefore guarantees that the square root of five can be written as a rational linear combination of roots of unity:

5=e2π5ie4π5ie6π5i+e8π5i.

Identities of Ramanujan

The square root of 5 appears in various identities discovered by Srinivasa Ramanujan involving continued fractions.[14][15]

For example, this case of the Rogers–Ramanujan continued fraction:

11+e2π1+e4π1+e6π1+=(5+525+12)e2π5=e2π5(φ5φ).


11+e2π51+e4π51+e6π51+=(51+534(φ1)5215φ)e2π5.


40xex5coshxdx=11+121+121+221+221+321+321+.

See also

References

<templatestyles src="Reflist/styles.css" />

  1. Dauben, Joseph W. (June 1983) Scientific American Georg Cantor and the origins of transfinite set theory. Volume 248; Page 122.
  2. Script error: No such module "citation/CS1".
  3. Script error: No such module "citation/CS1".
  4. Browne, Malcolm W. (July 30, 1985) New York Times Puzzling Crystals Plunge Scientists into Uncertainty. Section: C; Page 1. (Note: this is a widely cited article).
  5. Richard K. Guy: "The Strong Law of Small Numbers". American Mathematical Monthly, vol. 95, 1988, pp. 675–712
  6. Script error: No such module "citation/CS1".
  7. a b Script error: No such module "citation/CS1".
  8. Script error: No such module "citation/CS1".
  9. Script error: No such module "citation/CS1".
  10. Julian D. A. Wiseman, "Sin and cos in surds"
  11. Script error: No such module "citation/CS1".
  12. a b Script error: No such module "citation/CS1".
  13. Script error: No such module "citation/CS1".
  14. Script error: No such module "citation/CS1".
  15. Script error: No such module "citation/CS1". at MathWorld

Script error: No such module "Check for unknown parameters".

Template:Algebraic numbers Template:Irrational number