Continued fractions offer a useful method and representation of expressing numbers and functions. One of interesting ideas of this method is that any number can be represented by a point on the real line and that falls between two integers.

Several attempts have been made during the last 100 years to develop continued fraction algorithm for complex numbers[1]; such algorithm having properties that are known to possess on the regular continued fraction algorithm in the real numbers case.

In the real case, for example, let be any real number, and if is an integer, then

.

There is one and only one such integer for any given real . The integer is sometimes called the floor of ,

For example : , .

For any real with , there is a unique decomposition where is an integer and is in the unit interval. So, if and only if is an integer.

The process of finding the continued fraction expansion of a real number is a recursive process that procedes one step at a time. Given any real number , after steps, the process goes like this one :

Which has integers and real numbers that are members of the unit interval with all positive. We can write another representation :

.

If , the process ends after steps. Otherwise, the process continues at least one more step with

.

In this way one associates with any real number a sequence, which could be either finite or infinite, of integers. This sequence is called the continued fraction expansion of real number . For example, can be represented as a continued fraction

or .

Continued fractions have become more common in various other areas since the beginning of the twentieth century. For example, Robert M. Corless [2] examines the connection between theory of chaotic dynamical systems and continued fractions. It has also been used in computer algorithms for computing rational approximations to real numbers, as well as for solving Diophantine approximation of complex numbers [1] .

It turns out that complex numbers can also be represented as continued fractions, and, as such, falls between two Gaussian integers, and the unit is any divisor of whose norm is 1.

The best method at the moment was devised by Asmus Schmidt. [1]

Let

,

.

The set and their subdivisions into

and

are shown in Fig. 1, Fig. 1*, respectively.

**Figure 1, Figure 1*.** Every boundary point occurring in Fig. 1 is properly equivalent to a real number, and that every boundary point occurring in Fig. 1* is improperly equivalent to a real number. [1]

(Note : all regions are bounded by straight lines or circles with radii (or part thereof), and are supposed to be closed; )

The 8 matrices are defined as follows :

For any invertible matrix M,

with elements in , let denote the corresponding homographic map :

And denotes complex conjugation of .

A homographic map is called *unimodular* if (the ring of Gaussian integers) and . Notice that the determinant of a unimodular map is defined only as an element in the quotient group consisting of the two elements . A unimodular map is called *properly unimoduIar* if and *improperly unimodular* if .

An immediate consequence of these definitions is that every boundary point occurring in Fig. 1 is properly equivalent to a real number, and that every boundary point occurring in Fig. 1* is improperly equivalent to a real number.

A complex number, for example can be represented as a series of these matrices: and so on. Multiplying them together would yield :

If the top and bottom are added up, the fraction can be made, which approximately equals . starts off .

The Asmus Schmidt method uses partitions to divide the complex plane into regions, then subregions, and so on, and in this way, each point is encoded by the sequence of regions to which it belongs. In the first generation :

**Figure 2.** The first generation of Asmus Schmidt’s complex continued fraction method. (picture credite to Ed Pegg Jr., courtesy of MAA)

After that, each triangular region is divided into 4 parts, by adding a circle. In addition, each circle is divided into 8 regions, by adding 3 tangent circles.

**Figure 3.** The third generation of Asmus Schmidt’s complex continued fraction method. (picture credite to Ed Pegg Jr., courtesy of MAA)

Here is a portion of fourth generation :

**Figure 4.** The fourth generation of Asmus Schmidt’s complex continued fraction method. (picture credite to Ed Pegg Jr., courtesy of MAA)

Another interesting visualization on further successive generation was done by *Mathematica* software[7] in which seven matrices are used. Each use of these matrices divides the plane into seven parts as shown in the Figure 5.

**Figure 5.** Sucessive generations of Asmus Schmidt’s complex continued fraction method (picture credite to Doug Hensley, at Wolfram Library Archive).

**References :**

[1] Asmus L. Schmidt, *Diophantine Approximation of Complex Numbers,* University of Copenhagen, Denmark.

[2] Robert M. Corless, *Continued Fractions and Chaos*, Dept. Applied Math, University of Western Ontario, Canada.

[3] Ed Pegg Jr., *Gaussian Numbers*, editorial Math Games, March 15, 2004, MAA.

[4] MathWorld, *Continued Fractions*, *Pi Continued Fraction*.

[5] W. F. Hammond, *Continued Fractions and the Euclidean Algorithm,* Department of Mathematics and Statistics, University at Albany.

[6] Wikipedia, *Continued Fraction*, *Generalized continued fraction*, *Gaussian integer*.

[7] Wolfram Library Archive, *Complex Continued Fractions*, picture download : PDF document.