Chapter IV
4.1 General properties of continued fractions
A real number a > 1 can be approximated by an integral number s up to an error
s £ a < s + 1;
then
a = s + b,
where either
b = 0
or
1 : b = a ' > 1.
In the second case, a ' can be approximated again by an integral number, and so on. This method leads to the representation of real numbers by continued fractions* with many interesting properties, which will be considered in 4.2 and 4.3. However, the underlying principle is more general; for the integral numbers as well as for the real numbers > 1, one may substitute other systems of mathematical objects. The interconnection between the system A of the real numbers > 1 and the domain of the integral numbers which has been used in the consideration above and which will be used in the general part of the theory is only the following:
1. The system A and the
domain of the integral numbers are sub-sets of the same field
(the field of real numbers.
2. In this field, the domain generates a
partition into classes of residues, and the elements of A
are distributed among these classes in such a way that, if any
element a of A belongs to a particular class, then the
same class contains an element b = a - s
which is the inverse element of an element a ' of A,
unless the class of residues is the class (0), i.e., the
class formed by the domain itself.
* or simple continued fractions. Since this book does not use any other class of continued fractions, the term is here applied in this special sense.
Thus. the investigation of continued fractions will start here from a field K containing an integral domain.S and a sub-system A which are interconnected in the manner which has just been explained
4.1.1 Convergents of a continued fraction: Let K be a field, S an integral domain in K and A a subset of K with the property: If a class of residues ¹ (0) of S contains an element of A, this class contains also the inverse of an element of A. Hence, if
a ', a '', ··· , a1, a2, ··· (1)
denote elements of A and
s ', s '', ··· , s1, s2, ··· (2)
denote elements of S, then every element of A can either be expressed as
a = s + 1:a ' (3)
or as
a = s. (3')
Let

then

The representation of a1 by (5) is said to be a continued fraction. The sequence of the formulae (4) can be continued indefinitely unless there is an element ai which is an element of S. If there is m such that am = sm, then it is a finite continued fraction, otherwise it is an infinite continued fraction. If a can be represented by a finite continued fraction, it belongs to the quotient field Q of S and every finite set of elements
![]()
of S defines an element of Q by means of (5).
Determine now sequences of elements of S by the formulae:

Let
then, by (7) and (8), Dk = - Dk-1, and since D0 = 1,
![]()
By (8) and (9), Pk and Qk have no common factors in S other than unities and
![]()
Equations (4) can be given the following homogeneous form:
Let a1 be an arbitrary non-zero element of K, then a sequence of elements a1, a2, ··· , an+2 is determined uniquely by
![]()
and multiplication of (4) by a2, a3, ··· , respectively, yields
![]()
Equations (4') and (7) yield now

Repeated applications of the formula relating to P and Q show that for i < k

Hence
![]()
After multiplication of the first equation (12) by Qk-1, the second equation by -Pk-1 and subsequent addition, (9) yields
![]()
From Equations (11), (12), (13) and (9) now follows
![]()
Hence, if a continued fraction is finite, say an = sn and therefore an+2 = 0, then
![]()
The elements s1, s2, ··· , sn of (4) are said to be the elements of the continued fraction: The quotients Pk : Qk are the convergents and an+1 is a complete fraction. As a1 is uniquely defined by these elements, if an+1 exists, one denotes it by
![]()
and if sn is the last element of the continued fraction, by
![]()
It follows from (4), (5') and (6') that for k £ n

as may be applicable. Conversely, let a1 = (s1,
... , sk-1|ak)
and ak be given by (5'), then the
expansion of a1 into a continued fraction yields (5') or
(6'), corresponding to the two cases of (5"). Set k = t;
since at, at+1, ... are complete fractions obtained by
expansion of at into a continued fraction, it follows from
(1) that ![]()
The terms P'i and Q'i corresponding to at, are determined by

Hence, application of (12), (13), (14) and (9) to the expansion of at into a continued fraction yields the system:

4.1.2 Finite continued fractions. Without loss of generality, it may be assumed that all the elements of the quotient field Q(S) of the domain S belong to the set A. As the terms Pn and Qn of any element ai of A belong to S, their quotients belong to Q(S). In particular, the expansions of Pn:Pn-1 and Qn:Qn-1 in the homogeneous form (4') of 4.1.1 can be derived directly from the expansion of a1:

Hence

If S is the domain of the integral numbers, it is easy to show (as will be proved below) that an element can be expanded into a finite continued fraction if and only if it belongs to the field Q(S) which - in this particular case - is the field of the rational numbers. It is interesting to study the same question under more general conditions; a close connection between continued fractions and the factorization of S will then become apparent.
Let a1 be represented by a finite continued fraction a1 = (s1 ··· , sn). Then an:an+1=an= sn, whence (12) and (14) of 4.1.1 yield

whence a1 = Pn : Qn belongs to the quotient field of S.
Every common factor of a1 and a2 is a factor of an+1, and an+1 is a common factor of a1 and a2. Hence a1 and a2 have an h.c.f. and it can be represented linearly by a1 and a2. Especially, a1 = Pn : Qn is a representation by two relatively prime elements of S, since
![]()
Now let every element of Q(S) be representable by a finite continued fraction and s', s" -~ 0 be two arbitrary elements of S, then s' : s" = a can be represented by two relatively prime-elements of S, so that 1 can be represented in a linear and homogeneous manner by those elements. Hence
![]()
and therefore
![]()
Thus, s' = ps, s'q' + s"p' = s, and the arbitrary elements s',s" of S have an h.c.f. (s', s") = s which is represented in a linear and homogeneous manner by s' and s". Thus, S is a Euclidean domain (cf. 2.4.4).
Hence, if S is an integral domain other than a Euclidean one, not every element of Q(S) can be represented as a finite continued fraction, although all these fractions belong to Q(S). The system of all the finite continued fractions is a sub-set of Q(S) which contains S, whence it is not a field, unless S is a Euclidean domain.
Let there be defined a function N(s), which takes only positive integral values for every element s ¹ 0 of S, and exist for every pair of elements s, s' of S two other elements s1 and s", so that
s = s1 s' + s"
implies either
![]()
Then
![]()
and as
![]()
are all integral numbers, the sequence s', s", ··· must be finite, whence s:s' is a finite continued fraction and there follows the
Theorem: Let S be an integral domain and there be defined a positive integer N(s) satisfying Conditions (3) for every element s of S, then Q(S) will be formed by the finite continued fractions of S and the highest common factor of two elements a1 and a2 of S is given by an+1 in (2), where Pn-1, Qn-1 have the same significance as in 4.1.1.
If S is the domain of the integral numbers, N(s) =|s| satisfies (3), whence every rational number can be expanded into a finite continued fraction with integral elements and, conversely, every finite continued fraction with integral elements represents a rational number. In general, the elements of S are not supposed to be factorizable; in particular, the condition N(ab) ³ N(a), stated in 2.4.2 may not hold. If it holds in addition to (3), then S is a Euclidean domain and therefore the factorization in S is unique (cf. 2.4.4).
4.1.3 Proper and improper equivalence: Equations (12), (13) and (14) of 4.1.1 show that the complete fractions a1, a2, ··· of a continued fraction are interconnected by linear equations. These can either be expressed in the homogeneous form

or in the non-homogeneous form as linear fractional equations

The coefficients of this substitution are elements of S and the determinant is equal to ± 1. These substitutions will now be studied more closely. Let A and B be the matrices of such substitutions, say

and let a be transformed into a' by A and a' into a" by B, then (cf. 1.1.1):
transformed by |
into |
and | ||||||||
| 1. | a |
E |
a |
" | det E = 1 |
|||||
| 2. | a ' |
A' |
a |
" | det A' = e |
|||||
| 3. | a |
BA |
a" |
" | det BA = ee ' = ± 1 |
An element of K is said to be equivalent to a if it is obtained by transformation by a linear fractional substitution with determinant ± 1. It follows from 1. and 3. above that this equivalence satisfies the conditions of reflexivity, symmetry and transitivity (cf. 2.1.2), whence this equivalence defines a partition of K into classes, so that two elements of K arc equivalent if and only if they belong to the same class.
transforms the element 1 into s,
whence all elements of S are equivalent. By 4.1.1 (8)
and (13), all complete fractions a1, a2,
··· of a continued fraction are equivalent, In particular,
every finite continued fraction (s1, ··· ,
sn) is equivalent to an
= sn, whence it belongs to the class
containing the elements of S.
An equivalence is said to be proper or improper according to whether detA=± 1 or detA = -1. As det A = det A', the notion of proper equivalence as well as that of improper equivalence is symmetric. Combination of two equivalences of the same kind yields a proper equivalence, of two different kinds an improper equivalence. Every element is properly equivalent to itself, because the matrix E has the determinant 1. If in a class of equivalent elements an element is also improperly equivalent to itself, i.e., if it is transformed into a by E' and det E' = - 1, then an arbitrary element b of the same class is transformed into a by B and by E'B. One of these matrices has the determinant 1, the other the determinant - 1, whence each element of the class is properly and improperly equivalent to a, so that every element is at the same time properly and improperly equivalent to every other element of the class. On the other hand, if a is transformed into b by A as well as by B, where det A = 1, det B = -1, then a is transformed into a by A'B, where det A'B = -1, whence a is improperly equivalent to itself, so that in this case every other element of the class (a) is properly and improperly equivalent to every other element of (a). If there are in (a) pairs of elements which are properly as well as improperly equivalent, then (a) must be divided into two classes without common elements; the elements of the first class are properly, those of the second class improperly equivalent to a. Elements of the same sub-class are properly equivalent, elements of different sub-classes are improperly equivalent, whence follows the
Theorem: In a class of equivalent elements, either every element is properly and improperly equivalent to every other element or there are two sub-classes without a common element such that elements of the same sub-class are properly and of different sub-classes improperly equivalent.
Since 1 is transformed into itself by
, every
pair of elements is properly and improperly equivalent in the
class containing the finite continued fractions.
Let a be transformed into itself by A. Then
![]()
whence
![]()
There are three different cases:
1. a3 = (a4 - a1) = a2 = 0, when A = E or -E.
These transformations transform every element ino itself. E and - E generate proper equivalences.
2. The polynomial (2) is reducible in a. This is only possible if a is an element of the quotient field Q of S.
3. The polynomial (3) is irreducible. In this case a is algebraic to Q and of order 2 over Q.
These considerations show that there are elements which are not improperly equivalent to themselves.
Let not all the complete fractions a1, a2, ··· of the continued fraction differ, say at = at+i , then
![]()
Hence at can be represented by an infinite, periodic continued fraction with the period st+1, ··· , st+i. It follows from 4.1.1 (17) that at is transformed into itself by the matrix

where det D = (-1)i, whence at is made equivalent to itself by that transformation. It follows from 4.1.1 (13) that
,
whence it belongs to the field Q(at). Hence [Q(at) : Q] £ 2, whence a satisfies a second degree equation with coefficients from Q, and as Q is the quotient field of S, one can arrange by multiplication by a common factor that the coefficients belong to S. The same applies to a2, a3, ···.
Now, let there be given a periodic sequence a1, ··· , am, a1, ··· , am, ··· of elements of S. Then one does not know whether there exists in any extension of the quotient field Q of S an element representable by the infinite periodic continued fraction
![]()
and if such an element exists, it may not be uniquely determined in the field. But if there is a field in which there exists one and only one element a, represented by the periodic continued fraction (3), then
![]()
and therefore a is a root of a
quadratic polynomial an S[x]. The same applies
to
as
this number can be transformed into a by a
linear transformation in Q.
4.2 Representation of positive numbers by continued fractions
4.2.1 Correspondence between positive numbers and rational positive expansions: Let the elements of the set A be the real numbers ³ 1 and S be the ring of the integers; then the representation
![]()
is always possible. If a is not an integral number, then
![]()
and this representation is unique. But if a is an integral positive number
![]()
there exist two possibilities:

Hence in the representation 4.1.1 (4) of any positive a as a continued fraction,
| s1 is a non-negative number and | |
| (4) | |
| s2, s3, ··· are positive integral numbers |
As has been shown in 4.1.2, rational numbers can be represented by finite continued fractions.
Let a1 be a rational number ³ 1. If a1 is an integral number, then there exist its two representations corresponding to the two cases (1)

If a1 is not integral, a2 is uniquely determined by a1; if a2 is not integral, a3 is uniquely determined by a2, etc. Changes in the sequence a1, a2, ··· are not possible as long as those elements are not integral; a1 admits a representation by a finite continued fraction, the last complete fraction in it is necessarily integral. Let ar+1 (if r > 0) be the first integral complete fraction which occurs; then ar = sr + 1: ar+1 is not integral: 1 < ar+1 = s' + 1, where s'>0. Thus, there are two possibilities for the continuation of the continued fraction:
![]()
and there exist two and only two representations of a1:
![]()
If a1 > 1 is irrational, then s1 > 0, and a2, a3, ··· are uniquely determined, none of them being rational, whence there exists one and only one representation satisfying (2) and this continued fraction is infinite. If 0 < b < 1, then 1/b =a >1 and b = (0|a). The essence of these considerations is given by
Theorem 1: Every positive number can be represented as a continued fraction satisfying Condition (2). If the number is irrational, the representation is unique and the continued fraction is infinite. If the number is rational, there exist two representations, one by an even finite, another by an odd finite continued fraction.
It will be proved now that the converse theorem also applies, i.e., that every sequence, satisfying (2), determines one and only one real number.
Let s1, s2, ··· be an infinite sequence satisfying Conditions (2) and

From P2 > 0, Q1 > 0 follows by mathematical induction that
![]()
and

These inequalities hold independently of whether there exists a number a=(s1,s2, ··· ,) or not. In particular, let there exist a1, then Pk : Qk are its convergents (for k = 1,2, ···); applying the homogeneous notations ai=ai:ai+1, as in 4.1.1, one may select a1 > 0 ; then every ai is larger than zero. Therefore (cf. 4.1.1 (15))

Hence,

Now, the finite continued fractions s1, s2, ··· , sn = Pn : Qn exist anyhow (even if s1, s2, ···does not exist) and (s1,···, sk ) is its k-th convergent, provided k < n. Applying (5) to a1 = Pn/Qn, one obtains for n > 2m

hence, for m = 1, 2, 3, ···,
![]()
whence the quotients Pn/Qn form two sequences, one increasing, the other decreasing, and every number of the first sequence is less than every number of the second sequence. The intervals

form therefore a nest of intervals

(cf. 4.1.1 (10), the length of which converges to 0. Hence there is, for every given sequence (2), one and only one real number a such that

If there exists a number a1=(s1,s2,···), then a1 must satisfy the inequalities (5); thus comparing (5) and (7), it follows from the uniqueness of the solution of (7) that a = a1, provided that there exists a number which can be expanded into the infinite continued fraction (s1, s2, ···). For proving the existence of this number, one has the
Lemma: If t is a positive integral number, (s1,···,sn,sn+1)=A, (s1,···,sn+t)=B, then

and equality occurs in (8) if and only if t = sn+1 = 1.
Proof: Employ the usual notation and let
![]()
then
![]()
It follows from 4.1.1 (10) that
![]()
whence

Hence follows the lemma above.
In a similar manner, one computes the difference (s1,···, sn - t) - (s1,···, sn). Denote the last convergent of the first term by P" : Q" and the other convergents as usually, then (Qn - Q") : Qn-1 = t, whence
![]()
Hence
![]()
when n is even and t > 0, whereas for an odd n and t > 0 hold the opposite inequalities. Again, let Pn : Qn be the convergents of an infinite continued fraction (s1,···, sn) satisfying (2) and a1 the real number which is uniquely determined by (7). This number admits an expansion into a continued fraction which will be shown to equal (s1, s2, ···). If this is not so, let a1 be expanded into a different continued fraction - an infinite one. Then the expansion can be expressed by (s1, ···, sn-1, s , ···), where n > 0, s ¹ sn. Let s - sn =t > 0. If n is even, it follows from (5), (7) and (8) that
![]()
whereas the converse inequalities apply when n is odd. Hence s > sn is impossible. If s < sn, you set sn - s = t and by interchanging the two expansions show in the same way as above that the assumption leads to a contradiction. Suppose now that the expansion of a1 is finite; then it follows from (7) that this finite continued fraction cannot be a convergent of (s1,s2,···). Hence it can be expressed by (s1, ···, sn-1, s , ··· , t), where s ¹ sn. For s >sn, the same argument holds as in the case of an infinite continued fraction. Similarly, for s < sn, provided the finite continued fraction has more than n elements. There remains to show that (s1, ···, sn - t) ¹ a1, but this follows from (10) and (7), since for even n
![]()
whereas the converse inequality applies for odd n . Hence a1 cannot be expanded into any continued fraction which differs from (s1, s2, ···), whence it is an irrational number; as every positive number can be expanded into a continued fraction, the expansion of a1 must be (s1, s2, ···) and one has
Theorem 2: Let s1, s2, ··· be an infinite sequence satisfying (2), then there exists a uniquely determined number a1 = (s1, s2, ···), which is irrational and does not admit any different expansion into a continued fraction with elements satisfying (3).
4.2.2 Distribution of a continued fraction along the real axis: By the two theorems of 4.2.1, it has been shown that there corresponds to every continued fraction, which satisfies (2), a non-negative real number; rational positive numbers can be expanded into exactly two different continued fractions which are both finite; irrational positive numbers admit one and only one expansion which is infinite, and 0 is expanded into the continued fraction with the only element s1 = 0.
It is interesting to investigate the
distribution of continued fractions along the real axis. The
continued fractions with one element s1 = 0,
1, 2, ··· represent these integral numbers and subdivide the
positive half of the real axis into intervals of equal length 1.
Continued fractions with two elements are distributed among these
intervals as follows: As (s1,m)=s1+1/m
for every positive integral value of m, (s1,m)
is situated in the interval, which is bounded by s1
and s1 + 1, and will be denoted by
. For m
= 1, the number (s1,m) is the right
end point of the interval and it converges steadily with m
tending to infinity to the left end. Thus, every interval
is
subdivided into an infinity of abutting sub-intervals
bounded
by (s1, s2 + 1) and (s1,
s2) which covers
except its left end
point. Since (s1, s2+m)=s1+(s2+1/m),
each of these continued fractions lies in
and they converge
steadily from the left end of
to its right end and
subdivide it into an infinity of abutting intervals
.
Consider now the interval
which is bounded by (s1,
··· , sn), and (s1,
··· , sn + 1). Application of the
methods and formulae of 4.2.1 yields readily
![]()
The right hand side of (1) is a positive number
which is equal to 1 if t = 1 and converges steadily to zero as t
increases steadily. Hence the points (s1,···,
sn,t) converge steadily from (s1,
··· , sn + 1) to (s1,
··· , sn) as t
increases; they subdivide the interval
into an infinity of
abutting intervals, which cover
with the only exception
of (s1, ··· , sn).
This point is the left or the right end point of
according to whether n is odd or even. There corresponds
to every infinite sequence (s1, s2,
··· ) satisfying 4.2.1 (2) a sequence of intervals
which
form a nest; the
convergents of (s1, s2, ···
) are alternatively the left and the right end points of these
intervals, whence the nest converges to (s1, s2,
··· ). Thus, there exists a (1,1)-correspondence between
positive irrational numbers and nests. The end points of the nest
intervals are rational numbers and one arrives at a
classification of the non-negative rational numbers in the
following manner. The first class contains the numbers which can
be expanded into continued fractions with only one element -
integral numbers, the numbers of the second class can be expanded
into continued fractions with two (not one) elements, etc., the m-th
class is composed of the numbers which can be expanded into
continued fractions with m (not m 1)
elements.
The importance of this classification is made evident by the
Theorem:
If s > 0 and
, then s
< Q2nfl > Q2n-1.
Proof: The assumption yields directly
![]()
and as s and Q2n-1 are positive,
![]()
since the central part of this inequality is an integral positive number. Hence,
![]()
This theorem shows that the closest approximations of a real number with the aid of rational numbers with limited positive denominators are the approximations by the convergents Pm:Qm.
Since a lies in the interval bounded by two consecutive convergents Pn:Qn and Pn+1:Qn+1, its distance from Pn:Qn is less than the length of the interval. Hence

thus
![]()
where |e | < Qn:Qn+1 < 1 and e is positive or negative according to whether n is odd or even. Thus
![]()
4.3 Periodic continued fractions with integral coefficients: The elements of the continued fractions, considered in this section and its sub-sections, are assumed to be integral numbers. The first element is positive or zero, the other elements are positive. A continued fraction with a period a1m, ··· , am, say,
![]()
will be denoted by
![]()
In the special case when there are no elements bj, the continued fraction is said to be purely periodic. In any case, (1) determined uniquely an irrational number; hence it follows from the last paragraph of 4.1.3 that this number is a root of a quadratic polynomial, say f(x) of R[x], where R denotes the field of rational numbers. For the irrationality of the roots, f(x) is irreducible in R[x].
4.3.1 Expansion of quadratic elements into periodic continued fractions:
The converse of the last statement is given by the
Theorem: Let [L : R] = 2, then every irrational number a belonging to L can be expanded into a periodic, continued fraction.
Proof: Let a be the root of an irreducible polynomial
![]()
Expand a into a continued fraction a = (s1, ··· , sn, l) ; then (cf. 4.1.1 (5'))
![]()
whence
![]()
thus l is a root of
![]()
where

Let b be the second root of (1) and m be defined by
![]()
whence
![]()
Since ab ² + 2bb + c = 0, the number m satisfies (2). By (4),
![]()
where ± must be chosen according to whether n is odd or even.
Then, by (5) and 4.2.2 (4),

As Qn increases infinitely with n and b ¹ a, the root m. is negative for sufficiently high values of n, and as l is a complete fraction and therefore positive, lm = k : g < 0. Hence k g < 0 for all sufficiently high values of n. There corresponds to each of these values a partition of the positive number b²-ac = h² - kg (cf. (3)) into two non-negative summands h² and - kg; there correspond to the first term at most 2 values ± h and to the second term a finite number of integral factors k and g. Hence (3) admits only a finite number of solutions g, h, k for which k g < 0. Let now n run over 1, 2, ··· and consider the corresponding polynomials (2); there applies (3) to each of these polynomials h² - kg = b² - ac and the inequality k g < 0 holds for sufficiently high values of n. Hence not all of the polynomials gx² + 2hx + k can differ. There must at least occur one polynomial with k g < 0. This polynomial has exactly one positive root which is equal to the corresponding complete fraction. Hence not all the complete fractions differ, say
![]()
whence
![]()
is represented by a purely periodic continued fraction and a is represented by a periodic continued fraction.
4.3.2 Purely periodic continued fractions:
Let a1, a2, ··· be the complete fraction of
Since ai
= ai+k for i > m,
every property which holds for the complete fractions of
sufficiently high index applies to every complete fraction of
index > m. By 4.3.1, it is known that the
root conjugate to a complete fraction of sufficiently high index
is negative, whence this property belongs to every complete
fraction of index > m, i.e., for every purely
periodic continued fraction. In a purely periodic continued
fraction s1 = sk+1
¹ 0
(cf. 4.2 (2)), whence these
continued fractions represent numbers > 1.
A root l of a quadratic equation is said to be reduced if l > 1, and the conjugate root m satisfies 0 > m >1. It will be proved now that every purely periodic continued fraction represents a reduced quadratic number.
Let

be two purely continued fractions, the elements si being the same in both the continued fractions. but ordered in an inverse manner.
Let Pi : Qi be the convergents of a. Then (cf. 4.1.2 (1))

are convergents of x, whence
~. Let b = -1/x, then
0>b>-1 and
, whence b is a root of
![]()
Since
a is also a
root of f(x) and, since a > 1, the roots a and b differ.
The essence of these considerations is the
Theorem: If a is represented by a purely periodic continued fraction (1), it is a reduced quadratic number; let b be the number conjugate to a and x = -1/b -1, then x is represented by (2).
Every continued fraction is equivalent to its complete fraction (cf. 4.1.3); in particular, every periodic continued fraction is equivalent to a purely periodic continued fraction, whence
Corollary: Every quadratic number is equivalent to a reduced quadratic number.
4.3.3 Scheme for computations: In order to discover the representation of any quadratic number a by a continued fraction, represent it by
![]()
where a, b, s, D > 0 are integral numbers. Then
![]()
where
![]()
Starting from these formulae, the simple numerical scheme given below furnishes the numbers a, b; a', b', ···, which define uniquely the complete fractions a, a', ··· and the numbers s, s', ···, which define the continued fraction. As this continued fraction is periodic, one pair a, b must be repeated after a finite number of steps. Then the first period is finished and the calculation can be terminated.
Examples:

The last complete fraction is therefore equal to the preceding one, whence a=(0,1). This continued fraction is the simplest, but the least convenient one for practical computations, because the numbers Pk, Qk are increasing more slowly than in any other case.
2.

hence
. This example is very convenient for
quick and exact computations:

Hence a = 530451/104030 - e, where 0 < e < 10-1, whence the last two figures are uncertain (cf. 4.2.2 (3)).
3.

Thus Ö2 = (1,2). As Pk, Qk are increasing very slowly, the method will be applied in a modified form.
![]()
Thus expand Ö200 into a continued fraction. D = 200 = 14² +4.

Hence ![]()

correct to eight figures after the decimal point since 0 < e ' < 3·10².
Exercises: Prove that
compute Ö2501, Ö82, (Ö7+2)/3, Ö17, Ö3 directly and
also using Ö300. Compute Ö(a+1).
4.3.4 Reduced quadratic numbers: In order to prove the converse proposition of the theorem of 4.3.2, you use the
Lemma: If a > 1 and b < 0 are conjugate quadratic numbers, a = (s0,s1,s2,···), then all the complete fractions a1 = (s0,s1,···), a2 = (s2,s3,···) are reduced numbers.
Proof: a = s + 1/a1, b = s + 1/b1, a1 and b1 are conjugate numbers a1 > 1, -1/b1 = s - b > s ³ = 1, whence a1 is reduced, and it follows by repetition of this procedure that a2, ··· are reduced.
Theorem: Every reduced quadratic number is represented by a purely periodic continued fraction.
Proof: Every quadratic number is represented by a periodic
continued fraction
. Let this number be reduced and let the periodicity
of the continued fraction begin with s1 only
(i.e., let s ¹ sn), then it follows from the last
lemma that (
) is also a reduced number.
We will prove that this is impossible. Using the same notation as in the lemma, we state

but as a and an are reduced, 0 < -b < 1 and 0 <-bn<1; hence s < -1b1 < s + 1 and sn < -1/bn+1 < sn+n + 1. Hence it follows from b1 = bn+1 that s = sn.
4.3.5 Expansion of square roots:
Theorem: Let a = Ör/t be irrational, then

If, conversely, (1), (2) and (3) apply, then a is an irrational square root > 1.
Proof: As a > 1 and the number b = -a < 0 is conjugate to a, it follows from the lemma that the complete fractions a1, a2, ···of a are reduced, and therefore purely periodic, whence a satisfies (1). Since

Hence it follows from the theorem of 4.3.2 that

Thus,
![]()
This equation implies (2) and (3). Conversely, if a is defined by (1),(2) and (3), then (6) applies.
Let a1 and b1 be defined by (4) and (5), and b = s +1:b1, then, by (4) and (3), a1 and b1, and therefore a and b are conjugate, and, by (6), a + b = 0. Hence a and b and are the roots of a rational polynomial tx² + 0x - r. It follows from 0 ¹ sn = 2s that s ³ 1, and therefore a > 1, and as (1) is an infinite continued fraction, a must be irrational.
Corollary: Let a = Ö(r : t) and P1 : Q1, ··· be the convergents of a, then
![]()
for every k = 1, 2, ···.
Proof: Let a1, ··· be the complete fractions of a, then ai = ai+kn,
![]()
However, since
![]()
![]()
then
![]()
Since a ² = r : t and a is irrational,

Multiply these equations by Qknt and -Pknt, respectively, and add them, then
![]()
whence follows directly (7).
last next