Decimal Representation PDF
Decimal Representation PDF
To cite this article: A. Kalapodi (2010) The decimal representation of real numbers,
International Journal of Mathematical Education in Science and Technology, 41:7, 889-900, DOI:
10.1080/0020739X.2010.486450
Taylor & Francis makes every effort to ensure the accuracy of all the information (the
“Content”) contained in the publications on our platform. However, Taylor & Francis,
our agents, and our licensors make no representations or warranties whatsoever as to
the accuracy, completeness, or suitability for any purpose of the Content. Any opinions
and views expressed in this publication are the opinions and views of the authors,
and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content
should not be relied upon and should be independently verified with primary sources
of information. Taylor and Francis shall not be liable for any losses, actions, claims,
proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or
howsoever caused arising directly or indirectly in connection with, in relation to or arising
out of the use of the Content.
This article may be used for research, teaching, and private study purposes. Any
substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing,
systematic supply, or distribution in any form to anyone is expressly forbidden. Terms &
Conditions of access and use can be found at http://www.tandfonline.com/page/terms-
and-conditions
International Journal of Mathematical Education in
Science and Technology, Vol. 41, No. 7, 15 October 2010, 889–900
1. Introduction
The notion of representation is not purely mathematical, since representation
procedures are adopted by many other sciences. An elementary but not naive
representation process can be applied to all linguistic systems, where the letters of an
alphabet are used to express the words of the language. For example, every word of
the English language can be represented by a sequence consisting of some of the 26
letters of the Latin alphabet. It is clear that in this case, the reverse procedure is
meaningless, since a random series of letters does not correspond necessarily to an
acceptable language word.
A first approach to the representation of numbers in mathematical notation,
which is closest to the common way of writing, uses the digits {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
as alphabet. This alphabet is called a decimal alphabet in order to avoid confusions
about the number system used. The representation problem can therefore be
*Email: [email protected]
formulated in two questions: Can every real number be expressed using the 10 digits
of the decimal alphabet? Does every sequence of digits represent a real number?
Before answering these questions, it is worthwhile to briefly mention that the
writing of numbers passed through different primitive stages, that can be classified in
three main categories. The first comprises early attempts of recording numbers
through marks, such as knots tied on strings or wooden tallies. In the second, we find
simple grouping systems, such as hieroglyphic Egyptian numerals, Roman numerals
or attic Greek numerals. A typical representative of the third category is the
well-known alphabetic Greek numerals, where a number is expressed using
combination of symbols. All these representations were not appropriate for
calculations, especially when large numbers were involved. This inadequacy has
led to positional number systems, like the Babylonian system, the Mayan system or
the Arabic numerals, systems which gave the potential of overcoming simple
Downloaded by [Heriot-Watt University] at 05:50 27 December 2014
N ¼ cm cm1 c1 c0
The integer numbers {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} are called digits of the decimal system.
Theorem 2.2: Any natural number can be uniquely expressed as a decimal.
Proof: We prove at first that for a given natural number N, there is at most one
decimal representation, by showing that if there exist one, namely N ¼ cm10m þ cm1
10m1 þ c110 þ c0, then the numbers m and ci, i ¼ 0, 1, . . . , m, are uniquely
determined by N.
In fact, let n denote one of the numbers 0, 1, 2, . . . , m 1. Then
N cn1 cn2 c0
¼ cm 10mn þ cm1 10mn1 þ þ cn þ þ 2 þ þ n
10n 10 10 10
and
cn1 cn2 c0 9 9 9
0 þ 2 þ þ n þ þ þ n
10 10 10 10 102 10
1
¼ 1 n 5 1:
10
Thus,
N
¼ cm 10mn þ cm1 10mn1 þ þ cnþ1 10 þ cn
10 n
and similarly
N
¼ cm 10mn1 þ þ cnþ1
10nþ1
N N
Therefore cn ¼ 10 n
10 10 nþ1
for n ¼ 0, 1, . . . , m 1.
Similarly, dividing N by 10m, we conclude that
N
cm ¼ :
10m
In addition, since 0 ci 9, i ¼ 0, 1, . . . , m, and cm 6¼ 0, we have
equalities:
N ¼ c0 þ N1 10
N1 ¼ c1 þ N2 10
..
.
Nm1 ¼ cm1 þ Nm 10
Nm ¼ cm
if and only if
ri ¼ 0 for each i, 0 i n:
Downloaded by [Heriot-Watt University] at 05:50 27 December 2014
n ¼ 1, 2, . . . . Then
c 1 þ x2 c2 þ x3 cn þ xnþ1
x1 ¼ , x2 ¼ , ... , xn ¼ , ...:
10 10 10
Thus,
c 1 þ x2 c1 x2
x ¼ ½x þ x1 ¼ ½x þ ¼ ½x þ þ
10 10 10
c1 c2 cn xnþ1
¼ ¼ ½x þ þ 2 þ þ n þ n :
10 10 10 10
Since 0 xnþ1 5 1, we have 0 x10nþ1n 5 101n thus lim n!þ1 x10nþ1n ¼ 0. Therefore, we
obtain the following expansion of x into an infinite series:
c1 c2
x ¼ ½x þ þ þ
10 102
where ci, i ¼ 1, 2, . . . are digits of the decimal system.
Using the decimal notation of [x] we conclude that the real number x has a
decimal representation, x ¼ AsAs1 A0 . c1c2 . œ
Let D be the set of all decimal forms of type
c1 c2
As 10s þ As1 10s1 þ þ A1 10 þ A0 þ þ þ
10 102
where s is an integer, Ai, i ¼ 0, 1, . . . , s and cn, n ¼ 1, 2, . . . are digits of the decimal
system with the reservation that in case s 1 then As 6¼ 0.
Proposition 3.3: The function f : [0, þ1) ! D which to every non-negative real
number corresponds its decimal expansion by the algorithm presented in the proof of
Theorem 3.2 is not surjective, but restricted to its image becomes a bijection.
Proof: This function is obviously well-defined. Let x be a non-negative real number
and f(x) ¼ As As1 A0 . c1c2 . It is impossible that every cn, n m should be 9,
since in that case we have
1 9 9 cm cmþ1 xm 1
¼ þ þ ¼ m þ mþ1 þ ¼ m1 5 m1
10m1 10m 10mþ1 10 10 10 10
Thus the function f is not surjective.
International Journal of Mathematical Education in Science and Technology 895
With the reservation that an infinity of digits of the decimal form are less than 9,
the function f becomes a bijection. In fact, let AsAs1 A0 . c1c2 be a decimal
form with an infinity of digits less than 9. The series As 10s þ As1 10s1 þ þ
c1 c2
A1 10 þ A0 þ 10 þ 10 2 þ is convergent and let x be its limit. It is easy to verify that
10 10 10 10
Using Theorem 2.4, s ¼ r and Ai ¼ Bi, i ¼ 0, 1, 2,. . . s. In addition cn ¼ dn, for every
n ¼ 1, 2, . . . for if not, let cN and dN be the first pair which differ, so that |cN dN| 1.
Then
X 1
cn X1
dn 1 X1
j cn dn j 1 X1
9
¼ 0:
1 10n 1
10 n 10 N
Nþ1
10 n 10 N
Nþ1
10n
Thus, since equality must hold, all of cNþ1 dNþ1, cNþ2 dNþ2, . . . must have the
same sign and the absolute value 9. Then, either cn ¼ 9 and dn ¼ 0 for n 4 N, or cn ¼ 0
and dn ¼ 9 for n 4 N, each of these alternatives is impossible. Hence cn ¼ dn for all n.
Thus x ¼ y. œ
Until now, we have presented an algorithm which associates with every
non-negative real number a decimal expansion. We do not know whether or not
there is another decimal representation of a given number. Although, we can
examine the uniqueness of decimal expansion regardless of its construction. In what
follows, we will use the following notation:
Let x be a non-negative real number and a decimal expansion
As As1 A0 : c1 c2
of x. We put
r0 ¼ As 10s þ A0 ¼ ½x
c1
r1 ¼ r0 þ
10
c1 c2
r2 ¼ r0 þ þ
10 102
..
.
cnþ1 cnþ2
Thus, x rn ¼ þ þ for every n ¼ 0, 1, 2, . . . with
10nþ1 10nþ2
9 9 1
0 x rn nþ1 þ nþ2 þ ¼ n
10 10 10
896 A. Kalapodi
Lemma 3.4 [6]: Let x be a non-negative real number with decimal expansion
c1 c2
½x þ þ þ :
10 102
There exists natural number ci with ci 6¼ 9.
Proof: If ci ¼ 9 for every i ¼ 1, 2, . . . , then x ¼ [x] þ 1 which is impossible. œ
Thus, any decimal representation should be considered having at least one ci not
9
equal to 9. For example, although the series 10 þ 1092 þ 1093 þ equals 1 we cannot
accept the form 0.999. . . as decimal representation of 1.
The following two theorems clarify which non-negative real numbers have
precisely one decimal representation and which non-negative real numbers have two
representations.
Downloaded by [Heriot-Watt University] at 05:50 27 December 2014
Theorem 3.5: A non-negative real number x which is not a rational number equal to an
irreducible fraction whose denominator is a product of primes each of which is a divisor
of 10 has precisely one decimal representation.
Proof: Let x be a non-negative real number which is not a rational number equal to
an irreducible fraction whose denominator is a product of primes each of which is a
divisor of 10, and
c1 c2
As 10s þ As1 10s1 þ þ A1 10 þ A0 þ þ þ
10 102
a decimal representation of x. We know, using the notation presented before, that
0 x rn 101n , n ¼ 1, 2, . . . . If there exists n such that x rn ¼ 101n that means all the
digits cnþ1 ¼ cnþ2 ¼ ¼ 9. Then,
c1 c2 cm0 1 9 9
x ¼ ½x þ þ 2 þ þ m0 1 þ m þ m þ1 þ
10 10 10 0 10 0 10 0
Secondly, if l 10mrm ¼ 1, then x rm ¼ 10l m , being possible only in the case where
cmþ1 ¼ cmþ2 ¼ ¼ 9. Let m0 be the least natural number such that
cm0 ¼ cm0þ1 ¼ ¼ 9. If m0 ¼ 1 then x ¼ [x] þ 1, which is impossible. If m0 4 1 then
cm01 6¼ 9 thus cm0 0 1 ¼ cm0 1 þ 1 is also a digit. Thus,
c1 c2 cm0 1 0 0
x ¼ ½x þ þ 2 þ þ m0 1 þ m þ m þ1 þ
10 10 10 0 10 0 10 0
c1 c2 cm 1 9 9
¼ ½x þ þ 2 þ þ m0 1 þ m þ m þ1 þ :
10 10 10 0 10 0 10 0
œ
Remark 3.8: For example, it is obvious from the two previous theorems that
the rational number 12 can be represented in decimal notation either as 0.5 or
as 0.4999. . . , while the rational number 13 has a unique decimal representation
as 0.3333. . . .
For the following theorem we note that a decimal representation
c1 c2
½x þ 10 þ 10 2 þ , where x is a non-negative real number, is called finite if there
exists a natural number n0 such that cn ¼ 0 for every n 4 n0, and it is called periodic if
there exist natural numbers s and h such that cnþs ¼ cn whenever n h. Every finite
representation is considered as periodic. We recall (see Lemma 3.4) that in a decimal
representation it is impossible to have all digits ci, i ¼ 1, 2, . . . equal to 9.
Theorem 3.9: A non-negative real number x is rational if and only if it has a periodic
decimal representation.
898 A. Kalapodi
x1 ¼ x ½x
xnþ1 ¼ 10xn ½10xn , n ¼ 1, 2, . . . :
Then, 0 xn 5 1 for n ¼ 1, 2, . . . and mx1 ¼ l m[x], that is mx1 is an integer. We
have mxnþ1 ¼ 10mxn m[10xn] for n ¼ 1, 2, . . . . By induction, it is easy to prove that
all the numbers mxn are integers that satisfy the inequalities 0 mxn 5 m for
n ¼ 1, 2, . . . . If for some n we have xn ¼ 0 then xj ¼ 0 for all j n. Hence
½10x1 ½10x2 ½10xn1 0 0
x ¼ ½x þ þ þ þ þ n þ nþ1 þ :
10 102 10n1 10 10
Thus x has a finite representation. Further, if xn 6¼ 0 for all n ¼ 1, 2, . . . , we have
Downloaded by [Heriot-Watt University] at 05:50 27 December 2014
0 5 mxn 5 m for n ¼ 1, 2, . . . . So, the numbers mx1, mx2, . . . , mxn can take only m 1
different values 1, 2, . . . , m 1. It follows that there exist natural numbers h and s
such that h þ s m and mxh ¼ mxhþs, which proves that xn ¼ xnþs for n 4 h and
therefore cn ¼ cnþs, for n h. Thus the presentation is periodic.
Conversely, we shall prove that if the sequence of digits c1, c2, . . . is periodic then
c1 c2
the number x ¼ ½x þ 10 þ 10 2 þ is rational. In fact, there exist natural numbers s
c1 c2 . . . chþs1 c1 c2 . . . ch1
¼ ,
10h1 ð10s 1Þ
which is a rational number. œ
Corollary 3.10 [6]: If a non-negative number x has a non-periodic representation as a
decimal, then x is irrational.
It is easy now to expand a negative real number in its decimal form following the
procedure described for negative integers. That means that if x is a negative real
number we define as decimal representation of x, the series that comes from the
representation of x by changing the sign in all coefficients. All theorems are still
valid, with trivial modifications.
In this section, we quote the new definitions, and we state the corresponding
theorems giving only indications of proofs when necessary. Complete proofs can be
found in [3] or in [6].
Definition 4.1 [6]: Let g be a given natural number greater than 1. We say that a
natural number N is expressed as a decimal in the scale of g if
N ¼ cm gm þ cm1 gm1 þ c1 g þ c0
where m is an integer 0 and cn, n ¼ 0, 1, . . . , m are integers with the property
0 cn g 1 for n ¼ 0, 1, . . . , m and cm 6¼ 0. If each number of the sequence
0, 1, 2, . . . , g 1 is denoted by a special symbol, these symbols are called the digits
and N can be rewritten in the form
N ¼ ðm m1 . . . 1 0 Þg ,
Downloaded by [Heriot-Watt University] at 05:50 27 December 2014
Theorem 4.5: Let g be a given natural number greater than 1, and x be a non-negative
real number. Then:
(1) The number x has a decimal representation in the scale of g.
(2) In any decimal representation of x in the scale of g, it is impossible to have all
cn, n ¼ 1, 2, . . . , equal to g 1.
(3) If x is not a rational number which is an irreducible fraction with a denominator
such that any prime divisor of it divides g, then number x has precisely one
representation in the scale of g. Moreover, this unique representation is infinite
and has infinitely many digits different from g 1.
(4) If x is a rational number equal to an irreducible fraction whose denominator is a
product of primes each of which is a divisor of g, then x has two decimal
representations in the scale of g. In one of them all cn, n ¼ 1, 2, . . . , except a
Downloaded by [Heriot-Watt University] at 05:50 27 December 2014
finite number are equal to zero, in the other from a certain n onwards all cn are
equal to g 1.
(5) The number x is rational if and only if it has a periodic decimal representation
in the scale of g.
We mention that analogous results hold for number systems with negative base
or even with base that is not a rational number.
References
[1] O. Ore, Number Theory and its History, Dover Publications, New York, 1988.
[2] R. Dedekind, Essays on the Theory of Numbers, Dover Publications, New York,
republication, 1963.
[3] G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford
Science Publications, Clarendon Press, Oxford, 1993.
[4] A.M. Kirch, Elementary Number Theory: A Computer Approach, Intext Educational
Publishers, New York, London, 1974.
[5] J.A. Anderson and J.M. Bell, Number Theory with Applications, Prentice Hall, Upper
Saddle River, NJ, 1997.
[6] W. Sierpiński, Elementary Theory of Numbers, North-Holland, Amsterdam, 1988.