We take a number theoretic view of decimal (ie, regular) expansion of numbers.

We are going to look at our regular, decimal expansions of numbers from a number theory perspective in order to study something familiar as an analogy for continued fractions. We start with some familiar definitions.

Proof
In order to get a contradiction, assume that . Then for some , with . Without loss of generality, assume . By squaring both sides, we get , so . Thus, and . Thus, there is some integer where . Then , so . Now we get that . Thus and , which contradicts . So .

Proof by contradiction is a useful technique for proving a number is irrational.

Proof
The participation assignment covers . Replacing with gives . If , then there exists where and where none of are zero.

The analogous statement for irrational numbers does not hold. For example . The participation assignment is to find an example that does not work for addition.

Proof
Assume that . We must show that . Now for some integers and . Without loss of generality, . Then for implies

Multiplying both sides by , we get Then Thus, . Since , we have that . Then .

Using this theorem involves finding a polynomial where is a root. Sometimes this is basic algebra, like rewriting as . However, for numbers like and , no such polynomial exists.

Every real number has a decimal expansion, which is how we are used to writing numbers.

This is a formalized definition of a repeating decimal.

You have probably heard that the decimal expansion of a ration number either terminates or repeats. We have formalized the definition of repeats to “eventually periodic,” and show that terminating decimals are also eventually periodic. Now we prove that fact.

Proof
() Assume that . The for some integers and . Since, , we also have that . Now divide into by using long division; let the resulting decimal representation of be By the division algorithm, the possible remainders when dividing by are . At each stage of the long-division process, is being divided by one of these remainders times 10 (ie, ). The first such remainder is . Accordingly, let be the sequence of remainders corresponding to the quotients (so that ). Since the number of possible remainders is finite, for some and with . If , then for all , from which for all , and is eventually periodic.

() Assume that is eventually periodic. Then there exists positive integers and such that Now and Furthermore, is an integer since the identical repeating blocks cancel (leaving ). Since , we have that . Then Since is a nonzero integer, then as desired.

Homework: parallel this proof for specific numbers.

A very different look at decimal numbers

Here is a very different way of generating decimal expansions using ideas from dynamical systems. The idea is to divide the unit interval into intervals where . If a number , then the first digit of the decimal expansion is . For example, when , the interval is and the first digit of every in the interval is .

To get the second digit, we break each of these intervals into 10 smaller intervals . For each For example, when , the interval is and the first digit of every .

Determining the rest of the digits involves iterating this process.