In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on.^{[1]} In a finite continued fraction (or terminated continued fraction), the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression. In either case, all integers in the sequence, other than the first, must be positive. The integers are called the coefficients or terms of the continued fraction.^{[2]}
Continued fractions have a number of remarkable properties related to the Euclidean algorithm for integers or real numbers. Every rational number has two closely related expressions as a finite continued fraction, whose coefficients a_{i} can be determined by applying the Euclidean algorithm to . The numerical value of an infinite continued fraction is irrational; it is defined from its infinite sequence of integers as the limit of a sequence of values for finite continued fractions. Each finite continued fraction of the sequence is obtained by using a finite prefix of the infinite continued fraction's defining sequence of integers. Moreover, every irrational number is the value of a unique infinite continued fraction, whose coefficients can be found using the nonterminating version of the Euclidean algorithm applied to the incommensurable values and 1. This way of expressing real numbers (rational and irrational) is called their continued fraction representation.
It is generally assumed that the numerator of all of the fractions is 1. If arbitrary values and/or functions are used in place of one or more of the numerators or the integers in the denominators, the resulting expression is a generalized continued fraction. When it is necessary to distinguish the first form from generalized continued fractions, the former may be called a simple or regular continued fraction, or said to be in canonical form.
The term continued fraction may also refer to representations of rational functions, arising in their analytic theory. For this use of the term, see Padé approximation and Chebyshev rational functions.
Consider, for example, the rational number , which is around 4.4624. As a first approximation, start with 4, which is the integer part; . The fractional part is the reciprocal of which is about 2.1628. Use the integer part, 2, as an approximation for the reciprocal to obtain a second approximation of . The remaining fractional part, , is the reciprocal of , and is around 6.1429. Use 6 as an approximation for this to obtain as an approximation for and , about 4.4615, as the third approximation; . Finally, the fractional part, , is the reciprocal of 7, so its approximation in this scheme, 7, is exact and produces the exact expression for .
The expression is called the continued fraction representation of . This can be represented by the abbreviated notation = [4; 2, 6, 7]. (It is customary to replace only the first comma by a semicolon.) Some older textbooks use all commas in the (n + 1)tuple, for example, [4, 2, 6, 7].^{[3]}^{[4]}
If the starting number is rational, then this process exactly parallels the Euclidean algorithm. In particular, it must terminate and produce a finite continued fraction representation of the number. If the starting number is irrational, then the process continues indefinitely. This produces a sequence of approximations, all of which are rational numbers, and these converge to the starting number as a limit. This is the (infinite) continued fraction representation of the number. Examples of continued fraction representations of irrational numbers are:
Continued fractions are, in some ways, more "mathematically natural" representations of a real number than other representations such as decimal representations, and they have several desirable properties:
A continued fraction is an expression of the form
where a_{i} and b_{i} can be any complex numbers. Usually they are required to be integers. If b_{i} = 1 for all i the expression is called a simple continued fraction. If the expression contains a finite number of terms, it is called a finite continued fraction. If the expression contains an infinite number of terms, it is called an infinite continued fraction.^{[6]}
Thus, all of the following illustrate valid finite simple continued fractions:
Formula  Numeric  Remarks 

All integers are a degenerate case  
Simplest possible fractional form  
First integer may be negative  
First integer may be zero 
Consider a real number r. Let be the integer part of r and let be the fractional part of r. Then the continued fraction representation of r is , where is the continued fraction representation of .
To calculate a continued fraction representation of a number r, write down the integer part (technically the floor) of r. Subtract this integer part from r. If the difference is 0, stop; otherwise find the reciprocal of the difference and repeat. The procedure will halt if and only if r is rational. This process can be efficiently implemented using the Euclidean algorithm when the number is rational. The table below shows an implementation of this procedure for the number 3.245, resulting in the continued fraction expansion [3; 4,12,4].
Step  Real Number 
Integer part 
Fractional part 
Simplified  Reciprocal of f  

1  
2  
3  
4  STOP  
Continued fraction form for
= 3 + 
The integers , etc., are called the coefficients or terms of the continued fraction.^{[2]} One can abbreviate the continued fraction
in the notation of Carl Friedrich Gauss
or as
or in the notation of Pringsheim as
or in another related notation as
Sometimes angle brackets are used, like this:
The semicolon in the square and angle bracket notations is sometimes replaced by a comma.^{[3]}^{[4]}
One may also define infinite simple continued fractions as limits:
This limit exists for any choice of and positive integers ^{[7]}^{[8]}
Every finite continued fraction represents a rational number, and every rational number can be represented in precisely two different ways as a finite continued fraction, with the conditions that the first coefficient is an integer and the other coefficients are positive integers. These two representations agree except in their final terms. In the longer representation the final term in the continued fraction is 1; the shorter representation drops the final 1, but increases the new final term by 1. The final element in the short representation is therefore always greater than 1, if present. In symbols:
The continued fraction representations of a positive rational number and its reciprocal are identical except for a shift one place left or right depending on whether the number is less than or greater than one respectively. In other words, the numbers represented by and are reciprocals.
For instance if is an integer and then
If then
The last number that generates the remainder of the continued fraction is the same for both and its reciprocal.
For example,
Every infinite continued fraction is irrational, and every irrational number can be represented in precisely one way as an infinite continued fraction.
An infinite continued fraction representation for an irrational number is useful because its initial segments provide rational approximations to the number. These rational numbers are called the convergents of the continued fraction.^{[9]}^{[10]} The larger a term is in the continued fraction, the closer the corresponding convergent is to the irrational number being approximated. Numbers like ? have occasional large terms in their continued fraction, which makes them easy to approximate with rational numbers. Other numbers like e have only small terms early in their continued fraction, which makes them more difficult to approximate rationally. The golden ratio ? has terms equal to 1 everywherethe smallest values possiblewhich makes ? the most difficult number to approximate rationally. In this sense, therefore, it is the "most irrational" of all irrational numbers. Evennumbered convergents are smaller than the original number, while oddnumbered ones are larger.
For a continued fraction [a_{0}; a_{1}, a_{2}, ...], the first four convergents (numbered 0 through 3) are
The numerator of the third convergent is formed by multiplying the numerator of the second convergent by the third coefficient, and adding the numerator of the first convergent. The denominators are formed similarly. Therefore, each convergent can be expressed explicitly in terms of the continued fraction as the ratio of certain multivariate polynomials called continuants.
If successive convergents are found, with numerators h_{1}, h_{2}, ... and denominators k_{1}, k_{2}, ... then the relevant recursive relation is:
The successive convergents are given by the formula
Thus to incorporate a new term into a rational approximation, only the two previous convergents are necessary. The initial "convergents" (required for the first two terms) are ^{0}/_{1} and ^{1}/_{0}. For example, here are the convergents for [0;1,5,2,2].
n  2  1  0  1  2  3  4 

a_{n}  0  1  5  2  2  
h_{n}  0  1  0  1  5  11  27 
k_{n}  1  0  1  1  6  13  32 
When using the Babylonian method to generate successive approximations to the square root of an integer, if one starts with the lowest integer as first approximant, the rationals generated all appear in the list of convergents for the continued fraction. Specifically, the approximants will appear on the convergents list in positions 0, 1, 3, 7, 15, ... , 2^{k}1, ... For example, the continued fraction expansion for is [1;1,2,1,2,1,2,1,2,...]. Comparing the convergents with the approximants derived from the Babylonian method:
n  2  1  0  1  2  3  4  5  6  7 

a_{n}  1  1  2  1  2  1  2  1  
h_{n}  0  1  1  2  5  7  19  26  71  97 
k_{n}  1  0  1  1  3  4  11  15  41  56 
A Baire space is a topological space on infinite sequences of natural numbers. The infinite continued fraction provides a homeomorphism from the Baire space to the space of irrational real numbers (with the subspace topology inherited from the usual topology on the reals). The infinite continued fraction also provides a map between the quadratic irrationals and the dyadic rationals, and from other irrationals to the set of infinite strings of binary numbers (i.e. the Cantor set); this map is called the Minkowski question mark function. The mapping has interesting selfsimilar fractal properties; these are given by the modular group, which is the subgroup of Möbius transformations having integer values in the transform. Roughly speaking, continued fraction convergents can be taken to be Möbius transformations acting on the (hyperbolic) upper halfplane; this is what leads to the fractal selfsymmetry.
If , , , is an infinite sequence of positive integers, define the sequences and recursively:
Theorem 1. For any positive real number
Theorem 2. The convergents of [; , , ] are given by
Theorem 3. If the th convergent to a continued fraction is /, then
Corollary 1: Each convergent is in its lowest terms (for if and had a nontrivial common divisor it would divide , which is impossible).
Corollary 2: The difference between successive convergents is a fraction whose numerator is unity:
Corollary 3: The continued fraction is equivalent to a series of alternating terms:
Corollary 4: The matrix
has determinant plus or minus one, and thus belongs to the group of unimodular matrices .
Theorem 4. Each (th) convergent is nearer to a subsequent (th) convergent than any preceding (th) convergent is. In symbols, if the th convergent is taken to be , then
for all .
Corollary 1: The even convergents (before the th) continually increase, but are always less than .
Corollary 2: The odd convergents (before the th) continually decrease, but are always greater than .
Theorem 5.
Corollary 1: A convergent is nearer to the limit of the continued fraction than any fraction whose denominator is less than that of the convergent.
Corollary 2: A convergent obtained by terminating the continued fraction just before a large term is a close approximation to the limit of the continued fraction.
If
are consecutive convergents, then any fractions of the form
where is an integer such that , are called semiconvergents, secondary convergents, or intermediate fractions. The st semiconvergent equals the mediant of the th one and the convergent . Sometimes the term is taken to mean that being a semiconvergent excludes the possibility of being a convergent (i.e., ), rather than that a convergent is a kind of semiconvergent.
It follows that semiconvergents represent a monotonic sequence of fractions between the convergents (corresponding to ) and (corresponding to ). The consecutive semiconvergents and satisfy the property .
If a rational approximation to a real number is such that the value is smaller than that of any approximation with a smaller denominator, then is a semiconvergent of the continued fraction expansion of . The converse is not true, however.
One can choose to define a best rational approximation to a real number x as a rational number , d > 0, that is closer to x than any approximation with a smaller or equal denominator. The simple continued fraction for x can be used to generate all of the best rational approximations for x by applying these three rules:
For example, 0.84375 has continued fraction [0;1,5,2,2]. Here are all of its best rational approximations.
Continued fraction  [0;1]  [0;1,3]  [0;1,4]  [0;1,5]  [0;1,5,2]  [0;1,5,2,1]  [0;1,5,2,2] 

Rational approximation  1  
Decimal equivalent  1  0.75  0.8  ~0.83333  ~0.84615  ~0.84211  0.84375 
Error  +18.519%  11.111%  5.1852%  1.2346%  +0.28490%  0.19493%  0% 
The strictly monotonic increase in the denominators as additional terms are included permits an algorithm to impose a limit, either on size of denominator or closeness of approximation.
The "half rule" mentioned above requires that when a_{k} is even, the halved term a_{k}/2 is admissible if and only if x  [a_{0} ; a_{1}, ..., a_{k  1}] > x  [a_{0} ; a_{1}, ..., a_{k  1}, a_{k}/2]^{[11]} This is equivalent^{[11]} to:^{[12]}
The convergents to x are "best approximations" in a much stronger sense than the one defined above. Namely, n/d is a convergent for x if and only if dx  n has the smallest value among the analogous expressions for all rational approximations m/c with c d; that is, we have dx  n < cx  m so long as c < d. (Note also that d_{k}x  n_{k} > 0 as k > ?.)
A rational that falls within the interval (x, y), for 0 < x < y, can be found with the continued fractions for x and y. When both x and y are irrational and
where x and y have identical continued fraction expansions up through a_{k1}, a rational that falls within the interval (x, y) is given by the finite continued fraction,
This rational will be best in the sense that no other rational in (x, y) will have a smaller numerator or a smaller denominator.^{[]}
If x is rational, it will have two continued fraction representations that are finite, x_{1} and x_{2}, and similarly a rational y will have two representations, y_{1} and y_{2}. The coefficients beyond the last in any of these representations should be interpreted as +?; and the best rational will be one of z(x_{1}, y_{1}), z(x_{1}, y_{2}), z(x_{2}, y_{1}), or z(x_{2}, y_{2}).
For example, the decimal representation 3.1416 could be rounded from any number in the interval [3.14155, 3.14165). The continued fraction representations of 3.14155 and 3.14165 are
and the best rational between these two is
Thus, is the best rational number corresponding to the rounded decimal number 3.1416, in the sense that no other rational number that would be rounded to 3.1416 will have a smaller numerator or a smaller denominator.
A rational number, which can be expressed as finite continued fraction in two ways,
will be one of the convergents for the continued fraction expansion of a number, if and only if the number is strictly between
The numbers x and y are formed by incrementing the last coefficient in the two representations for z. It is the case that x < y when k is even, and x > y when k is odd.
For example, the number has the continued fraction representations
and thus is a convergent of any number strictly between
[3; 7, 15, 2]  =  ? 3.1415525 
[3; 7, 17]  =  ? 3.1416667 
Consider x = [a_{0}; a_{1}, ...] and y = [b_{0}; b_{1}, ...]. If k is the smallest index for which a_{k} is unequal to b_{k} then x < y if (1)^{k}(a_{k}  b_{k}) < 0 and y < x otherwise.
If there is no such k, but one expansion is shorter than the other, say x = [a_{0}; a_{1}, ..., a_{n}] and y = [b_{0}; b_{1}, ..., b_{n}, b_{n + 1}, ...] with a_{i} = b_{i} for 0 i n, then x < y if n is even and y < x if n is odd.
To calculate the convergents of ? we may set a_{0} = ??? = 3, define u_{1} = ? 7.0625 and a_{1} = ?u_{1}? = 7, u_{2} = ? 15.9966 and a_{2} = ?u_{2}? = 15, u_{3} = ? 1.0034. Continuing like this, one can determine the infinite continued fraction of ? as
The fourth convergent of ? is [3;7,15,1] = = 3.14159292035..., sometimes called Milü, which is fairly close to the true value of ?.
Let us suppose that the quotients found are, as above, [3;7,15,1]. The following is a rule by which we can write down at once the convergent fractions which result from these quotients without developing the continued fraction.
The first quotient, supposed divided by unity, will give the first fraction, which will be too small, namely, . Then, multiplying the numerator and denominator of this fraction by the second quotient and adding unity to the numerator, we shall have the second fraction, , which will be too large. Multiplying in like manner the numerator and denominator of this fraction by the third quotient, and adding to the numerator the numerator of the preceding fraction, and to the denominator the denominator of the preceding fraction, we shall have the third fraction, which will be too small. Thus, the third quotient being 15, we have for our numerator , and for our denominator, . The third convergent, therefore, is . We proceed in the same manner for the fourth convergent. The fourth quotient being 1, we say 333 times 1 is 333, and this plus 22, the numerator of the fraction preceding, is 355; similarly, 106 times 1 is 106, and this plus 7 is 113. In this manner, by employing the four quotients [3;7,15,1], we obtain the four fractions:
To sum up, the pattern is
These convergents are alternately smaller and larger than the true value of ?, and approach nearer and nearer to ?. The difference between a given convergent and ? is less than the reciprocal of the product of the denominators of that convergent and the next convergent. For example, the fraction is greater than ?, but  ? is less than = (in fact,  ? is just more than = ).
The demonstration of the foregoing properties is deduced from the fact that if we seek the difference between one of the convergent fractions and the next adjacent to it we shall obtain a fraction of which the numerator is always unity and the denominator the product of the two denominators. Thus the difference between and is , in excess; between and , , in deficit; between and , , in excess; and so on. The result being, that by employing this series of differences we can express in another and very simple manner the fractions with which we are here concerned, by means of a second series of fractions of which the numerators are all unity and the denominators successively be the product of every two adjacent denominators. Instead of the fractions written above, we have thus the series:
The first term, as we see, is the first fraction; the first and second together give the second fraction, ; the first, the second and the third give the third fraction , and so on with the rest; the result being that the series entire is equivalent to the original value.
A generalized continued fraction is an expression of the form
where the a_{n} (n > 0) are the partial numerators, the b_{n} are the partial denominators, and the leading term b_{0} is called the integer part of the continued fraction.
To illustrate the use of generalized continued fractions, consider the following example. The sequence of partial denominators of the simple continued fraction of ? does not show any obvious pattern:
or
However, several generalized continued fractions for ? have a perfectly regular structure, such as:
The first two of these are special cases of the arctangent function with ? = 4 arctan (1).
The continued fraction of above consisting of cubes uses the Nilakantha series and an exploit from Leonhard Euler.^{[13]}
The numbers with periodic continued fraction expansion are precisely the irrational solutions of quadratic equations with rational coefficients; rational solutions have finite continued fraction expansions as previously stated. The simplest examples are the golden ratio ? = [1;1,1,1,1,1,...] and = [1;2,2,2,2,...], while = [3;1,2,1,6,1,2,1,6...] and = [6;2,12,2,12,2,12...]. All irrational square roots of integers have a special form for the period; a symmetrical string, like the empty string (for ) or 1,2,1 (for ), followed by the double of the leading integer.
Because the continued fraction expansion for ? doesn't use any integers greater than 1, ? is one of the most "difficult" real numbers to approximate with rational numbers. Hurwitz's theorem^{[14]} states that any irrational number k can be approximated by infinitely many rational with
While virtually all real numbers k will eventually have infinitely many convergents whose distance from k is significantly smaller than this limit, the convergents for ? (i.e., the numbers , , , , etc.) consistently "toe the boundary", keeping a distance of almost exactly away from ?, thus never producing an approximation nearly as impressive as, for example, for ?. It can also be shown that every real number of the form , where a, b, c, and d are integers such that a d  b c = ±1, shares this property with the golden ratio ?; and that all other real numbers can be more closely approximated.
While there is no discernable pattern in the simple continued fraction expansion of ?, there is one for e, the base of the natural logarithm:
which is a special case of this general expression for positive integer n:
Another, more complex pattern appears in this continued fraction expansion for positive odd n:
with a special case for n = 1:
Other continued fractions of this sort are
where n is a positive integer; also, for integer n:
with a special case for n = 1:
If I_{n}(x) is the modified, or hyperbolic, Bessel function of the first kind, we may define a function on the rationals by
which is defined for all rational numbers, with p and q in lowest terms. Then for all nonnegative rationals, we have
with similar formulas for negative rationals; in particular we have
Many of the formulas can be proved using Gauss's continued fraction.
Most irrational numbers do not have any periodic or regular behavior in their continued fraction expansion. Nevertheless, Khinchin proved that for almost all real numbers x, the a_{i} (for i = 1, 2, 3, ...) have an astonishing property: their geometric mean tends to a constant (known as Khinchin's constant, K ? 2.6854520010...) independent of the value of x. Paul Lévy showed that the nth root of the denominator of the nth convergent of the continued fraction expansion of almost all real numbers approaches an asymptotic limit, approximately 3.27582, which is known as Lévy's constant. Lochs' theorem states that nth convergent of the continued fraction expansion of almost all real numbers determines the number to an average accuracy of just over n decimal places.
Generalized continued fractions are used in a method for computing square roots.
The identity

leads via recursion to the generalized continued fraction for any square root:^{[15]}

Continued fractions play an essential role in the solution of Pell's equation. For example, for positive integers p and q, and nonsquare n, it is true that if p^{2}  nq^{2} = ±1, then is a convergent of the regular continued fraction for . The converse holds if the period of the regular continued fraction for is 1, and in general the period describes which convergents give solutions to Pell's equation.^{[16]}
Continued fractions also play a role in the study of dynamical systems, where they tie together the Farey fractions which are seen in the Mandelbrot set with Minkowski's question mark function and the modular group Gamma.
The backwards shift operator for continued fractions is the map h(x) = 1/x  ?1/x? called the Gauss map, which lops off digits of a continued fraction expansion: h([0; a_{1}, a_{2}, a_{3}, ...]) = [0; a_{2}, a_{3}, ...]. The transfer operator of this map is called the GaussKuzminWirsing operator. The distribution of the digits in continued fractions is given by the zero'th eigenvector of this operator, and is called the GaussKuzmin distribution.
The Lanczos algorithm uses a continued fraction expansion to iteratively approximate the eigenvalues and eigenvectors of a large sparse matrix.^{[17]}
Continued fractions have also been used in modelling optimization problems for wireless network virtualization to find a route between a source and a destination.^{[18]}
Number  r  0  1  2  3  4  5  6  7  8  9  10 

123  a_{r}  123  
ra  123  
12.3  a_{r}  12  3  3  
ra  12  
1.23  a_{r}  1  4  2  1  7  
ra  1  
0.123  a_{r}  0  8  7  1  2  5  
ra  0  
ϕ = 
a_{r}  1  1  1  1  1  1  1  1  1  1  1 
ra  1  2  
−ϕ = − 
a_{r}  −2  2  1  1  1  1  1  1  1  1  1 
ra  −2  −  −  −  −  −  −  −  −  −  −  
a_{r}  1  2  2  2  2  2  2  2  2  2  2  
ra  1  
 a_{r}  0  1  2  2  2  2  2  2  2  2  2 
ra  0  1  
a_{r}  1  1  2  1  2  1  2  1  2  1  2  
ra  1  2  
 a_{r}  0  1  1  2  1  2  1  2  1  2  1 
ra  0  1  
 a_{r}  0  1  6  2  6  2  6  2  6  2  6 
ra  0  1  
a_{r}  1  3  1  5  1  1  4  1  1  8  1  
ra  1  
e  a_{r}  2  1  2  1  1  4  1  1  6  1  1 
ra  2  3  
π  a_{r}  3  7  15  1  292  1  1  1  2  1  3 
ra  3  
Number  r  0  1  2  3  4  5  6  7  8  9  10 
ra: rational approximant obtained by expanding continued fraction up to a_{r}