# Continued Fractions

on the Stern-Brocot Tree

The "left-side" and "right-side" encodings are complementary in more than one way. First of all, where one has letter L, the other has letter R, and vice versa. Secondly (and this explains left/right-side terminology), one applies to the tree (matrix) t on the left while the other applies on the right. There is a third difference between the two encodings that has to do with their utility. As we saw, the left-side encoding is useful in determining location of a fraction on the Stern-Brocot tree. The right-side encoding, on the other hand, leads directly to the fraction that occupies that location. To see how this is done I shall have to introduce simple algebraic notations and invoke the notion of continued fractions. As we shall see shortly, the right-side encoding is naturally interpreted in terms of *simple continued fractions*.

But first let's simplify encoding strings by using exponential notations. Let's, as is customary, write L^{k} for the string of k L's. Similarly, R^{k} will denote the string RR...R that consists of k R's. Thus, for example, the string LLRLLRRRL is replaced with L^{2}R^{1}L^{2}R^{3}L^{1}. Of course L^{1} = L and also R^{1} = R. When symbols L and R are looked at as matrices, power notations are consistent with the standard usage in matrix algebra.

With the new notations, Algorithm 1 is reduced to the old acquaintance, Euclid's Algorithm. Indeed, as multiplication of integers is repeated addition, so division is repeated subtraction. For example, f(LRLL) = f(L^{1}R^{1}L^{2}) = 4/7. Compare this with an application of Euclid's algorithm:

7 = **1**·4 + 3

4 = **1**·3 + 1

3 = **3**·1

The first two 1's match nicely with the first two exponents in L^{1}R^{1}L^{2}, the last term is off by 1. Let's get another example. tL^{3}R^{1}L^{20} = [1/4,21/83] and therefore f(L^{3}R^{1}L^{20}) = 22/87. On the other hand,

87 = **3**·22 + 21

22 = **1**·21 + 1

21 = **21**·1

(If you want to verify the calculations, it helps to note that

which is easily proven by induction).

Again, Euclid's algorithm produces the correct exponents, except that the last one is off by 1. Why this is so? In the latter example, on the last stage, Algorithm 1 keeps subtracting 1 first from 21, then from 20, and so on until the result is equal to 1 which takes 20 steps. This is one less than the quotient 21/1.

Recollect now that Euclid's algorithm also yields representation of continued fractions so that 22/87 = [3,1,21] which stands for

To sum up, a pure reformulation of the Algorithm 1 tells us that

(1)

f(L^{a1}R^{a2}... L^{ak}) = [a_{1}, a_{2}, ..., a_{k}+1]

Encodings of fractions on the right side of the tree (these all are greater than 1) start with R. According to our convention, we then use a semicolon to separate the integer part:

(2)

f(R^{a1}L^{a2}... L^{ak}) = [a_{1}; a_{2}, ..., a_{k}+1]

Note that it does not matter whether the last symbol of encoding is L or R. The result remains valid in the latter case also.

The connection between the Stern-Brocot encoding and continued fraction representation of the fractions on the tree has very nice consequences. For instance, fractions _{1}, a_{2}, ..., a_{k}]_{1} + a_{2} + ... + a_{k}.

In the Stern-Brocot tree, every fraction (except for 1/0 and 0/1) has two children: the left offspring and the right offspring that are located just below the fraction, one a little to the left, the other a little to the right from their parent. Knowing the continued fraction representation of the parent, we can easily find those of its offsprings. To see this, observe that, for continued fractions, we have the following identity

(3)

[a_{1}, a_{2}, ..., a_{k}+1] = [a_{1}, a_{2}, ..., a_{k}, 1]

Every finite continued fraction has two representations. Assume we are given a fraction with the last coefficient greater than 1, [a_{1}, a_{2}, ..., a_{k}], a_{k} >1. Write it in two ways as above

[a_{1}, a_{2}, ..., a_{k}] and [a_{1}, a_{2}, ..., a_{k} -1, 1]

Add 1 to the last coefficient in both representations:

[a_{1}, a_{2}, ..., a_{k}+1] and [a_{1}, a_{2}, ..., a_{k} -1, 2]

These are the offsprings of [a_{1}, a_{2}, ..., a_{k}]. For example,

Computationally, every fraction on the Stern-Brocot tree has two parents. These are the fractions whose mediant equals the given one. We can find these also. One of the parents is located in the row above the given fraction, another is more distant. The representation of the former is simply obtained by subtracting 1 from the last coefficient of the fraction. The representation of the distant parent is obtained by simply omitting the last coefficient. For example,

The part concerning the distant parent bears some explanation. I refer to Theorem 1 from the page on Continued Fractions. Let there be a fraction _{1}, a_{2}, ..., a_{k}] = [a_{1}, a_{2}, ..., a_{k}-1, 1]._{k+1} = 1 we can write

p/q = p_{k+1}/q_{k+1} = (p_{k} + p_{k-1})/(q_{k} + q_{k-1}),

where p_{k}/q_{k} = [a_{1}, a_{2}, ..., a_{k}-1] and
p_{k-1}/q_{k-1} = [a_{1}, a_{2}, ..., a_{k-1}]. Plainly, this is just what we were looking for.

### References

- R. Graham, D. Knuth, O. Patashnik,
*Concrete Mathematics*, 2nd edition, Addison-Wesley, 1994. - M. Schroeder,
*Fractals, Chaos, Power Laws*, W.H.Freeman and Company, 1991

- Modular Arithmetic
- Chinese Remainder Theorem
- Euclid's Algorithm
- Euclid's Game
- Binary Euclid's Algorithm
- gcd and the Fundamental Theorem of Arithmetic
- Extension of Euclid's Algorithm
- Stern-Brocot Tree
- Fine features
- Binary Encoding
- Binary Encoding, Second Interpretation
- Continued Fractions on the Stern-Brocot Tree
- Fractions on a Binary Tree
- Fractions on a Binary Tree II

- Farey series

- Pick's Theorem
- Fermat's Little Theorem
- Wilson's Theorem
- Euler's Function
- Divisibility Criteria
- Examples
- Equivalence relations
- A real life story

|Contact| |Front page| |Contents| |Algebra|

Copyright © 1996-2018 Alexander Bogomolny

71226160