Continued fraction

A continued fraction is a mathematical expression written as a fraction whose denominator contains a sum involving another fraction, which may itself be a simple or a continued fraction.Template:Sfn If this iteration (repetitive process) terminates with a simple fraction, the result is a finite continued fraction; if it continues indefinitely, the result is an infinite continued fraction. The special case in which all numerators are equal to one is referred to as a simple (or regular) continued fraction. Any rational number can be expressed as a finite simple continued fraction, and any irrational number can be expressed as an infinite simple continued fraction.

Different areas of mathematics use different terminology and notation for continued fractions. In number theory, the unqualified term continued fraction usually refers to simple continued fractions, whereas the general case is referred to as generalized continued fractions. In complex analysis and numerical analysis, the general case is usually referred to by the unqualified term continued fraction.

The numerators and denominators of continued fractions can be sequences $\{a_i\},\{b_i\}$ of constants or functions.

Formulation

A continued fraction is an expression of the form

$x=b_0+\frac{a_1}{b_1+\frac{a_2}{b_2+\frac{a_3}{b_3+\frac{a_4}{b_4+\ddots }}}}$

where the a_n (n > 0) are the partial numerators, the b_n are the partial denominators, and the leading term b₀ is called the integer part of the continued fraction.

The successive convergents of the continued fraction are formed by applying the fundamental recurrence formulas:

$\begin{array}{rl}{x}_0& =\frac{A_0}{B_0}=b_0,\\ x_1& =\frac{A_1}{B_1}=\frac{b_1{b}_0+a_1}{b_1},\\ x_2& =\frac{A_2}{B_2}=\frac{b_2(b_1{b}_0+a_1)+a_2{b}_0}{b_2{b}_1+a_2},\dots \end{array}$

where A_n is the numerator and B_n is the denominator, called continuants,Template:SfnTemplate:Sfn of the nth convergent. They are given by the three-term recurrence relation Template:Sfn

$\begin{array}{rl}{A}_n& =b_n{A}_{n-1}+a_n{A}_{n-2},\\ B_n& =b_n{B}_{n-1}+a_n{B}_{n-2}\text{for }n\ge 1\end{array}$

with initial values

$\begin{array}{rlrl}{A}_{-1}& =1,& A_0& =b_0,\\ B_{-1}& =0,& B_0& =1.\end{array}$

If the sequence of convergents {x_n} approaches a limit, the continued fraction is convergent and has a definite value. If the sequence of convergents never approaches a limit, the continued fraction is divergent. It may diverge by oscillation (for example, the odd and even convergents may approach two different limits), or it may produce an infinite number of zero denominators B_n.

History

The story of continued fractions begins with the Euclidean algorithm, a procedure for finding the greatest common divisor of two natural numbers m and n. That algorithm introduced the idea of dividing to extract a new remainder – and then dividing by the new remainder repeatedly.

Nearly two thousand years passed before devised a technique for approximating the roots of quadratic equations with continued fractions in the mid-sixteenth century. Now the pace of development quickened. Just 24 years later, in 1613, Pietro Cataldi introduced the first formal notation for the generalized continued fraction.Template:Sfn Cataldi represented a continued fraction as

$a_0\cdot \mathrm{\&}\frac{n_1}{d_1\cdot }\mathrm{\&}\frac{n_2}{d_2\cdot }\mathrm{\&}\frac{n_3}{d_3}$

with the dots indicating where the next fraction goes, and each & representing a modern plus sign.

Late in the seventeenth century John Wallis introduced the term "continued fraction" into mathematical literature.Template:Sfn New techniques for mathematical analysis (Newton's and Leibniz's calculus) had recently come onto the scene, and a generation of Wallis' contemporaries put the new phrase to use.

In 1748 Euler published a theorem showing that a particular kind of continued fraction is equivalent to a certain very general infinite series.Template:Sfn Euler's continued fraction formula is still the basis of many modern proofs of convergence of continued fractions.

In 1761, Johann Heinrich Lambert gave the first [[Proof that π is irrational#Lambert's proof|proof that Template:Pi is irrational]], by using the following continued fraction for tan x:Template:Sfn

$\tan (x)=\frac{x}{1+\frac{-x^2}{3+\frac{-x^2}{5+\frac{-x^2}{7+\ddots }}}}$

Continued fractions can also be applied to problems in number theory, and are especially useful in the study of Diophantine equations. In the late eighteenth century Lagrange used continued fractions to construct the general solution of Pell's equation, thus answering a question that had fascinated mathematicians for more than a thousand years. Lagrange's discovery implies that the canonical continued fraction expansion of the square root of every non-square integer is periodic and that, if the period is of length p > 1, it contains a palindromic string of length p − 1.

In 1813 Gauss derived from complex-valued hypergeometric functions what are now called Gauss's continued fractions.Template:Sfn They can be used to express many elementary functions and some more advanced functions (such as the Bessel functions), as continued fractions that are rapidly convergent almost everywhere in the complex plane.

Notation

The long continued fraction expression displayed in the introduction is easy for an unfamiliar reader to interpret. However, it takes up a lot of space and can be difficult to typeset. So mathematicians have devised several alternative notations. One convenient way to express a generalized continued fraction sets each nested fraction on the same line, indicating the nesting by dangling plus signs in the denominators:

$x=b_0+\frac{a_1}{b_1+}\frac{a_2}{b_2+}\frac{a_3}{b_3+\cdots }$

Sometimes the plus signs are typeset to vertically align with the denominators but not under the fraction bars:

$x=b_0+\frac{a_1}{b_1}\genfrac{}{}{0ex}{}{}{+}\frac{a_2}{b_2}\genfrac{}{}{0ex}{}{}{+}\frac{a_3}{b_3}\genfrac{}{}{0ex}{}{}{+\cdots }$

Pringsheim wrote a generalized continued fraction this way:

$x=b_0+\genfrac{}{}{0ex}{}{}{|}\frac{a_1}{b_1}\genfrac{}{}{0ex}{}{|}{}+\genfrac{}{}{0ex}{}{}{|}\frac{a_2}{b_2}\genfrac{}{}{0ex}{}{|}{}+\genfrac{}{}{0ex}{}{}{|}\frac{a_3}{b_3}\genfrac{}{}{0ex}{}{|}{}+\cdots$

Carl Friedrich Gauss evoked the more familiar infinite product Π when he devised this notation:

$x=b_0+\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{a_i}{b_i}.$

Here the "K" stands for Kettenbruch, the German word for "continued fraction". This is probably the most compact and convenient way to express continued fractions; however, it is not widely used by English typesetters.

Some elementary considerations

Here are some elementary results that are of fundamental importance in the further development of the analytic theory of continued fractions.

Partial numerators and denominators

If one of the partial numerators a_n+1 is zero, the infinite continued fraction

$b_0+\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{a_i}{b_i}$

is really just a finite continued fraction with Template:Mvar fractional terms, and therefore a rational function of a₁ to Template:Mvar and b₀ to b_n+1. Such an object is of little interest from the point of view adopted in mathematical analysis, so it is usually assumed that all a_i ≠ 0. There is no need to place this restriction on the partial denominators Template:Mvar.

The determinant formula

When the nth convergent of a continued fraction

$x_n=b_0+\underset{i=1}{\stackrel{n}{\mathrm{K}}}\frac{a_i}{b_i}$

is expressed as a simple fraction x_n = Template:Sfrac we can use the determinant formula

to relate the numerators and denominators of successive convergents x_n and x_{n − 1} to one another. The proof for this can be easily seen by induction.

Proof

Base case The case n = 1 results from a very simple computation. Inductive step Assume that (1) holds for n − 1. Then we need to see the same relation holding true for n. Substituting the value of An and Bn in (1) we obtain: $\begin{array}{rl}& =b_n{A}_{n-1}{B}_{n-1}+a_n{A}_{n-1}{B}_{n-2}-b_n{A}_{n-1}{B}_{n-1}-a_n{A}_{n-2}{B}_{n-1}\\ & =a_n(A_{n-1}{B}_{n-2}-A_{n-2}{B}_{n-1})\end{array}$ which is true because of our induction hypothesis. $A_{n-1}{B}_n-A_n{B}_{n-1}={(-1)}^n{a}_1{a}_2\cdots a_n=\prod _{i=1}^n(-a_i)$ Specifically, if neither Bn nor Bn − 1 is zero (n > 0) we can express the difference between the (n − 1)th and nth convergents like this: $x_{n-1}-x_n=\frac{A_{n-1}}{B_{n-1}}-\frac{A_n}{B_n}={(-1)}^n\frac{a_1{a}_2\cdots a_n}{B_n{B}_{n-1}}=\frac{\prod _{i=1}^n(-a_i)}{B_n{B}_{n-1}}.$

The equivalence transformation

If {c_i} = {c₁, c₂, c₃, ...} is any infinite sequence of non-zero complex numbers we can prove, by induction, that

$b_0+\frac{a_1}{b_1+\frac{a_2}{b_2+\frac{a_3}{b_3+\frac{a_4}{b_4+\ddots }}}}=b_0+\frac{c_1{a}_1}{c_1{b}_1+\frac{c_1{c}_2{a}_2}{c_2{b}_2+\frac{c_2{c}_3{a}_3}{c_3{b}_3+\frac{c_3{c}_4{a}_4}{c_4{b}_4+\ddots }}}}$

where equality is understood as equivalence, which is to say that the successive convergents of the continued fraction on the left are exactly the same as the convergents of the fraction on the right.

The equivalence transformation is perfectly general, but two particular cases deserve special mention. First, if none of the Template:Mvar are zero, a sequence {c_i} can be chosen to make each partial numerator a 1:

$b_0+\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{a_i}{b_i}=b_0+\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{1}{c_i{b}_i}$

where c₁ = Template:Sfrac, c₂ = Template:Sfrac, c₃ = Template:Sfrac, and in general c_n+1 = Template:Sfrac.

Second, if none of the partial denominators Template:Mvar are zero we can use a similar procedure to choose another sequence {d_i} to make each partial denominator a 1:

$b_0+\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{a_i}{b_i}=b_0+\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{d_i{a}_i}{1}$

where d₁ = Template:Sfrac and otherwise d_n+1 = Template:Sfrac.

These two special cases of the equivalence transformation are enormously useful when the general convergence problem is analyzed.

Notions of convergence

As mentioned in the introduction, the continued fraction

$x=b_0+\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{a_i}{b_i}$

converges if the sequence of convergents {x_n} tends to a finite limit. This notion of convergence is very natural, but it is sometimes too restrictive. It is therefore useful to introduce the notion of general convergence of a continued fraction. Roughly speaking, this consists in replacing the ${\mathrm{K}}_{i=n}^{\mathrm{\infty }}\frac{a_i}{b_i}$ part of the fraction by w_n, instead of by 0, to compute the convergents. The convergents thus obtained are called modified convergents. We say that the continued fraction converges generally if there exists a sequence $\{w_n^{*}\}$ such that the sequence of modified convergents converges for all $\{w_n\}$ sufficiently distinct from $\{w_n^{*}\}$. The sequence $\{w_n^{*}\}$ is then called an exceptional sequence for the continued fraction. See Chapter 2 of for a rigorous definition.

There also exists a notion of absolute convergence for continued fractions, which is based on the notion of absolute convergence of a series: a continued fraction is said to be absolutely convergent when the series

$f=\sum _n(f_n-f_{n-1}),$

where $f_n={\mathrm{K}}_{i=1}^n\frac{a_i}{b_i}$ are the convergents of the continued fraction, converges absolutely.Template:Sfn The Śleszyński–Pringsheim theorem provides a sufficient condition for absolute convergence.

Finally, a continued fraction of one or more complex variables is uniformly convergent in an open neighborhood Ω when its convergents converge uniformly on Ω; that is, when for every ε > 0 there exists M such that for all n > M, for all $z\in \mathrm{\Omega }$,

$|f(z)-f_n(z)|<\epsilon .$

Even and odd convergents

It is sometimes necessary to separate a continued fraction into its even and odd parts. For example, if the continued fraction diverges by oscillation between two distinct limit points p and q, then the sequence {x₀, x₂, x₄, ...} must converge to one of these, and {x₁, x₃, x₅, ...} must converge to the other. In such a situation it may be convenient to express the original continued fraction as two different continued fractions, one of them converging to p, and the other converging to q.

The formulas for the even and odd parts of a continued fraction can be written most compactly if the fraction has already been transformed so that all its partial denominators are unity. Specifically, if

$x=\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{a_i}{1}$

is a continued fraction, then the even part x_even and the odd part x_odd are given by

$x_{\text{even}}=\frac{a_1}{1+a_2-\frac{a_2{a}_3}{1+a_3+a_4-\frac{a_4{a}_5}{1+a_5+a_6-\frac{a_6{a}_7}{1+a_7+a_8-\ddots }}}}$

and

$x_{\text{odd}}=a_1-\frac{a_1{a}_2}{1+a_2+a_3-\frac{a_3{a}_4}{1+a_4+a_5-\frac{a_5{a}_6}{1+a_6+a_7-\frac{a_7{a}_8}{1+a_8+a_9-\ddots }}}}$

respectively. More precisely, if the successive convergents of the continued fraction x are {x₁, x₂, x₃, ...}, then the successive convergents of x_even as written above are {x₂, x₄, x₆, ...}, and the successive convergents of x_odd are {x₁, x₃, x₅, ...}.

Conditions for irrationality

If a₁, a₂,... and b₁, b₂,... are positive integers with a_k ≤ b_k for all sufficiently large k, then

$x=b_0+\underset{i=1}{\stackrel{\mathrm{\infty }}{\mathrm{K}}}\frac{a_i}{b_i}$

converges to an irrational limit.Template:Sfn

Fundamental recurrence formulas

The partial numerators and denominators of the fraction's successive convergents are related by the fundamental recurrence formulas:

$\begin{array}{rlrl}{A}_{-1}& =1& B_{-1}& =0\\ A_0& =b_0& B_0& =1\\ A_{n+1}& =b_{n+1}{A}_n+a_{n+1}{A}_{n-1}& B_{n+1}& =b_{n+1}{B}_n+a_{n+1}{B}_{n-1}\end{array}$

The continued fraction's successive convergents are then given by

$x_n=\frac{A_n}{B_n}.$

These recurrence relations are due to John Wallis (1616–1703) and Leonhard Euler (1707–1783).Template:Sfn These recurrence relations are simply a different notation for the relations obtained by Pietro Antonio Cataldi (1548-1626).

As an example, consider the simple continued fraction in canonical form that represents the [[golden ratio|golden ratio Template:Mvar]]:

$\phi =1+\frac{1}{1+\frac{1}{1+\frac{1}{1+\frac{1}{1+\ddots }}}}$

Applying the fundamental recurrence formulas we find that the successive numerators A_n are {1, 2, 3, 5, 8, 13, ...} and the successive denominators B_n are {1, 1, 2, 3, 5, 8, ...}, the Fibonacci numbers. Since all the partial numerators in this example are equal to one, the determinant formula assures us that the absolute value of the difference between successive convergents approaches zero quite rapidly.

Linear fractional transformations

A linear fractional transformation (LFT) is a complex function of the form

$w=f(z)=\frac{az+b}{cz+d},$

where Template:Mvar is a complex variable, and a, b, c, d are arbitrary complex constants such that cz + d ≠ 0. An additional restriction that ad ≠ bc is customarily imposed, to rule out the cases in which w = f(z) is a constant. The linear fractional transformation, also known as a Möbius transformation, has many fascinating properties. Four of these are of primary importance in developing the analytic theory of continued fractions.

• If c ≠ 0 the LFT has one or two fixed points. This can be seen by considering the equation

$f(z)=z\Rightarrow az+b=c{z}^2+dz\Rightarrow c{z}^2+(d-a)z-b=0,$

which is clearly a quadratic equation in Template:Mvar. The roots of this equation are the fixed points of f(z). If the discriminant (d − a)² + 4bc is zero the LFT fixes a single point; otherwise it has two fixed points.

• If ad ≠ bc the LFT is an invertible conformal mapping of the extended complex plane onto itself. In other words, this LFT has an inverse function

$z=g(w)=\frac{\phantom{+}dw-b}{-cw+a}$

such that f(g(z)) = g(f(z)) = z for every point Template:Mvar in the extended complex plane, and both Template:Mvar and Template:Mvar preserve angles and shapes at vanishingly small scales. From the form of z = g(w) we see that Template:Mvar is also an LFT.

• The composition of two different LFTs for which ad ≠ bc is itself an LFT for which ad ≠ bc. In other words, the set of all LFTs for which ad ≠ bc is closed under composition of functions. The collection of all such LFTs, together with the "group operation" composition of functions, is known as the automorphism group of the extended complex plane.
• If a = 0 the LFT reduces to

$w=f(z)=\frac{b}{cz+d},$

which is a very simple meromorphic function of Template:Mvar with one simple pole (at −Template:Sfrac) and a residue equal to Template:Sfrac. (See also Laurent series.)

The continued fraction as a composition of LFTs

Consider a sequence of simple linear fractional transformations

$\begin{array}{rl}{\tau }_0(z)& =b_0+z,\\ [4px]{\tau }_1(z)& =\frac{a_1}{b_1+z},\\ [4px]{\tau }_2(z)& =\frac{a_2}{b_2+z},\\ [4px]{\tau }_3(z)& =\frac{a_3}{b_3+z},\\ & ⋮\end{array}$

Here we use Template:Mvar to represent each simple LFT, and we adopt the conventional circle notation for composition of functions. We also introduce a new symbol Τ_n to represent the composition of n + 1 transformations Template:Mvar; that is,

$\begin{array}{rl}{\mathrm{T}}_{\mathit{1}}(z)& ={\tau }_0\circ {\tau }_1(z)={\tau }_0({\tau }_1(z)),\\ {\mathrm{T}}_{\mathit{2}}(z)& ={\tau }_0\circ {\tau }_1\circ {\tau }_2(z)={\tau }_0\left({\tau }_1\right({\tau }_2(z)\left)\right),\end{array}$

and so forth. By direct substitution from the first set of expressions into the second we see that

$\begin{array}{rlrl}{\mathrm{T}}_{\mathit{1}}(z)& ={\tau }_0\circ {\tau }_1(z)& =& b_0+\frac{a_1}{b_1+z}\\ [4px]{\mathrm{T}}_{\mathit{2}}(z)& ={\tau }_0\circ {\tau }_1\circ {\tau }_2(z)& =& b_0+\frac{a_1}{b_1+\frac{a_2}{b_2+z}}\end{array}$

and, in general,

${\mathrm{T}}_{\mathit{n}}(z)={\tau }_0\circ {\tau }_1\circ {\tau }_2\circ \cdots \circ {\tau }_n(z)=b_0+\underset{i=1}{\stackrel{n}{\mathrm{K}}}\frac{a_i}{b_i}$

where the last partial denominator in the finite continued fraction K is understood to be b_n + z. And, since b_n + 0 = b_n, the image of the point z = 0 under the iterated LFT Τ_n is indeed the value of the finite continued fraction with Template:Mvar partial numerators:

${\mathrm{T}}_{\mathit{n}}(0)={\mathrm{T}}_{\mathit{n}\mathit{+}\mathit{1}}(\mathrm{\infty })=b_0+\underset{i=1}{\stackrel{n}{\mathrm{K}}}\frac{a_i}{b_i}.$

A geometric interpretation

Defining a finite continued fraction as the image of a point under the iterated linear fractional transformation Τ_n(z) leads to an intuitively appealing geometric interpretation of infinite continued fractions.

The relationship

$x_n=b_0+\underset{i=1}{\stackrel{n}{\mathrm{K}}}\frac{a_i}{b_i}=\frac{A_n}{B_n}={\mathrm{T}}_{\mathit{n}}(0)={\mathrm{T}}_{\mathit{n}\mathit{+}\mathit{1}}(\mathrm{\infty })$

can be understood by rewriting Τ_n(z) and Τ_n+1(z) in terms of the fundamental recurrence formulas:

$\begin{array}{rlrl}{\mathrm{T}}_{\mathit{n}}(z)& =\frac{(b_n+z)A_{n-1}+a_n{A}_{n-2}}{(b_n+z)B_{n-1}+a_n{B}_{n-2}}& {\mathrm{T}}_{\mathit{n}}(z)& =\frac{z{A}_{n-1}+A_n}{z{B}_{n-1}+B_n};\\ [6px]{\mathrm{T}}_{\mathit{n}\mathit{+}\mathit{1}}(z)& =\frac{(b_{n+1}+z)A_n+a_{n+1}{A}_{n-1}}{(b_{n+1}+z)B_n+a_{n+1}{B}_{n-1}}& {\mathrm{T}}_{\mathit{n}\mathit{+}\mathit{1}}(z)& =\frac{z{A}_n+A_{n+1}}{z{B}_n+B_{n+1}}.\end{array}$

In the first of these equations the ratio tends toward Template:Sfrac as Template:Mvar tends toward zero. In the second, the ratio tends toward Template:Sfrac as Template:Mvar tends to infinity. This leads us to our first geometric interpretation. If the continued fraction converges, the successive convergents Template:Sfrac are eventually arbitrarily close together. Since the linear fractional transformation Τ_n(z) is a continuous mapping, there must be a neighborhood of z = 0 that is mapped into an arbitrarily small neighborhood of Τ_n(0) = Template:Sfrac. Similarly, there must be a neighborhood of the point at infinity which is mapped into an arbitrarily small neighborhood of Τ_n(∞) = Template:Sfrac. So if the continued fraction converges the transformation Τ_n(z) maps both very small Template:Mvar and very large Template:Mvar into an arbitrarily small neighborhood of Template:Mvar, the value of the continued fraction, as Template:Mvar gets larger and larger.

For intermediate values of Template:Mvar, since the successive convergents are getting closer together we must have

$\frac{A_{n-1}}{B_{n-1}}\approx \frac{A_n}{B_n}\Rightarrow \frac{A_{n-1}}{A_n}\approx \frac{B_{n-1}}{B_n}=k$

where Template:Mvar is a constant, introduced for convenience. But then, by substituting in the expression for Τ_n(z) we obtain

${\mathrm{T}}_{\mathit{n}}(z)=\frac{z{A}_{n-1}+A_n}{z{B}_{n-1}+B_n}=\frac{A_n}{B_n}\left(\frac{z\frac{A_{n-1}}{A_n}+1}{z\frac{B_{n-1}}{B_n}+1}\right)\approx \frac{A_n}{B_n}\left(\frac{zk+1}{zk+1}\right)=\frac{A_n}{B_n}$

so that even the intermediate values of Template:Mvar (except when z ≈ −k⁻¹) are mapped into an arbitrarily small neighborhood of Template:Mvar, the value of the continued fraction, as Template:Mvar gets larger and larger. Intuitively, it is almost as if the convergent continued fraction maps the entire extended complex plane into a single point.

Notice that the sequence {Τ_n} lies within the automorphism group of the extended complex plane, since each Τ_n is a linear fractional transformation for which ab ≠ cd. And every member of that automorphism group maps the extended complex plane into itself: not one of the Τ_n can possibly map the plane into a single point. Yet in the limit the sequence {Τ_n} defines an infinite continued fraction which (if it converges) represents a single point in the complex plane.

When an infinite continued fraction converges, the corresponding sequence {Τ_n} of LFTs "focuses" the plane in the direction of Template:Mvar, the value of the continued fraction. At each stage of the process a larger and larger region of the plane is mapped into a neighborhood of Template:Mvar, and the smaller and smaller region of the plane that's left over is stretched out ever more thinly to cover everything outside that neighborhood.

For divergent continued fractions, we can distinguish three cases:

1. The two sequences {Τ_2n−1} and {Τ_2n} might themselves define two convergent continued fractions that have two different values, x_odd and x_even. In this case the continued fraction defined by the sequence {Τ_n} diverges by oscillation between two distinct limit points. And in fact this idea can be generalized: sequences {Τ_n} can be constructed that oscillate among three, or four, or indeed any number of limit points. Interesting instances of this case arise when the sequence {Τ_n} constitutes a subgroup of finite order within the group of automorphisms over the extended complex plane.
2. The sequence {Τ_n} may produce an infinite number of zero denominators Template:Mvar while also producing a subsequence of finite convergents. These finite convergents may not repeat themselves or fall into a recognizable oscillating pattern. Or they may converge to a finite limit, or even oscillate among multiple finite limits. No matter how the finite convergents behave, the continued fraction defined by the sequence {Τ_n} diverges by oscillation with the point at infinity in this case.
3. The sequence {Τ_n} may produce no more than a finite number of zero denominators Template:Mvar. while the subsequence of finite convergents dances wildly around the plane in a pattern that never repeats itself and never approaches any finite limit either.

File:Continued fraction visualisation.svg

Visual interpretation of a simple continued fraction

Interesting examples of cases 1 and 3 can be constructed by studying the simple continued fraction

$x=1+\frac{z}{1+\frac{z}{1+\frac{z}{1+\frac{z}{1+\ddots }}}}$

where Template:Mvar is any real number such that z < −Template:Sfrac.

Euler's continued fraction formula

Euler proved the following identity:Template:Sfn

$a_0+a_0{a}_1+a_0{a}_1{a}_2+\cdots +a_0{a}_1{a}_2\cdots a_n=\frac{a_0}{1-\frac{a_1}{1+a_1-\frac{a_2}{1+a_2-\cdots \frac{a_n}{1+a_n}}}}.$

From this many other results can be derived, such as

$\frac{1}{u_1}+\frac{1}{u_2}+\frac{1}{u_3}+\cdots +\frac{1}{u_n}=\frac{1}{u_1-\frac{u_1^2}{u_1+u_2-\frac{u_2^2}{u_2+u_3-\cdots \frac{u_{n-1}^2}{u_{n-1}+u_n}}}},$

and

$\frac{1}{a_0}+\frac{x}{a_0{a}_1}+\frac{x^2}{a_0{a}_1{a}_2}+\cdots +\frac{x^n}{a_0{a}_1{a}_2\dots a_n}=\frac{1}{a_0-\frac{a_{0}x}{a_1+x-\frac{a_{1}x}{a_2+x-\cdots \frac{a_{n-1}x}{a_n+x}}}}.$

Euler's formula connecting continued fractions and series is the motivation for the , and also the basis of elementary approaches to the convergence problem.

Examples

Transcendental functions and numbers

Here are two continued fractions that can be built via Euler's identity.

$e^x=\frac{x^0}{0!}+\frac{x^1}{1!}+\frac{x^2}{2!}+\frac{x^3}{3!}+\frac{x^4}{4!}+\cdots =1+\frac{x}{1-\frac{1x}{2+x-\frac{2x}{3+x-\frac{3x}{4+x-\ddots }}}}$

$\log (1+x)=\frac{x^1}{1}-\frac{x^2}{2}+\frac{x^3}{3}-\frac{x^4}{4}+\cdots =\frac{x}{1-0x+\frac{1^{2}x}{2-1x+\frac{2^{2}x}{3-2x+\frac{3^{2}x}{4-3x+\ddots }}}}$

Here are additional generalized continued fractions:

$\arctan \frac{x}{y}=\frac{xy}{1y^2+\frac{(1xy{)}^2}{3y^2-1x^2+\frac{(3xy{)}^2}{5y^2-3x^2+\frac{(5xy{)}^2}{7y^2-5x^2+\ddots }}}}=\frac{x}{1y+\frac{(1x{)}^2}{3y+\frac{(2x{)}^2}{5y+\frac{(3x{)}^2}{7y+\ddots }}}}$

$e^{\frac{x}{y}}=1+\frac{2x}{2y-x+\frac{x^2}{6y+\frac{x^2}{10y+\frac{x^2}{14y+\frac{x^2}{18y+\ddots }}}}}\Rightarrow e^2=7+\frac{2}{5+\frac{1}{7+\frac{1}{9+\frac{1}{11+\ddots }}}}$

$\log (1+\frac{x}{y})=\frac{x}{y+\frac{1x}{2+\frac{1x}{3y+\frac{2x}{2+\frac{2x}{5y+\frac{3x}{2+\ddots }}}}}}=\frac{2x}{2y+x-\frac{(1x{)}^2}{3(2y+x)-\frac{(2x{)}^2}{5(2y+x)-\frac{(3x{)}^2}{7(2y+x)-\ddots }}}}$

This last is based on an algorithm derived by Aleksei Nikolaevich Khovansky in the 1970s.

Example: the natural logarithm of 2 (= [0; 1, 2, 3, 1, 5, Template:Sfrac, 7, Template:Sfrac, 9, Template:Sfrac,..., 2k − 1, Template:Sfrac,...] ≈ 0.693147...):Template:Sfn

$\log 2=\log (1+1)=\frac{1}{1+\frac{1}{2+\frac{1}{3+\frac{2}{2+\frac{2}{5+\frac{3}{2+\ddots }}}}}}=\frac{2}{3-\frac{1^2}{9-\frac{2^2}{15-\frac{3^2}{21-\ddots }}}}$

Template:Pi

Here are three of [[pi|Template:Pi's]] best-known generalized continued fractions, the first and third of which are derived from their respective arctangent formulas above by setting x = y = 1 and multiplying by 4. The [[Leibniz formula for π|Leibniz formula for Template:Pi]]:

$\pi =\frac{4}{1+\frac{1^2}{2+\frac{3^2}{2+\frac{5^2}{2+\ddots }}}}=\sum _{n=0}^{\mathrm{\infty }}\frac{4(-1{)}^n}{2n+1}=\frac{4}{1}-\frac{4}{3}+\frac{4}{5}-\frac{4}{7}+-\cdots$

converges slowly, requiring roughly 3 × 10ⁿ terms to achieve n correct decimal places. The series derived by Nilakantha Somayaji:

$\pi =3+\frac{1^2}{6+\frac{3^2}{6+\frac{5^2}{6+\ddots }}}=3-\sum _{n=1}^{\mathrm{\infty }}\frac{(-1{)}^n}{n(n+1)(2n+1)}=3+\frac{1}{1\cdot 2\cdot 3}-\frac{1}{2\cdot 3\cdot 5}+\frac{1}{3\cdot 4\cdot 7}-+\cdots$

also converges quite slowly, requiring nearly 50 terms for five decimals and nearly 120 for six. Both converge sublinearly. On the other hand:

$\pi =\frac{4}{1+\frac{1^2}{3+\frac{2^2}{5+\frac{3^2}{7+\ddots }}}}=4-1+\frac{1}{6}-\frac{1}{34}+\frac{16}{3145}-\frac{4}{4551}+\frac{1}{6601}-\frac{1}{38341}+-\cdots$

converges linearly, adding at least three digits of precision per four terms, a pace slightly faster than the [[Approximations of π#Arcsine|arcsine formula for Template:Pi]]:

$\pi =6{\sin }^{-1}\left(\frac{1}{2}\right)=\sum _{n=0}^{\mathrm{\infty }}\frac{3\cdot (\genfrac{}{}{0ex}{}{2n}{n})}{16^n(2n+1)}=\frac{3}{16^0\cdot 1}+\frac{6}{16^1\cdot 3}+\frac{18}{16^2\cdot 5}+\frac{60}{16^3\cdot 7}+\cdots$

which adds at least three decimal digits per five terms.Template:Sfn

• Note: this continued fraction's rate of convergence μ tends to 3 − Template:Radic ≈ 0.1715729, hence Template:Sfrac tends to 3 + Template:Radic ≈ 5.828427, whose common logarithm is 0.7655... ≈ Template:Sfrac > Template:Sfrac. The same Template:Sfrac = 3 + Template:Radic (the silver ratio squared) also is observed in the unfolded general continued fractions of both the natural logarithm of 2 and the nth root of 2 (which works for any integer n > 1) if calculated using 2 = 1 + 1. For the folded general continued fractions of both expressions, the rate convergence μ = (3 − Template:Radic)² = 17 − Template:Radic ≈ 0.02943725, hence Template:Sfrac = (3 + Template:Radic)² = 17 + Template:Radic ≈ 33.97056, whose common logarithm is 1.531... ≈ Template:Sfrac > Template:Sfrac, thus adding at least three digits per two terms. This is because the folded GCF folds each pair of fractions from the unfolded GCF into one fraction, thus doubling the convergence pace. The Manny Sardina reference further explains "folded" continued fractions.
• Note: Using the continued fraction for arctan Template:Sfrac cited above with the best-known Machin-like formula provides an even more rapidly, although still linearly, converging expression:

$\pi =16{\tan }^{-1}\frac{1}{5}-4{\tan }^{-1}\frac{1}{239}=\frac{16}{5+\frac{1^2}{15+\frac{2^2}{25+\frac{3^2}{35+\ddots }}}}-\frac{4}{v+\frac{1^2}{717+\frac{2^2}{1195+\frac{3^2}{1673+\ddots }}}}.$

Roots of positive numbers

The nth root of any positive number z^m can be expressed by restating z = xⁿ + y, resulting in

$\sqrt[n]{z^m}=\sqrt[n]{{(x^n+y)}^m}=x^m+\frac{my}{n{x}^{n-m}+\frac{(n-m)y}{2x^m+\frac{(n+m)y}{3n{x}^{n-m}+\frac{(2n-m)y}{2x^m+\frac{(2n+m)y}{5n{x}^{n-m}+\frac{(3n-m)y}{2x^m+\ddots }}}}}}$

which can be simplified, by folding each pair of fractions into one fraction, to

$\sqrt[n]{z^m}=x^m+\frac{2x^m\cdot my}{n(2x^n+y)-my-\frac{(1^2{n}^2-m^2)y^2}{3n(2x^n+y)-\frac{(2^2{n}^2-m^2)y^2}{5n(2x^n+y)-\frac{(3^2{n}^2-m^2)y^2}{7n(2x^n+y)-\frac{(4^2{n}^2-m^2)y^2}{9n(2x^n+y)-\ddots }}}}}.$

The square root of z is a special case with m = 1 and n = 2:

$\sqrt{z}=\sqrt{x^2+y}=x+\frac{y}{2x+\frac{y}{2x+\frac{3y}{6x+\frac{3y}{2x+\ddots }}}}=x+\frac{2x\cdot y}{2(2x^2+y)-y-\frac{1\cdot 3y^2}{6(2x^2+y)-\frac{3\cdot 5y^2}{10(2x^2+y)-\ddots }}}$

which can be simplified by noting that Template:Sfrac = Template:Sfrac = Template:Sfrac:

$\sqrt{z}=\sqrt{x^2+y}=x+\frac{y}{2x+\frac{y}{2x+\frac{y}{2x+\frac{y}{2x+\ddots }}}}=x+\frac{2x\cdot y}{2(2x^2+y)-y-\frac{y^2}{2(2x^2+y)-\frac{y^2}{2(2x^2+y)-\ddots }}}.$

The square root can also be expressed by a periodic continued fraction, but the above form converges more quickly with the proper x and y.

Example 1

The cube root of two (2^1/3 or Template:Radic ≈ 1.259921...) can be calculated in two ways:

Firstly, "standard notation" of x = 1, y = 1, and 2z − y = 3:

$\sqrt[3]{2}=1+\frac{1}{3+\frac{2}{2+\frac{4}{9+\frac{5}{2+\frac{7}{15+\frac{8}{2+\frac{10}{21+\frac{11}{2+\ddots }}}}}}}}=1+\frac{2\cdot 1}{9-1-\frac{2\cdot 4}{27-\frac{5\cdot 7}{45-\frac{8\cdot 10}{63-\frac{11\cdot 13}{81-\ddots }}}}}.$

Secondly, a rapid convergence with x = 5, y = 3 and 2z − y = 253:

$\sqrt[3]{2}=\frac{5}{4}+\frac{0.5}{50+\frac{2}{5+\frac{4}{150+\frac{5}{5+\frac{7}{250+\frac{8}{5+\frac{10}{350+\frac{11}{5+\ddots }}}}}}}}=\frac{5}{4}+\frac{2.5\cdot 1}{253-1-\frac{2\cdot 4}{759-\frac{5\cdot 7}{1265-\frac{8\cdot 10}{1771-\ddots }}}}.$

Example 2

Pogson's ratio (100^1/5 or Template:Radic ≈ 2.511886...), with x = 5, y = 75 and 2z − y = 6325:

$\sqrt[5]{100}=\frac{5}{2}+\frac{3}{250+\frac{12}{5+\frac{18}{750+\frac{27}{5+\frac{33}{1250+\frac{42}{5+\ddots }}}}}}=\frac{5}{2}+\frac{5\cdot 3}{1265-3-\frac{12\cdot 18}{3795-\frac{27\cdot 33}{6325-\frac{42\cdot 48}{8855-\ddots }}}}.$

Example 3

The twelfth root of two (2^1/12 or Template:Radic ≈ 1.059463...), using "standard notation":

$\sqrt[12]{2}=1+\frac{1}{12+\frac{11}{2+\frac{13}{36+\frac{23}{2+\frac{25}{60+\frac{35}{2+\frac{37}{84+\frac{47}{2+\ddots }}}}}}}}=1+\frac{2\cdot 1}{36-1-\frac{11\cdot 13}{108-\frac{23\cdot 25}{180-\frac{35\cdot 37}{252-\frac{47\cdot 49}{324-\ddots }}}}}.$

Example 4

Equal temperament's perfect fifth (2^7/12 or Template:Radic ≈ 1.498307...), with m = 7:

With "standard notation":

$\sqrt[12]{2^7}=1+\frac{7}{12+\frac{5}{2+\frac{19}{36+\frac{17}{2+\frac{31}{60+\frac{29}{2+\frac{43}{84+\frac{41}{2+\ddots }}}}}}}}=1+\frac{2\cdot 7}{36-7-\frac{5\cdot 19}{108-\frac{17\cdot 31}{180-\frac{29\cdot 43}{252-\frac{41\cdot 55}{324-\ddots }}}}}.$

A rapid convergence with x = 3, y = −7153, and 2z − y = 2¹⁹ + 3¹²:

$\sqrt[12]{2^7}=\frac{1}{2}\sqrt[12]{3^{12}-7153}=\frac{3}{2}-\frac{0.5\cdot 7153}{4\cdot 3^{12}-\frac{11\cdot 7153}{6-\frac{13\cdot 7153}{12\cdot 3^{12}-\frac{23\cdot 7153}{6-\frac{25\cdot 7153}{20\cdot 3^{12}-\frac{35\cdot 7153}{6-\frac{37\cdot 7153}{28\cdot 3^{12}-\frac{47\cdot 7153}{6-\ddots }}}}}}}}$

$\sqrt[12]{2^7}=\frac{3}{2}-\frac{3\cdot 7153}{12(2^{19}+3^{12})+7153-\frac{11\cdot 13\cdot 7153^2}{36(2^{19}+3^{12})-\frac{23\cdot 25\cdot 7153^2}{60(2^{19}+3^{12})-\frac{35\cdot 37\cdot 7153^2}{84(2^{19}+3^{12})-\ddots }}}}.$

More details on this technique can be found in General Method for Extracting Roots using (Folded) Continued Fractions.

Higher dimensions

Another meaning for generalized continued fraction is a generalization to higher dimensions. For example, there is a close relationship between the simple continued fraction in canonical form for the irrational real number α, and the way integer lattice points in two dimensions lie to either side of the line y = αx. Generalizing this idea, one might ask about something related to lattice points in three or more dimensions. One reason to study this area is to quantify the mathematical coincidence idea; for example, for monomials in several real numbers, take the logarithmic form and consider how small it can be. Another reason is to find a possible solution to Hermite's problem.

There have been numerous attempts to construct a generalized theory. Notable efforts in this direction were made by Felix Klein (the Klein polyhedron), Georges Poitou and George Szekeres.

See also

• Convergence problem
• Gauss's continued fraction
• Infinite compositions of analytic functions
• Lentz's algorithm
• Padé table
• Solving quadratic equations with continued fractions

References

• (Covers both analytic theory and history.)

• (Covers primarily analytic theory and some arithmetic theory.)

• 
  

External links

• The first twenty pages of Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, Template:ISBN, contains generalized continued fractions for Template:Radic and the golden mean.
• Template:OEIS el