Lochs's theorem

Channel:

WikiReader

Subscribers:

9,560

Published on May 7, 2022 8:03:08 AM ● Video Link: https://www.youtube.com/watch?v=p06RMMqU-18

Duration: 0:03

2 views

0

In number theory, Lochs's theorem concerns the rate of convergence of the continued fraction expansion of a typical real number. A proof of the theorem was published in 1964 by Gustav Lochs.The theorem states that for almost all real numbers in the interval (0,1), the number of terms m of the number's continued fraction expansion that are required to determine the first n places of the number's decimal expansion behaves asymptotically as follows:





lim

n
→
∞




m
n


=



6
ln
⁡
(
2
)
ln
⁡
(
10
)


π

2




≈
0.97027014


{\displaystyle \lim _{n\to \infty }{\frac {m}{n}}={\frac {6\ln(2)\ln(10)}{\pi ^{2}}}\approx 0.97027014}
(sequence A086819 in the OEIS).As this limit is only slightly smaller than 1, this can be interpreted as saying that each additional term in the continued fraction representation of a "typical" real number increases the accuracy of the representation by approximately one decimal place. The decimal system is the last positional system for which each digit carries less information than one continued fraction quotient; going to base-11 (changing



ln
⁡
(
10
)


{\displaystyle \ln(10)}
to



ln
⁡
(
11
)


{\displaystyle \ln(11)}
in the equation) makes the above value exceed 1.
The reciprocal of this limit,







π

2



6
ln
⁡
(
2
)
ln
⁡
(
10
)



≈
1.03064083


{\displaystyle {\frac {\pi ^{2}}{6\ln(2)\ln(10)}}\approx 1.03064083}
(sequence A062542 in the OEIS),is twice the base-10 logarithm of Lévy's constant.

A prominent example of a number not exhibiting this behavior is the golden ratio—sometimes known as the "most irrational" number—whose continued fraction terms are all ones, the smallest possible in canonical form. On average it requires approximately 2.39 continued fraction terms per decimal digit.


== References ==

Source: https://en.wikipedia.org/wiki/Lochs%27s_theorem
Created with WikipediaReaderReborn (c) WikipediaReader