30 Chapter 3

Practice

208 Problem Find an equivalent fraction for the repeating decimal 0.3172. 217 Problem The integer n is the smallest multiple of 15 such that every digit of n is
n
either 0 or 8. Compute .
15
209 Problem A two-digit number is divided by the sum of its digits. What is the largest
possible remainder?
218 Problem Shew that Champernowne’s number

210 Problem Shew that the integer 0.12345678910111213141516171819202122 . . . ,

11 . . . 11 which is the sequence of natural numbers written after the decimal point, is irrational.
| {z }
221 10 s

219 Problem Given that

is a composite number.
1
= 0.020408163265306122448979591836734693877551,
49
211 Problem Let a and b be the integers
find the last thousand digits of
a = 111 . . . 1
| {z }
m 10 s 1 + 50 + 502 + · · · + 50999 .

b = 1 000 . . . 0 5.
| {z } 220 Problem Let t be a positive real number. Prove that there is a positive integer n
m−1 00 s such that the decimal expansion of nt contains a 7.
Shew that ab + 1 is a perfect square.
221 Problem (AIME 1989) Suppose that n is a positive integer and d is a single digit in
212 Problem What digits appear on the product base-ten. Find n if
n
= 0.d25d25d25d25d25 . . .
810
3... 3 · 6... 6 ?
|{z} |{z}
666 30 s 666 60 s 222 Problem (AIME 1988) Find the smallest positive integer whose cube ends in 888.

213 Problem Shew that there exist no integers with the following property: if the initial
digit is suppressed, the resulting integer is 1/35 of the original number.
214 Problem Shew that the sum of all the integers of n digits, n ≥ 3, is
494 99 . . . 9 55 00 . . . 0 .
|{z} |{z}
n−3 90 s n−2 00 s
223 Problem (AIME 1986) In the parlour game, the “magician” asks one of the partici-
pants to think of a three-digit number abc, where a, b, c represent the digits of the number
in the order indicated. The magician asks his victim to form the numbers
acb, bac, cab, cba,
to add these numbers and to reveal their sum N. If told the value of N, the magician can
identify abc. Play the magician and determine abc if N = 319.

215 Problem Shew that for any positive integer n, 224 Problem (AIME 1988) For any positive integer k, let f1 (k) denote the square of the
sums of the digits of k. For n ≥ 2, let fn (k) = f1 ( fn−1 (k)). Find f1988 (11).
11 . . . 1 − 22 . . . 2
|{z} |{z}
2n 10 s n 20 s
225 Problem (IMO 1969) Determine all three-digit numbers N that are divisible by 11
N
is a perfect square. and such that equals the sum of the squares of the digits of N.
11

216 Problem A whole number is equal to the arithmetic mean of all the numbers ob- 226 Problem (IMO 1962) Find the smallest natural number having the last digit 6 and if
tained from the given number with the aid of all possible permutation of its digits. Find this 6 is erased and put in from of the other digits, the resulting number is four times as
all whole numbers with that property. large as the original number.

3.3 Non-decimal Scales

The fact that most people have ten fingers has fixed our scale of notation to the decimal. Given any positive integer r > 1, we
can, however, express any number x in base r.
If n is a positive integer, and r > 1 is an integer, then n has the base-r representation

n = a0 + a1 r + a2 r2 + · · · + ak rk , 0 ≤ at ≤ r − 1, ak 6= 0, rk ≤ n < rk+1 .

We use the convention that we shall refer to a decimal number without referring to its base, and to a base-r number by using
the subindex r .