<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=136.152.142.32</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=136.152.142.32"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/136.152.142.32"/>
	<updated>2026-08-16T05:14:25Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Canadian_traveller_problem&amp;diff=22461</id>
		<title>Canadian traveller problem</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Canadian_traveller_problem&amp;diff=22461"/>
		<updated>2013-09-20T20:23:19Z</updated>

		<summary type="html">&lt;p&gt;136.152.142.32: Adjacent edges -&amp;gt; incident edges&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[number theory]], &#039;&#039;&#039;Lochs&#039; theorem&#039;&#039;&#039; is a theorem concerning the rate of convergence of the [[continued fraction]] expansion of a typical real number. A proof of the theorem was published by [[Gustav Lochs]] in 1964.&amp;lt;ref&amp;gt;{{citation&lt;br /&gt;
 | last = Lochs | first = Gustav&lt;br /&gt;
 | doi = 10.1007/BF02993063&lt;br /&gt;
 | journal = Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg&lt;br /&gt;
 | language = German&lt;br /&gt;
 | mr = 0162753&lt;br /&gt;
 | pages = 142–144&lt;br /&gt;
 | title = Vergleich der Genauigkeit von Dezimalbruch und Kettenbruch&lt;br /&gt;
 | volume = 27&lt;br /&gt;
 | year = 1964}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The theorem states that for [[almost all]] real numbers in the interval (0,1), the number of terms &#039;&#039;m&#039;&#039; of the number&#039;s continued fraction expansion that are required to determine the first &#039;&#039;n&#039;&#039; places of the number&#039;s decimal expansion behaves [[asymptotically]] as follows:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\lim_{n \rightarrow \infty} \frac{m}{n} = \frac {6 \ln 2 \ln 10}{ \pi^2} \approx 0.97027014&amp;lt;/math&amp;gt; {{OEIS|id=A086819}}.&amp;lt;ref&amp;gt;{{MathWorld|urlname=LochsTheorem|title=Lochs&#039; Theorem}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
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 &amp;quot;typical&amp;quot; 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 [[Undecimal|base-11]] (changing &amp;lt;math&amp;gt;\ln 10&amp;lt;/math&amp;gt; to &amp;lt;math&amp;gt;\ln 11&amp;lt;/math&amp;gt; in the equation) makes the above value exceed 1.&lt;br /&gt;
&lt;br /&gt;
The reciprocal of this limit,&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\frac { \pi^2}{6 \ln 2 \ln 10} \approx 1.03064083&amp;lt;/math&amp;gt; {{OEIS|id=A062542}},&lt;br /&gt;
&lt;br /&gt;
is twice the base-10 logarithm of [[Lévy&#039;s constant]].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Continued fractions]]&lt;br /&gt;
[[Category:Theorems in number theory]]&lt;/div&gt;</summary>
		<author><name>136.152.142.32</name></author>
	</entry>
</feed>