1 01

1
Basic Math

If an integer (other than one) is not divisible by any other integer except one and itself, then it is called a
prime number i.e., 2, 3, 5, 7, 11, 13, … etc.

1. For any prime p the only divisors are ±1 and ±p

2. If difference of two prime numbers is 2 then they are known as twin primes. e.g., {5, 7}, {11, 13} etc.
p2 −1
3.  I  p is a prime number [p > 3]
24
4. Prime numbers are written either as 6k – 1 or 6k + 1 i.e., (twins) but the converse is not true
n
5. 22 + 1 is a number known as Fermat's number.
Note:
1. Above number was proposed to be prime number by Fermat, but Cauchy proved it wrong for n ≥ 4.
2. Composite numbers: An integer p > 1 is said to be a composite number if it has at least one divisor other
than ±1 and ±p. e.g., 6, 27 and 143 are composite numbers whereas –1, 1, 2, 7, 13 are not composite
numbers. Note that: 1 is neither prime nor composite

Two integers are said to be relatively prime or co-prime if they have no common factor i.e., their G.C.D
= 1, e.g., 4 and 15, 3 and 16 etc.

If sum of all the divisors of a number n is equal to 2n then the number n is called perfect number e.g., 6
is a perfect number because sum of all divisors = 1 + 2 + 3 + 6 = 12 = 2(6)

As we know that the unit digit of sum of n integers say x1, x2, …, xn is unit digit of sum of their digits at
unit places and also the unit digit of product of these n integers is equal to unit digit of product of their digits at
unit places. Application of the above two simple concepts lead to following periodic properties of integers.
1. If a number x having zero/one at its unit place then xn ends with zero/one at its unit place, where n is any
natural number.
2. If a number x having two at its unit place then xn ends with 2, 4, 8, 6 at its unit place, for n = 4k + 1, 4k +
2, 4k + 3, 4k respectively where k is any whole number.

NUMBER SYSTEM 1
OLYMPIAD BOOKLET

3. If a number x having three at its unit place then xn ends with 3, 9, 7, 1 at its unit place, for n = 4k + 1, 4k
+ 2, 4k + 3, 4k respectively where k is any whole number.
4. If a number x having four at its unit place then xn ends with 4, 6 at its unit place, for n = 2k + 1, 2k + 2
respectively where k is any whole number.
5. If a number x having five at its unit place then xn ends with 5 at its unit place, ∀n ∈ number.
6. If a number x having six at its unit place then xn ends with 6 at its unit place, for all n ∈ number.
7. If a number x having seven at its unit place then xn ends with 7, 9, 3, 1 at its unit place, for n = 4k + 1, 4k
+ 2, 4k + 3, 4k respectively where k is any whole number.
8. If a number x having eight at its unit place then xn ends with 8, 4, 2, 6 at its unit place, for n = 4k + 1, 4k
+ 2, 4k + 3, 4k respectively where k is any whole number.
9. If a number x having nine at its unit place then xn ends with 9, 1 at its unit place, for n = 2k + 1, 2k + 2
respectively where k is any whole number.

Note: 1. Square of any integer can never have 2, 3, 7, 8, at its unit place.
2. Fourth power of any integer can have only 0, 1, 5 and 6 at its unit place.

Find the digit at units place of following numbers:

(a) 19999 1996
(b) 19991997 (c) 19471947 (d) 19471948
6
4 2
(e) 19471949 (f) 22003 (g) (2 )
Sol: (a) unit place of the base is 9 and 1996 = 2k + 2 ∴ digit at unit place = 1
(b) unit place of the base is 9 and 1997 = 2k + 1 ∴ digit at unit place = 9
(c) unit place of the base is 7 and 1947 = 4k + 3 ∴ digit at unit place = 3
(d) unit place of the base is 7 and 1948 = 4k + 4 ∴ digit at unit place = 1
(e) unit place of the base is 7 and 1949 = 4k + 1 ∴ digit at unit place = 7
(f) unit place of the base is 2 and 2003 = 4k + 3 ∴ digit at unit place = 8
(g) unit place of the base is 6 and 256 = 4k + 4 ∴ digit at unit place = 6
Find the remainder when following numbers are divided by 2, 5, 10.
(a) 1719 + 1917 (b) 199 + 919 (c) 137 + 173 (d) 9922 + 7722 + 3331 + 8831
Sol: (a) Since 1719 ends with 3 at unit place and 1917 ends with 9 at unit place, therefore the summation will
end with 2 at its unit place. So, the remainder will be 0, 2, 2 when it is divided by 2, 5, 10
respectively.
(b) Since 199 ends with 9 at unit place and 919 ends with 9 at unit place, therefore the summation will
end with 8 at its unit place. So, the remainder will be 0, 3, 8 when it is divided by 2, 5, 10
respectively.
(c) Since 137 ends with 7 at unit place and 173 ends with 3 at unit place, therefore the summation will
end with 0 at its unit place. So, the remainder will be 0, 0, 0 when it is divided by 2, 5, 10
respectively.
(d) Since 9922 ends with 1 at unit place, 77 22 ends with 9 at unit place, 3331 ends with 7 at unit place
and 8831 ends with 2 at unit place, therefore the summation will end with 9 at its unit place. So, the
remainder will be 1, 4, 9 when it is divided by 2, 5, 10 respectively.

NUMBER SYSTEM 2
OLYMPIAD BOOKLET

Find the integers x and y satisfying the equation x2 + y2 + 2xy = 24973.

Sol: Given x2 + y2 + 2xy = 24973.
⇒ (x + y)2 = 24973. Where x and y are integers
which is not possible because square of any integer can never have 2, 3, 8, 7 at their unit place.
Prove that product of two odd numbers of the form 4n + 1 is of the form (4n + 1).
Sol: Let a = 4k + 1, b = 4k′ + 1 be two numbers of the form (4n + 1)
∴ ab = (4k + 1) (4k′ + 1) = 16kk′ + 4k + 4k′ + 1 = 4 (4kk′ + k + k′) + 1 = 4l + 1
(where I = 4kk′ + k + k′)
Which is in form (4n + 1).
Prove that the square of each odd number is of the form 8j + 1.
Sol: Let n = 2m + 1 be an odd number.
n2 = (2m + 1)2 = 4m2 + 4m + 1 = 4m (m + 1) + 1
Now, m(m + 1) being a product of two consecutive integers, is divisible by 2! = 2
∴ m (m + 1) = 2j ⇒ n2 = 4(2j) + 1 = 8j + 1

Decimal representation Decimal representation of a number x where N = an an−1an−2 a2 a1a0 (here ai's
are digits from 0 to 9m) is defined as N = an(10n) + an–1(10n–1) + an–2(10n–2) + … + a2 (102) + a1(101) + a0 (10°)
Also we know that, an integer x is said to divide an integer y if there exists an integer z such that xz = y.
If x divides y, we can also say that x is a divisor (or factor) of y or that, y is a multiple of x. Each of these facts is
often written as x | y. If x is not a divisor of y, we write x/y.
Above mentioned facts can be used to derive the condition of divisibility of a number N (= anan–1an–2
…a3a2a1; where ai's are digits of the number N.) by 2, 3, 4, 5, … etc., as well as to solve other problems
involving digits of a number.

1. Divisibility by 2: A number N is divisible by 2 if and only if its last digit is divisible by 2. (i.e., even)
Proof: Writing N = an10n + an–110n–1 + … + a0 as (an10n + an–110n–1 + … + 10a1) + a0 we immediately get the
result.
2. Divisibility by 3: A number N is divisible by 3 if and only if the sum of all digits are divisible by 3.
Proof: Writing N = {an (10n – 1) + an–1 (10n–1 – 1) + … + a1 (10 – 1)} + (an + an–1 + an–2 + … + a0). Since 10n –
1, 10n–1 – 1, … are all divisible by 3, therefore N is divisible by 3 if and only if an + an–1 + … + a0 is
divisible by 3.
3. Divisibility by 4: A number N is divisible by 4 if its units digit plus twice its ten's digit is divisible by 4.
Proof: Writing N = an 10n + an–1 10n–1 + … + a2.100) + (a1.10 + a0) = 4.k + 8a1 + 2a1 + a0. So n is divisible by 4
iff 2a1 + a0 is divisible by 4.
4. Divisibility by 5: A number N is divisible by 5 if and only if its last digit is divisible by 5 (i.e., if it ends
in 0 or 5)
Proof: Writing N = (an 10n + an–1 10n–1 + … + a1.10) + a0 = 10k + a0.

NUMBER SYSTEM 3
OLYMPIAD BOOKLET

5. Divisibility by 6: A number N is divisible by 6 if and only if its units's digit is even and the sum of its
digits are divisible by 3.
Proof: N is divisible by 6 if it is divisible by 2 and 3 both.
6. Divisibility by 7: A number N is divisible by 7 if and only if 3 × unit's digit + 2 × ten's digit – 1 ×
hundred's digit – 3 × thousand's digit – 2 × ten thousand's digit + 1 × hundred thousand's digit is divisible
by 7.
i.e., 3(a0) + 2(a1) – 1(a2) – 3(a3) – 2(a4) + 1(a5) + 3(a6) + … is divisible by 7.
i.e., If there are more digits present in the sequence of multipliers 3, 2, –1, –3, –2, 1 is repeated as often
necessary.
7. Divisibility by 8: A number N is divisible by 8 if and only if its units's digit + 2 × ten's digit + 4 ×
hundred's digit is divisible by 8
Proof: Writing N = an 10n + an–1 10n–1 + … + a3.1000) + (a2.100 + a1.10 + a0)
= 8k + 96a2 + 4a2 + 8a1 + 2a1 + a0 = 8k0 + 4a2 + 2a1 + a0
8. Divisibility by 9: A number N is divisible by 9 if and only if the sum of its digits are divisible by 9.
Proof: Writing N = {an (10n – 1) + an–1 (10n–1 – 1) + … + a1 (10 – 1)} + (an + an–1 + an–2 + … + a1 + a0)
9. Divisibility by 10: A number N is divisible by 10 if and only if the last digit is 0.
10. Divisibility by 11: N is divisible by 11 if and only if the difference between the sum of the digits in the
odd places (starting from the right) and the sum of the digits in the even places (starting from the right) is
a multiple of 11 e.g., 1221, 123321, 2783 etc.
Proof: As we know that 10 ≡ – 1(mod. 11), 102 ≡ 1(mod 11), 103 ≡ –1 (mod 11), ⇒ 10n ≡ (–1)n (mod. 11)
so that an 10n + an–1 10n–1 + an–2 10n–2 + … + a1.10 + a0
≡ an (–1)n + an–1 (–1)n–1 + an–2 (–1)n–2 + … + (–1) a1 + a0(mod.11)
≡ [(a0 + a2 + a4 + …) – (a1 + a3 + a5 + …)] (mod.11)
i.e., N is divisible by 11 if and only if (a0 + a2 + a4 + …) – (a1 + a3 + a5 + …) is a multiple of 11.
12. Divisibility by 13: A number N is divisible by 13 if and only if 10 × units's digit – 4 × ten's digit – 1 ×
hundred's digit + 3 × thousand's digit + 4 × ten thousand's digit + 1 × hundred thousand's digit is
divisible by 13. (If there are more digits present, the sequence of multipliers 10, – 4, – 1, 3, 4, 1 is
repeated as often as necessary)
Test whether the integer 3201828 is divisible by 7 or not.
Sol: Clearly (3 × 8) + (2 × 2) + (–1 × 8) + (–3 × 1) + (–2 × 0) + (1 × 2) + (3 × 3)
= 24 + 4 – 8 + (–3) + 0 + (2) + 9 = 28
since 28 is divisible by 7 so the given no. is divisible by 7.
Derive the condition that a three digit number N = abc is divisible by 7 if –a + 2b + 3c, is
divisible by 7.
Sol: Let N be a three digit number with digits a, b and c, then N = 100a + 10b + c From the sum required by
the test call it S = –a + 2b + 3c
Then 2S = –2a + 4b + 6c. And N + 2S = 98a + 14b + 7c = 7(14a + 2b + c)
The sum N + 2S is, therefore, a multiple of 7, say 7M. Now if N is multiple of 7, say 7P, then 2S = 7M –
7P = 7(M – P), and it follows from here that S must also be divisible by 7. If conversely, S is multiple of
7, say 7Q, then N = 7M – 14Q = 7(M – 2Q). It shows that N must be a multiple of 7.

NUMBER SYSTEM 4
OLYMPIAD BOOKLET

Consider a number x = 21A42 B4 . Find the number of ordered pairs (A, B) so that the
number 'N is divisible by 22.
Prove that an integer is divisible by 9 if and only if the sum of its digits is divisible by 9.
Sol: Let a = an…a3a2a1 be an integer
[Note a is not the product of a1, a2, a3, …, an but a1, a2, a3, …, an are digits in the value of a. For
example 368 is not the product of 3, 6 and 8 rather 3, 6, 8 are digits in value of 368
= 8 + 6 × 10 + 3 × (10)2]
a = an…a3a2a1 = a1 + (10)1a2 + (10)2a3 + (10)3a4 + … + (10)n–1an = a1 + 10a2 + 100a3 + 1000a4 + …
= a1 + (a2 + 9a2) + (a3 + 99a3) + (a4 + 999a4) + …
= (a1 + a2 + a3 + a4 + …) + (9a2 + 99a3 + 999a4 + …) …(i)
or a = S + 9 (a2 + 11a3 + 111a4 + …)
S = a1 + a2 + a3 + a4 + …
is the sum of digits in the value of a.
∴ a – S = 9 (a2 + 11a3 + 111a4 + …)
∴ 9 | (a – S) …(ii)
Case I: a is divisible by 9
i.e., 9 | a …(iii)
∴ 9 | [a – (a – S)]
[From Eqs. (ii) and (iii)]
i.e., 9 | S i.e., sum of digits is divisible by 9.
Case II: S (sum of digits) is divisible by 9
i.e., 9 | S …(iv)
From Eqs. (ii) and (iv), 9[(a – S) + S]
i.e., 9 | a
i.e., the integer a is divisible by 9.
Find all six-digit numbers (a1a2a3a4a5a6)10 formed by using the digits 1, 2, 3, 4, 5, 6 once
each such that the number (a1a2…ak)10 is divisible by k for 1 ≤ k ≤ 6.
Sol: (a1a2a3a4a5)10 is divisible by 5 and hence, a5 = 5.a1a2, a1a2a3a4, and a1a2a3a4a5a6 are to be divisible by 2,
4 and 6, respectively. a2, a4 and a6 should be even numbers.
So, a1 = 1 and a3 = 3 or a1 = 3 and a3 = 1
Case 1: If a1 = 1, a2 can be 2, 4 or 6 and a1a2a3 = 123, 143 or 163 but 143, 163 are not divisible by 3, so
a1a2a3 should be 123. For a4, we have either 4 or 6 but for a4 = 4, 1234 is not divisible by 4 and hence, a4
= 6 and hence, the six-digit number, when a1 = 1, is 123654.
Case 2: If a1 = 3.a2 can be 2 or 6 or 4 but then, a1a2a3 = 321 is divisible by 3 and 361 or 341 is not
divisible by 3.
So, a2 cannot be 6 or 4.
Now, a1a2a3a4 = (321 a4)10 and a4 can be 4 or 6. For a4 = 4, 3214 is not divisible by 4 and hence, a4 = 6
and a6 = 4.
Hence, the number is 321654.
Thus, there are exactly 2 numbers 123654 and 321654 satisfying the conditions.

NUMBER SYSTEM 5
OLYMPIAD BOOKLET

Let n be any integer such that |n| > 1. Then n is expressible as a product of unity and finitely many prime
numbers. Moreover, such an expression is unique except as to the order in which the various factors occur. Any
natural number N can be written as N = paqbrcsd…. where p, q, r, s are prime numbers and a, b, c, d are non-
negative integers. e.g., 225 = 32 × 52; 345 = 3 × 5 × 23

From the division algorithm a = mq + r. When the remainder r becomes zero then a = mq. Here m and q
are called divisors of a and a is known as multiple of m and q.
Given a natural number N = pa.qb.rc and a number x = pαqβrγ is called the divisor of N. If N is completely
divisible by x i.e., N = x. m where m ∈ I. In other words, that will be divisor of N iff all the prime factors of x are
present in N. This condition can be mathematically expressed as 0 ≤ α ≤ a; 0 ≤ β ≤ b; 0 ≤ γ ≤ c where α, β, γ are
integers.

Number of divisors of N = number of ways the integers α, β, γ can take values applying the above
restrictions = (a + 1).(b + 1).(c + 1)
Proper and improper divisors: As unity (1) is a divisor of every natural number (N) and every natural
number N is divisor of itself. These two numbers are called the improper divisor of (N) and remaining divisors
are known as proper divisors.
∴ Number of proper divisors of (N) = (a + 1)(b + 1)(c + 1) – 2.
Sum of divisors: Divisors of the number (N) are given by the terms of the following expansion as it clear
that each term of the product.
(1 + p + p2 + … + pa).(1 + q + q2 + … + qb).(1 + r + r2 + … + rc) is a divisor of 'N' including 'N' and
unity and no other number is divisor of N.
(1 + p + p2 + … + pa) . (1 + q + q2 + … + qb) . (1 + r + r2 + … + rc)
= 1 + p + q + r + pq + pr + qr + p2 + q2 + r2 + pqr + p3 + q3 + r3 + … + pa.qb.r6
∴ Sum of all divisors of (N) is given by
S = (1 + p + p2 + … + pa) . (1 + q + q2 + … + qb) . (1 + r + r2 + … + rc)
 p a+1 − 1  q b+1 − 1  r c+1 − 1 
=   
 p − 1  q − 1  r − 1 
Find the number of divisors of the number 1800, also find the summation of all divisors.
Sol: Consider prime factorization of n = 1800
n = 23.32.52 a natural number, x = 2α.3β.5γ divides n
⇒ 0 ≤ α ≤ 3, 0 ≤ β ≤ 2, 0 ≤ γ ≤ 2
 x : x = 233 where , ,  W
Set of all such divisors is given as x = 
0    3; 0    20    2
⇒ number of divisors = n(X) = number of ordered triplet (α, β, γ) satisfying the above conditions
= number of possible values of α) × (number of possible values of β) × (number of possible values of γ)
= (3 + 1) (2 + 1) (2 + 1) = 36

NUMBER SYSTEM 6
OLYMPIAD BOOKLET

Sum of divisors = (20 + 21 + 22 + 23) (30 + 31 + 32) (50 + 51 + 52)

 24 − 1  33 − 1  53 − 1 
=    = 15 × 13 × 31 = 6045
 2 − 1  3 − 1  5 − 1 
Number and sum of divisors of N divisible by a natural number y = p a1  q h1  r c1
Let x = pα.qβ.ry be such divisors
y | x  p a1  q b1  r c1 | p   q   r 
⇒ a1 ≤ α ≤ a & b1 ≤ β ≤ b and c1 ≤ γ ≤ c
⇒ number of such divisors = (a – a1 + 1) (b – b1 + 1) (c – c1 + 1)
Sum of such divisors Sy = ( p a1 + p a1 +1 ++ p a ).(q b1 + q b1 +1 ++ q b )  (r c1 + r c1 +1 ++ r c )

( )( )(
= y 1 + p + p 2 ++ p a − a1 1 + q + q 2 ++ q b −b1 1 + r ++ r c −c1 )
 p a − a1 +1 − 1  qb −b1 +1 − 1  r c −c1 +1 − 1 
= y   
 p − 1  q − 1  r − 1 
Find the number of:
(a) even proper divisors and sum of even proper divisors of 180.
(b) odd proper divisors and sum of odd proper divisors of 2700
Sol: (a) 180 = 22 × 32 × 5
⇒ number of divisors = (2 + 1)(2 + 1)(1+1) = 18
Since even divisors are of the type 2a + 1.3b.5c where a, b, c are non negative integers.
⇒ number of even divisors = 2 × 3 × 2 = 12
Sum of even divisors = (21 + 22) (30 + 31 + 32) (50 + 51) = 6 × 13 × 6 = 468
⇒ number of even proper divisors = 12 – 1 = 11 (excluding the number 180)
Sum of even proper divisors = 468 – 180 = 388
(b) 2700 = 22 × 33 × 52
Since odd divisors of above number are of the type 3 b.5c
where a, b, c are non negative integers, where 0 ≤ b ≤ 3 and 0 ≤ c ≤ 2
⇒ Number of odd divisors = 4 × 3 = 12
Sum of odd divisors = (30 + 31 + 32 + 33) (50 + 51 + 52) = 1240
⇒ Number of odd proper divisors = 12 – 1 = 11 (excluding unity)
Sum of odd proper divisors = 1240 – 1 = 1239
Find the number and sum of all divisors of 3600 that are divisible by 48.
Sol: 3600 = 2 .3 .52. Any required divisor of 3600 is of the form 48.(2 a3b.5c).
4 2

i.e. 2a + 4.3b + 1.5c where a, b, c are non negative integers.

⇒ Number of such divisors = (no. of values of a) × (no. of values of b) × (no. of values of c)
= 1 × 2 × 3 = 6 since 0 ≤ a + 4 ≤ 4; 0 ≤ b + 1 ≤ 2 0 ≤ c ≤ 2
Sum of their divisors = 48 (20) (31 + 32) + (50 + 51 + 52) = 48 × 12 × 31 = 17856

NUMBER SYSTEM 7
OLYMPIAD BOOKLET

Consider the natural number n = paqbrc… as the number of divisors of n is (a + 1)(b + 1)(c + 1). Among
these divisors we can always find a pair of two divisors x, y such that their product x.y = n.
Therefore the number of ordered pairs (x, y) satisfying above equation x.y = n is equal to the number of
divisors.
Every un-ordered pair of such divisors represents one way of resolving n into two factors. Therefore, the
number of ways of resolving n into two factors is half the total number of divisors. Number of such pair of
1
factors = (a + 1)(b + 1)(c + 1) . But, this is true only if n is not a perfect square (i.e. at least one of the
2
quantities a, b, c, … is an odd natural number).
In case n being a perfect square, one of the possible resolution into factors is x = n and y = n , and
corresponding to this there will be only one unordered pair ((x1 : y1) = (x2, y2) does not imply x1 = x2 and y1 = y2)
of solution. While counting number of (x, y) as (a + 1) (b + 1) (c + 1) the above ( n , n ) has been counted
only once. So to find the number of unordered pairs of solutions it should be counted twice and then the total
must be factored by two.
1
Hence, number of ways of resolution is {(a + 1)(b + 1)(c + 1) + 1}
2
In how many ways 129600 can be resolved into a product of two positive integers.
Sol: 129600 = 26 × 34 × 52. Here 129600 is a perfect square as every power is even
1
∴ Number of ways = {(6 + 1)(4 + 1)(2 + 1) + 1} = 53
2
In how many ways the number 36000 can be resolved as a product of two positive integers?
Sol: Let n = 54000 = 24 × 33 × 53. Here n is not a perfect square. ( power of 3 and 5 are odds)
1
Hence the number of ways = {(4 + 1)(3 + 1)(3 + 1)} = 40
2
Notes:
1
1. The number of ways of resolving n into two factors is (a + 1)(b + 1)(c + 1), when n is not a perfect
2
1
square and {(a + 1)(b + 1)(c + 1) + 1}, when n is a perfect square.
2
2. Every number n has two improper divisors 1 and n itself and the remaining divisors are called proper
divisors. E.g., the number of proper divisors of 108 is 10.

The factorial of r is defined as the product of first r natural numbers. And is denoted as r!.
i.e., r! = 1.2.3.4… (r – 1).r
e.g., 1! = 1 2! = 2 3! = 6 4! = 24
5! = 120 6! = 720 7! = 5040 8! = 40320

NUMBER SYSTEM 8
OLYMPIAD BOOKLET

Simplify the following.

8! 10! 8! 15!
(a) (b) (c) (d)
5! 2!8! 3!5! 12!
8! 8  7  6  (5!)
Sol: (a) Given = = 8  7  6 = 336
5! (5!)
10! 10  9  (8!) 90
(b) Consider = = = 45
2!8! 2!(8!) 2
8! 8  7  6  5!
(c) Given = = 56
3!5! (3  2 1)  5!
15! 15 14 13  (12!)
(d) Given = = 15 14 13 = 2730
12! 12!

The product of k consecutive integers is always divisible by k!. e.g., (n + 1) (n + 2) (n + 3) (n + 4) is

divisible by 4!
Let Pn denote the product of k consecutive integers, the smallest of which is n. Then
Pn = n(n + 1)(n + 2)…(n + k – 1)
∴ Pn + 1 = (n + 1) (n + 2)…(n + k)
∴ nPn + 1 = (n + k) Pn = nPn + kPn
i.e., n(Pn + 1 – Pn) = kPn so that
Pn + 1 – Pn = k (Pn/n) …(i)
Now Pn/n = (n + 1)(n + 2)…(n + k – 1)
which is the product of (k – 1) consecutive integers beginning with n + 1. From (i), we find that, Pn + 1 –
Pn = k × product of (k – 1) consecutive integers.
Therefore if the product of (k – 1) consecutive integers is divisible by (k – 1)! then Pn + 1 – Pn = M(k!).
But P1 = k! so that P1 is divisible by k!. Consequently, P2P3…, Pn are all divisible by k!.
Since the product of every pair of consecutive integers is divisible by 2!, it follows by the principle of
finite induction that Pn is divisible by k! for all positive integers n.
Prove that for any natural number n, the number N = n2 + 1 is not divisible by 3.
Sol: The only possible remainders upon the division of a natural number by 3 are 0, 1, 1, 2. In solving this
problem, we therefore find it convenient to partition all the natural numbers into three classes; 3k, where
k is a natural number; 3k + 1, where k is a whole number, 3k + 2, where k is a whole number. If n = 3k,
we haven n2 + 1 = 9k2 + 1. Since the first term in the right member is divisible by 3 and the second one is
not, the number N is not divisible by 3 for these values of n.
If n = 3k + 1, then n2 + 1 = 9k2 + 6k + 2. It is obvious in this case that when N is divided by there is a
remainder of 2.
The case of n = 3k + 2 is considered in a similar manner.
Prove that n (n2 + 20) is divisible by 48 if n is even
Sol: n (n + 20) = n [n2 – 4 + 24] = n (n2 – 4) + n (24)
2

= n (n – 2) (n + 2) + 24n = 2k (2k – 2)(2k + 2) + 48k (where 2k = n)

= 8k (k – 1)(k + 1) + 48k = 8(k + 1) k(k – 1) + 48k
= 8(3!)m + 48k = 48m + 48k which is divisible by 48

NUMBER SYSTEM 9
OLYMPIAD BOOKLET

Aliter:
Let n = 2k, where k is an integer therefore N = 8k (k2 + 5)
If we show that for any integer k the number k (k2 + 5) is divisible by 6, it will be clear that N is divisible
by 48. Now, k (k2 + 5) = k (k2 – 1 + 6) = (k – 1) k(k + 1) + 6k, we see that 6k is divisible by 6. Here
(k – 1) k (k + 1) is a product of three successive integers and for this reason one of them is definitely
divisible by 3. Out of the two successive integers, one must definitely be even. Since 2 and 3 are
relatively prime, it follows that k (k2 + 5) is indeed divisible by 6 for any integer k.
Sum of cubes of three consecutive integers is always divisible by 9.
Sol: n3 + (n + 1)3 + (n + 2)3 = 3n3 + 1 + 3n(n + 1) + 8 + 6n(n + 2)
⇒ 3n (n2 + 3n + 5) + 9 = 3n[(n + 1)(n + 2) + 3] + 9
⇒ 3n(n + 1)(n + 2) + 9(n + 1) = 3.3!k1 + 9k2 = (9k)
If 4x –y is a multiple of 3, show that 4x2 + 7xy – 2y2 is divisible by 9.
Sol: Given 4x –y = 3k ⇒y = 4x – 3k
Now 4x2 + 7xy – 2y2 = 4x2 + 7x (4x – 3k) – 2(4x – 3k)2 = 4x2 + 28x2 – 21kx – 32x2 + 48kx – 18k2
= 27kx – 18k2 = 9k(3x – 2k)
So 9 | 4x2 + 7xy – 2y2
xn – yn is divisible by (x – y) ∀n ∈
Sol: Since putting x =y makes expression xn – yn = yn – yn = 0.
∴ x –y must be a factor in the above expression.
or xn – yn = (x – y) (xn–1 + xn–2y + y2xn–3 + … + yn–1)
e.g., x3 – y3 = (x – y) (x2 + xy + y2)
x4 – y4 = (x – y) (x3 + x2y + xy2 + y3) = (x – y)(x + y) (x2 + y2)
x5 – y5 = (x – y) (x4 + x3y + x2y2 + xy3 + y4)
Prove that 24n – 1 is always divisible by 15.
Sol: Consider 24n – 1 = (24)n – 1 = 16n – 1n = (16 – 1)k = 15k as xn – yn is divisible byx –y ∀x ∈
xn + yn is always divisible by (x + y) ∀ odd natural numbers n.
Sol: Since putting x = –y makes expression
xn + yn = yn + (–y)n = yn + (–1)nyn = yn – yn = 0
∴ x +y must be a factor in the above expression.
(xn + yn) = (x + y) (xn–1 – xn–2y + xn–3y2 – xn–4y3 + … + (–1)n–1yn–1)
x3 + y3 = (x + y) (x2 – xy + y2)
x5 + y5 = (x + y) (x4 – x3y + x2y2 – xy3 + y4)
x7 + y7 = (x + y) (x6 – x5y + x4y2 – x3y3 + x2y4 – xy5 + y6)
Prove that 710 – 210 is always divisible by 5, 9, 15, 45, 15783 and 17831.
Sol: Let x = 7 – 210 clearly (7 – 2) i.e., 5 divides x
10

at the same time we can observe that x can also be written as;
x = (72)5 – (22)5 = (49)5 – (4)5
therefore (49 – 4)/x i.e., 45/x. Again rearranging x as
x = (75)2 – (25)2 = (16807)2 – (1024)2 = (16807 + 1024) (16807 – 1024) = (17831) (15783)
so x is divisible by 17831 and 15783 both.

NUMBER SYSTEM 10
OLYMPIAD BOOKLET

Prove that 32n + 7 is a multiple of 8 .

Sol: 32n + 7 = 9n – 1 + 8 = (9 – 1) (9n–1 + 9n– 2 + … + 9 + 1) + 8 = 8 (9n–1 + 9n–2 + … + 9 + 2)
Clearly divisible by 8.

Least Common Multiple (LCM): LCM of set of numbers is the smallest number (integer/rational) which
is completely divisible by each of them. i.e. x is said to be LCM of y and z iffy divides x, z also divides x and x is
least positive of all such numbers.
e.g., To find LCM of 6, 4, 9. Let us define Nk be set of multiples of k, therefore
N4 = {4x :x ∈ N} = {4, 8, 12, …, 36, …}
N6 = {6x :x ∈ N} = {6, 12, 18, …, 36, …}
N9 = {9x :x ∈ N} = {9, 18, 27, 36, …}
⇒ Set of common multiples N4 ∩ N6 ∩ N9 = {36, 72, 108, …}
Hence least common multiple is 36.
   
Let x and y be two given integers x = pα.qβ.rγ.sδ and y = p  q  r  s where p, q, r, are primes.
1 1 1 1

If z is LCM of x and y then

 z = p max( ,1 )  q max(,1 )  r max(  ,1 )  s max(,1 )

(a) If x and y are co-prime then LCM (x and y) = x.y

(b) LCM (x and y) = LCM (y and x) commutative
(c) LCM of a rational and an irrational number does not exists.
a c LCM(a and c)
(d) LCM of and =
b d HCF(b and d )
a c e
Proof: Let the common multiple of & be where each of the above fractions are in lowest form
b d f
a e c e e b e d
and    and  
⇒ b f d f f a f c
⇒ e is L.C.M. of a and c where as f is H.C.F. of b and d.
 a c  e LCM(a and c)
⇒ LCM  ,  = =
 b d  f HCF(b and d )
a c  e LCM(a and c)
 LCM  ,  = min =
 b d  f max HCF(b and d )
Find the LCM of
(a) (2, 4, 6, 12, 5) (b) (π/2, π/3, π, 2π) (c) (2, π, π/3)
Sol: (a) 2 = 2 × 1, 4 = 2 × 2, 6 = 2 × 3, 12 = 2 2 × 3, 5 = 1 × 5 hence common multiple is 2 2 × 3 × 5 = 60
(b) Writing down multiples of π/2, π/3, π and 2π, we can easily see that the common multiples are 2π,
4π, 6π, … etc., so the least common multiple is 2π.
(c) Writing down multiples of 2, π and π/3 we can observe
N2 = {2, 4, 6, 8, …}; Nπ/3 = {π/3, 2π/3, π …; Nπ = {π, 2π, 3π…}
there is no common multiple, So LCM does not exist.

NUMBER SYSTEM 11
OLYMPIAD BOOKLET

Find the LCM of following set of numbers

(a) 1800, 1008, 1080 (b) 30/28, 35/21 (c) 3 2, 4
Sol: (a) consider the set of numbers in prime factorized form
1800 = 23 × 32 × 52; 1008 = 23 × 32 × 7; 1080 = 23 × 32 × 5
Clearly the LCM of 1800, 1008, 1080 is 2 3 × 32 × 5 × 7.
i.e. 2520.
30 15 35 5
(b) Considering the fractions in lowest form, = and =
28 14 21 3
LCM (15 & 5)
therefore LCM = = 15
HCF (14 & 3)
(c) Multiples of 3 2 are irrationals where as all multiples of 4 are integers therefore common
multiples do not exists and hence no LCM.
Find the G.C.D of 6 and 24.
Sol: The G.C.D of 6 and 24 is 6, because 6 | 6 and 6 | 24 and every common divisor of 6 and 24 also divides
6. Thus (6, 24) = 6
Prove that two consecutive integers are always co-prime.
Sol: Let n and n + 1 be two consecutive integers.
Let (n, n + 1) = d
∴ d|n + d|n + 1
∴ d | (n + 1) – n or d | 1
∴ d=1
∴ (n, n + 1) = 1
i.e., n and (n + 1) are relatively prime.
Show that gcd of a + b and a – b is either 1 or 2 if (a, b) = 1.
Sol: Let (a + b, a – b) = d
∴ d/(a + b) and d/(a – b)
∴ d/(a + b + a – b) and d/(a + b) – (a – b) or d/2a and d/2b.
i.e., d is a common divisor of 2a and 2b.
∴ d/(2a, 2b) [By definition of gcd]
i.e., d/2(a, b) [ (ma, mb) = m(a, b)]
But a, b = 1
∴ d/2
∴ d = 1 or d = 2
Find the least number that when divided by 6, 7, 8, 9 and 10 leaves remainder 1.
Sol: As the remainder is same
Required number = LCM of divisors + remainder = LCM
(6, 7, 8, 9, 10) + 1 = 2520 + 1 = 2521

NUMBER SYSTEM 12
OLYMPIAD BOOKLET

A number N when factorized can be written N = a4 × b3 × c7. Find the number of perfect
squares which are factors of N (the three prime numbers a, b, c > 2).
Sol: In order that the perfect square divides N, the powers of 'a' can be 0, 2 or 4, i.e., 3.
Powers of 'b' can be 0, 2, i.e., 2. Power of 'c' can be 0, 2, 4 or 6, i.e., 4.
Hence, a combination of these powers given 3 × 2 × 4 i.e., 24 numbers.
So, there are 24 perfect squares that divides N.

If a and b are any two integers, a ≠ 0, then there exist unique integers q and r such that b = aq + r, 0 ≤ r < |a|
b, a, q and r are called dividend, divisor, quotient and remainder respectively.
When the numbers 19779 and 17997 are divided by a certain three digit number, they leave
the same remainder. Find this largest such divisor and the remainder. How many such divisors are there?
Sol: Let the divisor be d and the remainder be r.
Then by Euclidean Algorithm, we find
19779 = dq1 + r …(1)
and 17997 = dq2 + r …(2)
By subtracting Eq. (2) from Eq. (1), we get
1782 = d (q1 – q2)
∴ d is a three-digit divisor of 1782.
Therefore, possible values of d are 891, 594, 297 and 198, 162.
Hence, the largest three-digit divisor is 891 and the remainder is 177.

The Chinese Remainder Theorem (CRT) is a powerful tool in number theory and modular arithmetic
that provides a solution to systems of simultaneous congruences. The theorem is particularly useful for solving
problems where we need to find an integer that satisfies several different modular conditions.

The Chinese Remainder Theorem states that if n1, n2, …, nk are pairwise coprime integers (i.e., the
greatest common divisor of any two of them is 1), and a1, a2, …, ak are integers, then the system of
simultaneous congruences:
x ≡ a1 (mod n1)
x ≡ a2 (mod n2)
⋮
x ≡ ak (mod nk)
has a unique solution modulo N = n1 × n2 × … × nk.
In other words, there exists an integer x that satisfies all the congruences simultaneously, and the solution
is unique modulo N.

The existence of a solution is guaranteed by the Chinese Remainder Theorem when the moduli are
pairwise coprime. The uniqueness of the solution means that, while there may be many integers that
satisfy the congruences, all of them are congruent to each other modulo N.
Thus, the solution is uniquely determined modulo N, where N = n1 × n2 × … × nk.

NUMBER SYSTEM 13
OLYMPIAD BOOKLET

The solution to the system can be found using the method of successive substitution or by explicitly
solving for x using a combination of the moduli. Here is a step-by-step procedure to find the Sol:
1. Find the product N:
N = n1 × n2 × … × nk
2. For each modulus ni, compute Ni, the product of all nj except ni :
N
Ni =
ni
3. For each Ni, find its modular inverse mi modulo ni :
mi ≡ Ni–1 (mod ni)
This inverse exists because ni and Ni are coprime by construction.
4. Construct the solution as:
k
x   ai  Ni  mi (mod N)
i =1

Here, mi is the modular inverse of Ni modulo ni, and ai are the given remainders in the system of
congruences.
Solving a Simple System of Congruences
Sol: Let's solve the following system of congruences:
x≡2 (mod 3)
x≡3 (mod 5)
x≡1 (mod 7)
Step 1: Compute N: N = 3 × 5 × 7 = 105.
Step 2: Compute Ni for each modulus:
N 105
• For n1 = 3, N1 = = = 35.
3 3
N 105
• For n2 = 5, N2 = = = 21.
5 5
N 105
• For n3 = 7, N3 = = = 15.
7 7
Step 3: Find the modular inverses mi for each Ni :
• For N1 = 35, we need to find m1 such that 35m1 ≡ 1 (mod 3). Since 35 ≡ 2 (mod 3), we solve 2m1 ≡
1 (mod 3). The inverse of 2 modulo 3 is 2, so m1 = 2.
• For N2 = 21, we need to find m2 such that 21m2 ≡ 1(mod 5). Since 21 ≡ 1 (mod 5), we have m2 = 1.
• For N3 = 15, we need to find m3 such that 15m3 ≡ 1 (mod 7). Since 15 ≡ 1(mod 7), we have m3 = 1.
Step 4: Construct the Sol:
Now, we can compute x as: x ≡ (2 · 35 · 2) + (3 · 21 · 1) + (1 · 15 · 1) (mod 105)
Calculating each term: x ≡ 140 + 63 + 15 (mod 105)
Now simplify: x ≡ 218 (mod 105)
Finally, reduce modulo 105: x ≡ 218 – 2 × 105 = 218 – 210 = 8 (mod 105)
Thus, the solution to the system is x ≡ 8(mod 105).

NUMBER SYSTEM 14
OLYMPIAD BOOKLET

Solving a System with Larger Moduli

Consider the following system of congruences:
x≡1 (mod 4),
x≡2 (mod 5),
x≡3 (mod 7)
Follow the same steps to solve this system, first computing N = 4 × 5 × 7 = 140, then finding the values
of Ni, computing the modular inverses, and constructing the solution as in Example 1.

The Chinese Remainder Theorem has wide-ranging applications, including:

• Cryptography: CRT is used in RSA encryption, where large integers are factored modulo smaller
primes for efficient computation.
• Computer Science: CRT is employed in algorithms that require large number operations, such as
fast multiplication of large numbers.
• Coding Theory: CRT can be used in error detection and correction, helping to find solutions to
systems of linear congruences.
• Clock Arithmetic: CRT provides a way to solve problems in modular arithmetic with multiple
moduli, which can be useful in solving time-based problems in clock arithmetic.
Solve the following system of congruences:
x≡2 (mod 3)
x≡3 (mod 5)
Solve the system of congruences:
x≡1 (mod 4),
x≡3 (mod 5),
x≡2 (mod 7)
Solve the following system:
x≡1 (mod 6),
x≡2 (mod 9),
x≡3 (mod 15)
Solve the system:
x≡4 (mod 6),
x≡5 (mod 8)
(Hint: The moduli 6 and 8 are not coprime, so the system might not have a solution. Check if the
Chinese Remainder Theorem can be applied directly.)
Solve the following system of congruences:
x≡7 (mod 11)
x ≡ 10 (mod 13),
x≡4 (mod 17)
You have three clocks with periods 6, 7, and 8 hours. The clocks show the following times when viewed
at the same moment:
• Clock 1 shows 2 hours past 12.
• Clock 2 shows 4 hours past 12.
• Clock 3 shows 5 hours past 12.

NUMBER SYSTEM 15
OLYMPIAD BOOKLET

What time (in hours past 12) will all three clocks show at the same moment in the future?
Solve the system of congruences:
x≡3 (mod 7),
x≡2 (mod 11)
Then, compute 2x mod 77 (where 77 = 7 × 11).
A factory produces items in batches. The production times for three machines are as follows:
• Machine 1 completes a batch every 5 hours.
• Machine 2 completes a batch every 7 hours.
• Machine 3 completes a batch every 9 hours.
If all machines started working at the same time, after how many hours will they all complete a batch
simultaneously again?
Solve the system of congruences:
x≡1 (mod 4),
x≡2 (mod 9),
x≡3 (mod 16)
Solve the system:
x≡4 (mod 5)
x≡7 (mod 11)
Then, verify your solution by computing the modular inverse of 5 modulo 11 and checking the solution
step by step.
Solve the following system of congruences:
x≡3 (mod 6),
x≡5 (mod 9)
x≡7 (mod 12)
Solve the following system:
x≡5 (mod 8),
x≡4 (mod 9),
x≡7 (mod 11)
Solve the following system, if possible:
x≡1 (mod 6)
x≡1 (mod 12)
Does the Chinese Remainder Theorem apply here? If not, explain why.
Solve the system:
x≡4 (mod 10)
x≡3 (mod 14)
Does the system have a solution? If yes, find it. If not, explain why.
Solve the system:
x≡1 (mod 3)
x≡2 (mod 4)
x≡3 (mod 5)
Then, find 3x mod 60 (where 60 = 3 × 4 × 5).

NUMBER SYSTEM 16
OLYMPIAD BOOKLET

Solve the system of congruences:

x≡2 (mod 3),
x≡5 (mod 4),
x≡7 (mod 6).
Then determine the smallest x that satisfies all the congruences.
Solve the system of congruences:
x≡2 (mod 5)
x≡3 (mod 7)
x≡4 (mod 11)
Sol: Step 1: Compute N = 3 × 5 = 15.
15 15
Step 2: Compute N1 = = 5 and N2 = =3
3 5
Step 3: Find the modular inverses:
• N1 = 5, find m1 such that 5m1 ≡ 1 (mod 3). Since 5 ≡ 2 (mod 3), we need 2m1 ≡ 1 (mod 3). The
inverse of 2 modulo 3 is 2, so m1 = 2.
• N2 = 3, find m2 such that 3m2 ≡ 1 (mod 5). Since 3 ≡ 3 (mod 5), we need 3m2 ≡ 1 (mod 5). The
inverse of 3 modulo 5 is 2, so m2 = 2.
Step 4: Solve for x:
x ≡ (2 · 5 · 2) + (3 · 3 · 2) (mod 15)
x ≡ 20 + 18 (mod 15)
x ≡ 38 (mod 15)
x≡8 (mod 15)
Answer: x ≡ 8 (mod 15)
Sol: Step 1: Compute N = 4 × 5 × 7 = 140.
140 140 140
Step 2: Compute N1 = = 35, N2 = = 28, and N3 = = 20.
4 5 7
Step 3: Find the modular inverses:
• For N1 = 35, find m1 such that 35m1 ≡ 1 (mod 4). Since 35 ≡ 3 (mod 4), solve 3m1 ≡ 1 (mod 4). The
inverse of 3 modulo 4 is 3, so m1 = 3.
• For N2 = 28, find m2 such that 28m2 ≡ 1 (mod 5). Since 28 ≡ 3 (mod 5), solve 3m2 ≡ 1 (mod 5). The
inverse of 3 modulo 5 is 2, so m2 = 2.
• For N3 = 20, find m3 such that 20m3 ≡ 1 (mod 7). Since 20 ≡ 6 (mod 7), solve 6m3 ≡ 1 (mod 7). The
inverse of 6 modulo 7 is 6, so m3 = 6.
Step 4: Solve for x:
x ≡ (1 · 35 · 3) + (3 · 28 · 2) + (2 · 20 · 6) (mod 140)
x ≡ 105 + 168 + 240 (mod 140)
x ≡ 513 (mod 140)
x ≡ 93 (mod 140)
Answer: x ≡ 93(mod 140).
Sol: Step 1: Compute N = 6 × 9 × 15 = 810.
Step 2: Compute N1 = 810 = 135, N 2 = 810 = 90, and N3 = 810 = 54.
6 9 15

NUMBER SYSTEM 17
OLYMPIAD BOOKLET

Step 3: Find the modular inverses:

• For N1 = 135, find m1 such that 135m1 ≡ 1 (mod 6). Since 135 ≡ 3 (mod 6), solve 3m1 ≡ 1 (mod 6).
The inverse of 3 modulo 6 is 3, so m1 = 3.
• For N2 = 90, find m2 such that 90m2 ≡ 1 (mod 9). Since 90 ≡ 0 (mod 9), there is no modular inverse,
so there is no solution to the system.
Answer: No solution.
Sol: Step 1: Check if the moduli 6 and 8 are coprime.
Since gcd (6, 8) = 2, the system is not solvable because the Chinese Remainder Theorem requires the
moduli to be coprime.
Answer: No solution.
Sol: Step 1: Compute N = 11 × 13 × 17 = 2431.
2431
Step 2: Compute N1 = 2431 = 221, N 2 = 2431 = 187 and N3 = = 143.
11 13 17
Step 3: Find the modular inverses:
• For N1 = 221, find m1 such that 221m1 ≡ 1 (mod 11). 221 ≡ 1 (mod 11), so m1 = 1.
• For N2 = 187, find m2 such that 187m2 ≡ 1 (mod 13). 187 ≡ 5 (mod 13), so 5m2 ≡ 1 (mod 13). The
inverse of 5 modulo 13 is 8, so m2 = 8.
• For N3 = 143, find m3 such that 143m3 ≡ 1 (mod 17). 143 ≡ 7 (mod 17), so 7m3 ≡ 1 (mod 17). The
inverse of 7 modulo 17 is 5, so m3 = 5.
Step 4: Solve for x:
x ≡ (7 · 221 · 1) + (10 · 187 · 8) + (4 · 143 · 5) (mod 2431)
x ≡ 1547 + 14960 + 2860 (mod 2431)
x ≡ 19367 (mod 2431)
x ≡ 915 (mod 2431)
Answer: x ≡ 915 (mod 2431)
This problem is asking for a solution to the system:
x≡2 (mod 6),
x≡4 (mod 7),
x≡5 (mod 8)
By applying the Chinese Remainder Theorem (as described in earlier problems), the solution is:
Answer: x ≡ 66 (mod 168).
Therefore, all clocks will show the same time 66 hours past 12.

The Diophantine equation is the polynomial equation which the coefficients are integers and
Diophantine equations whose solutions we seek in the set of integers or natural numbers. The most basic
Diophantine equation is the linear case. We can write ax + by = c where a, b, c ∈ .

NUMBER SYSTEM 18
OLYMPIAD BOOKLET

Let a, b, and c be integers with a and b not both zero. The linear Diophantine equation ax +
by = c has a solution if and only if d = (a, b) divides c.
Sol: (⇒) Suppose that x0 and y0 is a solution. Then ax0 + by0 = c. Since d | a and d | b, we get that d | ax0 + by0
and d | c.
(⇐) Suppose that d | c. then c = dk where k is an integer. We already know that by Theorem 2.1.5 (a, b)
can be written as a linear combination of a and b. So, there exist u, v ∈  with au + bv = d. Hence a (uk)
+ b (vk) = dk = c. So the equation ax + by = c has a solution (namely x = uk, y = vk).
Find the solution of 155x + 45y = 7. First, we must find (155, 45) = ?
Sol: (155, 45) = 5
5 and 7 relatively prime. So we can't find a solution. Because, there is no solution.
Let a and b integers with d = (a, b). The equation ax + by = c has no integral solutions if d
doesn't divide c. If d | c, then there are infinitely many integral solutions. Moreover, if x = x0,y = y0 is a
b a
particular solution of the equation, then all solutions are given by x = x0 + n, y = y0 − n, where N is an
d d
integer.
Sol: We already know that there is a solution if and only if d | c by Theorem 2.3.1.
For the second part of the theorem, let x0, y0 be a particular solution ax0 + by0 = c.
bn an
If we put x = x0 + , y = y0 −
d d
where N is any integer, then
 bn   an 
ax + by = a  x0 +  + b  y0 −  = ax0 + by0 = c,
 d   d 
so x, y are also solution.
We know from the previous Theorem 2.3.1., x and y integers since d divides b and a. This gives us many
solutions, for different integers N. Let's show that these are any solution; x, y be any integer solution, so
ax + by = c. Since ax + by = c = ax0 + by0 we have a (x – x0) + b (y – y0) = 0,
so dividing by d we get
a b
( x − x0 ) = − ( y − y0 ) …(2)
d d
b
Now, a and b aren't both 0, assume that b ≠ 0. If we divide both the sides with and since
d
a b b bn
 ,  = 1, divides x – x0 (by k | pr and (k, p) = 1, then k | r). Thus x – x0 = for some integer N, so
d d  d d
bn
x = x0 + .
d
Substituting back for x – x0 in (2) we obtain;
b a a bn
− ( y − y0 ) = ( x − x0 ) = ·
d d d d
b an
So dividing by (which is nonzero) we have y = y0 −
d d

NUMBER SYSTEM 19
OLYMPIAD BOOKLET

Let the equation be 60x + 33y = 9. And we will find all solution to 60x + 33y = 9.
So, a = 60, b = 33, c = 9 and (60, 33) = 3, we can see 3 | 9. So we can search for solutions.
Sol: First, we use Euclidean algorithm
60 = 1 · 33 + 27
33 = 1 · 27 + 6
27 = 4 · 6 + 3
6=2·3+0
We see the last nonzero remainder is 3 so (60, 33) = 3.
Reverse by step
3 = 27 – 4 · 6 = 27 – 4 · (33 – 27) = 5 · 27 – 4 · 33 = 5 · (60 – 33) – 4 · 33 = 5 · 60 – 9 · 33
So we take u = 5 and v = –9. One solution is then,
9
x0 = 5 · = 15
3
9
y0 = −9 · = – 27
3
All the solutions are given by
33n
x = 15 +  x = 15 + 11n
3
60n
y = −27 −  y = −27 − 20n
3
where n ∈ .
Now, we can extend the Theorem 2.3.2 with more than two variables.
If a1, a2, …, an are non zero positive integers, then the equation a1x1 + a2x2 + …+ anxn = c
has an integral solution if and only if d = (a1, a2, …, an) divides c. Furthermore, when there is a solution, there
are infinitely many solutions.
Sol: Suppose that d = (a1, a2, …, an) and d | c, we have many solutions. Let's use the mathematical induction.
For n = 2 we know that how we can find the solution of linear Diophantine equation by Theorem 2.3.2.
Suppose that there are infinitely many solutions for the equation in n = k variables, then we can write
a1x1 + a2x2 + … + akxk = c and d | c.
The original equation in n = k + 1 variables can be reduced to a linear Diophantine equation in n
variables. The equation in n = k + 1 variables; a1x1 + a2x2 + … + akxk + ak + 1xk + 1 = t and d | t then, t = dp.
By Theorem 2.1.5., the set of linear combinations akxk + ak + 1xk + 1 is the same as the set of multiplies of
(ak, ak + 1). So, for every integer p there are many solutions of the linear Diophantine equations akxk +
ak + 1xk + 1 = (ak, ak + 1)p. Then, the equation reduced to k variables.
a1x1 + a2x2 + … + ak – 1x k – 1 + (ak, a k – 1)p = c
By Theorem 2.1.6. c is divisible by (a1, a2, …, ak + 1, (ak, ak + 1)), this gcd equals (a1, a2, …, ak, ak + 1).
By the inductive hypothesis, this equation has many solution (it is also a linear Diophantine equation has
n variables) because gcd of a1}, a2, …, an, an + 1 divides c. We completed our proof and we see there are
many solutions to the original equation.
Let's illustrate the theorem:

NUMBER SYSTEM 20
OLYMPIAD BOOKLET

We will find the solutions of 4x + 8y + 5z = 7

Sol: First we find (4, 8) = 4, then;
(4, 8)(x + 2y) + 5z = 7 and if we say x + 2y = w
4w + 5z = 7
5=4·1+1
4=1·4+0
The (4, 5) = 1 and 1 divides 7, there are many solutions.
1=5–4·1
w0 = –1, z0 = 1
Its general solution is
w = –7 + 5k
z = 7 – 4k
Next we find x and y
x + 2y = –7 + 5k
(1, 2) | (– 7 + 5k), the equation is solvable and the solution is
x = 1 · (– 7 + 5k) + 2p
y = 0 ·(– 7 + 5k) – p
z = 7 – 4k
where p ∈  is another parameter.
k, p = 0, ±1, ±2, …
If we want to solve in different way;
4x + 8y + 5z = 7
4x + (8, 5)(8y + 5 z) = 7
Assume that 8y + 5z = t
4x + t = 7
x0 = 0 and t0 = 1.
Then, x = s
t = 7 – 4s
We said that 8y + 5z = t and we found t = 7 – 4s, so we can write 8y + 5z = 7 – 4s.
(8, 5) | 7 – 4s so there is a solution.
8=5·1+3
5=3·1+2
3=2·1+1
2=1·2+0
And by extended Euclidean algorithm;
1 = 3 – 2 · 1 = 3 – (5 – 3) = 2 · 3 – 1 · 5 = 2 ·(8 – 5) – 5 = 2 · 8 – 3 · 5
Hence we find y0 = 2, z0 = – 3.
x=s
y = 2 ·(7 – 4s) + 5m = 14 – 8s + 5m
z = – 3 · (7 – 4s) – 8m
= – 21 + 12s – 8m
where s, m are the integers.

NUMBER SYSTEM 21
OLYMPIAD BOOKLET

And then we have two different systems of equation with different parameters
x = – 7 + 5k + 2p
y=–p
z = 7 – 4k
and for the second system
x=s
y = – 8s + 5m
z = 12 – 8m
Let's find the s, m in terms of k, p from the two systems; For x
x = – 7 + 5k + 2p and x = s.
Then, s = 5k + 2p – 7
For y we have;
y = – p and y = 14 – 8s + 5m
– p = 14 – 8s + 5m
If we put s = 5k + 2p – 7 we get;
15 p − 70 + 40k
– p = 14 – 40k – 16p + 56 + 5m  m = = 3 p + 8k − 14
5
and if we put these values (s and m)in the z equality, we will see;
z = 7 – 4k, z = – 21 + 12s – 8m
Put the values of s and m in terms of k and p
7 – 4k = – 21 + 12 (– 7 + 5k + 2p) – 8(3p – 14 + 8k)
Hence, we get
7=7
So, our equality is always true.
Now, we have
s = – 7 + 5k + 2p
m = 3p – 14 + 8k
We reduced the our equation system to two parameter as k and p.

Clara wants to buy pizza and cola to her family. She has 400 SEK.
If we know that each pizza 57 SEK and each bottle of cola cost 22 SEK, how many pizzas and bottles of
cola she can buy?
Sol: We can write the equation as the linear Diophantine equations
57x + 22y = 400
Let's find the GCD of 57 and 22 using the Euclidean algorithm;
57 = 22 · 2 + 13
22 = 13 · 1 + 9
13 = 9 · 1 + 4
9=4·2+1
4=1·4+0
So, the last non zero remainder 1 and (57, 22) = 1 and 1 | 400, there are many solutions.

NUMBER SYSTEM 22
OLYMPIAD BOOKLET

1 = 9 – 4 · 2 = 9 – 2 ·(13 – 9) = 3 · 9 – 2 · 13 = 3 ·(22 – 13) – 2 · 13

= 3 · 22 – 5 · 13 = 3 · 22 – 5 ·(57 – 2 · 22) = 13 · 22 – 5 · 57
We can find x0* = – 5 and y0* = 13 ⇒ x0 = 400 · (– 5) = – 2000 and y0 = 400 · 13 = 5200
We write the general solution;
x = – 2000 + 22n
y = 5200 – 57n
x ≥ 0 and y ≥ 0. Because x and y determine the number of pizzas and bottles of colas. That's why x and y
can't be negative.
5200 – 57n ≥ 0 then 5200 ≥ 57n, if divide both sides by 57, we find n ≤ 91. – 2000 + 22n ≥ 0, so 22n ≥
2000, divide both sides by 22, we get n ≥ 90, 9 ≅ 91, so N = 91.
If we put n = 91 in general solution we find x = – 2000 + (22 · 91) = 2 and y = 5200 – (57 · 91) = 13, so
she can buy 2 pizza and 13 bottles of cola.
Assume that, there is discount for some stuffs in the restaurant and the pizza's price
changed from 57 SEK to 55 SEK. How many pizzas and bottles of cola she can buy?
Sol: 55x + 22y = 400
Using the Euclidean algorithm;
55 = 22 · 2 + 11
22 = 11 · 2 + 0
(55, 22) = 11 and 11 doesn't divide 400. So there is no solution.
Peter wants to buy pets. He has 151 euros and he must choose at least one of each pet. The
prices are; fishes 3 euro each, cats are 5 euro each, dogs are 10 euros each. How many fishes, cats and dogs he
can buy?
Sol: 3x + 5y + 10z = 151
If we use the same method which have been used in Example 2.3.3, then we write
(3, 5) 3x + 5y + 10z = 151 and 3x + 5y = v.
v + 10z = 151
The general solutions are given by
v = 151 + 10t
z = –t
And we assumed that 3x + 5y = v and then 3x + 5y = 151 + 10t;
The general solution
x = 47 + 5k
y = 2 + 2t – 3k
where t, k ∈ .
x, y, z should be bigger than zero, so we can find the ranges for t and k.
47 + 5k > 0
2 + 2t – 3k > 0
–t>0
If we calculate the ranges, we find;
k > – 10,
2t – 3k > – 2,
t>0

NUMBER SYSTEM 23
OLYMPIAD BOOKLET

Now, we should find the ranges. For example, consider 2t – 3k > – 2 and we know that t a is negative
parameter. So, if we put t = – 1 in 2t – 3k > – 2, it is equal to (2 · – 1) – 3k > – 2 and k < 0. So, the ranges
for k should be –10 < k < 0 and let's continue to process, if we choose t = – 2, the inequality will be k < 0
again, and for t = – 3, it will be k < – 2 and if we continue that calculation when we reach t = – 16, we
will get k < – 10 and it will be wrong, because k should be bigger than – 10 . So, range for t should be
–16 < t ≤ – 1. And the ranges are;
–10 < k < 0,
–16 < t ≤ – 1
If we choose t = – 14, k can be only equal to – 9, and if we put those values on the x, y, z equation, we
find x = 47 + 5(– 9) = 2, y = 2 + 2(– 14) – 3(– 9) = 1 and z = – (– 14) = 14. So he can buy 2 fishes, 1 cat
and 14 dogs and he pays 151 euros. If we choose the t values according to range, then k depends on t.
We will find that how many solutions are there for these equations after the theorem for solving linear
congruence in n variables.

For a positive integer d that is not a square, an equation of the form x2 – dy2 = 1 is called Pell's equation.
We are interested in x and y that are both integers, and the term "solution" will always mean an integral solution.
The obvious solutions (x, y) = (±1, 0), are called the trivial solutions. They are the only solutions where x = ±1
or y = 0 (separately). Solutions where x > 0 and y > 0 will be called positive solutions. Every nontrivial solution
can be made into a positive solution by changing the sign of x or y.
We don't consider the case when d is a square, since if d = c2 with c ∈ then x2 – dy2 = x2 – (cy)2 and the
only squares that differ by 1 are 0 and 1, so x2 – (cy)2 = 1 ⇒ x = ±1 and y = 0. Thus Pell's equation for square d
only has trivial solutions.
2. Examples of Solutions
To find a nontrivial solution of x2 – dy2 = 1 by elementary methods, rewrite the equation as x2 = dy2 + 1
and then set y = 1, 2, 3, … until you reach a value where dy2 + 1 is a perfect square. Call that value x2
and then we have a solution (x, y).
Two positive solutions of x2 – 2y2 = 1 are (3, 2) and (17, 12), since 2y2 + 1 is a square when
y = 2 and 12, where it has values 9 = 32 and 289 = 172. See below.
y 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

2y2 + 1 3 9 19 33 51 73 99 129 163 201 243 289 339 393 451

Square? × ✓ × × × × × × × × × ✓ × × ×

Three positive solutions of x2 – 3y2 = 1 are (2, 1) and (7, 4), and (26, 15), as shown by the
table below.
y 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

3y2 + 1 4 13 28 49 76 109 148 193 244 301 364 433 508 589 676

Square? ✓ × × ✓ × × × × × × × × × × ✓

NUMBER SYSTEM 24
OLYMPIAD BOOKLET

The number system that we work in is called the 'decimal system'. This is because there are 10 digits in
the system 0 – 9. There can be alternative system that can be used for arithmetic operations. Some of the most
commonly used systems are: binary, octal, and hexadecimal.
These systems find applications in computing.
Binary system [2] has 2 digits: 0, 1.
Octal system [8] has 8 digits: 0, 1, …, 7.
Hexadecimal system [16] has 16 digits: 0, 1, 2, …, 9, A, B, C, D, E, F
After 9, we use the letters to indicate digits. For instance, A has a value 10, B has a value 11, C has a
value 12, … so on in all base systems.
The counting sequences in each of the systems would be different though they follow the same principle.

Conversion of numbers from

(i) decimal system to other base system.
(ii) other base system to decimal system.
Express 2910 in base 2, base 3 and base 5 systems.
Sol: We can write 2910 as (29)10 = 24 + 23 + 22 + 1 = 1.24 + 1.23 + 1.22 + 0.2 + 1 = (11101)2
2 29
2 14,1 = a0
2 7,1 = a1
or
2 3,1 = a2
2 1,1 = a3
0,1 = a4
(29)10 = (11101)2
(29)10 = 33 + 2 = 1.33 + 0.32 + 0.32 + 2 = (1002)3
3 29
3 9, 2 = a0
or 3 3,0 = a1
3 1,0 = a2
0,1 = a3
(29)10 = (1002)3
(29)10 = 52 + 4 = 1.52 + 0.5 + 4 = (104)5
5 29
5 5, 4 = a0
or
5 1,0 = a1
0,1 = a2

NUMBER SYSTEM 25
OLYMPIAD BOOKLET

∴ (29)10 = (104)5
dividend
Note that divisor
quotient, remainder
Express (1042)10 in base 12 system.
Sol: In base 12 we have 12 numerals. We take them as 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, where
A = (10)10
B = (11)10
12 1042
12 86,10 = a0
12 7, 2 = a1

0,7 = a2
∴ (1042)10 = (72A)12
A three-digit number in base 11, when expressed in base 9, has its digits reversed. Find the
number.
Sol: (xyz)11 = (zyx)9
112x + 11y + z = 92z + 9y + x
⇒ 120x + 2y – 80z = 0
⇒ 60x +y – 40z = 0
⇒ 40z – 60x = y
⇒ 20(2z – 3x) = y
So 20 | y, but as 0 ≤ y < 9, y = 0
Therefore, 2z = 3x. As 0 ≤ x, z < 9, the solutions are x = 2, z = 3 and x = 4, z = 6.
Thus the two possible solutions are (203)11 and (406)11.
Show that N = (1 2 3 4 3 2 1)b written in base b, b > 4 is a square number for all b.
Sol: (1 2 3 4 3 2 1)b in the expanded notation is b6 + 2b5 + 3b4 + 4b3 + 3b2 + 2b + 1, b > 4.
Now, N = (b3 + b2 + b + 1)2.
This is true for all real number b and hence, is true for all b > 4, b ∈ N also.
If 10025 – 25 is written in decimal notation, find the sum of its digits.
Sol: Since 100 = (102)25 = 1050 = 10000 … 0 (50 zeroes)
25

10025 – 25 = 1050 – 25 = 1000000 − 25 = 9999975

(48 nines)
(50 zeroes)

So the sum of its digits = 48 × 9 + 12 = 432 + 12 = 444.

When the numbers from 1 to n are written in decimal notation, it is found that the total
number of digits in writing all these is 1998. Find n.
Sol: To write the first nine single-digit number from 1 to 9, both inclusive the number of digits used = 9.
To write the two-digit numbers from 10 to 99, number of digits used = (99 – 9) × 2 = 180.
So, the number of digits used to write numbers from 1 to 99 is 189.
Total number of digits used in writing up to n is 1998.
The total number of digits used in writing all the three-digit numbers = (999 – 99) × 3 = 2700 > 1998.
So, n should be less than 999.

NUMBER SYSTEM 26
OLYMPIAD BOOKLET

Number of digits used to write the three-digit numbers up to n is 1998 – 189 = 1809.
In each three-digit number, we use three digits.
1809
So, the number of three-digit numbers in n = = 603
3
Therefore, n = 100 + (603 – 1) · 1 = 702.
Find the smallest natural number n, which has the following properties:
(a) Its decimal representation has 6 as the last digit.
(b) When its last digit is removed and placed in front of the remaining digits, the resulting number is
four times the original number.
Sol: If a, b, c, d, …, k are the digits of a number written in decimal system, abcd…lk, then
10(abcd…l) + k = abcd…lk = 100 (abcd…) + (lk), etc.
Now, let the unit digit of the number be 6 and all the other digits on the left of 6 is taken as x, then the
number is x 6.
When 6 is written in front, the number becomes 6 x and it is equal to 4 × x6.
Note: 6x is not 6 × x, here 6 is the extreme left digit of the number.
If 6x is a two-digit number, then 6x = 60 + x, if it is a three-digit number, then x is the last two digits of
6x and 6x = 600 + x, because 6 is in the hundreds place.
Similarly, if it is a four-digit number, 6x is 6000 + x and thus, 6x = 60 + x or 600 + x, or 6000 + x and so
on, according to the number of digits in x (i.e., the place value of 6 may be 10, 10 2, 103 or 104 …
according to the number of digits of the given number.)
However, x6 = 10x + 6, whatever be the number of digits x has.
Thus, 4 × x6 = 4(10x + 6) = 6x = 6 × 10k + x
where k is the number of digits in x
39x = 6 × 10k – 24
13x = 2 × 10k – 8
To find the smallest value for x, we need to find the smallest power k for which 13 | (2 × 10k – 8),
i.e., 2 × 10k ≡ 8 (mod 13) or 10k ≡ 4 (mod 13)
As 10 ≡ – 3 (mod 13)
⇒ 102 ≡ 9 (mod 13) ≡ – 4 (mod 13)
⇒ 104 ≡ 16 (mod 13) ≡ 3 (mod 13)
⇒ 105 ≡ – 9 (mod 13) ≡ 4 (mod 13)
∴ 13 | 2 × 105 – 8
200000 − 8 199992
So, x has 5 digits and is given by = = 15384.
13 13
∴ The given number is 153846.
Clearly, 615384 = 153846 × 4.
If p is prime, then (a + b)p = (ap + bp) mod p.
Sol: Expanding by binomial theorem
(a + b)p = ap + pC1ap – 1b + pC2ap – 2b2 + … + pCp – 1abp – 1 + bp
p −1
or (a + b)p = (ap + bp) + 
r =1
p
Cr a p−r b r …(i)

NUMBER SYSTEM 27
OLYMPIAD BOOKLET

p!
Now, p
Cr = ;1  r  ( p − 1)
r !( p − r )!
But p! = 1.2.3 … p is divisible by p
p is coprime to r!
 p is coprime to 1, 2, 3, … r ( r < p, p is prime)
∴ p is coprime to their product = r!
Also for the same reason p is coprime to (p – r)!
p p!
∴ Cr = is divisible by p.
r !( p − r )!
∴ ∃ an integer kr such that pCr = pkr
Putting this value of pCr in Eq. (i)
p −1
(a + b) p − ( a p + b p ) = p kr a p − r br
r =1

which is divisible by p.
∴ (a + b)p ≡ (ap + bp) mod p

If p is a prime number, prove that (a1 + a2 + a3 + … + an)p

≡
p p p
(a1 + a2 + a3 + n + an ) mod p p

(a1 + a2 + a3 + … + an)p = (a1 + b1)p

where b1 = a2 + a3 + … + an
≡ ( a1p + b1p ) mod p

≡ [a1p + (a2 + a3 + …+ an) p ] mod p

p
≡ [ a1 + (a2 + c2)p] mod p
where c2 = a3 + a4 + + an  (a1 + a2 + c2 ) mod p
p p p

continuing like this, we get

(a1 + a2 + a3 + … + an)p ≡ (a1 + a2 + + an ) mod p
p p p

If p prime number, then ap = a mod p

Sol:
p
(
We know that, ( a1 + a2 + a3 ++ an )  a1p + a2p + a3p + anp mod p ) …(i)
Putting a1 = a2 = a3 = … = an = 1 in Eq. (i)
(1 + 1 + 1 + … + 1)p
≡ (1p + 1p + 1p + … + 1p) mod p
or np ≡ (1 + 1 + 1 + … + 1) mod p
or np ≡ n mod p for every natural number n.
Replacing n by a.
ap = a mod p

NUMBER SYSTEM 28
OLYMPIAD BOOKLET

Fermat Little Theorem

If p is a prime number and (a, p) ≡ 1, prove that ap – 1 = 1 mod p.
Sol: As p is prime.
∴ ap = a mod p
Cancelling a from both sides. [∴ a is coprime to p]
We have a p–1
≡ 1 mod p.
n! = nn – nC1(n – 1)n + nC2(n – 2)n – … + (– 1)n – 2 nCn – 222 + (– 1)n – 1 nCn – 1
Sol: Expanding by binomial theorem
(ex – 1)n = enx – nC1e(n – 1)x + nC2e(n – 2)x – … + nCn – 2(– 1)n – 2e2x + nCn – 1(– 1)n – 1ex + (– 1)n …(i)
 2 3
We know that e = 1 + + + + 
1! 2! 3!
Using this expansion of eθ, Eq. (i) becomes
n
 x x 2 x3 xn 
 1 + + + + n + + n − 1
 1! 2! 3! n! 
 nx (nx)2 (nx)n   (n − 1) x [(n − 1) x]2 [(n − 1) x]n 
= 1 + + + n+ +  −n C1 1 + + + + + 
 1! 2! n!   1! 2! n! 
 (n − 2) x [(n − 2) x]2 [(n − 2) x]n 
+n C2 1 + + + + + 
 1! 2! n! 
 2 x (2 x)2 (2 x)n 
+  + n Cn − 2 (−1)n − 2 1 + + + + + 
 1! 2! n 
 2 x (2 x)2 (2 x)n  n  x x2 xn 
+  + n Cn − 2 (−1)n − 2 1 + + + + +  +(−1)n −1 Cn −1 1 + + + n + +  + (−1)n
 1! 2! n   1! 2! n! 
Comparing coefficient of xn on both sides
nn n (n − 1)n n (n − 2)n 2n (−1)n −1n Cn −1
1= − C1 + C2 −+ (−1)n − 2 n Cn − 2 +
n! n! n! n! n!
Multiplying both sides by n!
n! = nn – nC1(n – 1)n + nC2(n – 2)n – … + (– 1)n – 2 nCn – 22n + (– 1)n – 1 nCn – 1
Wilson Theorem
If p is prime, then (p – 1)! + 1 ≡ 0 mod p
Sol: Case I: when p = 2
(2 – 1)! + 1 ≡ 0 mod 2 [Putting p = 2 in (p – 1)! + 1 ≡ 0 mod p]
⇒ 1! + 1 ≡ 0 mod 2
⇒ 2 ≡ 0 mod 2
which is true
∴ Wilson theorem is true for p = 2.
Case II: If p is an odd prime.
n! = nn – nC1(n – 1)n + nC2(n – 2)n – … + (– 1)n – 2 nCn – 22n + (– 1)n – 1 nCn – 1

NUMBER SYSTEM 29
OLYMPIAD BOOKLET

Put n = p – 1 on both sides

∴ (p – 1)! = (p – 1)p – 1 – p – 1C1(p – 2)p – 1
+ p – 1C2(p – 3)p – 1 + … + (– 1)p – 3 – p – 1Cp – 32p – 1 + (– 1)p – 2 p – 1Cp – 2 (i)
p is prime.
∴ p is coprime to all numbers <p.
i.e., p is coprime to p – 1, p – 2, p – 3, … 2, 1.
∴ Putting a = p – 1, p – 2, p – 3, … 2 in Fermat Theorem
ap – 1 ≡ mod p
(p – 1)p – 1 ≡ 1 mod p
or (p – 1)p – 1 – 1 = M(p)
(p – 1)p – 1 = M(p) + 1
Similarly, (p – 2)p – 1 = M(p) + 1
(p – 3)p – 1 = M(p) + 1
………………
………………
………………
2p – 1 = M(p) + 1
Putting these values of (p – 1)p – 1, (p – 2)p – 1, …, 2p – 1 in Eq. (i).
∴ (p – 1)! = [M(p) + 1] – p – 1C1[M(p) + 1] + p – 1C2[M(p) + 1] + … + (– 1)p – 3 p – 1Cp – 3
[M(p) + 1] + (– 1)p – 2 p – 1Cp – 2
p −1

or (p – 1)! = M(p) + 1 – p – 1C1 + p – 1C2 – … +

(−1) p −3 C
p −3 + (−1) p − 2 p −1 C
p−2

Adding and Subtracting (– 1) p–1

in RHS.
(p – 1)! = M(p) + [(1)p – 1 – p – 1C1 + p – 1C2 – p – 1C3 + … + (– 1)p – 3 p – 3Cp – 3
+ (– 1)p – 2 p – 1Cp – 2 + (– 1)p – 1] – (– 1)p – 1
(p – 1)! = M(p) + (1 – 1)p – 1 – (– 1)p – 1
∴ (p – 1)! = M(p) + 0 – (– 1)p – 1 = M(p) – 1
 p is odd. ∴ p – 1 is even.
(p – 1)! + 1 is divisible by p.
∴ (p – 1)! + 1 ≡ 0 mod p.
Converse of Wilson Theorem
If p > 1 and (p – 1)! + 1 ≡ 0 mod p, then p is a prime number.
Sol: If possible let p be not prime.
∴ p is composite ( p > 1).
So let p = p1p2, where (1 < p1 < p, 1 < p2 < p) or 1 < p1 ≤ p – 1, 1 < p2 ≤ p – 1
Now, 1 < p1 ≤ p – 1
∴ p1 is one of the factors in the value of (p – 1)! and therefore p1 divides (p – 1)!.
Also p = p1p2 …(i)
⇒ p1 | p …(ii)
But (p – 1)! + 1 ≡ 0 mod p
∴ p | (p – 1)! + 1 …(iii)

NUMBER SYSTEM 30
OLYMPIAD BOOKLET

From Eqs. (ii) and (iii)

p1 | (p – 1)! + 1 …(iv)
From Eqs. (iv) and (i)
p1 | (p – 1)! + 1 – (p – 1)! …(v)
i.e., p1 | 1
But this is impossible. ( p1 > 1)
∴ p is a prime number.

The number of integers ≤ n and coprime to n is called Euler's function for n and is denoted by ϕ(n).

ϕ(1) = 1 [ 1 is the only integer ≤ 1 and coprime to 1].

ϕ(2) = 1 [ 1 is the only integer < 2 and coprime to 2].
ϕ(8) = 4 [ 1, 3, 5, 7 are the only four integers <8 and coprime to 8].
Remark
If p is a prime number, then 1, 2, 3, … (p – 1) are all less than p and coprime to p and are (p – 1) in total.
∴ ϕ(p) = p – 1
 1  1   1 
Prove that ϕ(n) = n 1 − 1 − 1 −  where p1, p2, …, pr are distinct prime
 p1   p2   pr 
factors of n.
Sol:  p1, p2, …, pr are distinct prime factors of n.
k k k
n = p1 · p2  pr
1 2 r
∴
∴ (n) = ( p1k1  p2k2  prkr ) = ( p1k1 )( p2k2 ) ( prkr )

[ p1, p2, …, pr are distinct primes and hence are coprime to each other and ϕ(ab) = ϕ(a)ϕ(b), if a and b
are coprime to each other.]
 1  1  1  1  1   1 
= p1k1 1 −  p2k2 1 −  prkr 1 −  = p1k1  p2k2  prkr 1 − 1 − 1 − 
 p1   p2   pr   p1  p2   pr 
 1  1   1 
= n 1 − 1 − 1 −   n = p1k1  p2k2  prkr 
 p1  p2   pr 
 1
Prove that  ( p k ) = p k 1 −  , where p is prime.
 p
Sol: Number of integers from 1 to p which are not coprime to pk are p.1, p.2, p.3, … p.pk – 1.
k

Total number of such integers, which are not coprime to pk = pk – 1.

∴ ϕ(pk) = Number of integers coprime to pk and < pk.
= pk – pk – 1 = pk(1 – 1/p)

If a and b are coprime to each other, then ϕ(ab) = ϕ(a) ϕ(b).

NUMBER SYSTEM 31
OLYMPIAD BOOKLET

Find the number of positive integers ≤ 3600 that coprime to 3600.

Sol: n = 3600 = 24 × 32 × 52
 1  1  1   1  1  1 
ϕ(n) = ϕ(3600) = ϕ(24 × 32 × 52) = n 1 − 1 − 1 −  = 3600 1 − 1 − 1 − 
 p1  p 2  p3   2  3  5 
[Here p1 = 2, p2 = 3, p3 = 5]
1 2 4
= 3600   
2 3 5
∴ ϕ(3600) = 960

Sum of digits of a number is congruent to the number modulo 9. The same holds for modulo 3.
Proof: Since 10n ≡ 1 (mod 9) for all n ∈ N, any number written in decimal representation such as
(an an – 1an – 2 … a1a0)10 = an + an – 1 + … + a1 + a0 (mod 9)

The number of 1's occurring in the digits from 10 to 19 = 11 and from 20 to 99 = 8.

So, total of 1's is 11 + 8 = 19.
Similarly, no. of 2's, 3's, …, 9 are all equal to 19.
19  9 10
So, sum of all the digits = 19(1 + 2 + 3 + … + 9) = = 19  5  9 = 855
2
and as 91855, 1011 … 99 is divisible by 9.
When the numbers start from 12, the sum of the digits become 855 – 3 = 852 (since 10, 11 account for
the digital sum 3) and hence, is divisible by 3.
(a) For divisibility by 3, it could start from 12, 13, 15, 16, 18, 19, 21, 22, 24, 25, …
(b) For divisibility by 32 = 9 the numbers may start from any of 18, 19, 27, 28, 36, 37,
All two-digit numbers from 10 to 99 are written consecutively, i.e., N = 101112…99. Show
that 3 | N. From which other two-digit number you should start so that N is divisible by (a) 3 (b) 32.
2

Sol: N is divisible by 9, if the digit sum is divisible by 9.

The digital sum of N :
The number of 1's occurring in the digits
from 10 to 19 = 11
and from 20 to 99 = 8.
So, total of 1's is 11 + 8 = 19.
Similarly, No. of 2's, 3 's, ..., 9 are all equal to 19.
19  9 10
So, sum of all the digits = 19(1 + 2 + 3 + … + 9) = = 19  5  9 = 855
2
and as 9 | 855, 1011 … 99 is divisible by 9.
When the numbers start from 12, the sum of the digits become 855 – 3 = 852 (Since 10, 11 account for
the digital sum 3) and hence, is divisible by 3.
(a) For divisibility by 3, it could start from 12, 13, 15, 16, 18, 19, 21, 22, 24, 25, …
(b) For divisibility by 3^{2} = 9 the numbers may start from any of 18, 19, 27, 28, 36, 37,

NUMBER SYSTEM 32
OLYMPIAD BOOKLET

Find the remainder when 43333333 is divided by 9.

Sol: 4333 ≡ 4 + 3 + 3 + 3 = 13 (mod 9) ≡ 4 (mod 9)
∴ 43333 ≡ 43 (mod 9)
≡ 64 (mod 9)
≡ 1 (mod 9)
⇒ 43333333 ≡ 1 (mod 9)
i.e., when 43333333 is divided by 9, the remainder is 1.
Prove that among 18 consecutive three-digit numbers there is at least one number which is
divisible by the sum of its digits.
Sol: Among 18 consecutive integers there are two numbers which are divisible by 9.
The sum of the digits of these two numbers must be 9, 18 or 27.
If the sum of the digits is 9, then the number is divisible by the sum of the digits, so there is nothing to
prove.
If the sum of the digits is 27, then the three-digit numbers should be 999 = 9 × 111 = 9 × 3 × 37 and
hence, the result. Let both the numbers have 18 as the sum of their digits. Let those numbers be a and b
with a < b.
If a is odd and sum of its digits is 18, it is divisible by 9 but not by 18. However, the other number b is
also divisible by 9 and b should be a + 9 ⇒ b is even and sum of its digits is 18, and hence, b is an even
number as well as divisible by 9 ⇒ b is divisible by 18.
If m > 2, show that ϕ(m) is even.
Sol: If (a, m) = 1, then (m – a, m) = 1
∴ Integers coprime to m occur in pairs of type a and m – a.
∴ ϕ(m) is even.
For what values of m is ϕ(m) odd.
Sol: If m > 2, ϕ(m) is even.
ϕ(1) = 1
ϕ(2) = 1
Only for m = 1, m = 2
ϕ(m) is odd.
10n − 1 10n − 1
Concept Let a = =
10 − 1 9
10 n − 1
We can express any a of the form in terms of perfect square.
9
10n − 1
a=  9a = 10n − 1
9
9a + 1 = 10n
Let b = 9a + 1
c = 8a + 1
Now, consider 4ab + c = 4a(9a + 1) + 8a + 1 = 36a2 + 12a + 1 = (6a + 1)2
Verification (6 × 1 + 1)2 = 72 = 49 = (6 × 11 + 1)2 = 672
(6 × 111 + 1)2 = 6672

NUMBER SYSTEM 33
OLYMPIAD BOOKLET

Now, consider (a – 1)b + c = (a – 1)(9a + 1) + 8a + 1 = 9a2 + a – 9a – 1 + 8a + 1 = 9a2 = (3a)2

Verification a = 1 ⇒ 32
a = 11 ⇒ (33)2
Now, consider (16ab + c)
16a(9a + 1) + 8a + 1
(12a + 1)2
This is also a perfect square.
Concept Prove that every number of the sequence 49, 4489, 44489, 4448889 is a perfect square. If there
are n fours and (n – 1) eight and one 9.
Let us denote 444889 as 43829.
Consider 667 written as 627
We know 444889 = (667)2.
∴ We develop (6nm – 17)2 = 4n8n – 19
If this is true then
2 2 2
 6(10n − 1)   6 10n + 3   2.10n + 1
( 6n−17 )
2
= + 1 =   = 
 9   9   9 
4.102 n + 4.10n + 1 40n −140n −1 + 1 4.102n + 4.10n + 1 40n −140n −1 + 1
= = = 4n8n −19 = = = 4n8n −19
9 9 9 9
Let n be the natural number. If 2n + 1 and 3n + 1 are perfect square. Then prove that n is
divided by 40.
Sol: 40 = 23 × 5. It is sufficient to prove that n is divisible by 8 and 5.
Let 2n + 1 = x2 …(i)
and 3n + 1 = y2 …(ii)
⇒ x2 is odd.
⇒ x is odd.
Let x = 2a + 1
(2n + 1) = (2a + 1)2
2n + 1 = 4a2 + 4a + 1
n = 2a2 + a
⇒ n is even.
If n is even ⇒ 3n + 1 is odd
⇒ y2 is odd ⇒ y is odd
Let y = 2b + 1
Subtract Eq. (i) from Eq. (ii), we get
n = y2 – x2 …(iii)
⇒ n = (2b + 1)2 – (2a + 1)2
We know square difference of odd number is always divisible by 8.
∴ n is divisible by 8.
If we eliminate n between 1 and 2
3x2 – 2y2 = 1

NUMBER SYSTEM 34
OLYMPIAD BOOKLET

Since square of odd number ends with 1, 5 or 9

∴ 3x2 ends with 3, 5 or 4, 7
⇒ 2y2 ends with 2, 0, 8
⇒ x2 ends with 1 and y2 ends with 1
⇒ n = y2 – x2 = 0
∴ It is divisible by 5.
Prove that there are infinitely many squares in the sequence 1, 3, 6, 10, 15, 21, 28, …
Sol: Suppose Tn is a square
n(n + 1)
Let Tn of the above sequence be
2
n(n + 1)
⇒ Tn =
2
If it is a square then Tn = (m)2
n(n + 1)
⇒ = (m) 2
2
⇒ n(n + 1) = 2(m)2
Also, T4n(n + 1) is also a square.
4n(n + 1)[4(n)(n + 1) + 1] 4 ( 2m2 )  4n 2 + 4n + 1
∴ T4 n ( n+1) = = = 4m2 (2n + 1) 2
2 2
T4n(n + 1) is also a perfect square.
∴ perfect squares are T1 = 1
T8 = 36 is a perfect square.
T288 is also a perfect square.
If N = 123 × 34 × 52, find the total number of even factor of N.
Sol: If N = 123 × 34 × 52
Then, N = 26 × 37 × 52
∴ Total Number of factors are = (6 + 1)(7 + 1)(2 + 1) = 7 × 8 × 3 = 168
In above factors, some of these are odd multiple and some are even.
The odd multiples are formed only with combination of 35 and 55.
So total number of odd multiples is (7 + 1)(2 + 1) = 24
∴ Even multiples = 168 – 24 = 144
1 1 1
Find all positive integers x, y satisfying + = .
x y 20

1 1 1 1 1 1 x − 20
Sol: Suppose x, y are two positive integers such that + = then = − =
x y 20 y 20 x 20 · x
1 x + 20 − 4 5 x
∴ =
y 20 x

Implying that 5x is rational.

Now x ∈ N ⇒ 5x ∈ N. Hence 5x is the square of an integer which is divisible by 5.

NUMBER SYSTEM 35
OLYMPIAD BOOKLET

∴ 5x = (5a)2 for some a ∈ N i.e., x = 5a2 similarly y = 5b2 for some b ∈ N.

Now, Eq. (i) becomes
1 1 1
+ =  2(a + b) = ab
a b 2
(a – 2)(b – 2) = 4
⇒ (a, b) ∈ {(3, 6), (4, 4), (6, 3)}.
∴ Solution set is {(45, 180), (80, 80), (180, 45)}.

An equation of the form f (x1, x2, x3, …, xn) = 0 where f is an n-variable function with n ≥ 2 is called
Diophantine equation. If f is polynomial with integral coefficients, then it is called algebraic Diophantine
equation.
An n-tuple (a1, a2, …, an) ∈ n satisfying the equation called a solution to the equation.
In Diophantine equation we basically concern with solvability of the equation, number of solution
finite or infinite and determining all solutions.
Please observe following examples:
Determine the integer n for which n2 + 19n + 92 is a square.
Sol: Let n + 19n + 92 = x2, where x is a positive integer.
2

Now, 4 (n2 + 19n + 92) = 4x2

⇒ (2n + 19)2 + 7 = 4x2
⇒ (2 x)2 – (2n + 19)2 = 7
⇒ (2x + 2n + 19)(2x – 2n – 19) = 7
As x is positive both cannot be negative.
Hence, both must be positive. There are two possibilities.
2x + 2n + 19 = 1
and 2x – 2n – 19 = 7
⇒ n = – 11
or 2x + 2n + 19 = 7
and 2x – 2n – 19 = 1
n=–8
Hence, n = – 8, – 11.
Find all unordered pairs of natural numbers, the difference of whose square is 45.
Sol: Let x and y be the natural numbers such that x2 – y2 = 45, where x > y.
⇒ (x – y)(x + y) = 45
So, both (x – y) and (x + y) are the divisors of 45, and x + y > x – y, where x and y are positive integers.
So, x – y = 1, and x + y = 45 …(1)
or x – y = 3, and x + y = 15 …(2)
or x – y = 5, and x + y = 9 …(3)
Solving (1), (2) and (3), we get
x = 23, y = 22 and x = 9, y = 6 and x = 7, y = 2
So, the pairs of numbers satisfying the condition are (23, 22), (9, 6), (7, 2).

NUMBER SYSTEM 36
OLYMPIAD BOOKLET

Find all the ordered pairs of integers (x, z) such that x3 = z3 + 721.
Sol: Since x3 – z3 = 721
⇒ x3 – z3 = (x – z) (x2 + xz + z2) = 721
For integers x, z; x2 + xz + z2 > 0
⇒ x–z>0
So (x – z) (x2 + xz + z2) = 721 = 1 × 721 = 7 × 103 = 103 × 7 = 721 × 1.
Case 1: x – z = 1 ⇒ x = 1 + z
and x2 + xz + z2 = (1 + z)2 + (1 + z)z + z2 = 721
⇒ 3z2 + 3z – 720 = 0
⇒ z2 + z – 240 = 0
⇒ (z + 16)(z – 15) = 0
⇒ z = – 16 or z = 15.
Solving, we get x = – 15 or 16.
So (– 15, – 16) and (16, 15) are two of the ordered pairs.
Solving (1), (2) and (3), we get
x = 23, y = 22 and x = 9, y = 6 and x = 7, y = 2
So, the pairs of numbers satisfying the condition are (23, 22), (9, 6), (7, 2).
Find all positive integers n for which n2 + 96 is a perfect square.
Sol: Let n2 + 96 = k2, where k ∈ .
Then k2 – n2 = 96
(k – n)(k + n) = 96 = 31 × 25.
Clearly k > n and hence, k + n > k – n > 0.
Since 3 is the only odd factor, both k and n are integers. We must have k + n and k – n both to be either
even or odd. (If one is odd and the other even, then k and n do not have integer solutions). Also both k +
n and k – n cannot be odd as the product is given to be even. So the different possibilities for k + n, k – n
are as follows.
k – n = 2 and k + n = 48 …(1)
or k – n = 4 and k + n = 24 …(2)
or k – n = 6 and k + n = 16 …(3)
or k – n = 8 and k + n = 12 …(4)
So, solving separately Eqs. (1), (2), (3) and (4), we get n = 23, 10, 5, 2.
So, there are exactly four values of n for which n2 + 96 is a perfect square.
n = 23 gives 232 + 96 = 625 = 252
n = 10 gives 102 + 96 = 196 = 142
n = 5 gives 52 + 96 = 121 = 112
n = 2 gives 22 + 96 = 100 = 102
z x y
Find all the positive integers x, y, and z satisfying x y ·y z ·z x = 5xyz.
z x y
Sol: x, y, and z are integers and 5 is a prime number and given equation is x y ·y z ·z x = 5xyz.
Dividing both sides of the equation by xyz
z x y
−1 −1 −1
xy ·y z ·z x =5

NUMBER SYSTEM 37
OLYMPIAD BOOKLET

So, the different possibilities are

z z
−1 −1
xy =5 xy =1 z

x x
y y −1 = 1
z −1 z −1
y =1 y =5 yx −1
y y
−1 x −1
zx =1
z =1 x −1
=5
y

or or z
Taking the first column x = 5, yz – 1 = 1; yz = 2, y = 2, and z = 1
and these values are satisfying the other expressions in the first column.
Similarly, from the second column, we get y = 5, z = 2, and x = 1 and from the third column, we get z =
5, x = 2, and y = 1.
⇒ (x, y, z) ≡ (5, 2, 1), (2, 1, 5), (1, 5, 2)
Find all pairs of integers x, y, such that (xy – 1)2 = (x + 1)2 + (y + 1)2.
Sol: We have, (xy – 1)2 = (x + 1)2 + (y + 1)2
⇒ (xy – 1)2 – (x + 1)2 = (y + 1)2
⇒ (xy – x – 2)(xy + x) = (y + 1)2
⇒ x(xy – x – 2)(y + 1) = (y + 1)2 …(1)
⇒ (y + 1)[x(xy – x – 2) – (y + 1)] = 0 …(2)
If y = – 1, then x takes all the values from the set of integers.
Similarly, we also get
(x + 1)[y(xy – y – 2) – (x + 1)] = 0 …(3)
If x = – 1, then y takes all the values from the set of integers.
If x ≠ – 1, y ≠ – 1, then from Eq. (1)
x(xy – x – 2)(y + 1) = (y + 1)2
⇒ x(xy – x – 2) = (y + 1) ( y ≠ – 1)
⇒ x2y – x2 – 2x – y – 1 = 0
⇒ y(x – 1)(x + 1) = (x + 1)2
Since x ≠ – 1, we have y(x – 1) = (x + 1)
x +1 2
⇒ y= = 1+
x −1 x −1
⇒ (x – 1) | 2 ⇒ x – 1 = ± 1, ± 2
⇒ x = 0, 2, – 1, 3
Now, x = 0 ⇒ y = – 1
x=2⇒y=3
x=3⇒y=2
Hence, the solution set is (3, 2), (2, 3), (x, – 1), (– 1, y).
Find all integral solutions of x2} – 3y2 = – 1.
Sol: We have, x2 – 3y2 = – 1
⇒ x2 = 3y2 – 1 ≡ –1 (mod 3) ≡ 2 (mod 3)
But, for any x ∈ Z, x2 ≡ 0 (mod 3), or x2 ≡ 1 (mod 3) And hence, there is no solution for the given
equation.

NUMBER SYSTEM 38
OLYMPIAD BOOKLET

Find the number of solutions in positive integers of the equation 3x + 5y = 1008.

Sol: Let x, y ∈ N such that 3x + 5y = 1008 then 3|5y ⇒ 3|y ⇒ y = 3k for some k ∈ N
Now, 3x + 15k = 1008
⇒ x + 5k = 336
⇒ 5k ≤ 335
⇒ k ≤ 67
Thus, any solution pair is given by (x, y) = (336 – 5k, 3k) where 1 ≤ k ≤ 67.
∴ Number of solutions is 67.
Assume that a, b, c and d are positive integers such that a5 = b4, c3 = d2 and c – a =
19/Determine d – b.
Sol: Since a and b are positive integers, let a5 = b4 = m5 × 4 = m20, we get : a = m4 and b = m5.
Let c3 = d2 = n3 × 2 = n6, we get : c = n2 and d = n3.
Therefore, c – a = 19 can be written as n2 – m4 = 19 or (n –m2) (n + m2) = 19
Since 19 is a prime number and n + m2 > n – m2, we have : n – m2 = 1 and n + m2 = 19
Solve for m and n, we get : m = 3 and n = 10.
Therefore, d = n3 = 103 = 1000, and b = m5 = 35 = 243. So d – b = 1000 – 243 = 757.
Property : 2
If the sum of two prime numbers is an odd number, then one of the two prime numbers must be 2.
The sum of two prime numbers is 39. What is their product?
Sol: Since the sum is an odd number, one prime number must be 2. The other one is then 39 – 2 = 37. The
product is 2 × 37 = 74.
The difference of two prime numbers is 2011. What is the value of the larger prime number?
Sol: Let the two prime numbers be x and y and x < y.
Since y – x = 2011, x must be 2 and y = 2013.
The sum of two prime numbers is 49. What is the sum of the reciprocals of the two prime
numbers?
Sol: Let the two prime numbers be x and y and x < y.
Since y + x = 49, x must be 2 and y = 47.
1 1 49
+ =
47 2 94
Three prime numbers p, q and r satisfy the following conditions : p + q = r and 1 < p < q.
Find the value of p.
Sol: Since p, q and r are all prime numbers, r must be an odd number and one of the two numbers p and q
must be 2.
Since 1 < p < q, p = 2.
Two prime numbers p and q satisfy the following conditions : p = m + n and q = mn, where
both m and n are positive integers. Find the value of pq – qp.
Sol: Since q is a prime number and q = mn, m or n must be 1.
Let m = 1, we have q = n and p = 1 + n = 1 + q.

NUMBER SYSTEM 39
OLYMPIAD BOOKLET

p
Find , where both p and q are prime numbers, if 3p + 5q = 31?
3q + 1
Sol: Since 3p + 5q = 31, 3p or 5q must be even since two odd numbers do not sum to an odd integer.
Case I: If 3p is even, p must be 2. We then have 5q = 31 – 3 × 2 = 25 ⇒ q = 5
p 2 1
= =
3q + 1 3  5 + 1 8
Case II: If 5q is even, q must be 2. We then have 3p = 31 – 5 × 2 = 21 ⇒ p = 7
p 7
= =1
3q + 1 3  2 + 1
For how many positive integer n is n2 – 3n + 2 a prime number?
Sol: We know that n2 – 3n + 2 = (n – 1)(n – 2) is a prime if and only if
Case I: (n – 1) = 1 and (n – 2) is a prime
n – 1 = 1 ⇒ n = 2 and (n – 2) = 0 which is not a prime
Case II: (n – 2) = 1 and (n – 1) is a prime.
n – 2 = 1 ⇒ n = 3 and (n – 1) = 2 which is a prime.
Case III: (n – 1) = – 1 and (n – 2) is a negative value and |(n – 2)| is a prime
n – 1 = – 1 ⇒ n = 0 which is not a positive integer and we do not need to verify.
n – 2.
Case IV: (n – 2) = – 1 and (n – 1) is a negative value and |(n – 1)| is a prime
n – 2 = – 1 ⇒ n = 1 and (n – 1) = 0 which is not negative.
Therefore, n2 – 3n + 2 is prime only when n = 3.
The product of three prime numbers is five times the sum of these prime numbers and it is
also divisible by 5. Find these prime numbers.
Sol: Since the product is divisible by 5, one of these prime numbers must be 5.
Let p and q be the other two prime numbers, we have : 5pq = 5(p + q + 5)
⇒ pq – p – q + 1 = 6 ⇒ (p – 1)(q – 1) = 6 = 2 × 3 = 1 × 6.
If p – 1 = 2 and q – 1 = 3, q = 4 is not a prime number which is not possible.
If p – 1 = 1 and q – 1 = 6, p = 2 and q = 7.
The solution is (2, 5, 7)
For a positive integer such that the sum of the positive integer and 100 is a square number,
and the sum of the positive integer and 168 is also a square number.
Sol: Let x be the positive integer.
x + 100 = y2
x + 168 = z2
(ii) – (i)
z2 – y2 = 68 ⇒ (z – y)(z + y) = 68 = 22 × 17
Since 0 < z – y < z + y, we have
z – y =1  z–y=2  z–y=4 
  
z + y = 22 17  z + y = 2 17  z + y = 17 
On solving these equation : y = 16, z = 18 and x = 156

NUMBER SYSTEM 40
OLYMPIAD BOOKLET

It is given that a, b, c and d are four positive prime numbers such that the product of these
four prime numbers is equal to the sum of 55 consecutive positive integers. Find the smallest possible value of a
+ b + c + d. (Remark: The four numbers a, b, c, d are not necessarily distinct.)
Sol: The sum of 55 positive consecutive integers is at least (55 × 56)/2 = 1540. Let the middle number of
these consecutive positive integers be x. Then the product abcd = 55x = 5 · 11 · x. So we have 55x ≥
1540 and thus x ≥ 28. The least value of a + b + c + d is attained when x = 5(7). Thus the answer is
5 + 11 + 5 + 7 = 28.

1. If a + b + c = 66 and ab + bc + ca = 1071, 8. How many prime numbers satisfy

where a, b and c are all prime numbers, find 300  x  700 ?
the value of abc.
(a) 5 numbers (b) 3 numbers
(a) 1007 (b) 2876
(c) 2 numbers (d) 1 number
(c) 1886 (d) 1765
9. The number of pairs of prime numbers (p, q)
2. The positive integers A, B, A – B and A + B
51 1 1 5
are all prime numbers. The sum of these four satisfying the condition  +  will
primes is 100 p q 6
(a) Even (b) Divisible by 3 be
(c) Prime (d) Divisible by 7 (a) 49 (b) 24
3. For how many positive integers a is a4 – 3a2 + (c) 50 (d) 48
9 a prime number? 10. The number of positive integral values of n for
(a) 5 (b) 7 which (n3 – 8n2 + 20n – 13) is a prime number
(c) 6 (d) 2 is
4. If n is a positive integer greater than 1, then n4 (a) 2 (b) 1
+ 4 is a _______ number. (c) 3 (d) 4
(a) Composite 11. The number of positive integers 'n' for which 3
(b) Composite odd number n – 4, 4n – 5 and 5n – 3 are all primes is
(c) Composite even number (a) 1 (b) 2
(d) Prime (c) 3 (d) infinite
5. What is the smallest positive integer x for 12. m, n are natural numbers. The number of pairs
which x2 – x + 5 is not a prime? (m, n) for which m2 + n2 + 2mn – 2013m –
(a) 5 (b) 7 2013n – 2014 = 0 is.
(c) 6 (d) 13 (a) 2000 (b) 2013
6. What is the smallest composite number (c) 1023 (d) 2007
generated by p2 – p – 1 where p is a prime? 13. Suppose that a, b, c are distinct numbers such
(a) 155 (b) 157 that (b – a)2 – 4(b – c)(c – a) = 0 find the
(c) 156 (d) 154 b−c
7. Some prime numbers are 1 more then a value of .
c−a
square, as in 42 + 1 = 17. How many primes p
14. Suppose that p and q are prime numbers (p >
≤ 100 are of the from p = n2 + 1?
q) and they are roots of the equation x2 – 99x +
(a) 5 (b) 7
m = 0 for some m. What is the value of p – q?
(c) 4 (d) 23

NUMBER SYSTEM 41
OLYMPIAD BOOKLET

15. What is the largest possible prime value of 23. m and n are two positive integers of reverse
n2 – 12n + 27, where n ranges over all positive order (for example 123 and 321) such that mn
integers? = 1446921630. Now the value of m + n is
16. What is the largest integer that is a divisor of given as ab4ba. Find the product of a and b.
(n + 1) (n + 3) (n + 5) (n + 7) (n + 9) for all 24. Find the number of positive divisors of
positive even integers n? (20083 + (3 × 2008 × 2009) + 1)2.
17. Let a be the set of positive integers that have 25. Determine the largest prime number less than
5000 of the form an – 1, where a and n are
no prime factors other than 2, 3 or 5. The
positive integers, and n is greater than 1.
1 1 1 1 1 1 1 1 1
infinite sum + + + + + + + + 26. Let f be a real-valued function with the rule
1 2 3 4 5 6 8 9 10
f (x) = x3 + 3x2 + 6x + 14 defined for all real
1 1 1 1 1 value of x. It is given that a and b are two real
+ + + + + + of the
12 15 16 18 20 numbers such that f (a) = 1 and f (b) = 19.
reciprocals of the elements of a can be Find the value of (a + b)2.
m 27. Positive integers a, b, and 2009, with a < b <
expressed as , where m and n are relatively
n 2009, form a geometric sequence with an
prime positive integers. What is m + n? integer ratio. What is a?
18. For some positive integer n, the number 110n3 28. For k > 0, let Ik = 10…064, where there are k
has 110 positive integer divisors, including 1 zeros between the 1 and the 6. Let N(k) be the
and the number 110n3. The number 81n4 have number of factors of 2 in the prime
D factorization of Ik. What is the maximum value
D positive integer divisors. What is ? of N(k)?
5
29. Suppose that m and n are positive integers
19. What is the minimum number of digits to the
such that 75m = n3. What is the minimum
right of the decimal point needed to express
possible value of m + n?
123456789
the fraction as a decimal? 30. Let n be the largest integer that is the product
226.54 of exactly 3 distinct prime numbers, d, e, and
20. How many positive two-digit integers are 10d + e, where d and e are single digits. What
factors of 224 – 1? is the sum of the digits of n?
21. Let N be the positive integer for which the 31. The digits 1, 2, 3, 4, 5, 6, 7, and 9 are used to
sum of its two smallest factors is 4 and the form four two-digit prime numbers, with each
sum of its two largest factors is 204. Find the digit used exactly once. Then the sum of these
N four prime numbers is given by 10A. Find the
value of   .
3 value of A.
32. The positive integers A, B, A – B, and A + B
22. Let S = {1, 2, 3, …, 20} be the set of all
are all prime numbers. The sum of these four
positive integers from 1 to 20. Suppose that N
prime number is
is the smallest positive integer such that
33. Find the number of counterexamples to the
exactly eighteen numbers from S are factors of
statement:
N, and the only two numbers from S that are "If N is an odd positive integer the sum of
not factors of N are consecutive integers. Find whose digits is 4 and none of whose digits is
the sum of the digits of N. 0, then N is prime."

NUMBER SYSTEM 42
OLYMPIAD BOOKLET

34. Three positive integers are each greater than 1, of the four divisors is equal to n. How many
have a product of 27000, and are pairwise numbers in the set {2010, 2011, 2012, …,
relatively prime. What is their mean to the 2019} are nice?
nearest whole number? 36. Let a and b be relatively prime integers with a
35. A positive integer n is nice if there is a a 3 − b3 73
positive integer m with exactly four positive > b > 0 and = . What is a – b?
( a − b) 3 3
divisors (including 1 and m) such that the sum

"Divisible by" means "when you divide one number by another number, the result is a whole number".
"Divisible by" and "can be evently divided by" mean the same thing.
The expressions abc , abc and abc are the same, abc = abc = 100a + 10b + c. They represent a three-
digit number such as 234 = 234 = 234.

∙ Divisibility rule for 2, 4, 8 and 16:

A number is divisible by 2 if the last digit of the number is divisible by 2(2 1).
A number is divisible by 4 if the last two digit of the number are divisible by 4(2 2).
A number is divisible by 8 if the three digits of the number are divisible by 8(23).
A number is divisible by 16 if the last four digits of the number are divisible by 16(2 4).
For what digit(s) x will be 7-digit number 3 × x6 × x2 be divisible by 4?
Sol: 1, 3, 5, 7 and 9
The two-digit number x2 needs to be divisible by 4 by the divisible rules. The following numbers work:
12, 32, 52, 72 and 92
How many different 4-digit numbers can be formed using the digits 2, 4, 5, 6 and 7 such
that no digits repeat and the number is divisible by four?
Sol: 36
The last digit needs to be even in order for the number to be divisible by 4. So we list all the two-digit
numbers that are divisible by 4: 52, 72, 24, 64, 56 and 76 to be the last two the two-digits. There are 3 ×
2 = 6 ways to arrange the other two digits. There are a total of 6 × 6 = 36 such 4-digit numbers.
If 4b + 2c + d = 32, is the 4-digit number abcd divisible by 8?
Sol: Yes
We must determine if the number formed by the last three digits is divisible by 8.
bcd = 100b + 10c + d = 96b + 8c + (4b + 2c + d) = 96b + 8c + 32 = 8 (12b + c + 4)bcd is in fact a
multiple of 8. So abcd is divisible by 8.
Divisibility rule for 5, 25, 125 and 625 :
A number is divisible by 5 if the last of the number is divisible by 5(5 1).
A number is divisible by 25 if the last two digits of the number form a number that is divisible by 25(5 2).
A number is divisible by 125 if the last three digits of the number form a number that is divisible by
125(53).
A number is divisible by 625 if the last four digits of the number form a number that is divisible by
625(54).

NUMBER SYSTEM 43
OLYMPIAD BOOKLET

The four-digit number 6BB5 is divisible by 25. How many such four-digit numbers are
there?
Sol: (6225 and 6775)
If the given number is divisible by 25, B5 should be divisible by 25.
25 × 1 = 25 and 25 × 3 = 75
The six-digit number 713EF 5 is divisible by 125. How many such six-digit numbers are
there?
Sol: (713125, 713375, 713625 and 713875)
If the given number is divisible by 125, EF 5 should be divisible by 125.
125 × 1 = 125, 125 × 3 = 375, 125 × 5 = 625 and 125 × 7 = 875.

A number is divisible by 3 if the sum of the digits of the number is divisible by 3.

A number is divisible by 9 if the sum of the digits of the number is divisible by 9.
What is the sum of all possible digits which could fill the blank in 47 … 21 so that the
resulting five-digit number is divisible by 3?
Sol: Let the digit be x.
4 + 7 + x + 2 + 1 = 14 + x
⇒ x = 1, 4 and 7 in order for 14 + x to be divisible by 3
The sum is 1 + 4 + 7 = 12
What is the largest digit which can replace b to make the number 437, b32 divisible by 3?
Sol: 4 + 3 + 7 + b + 3 + 2 = 19 + b
⇒ b = 2, 5 and 8
The greatest value of b such that 437, b32 is divisible by 3 is 8.
The three-digit number 2a3 is added to the number 326 to give the three-digit number 5b9.
If 5b9 is divisible by 9, then a + b equal
Sol: The sum of the digits of 5b9 must be divisible by 9, 5 + b + 9 = 14 + b, b must be 4.
2a3 + 326 = 549 ⇒ 2a3 = 549 – 326 = 223
a+v=2+4=6 a=2

(1) If you double the last digit and subract it from the rest of the number and the answer is divisible by
7, the number is divisible by 7, you can apply this rule to that answer again if necessary.
(2) To find out if a number is divisible by 11, odd every other digit, and call that sum "x". Add together
the remaining digits, and call that sum "y". Take the positive difference of x and y. If the difference
is zero or a multiple of eleven, then the original number is a multiple of eleven.
(3) Delete the last digit from the number and then subtract 9 times the deleted digit from the remaining
number. If what is left is divisible by 13, then so is the original number. Repeat the rule if
necessary.
(4) If the positive difference of the last three digit and the rest of the digits is divisible by 7, 11 or 13,
then the number is divisibly by 7, 11 or 13 respectively.

NUMBER SYSTEM 44
OLYMPIAD BOOKLET

Which number is not divisible by 7? 616, 567, 798 or 878

Sol: 616 : 61 – 6×2 = 61 – 12 = 49 (divisible by 7)
567 : 56 – 7×2 = 56 – 14 = 42 (divisible by 7)
798 : 79 – 8×2 = 79 – 16 = 63 (divisible by 7)
878 : 87 – 8×2 = 87 – 16 = 71 (not divisible by 7)
Which number is not divisible by 7? 630616, 588567, 28105 or 40111?
Sol: 630616 : 630 – 616 = 14 (divisible by 7)
588567 : 588 – 567 = 21 (divisible by 7)
28105 : 105 – 28 = 77 (divisible by 7)
40111 : 111 – 40 = 71 (not divisible by 7)
If 13x + 8y is divisible by 7, prove that 9x + 5y is also divisible by 7.
Sol: Since 13x + 8y is divisible by 7, it will not change the divisibility of a number if we add 13x + 8y to
number. To prove that 9x + 5y is divisible by 7. we can add 13x + 8y to it until the number is divisible by 7.
9x + 5y ⇒ 9x + 5y + (13x + 8y) = 22x + 13y ⇒ 22x + 13y + (13x + 8y) = 35x + 21y = 7(5x + 3y)
Since 7(5x + 3y) is divisible by 7, 9x + 5 y is also divisible by 7.
Which digit should replace a in the units place so that 9867542 a is divisible by 11?
Sol: Let x = 9 + 6 + 5 + 2, y = 8 + 7 + 4 + a
(x – y) = (9 + 6 + 5 + 2) – (8 + 7 + 4 + a) = 22 – 19 – a = 3 – a.
⇒ a=3
A and B are non-zero digits for which A468B05 is divisible by 11. What is A + B?
Sol: Let x = 5 + B + 6 + A, y = 0 + 8 + 4
x – y = (5 + B + 6 + A) – (0 + 8 + 4) = 11 + B + A – 12 = B + A – 1
⇒ B + A = 12
If 7x + 2y – 5z is divisible by 11, x, y and z are all integers, prove that 3x – 7y + 12z is also
divisible by 11.
Sol: Since 7x + 2y – 5z is divisible by 11, it will not change the divisibility of a number if we add 7x + 2y – 5
z to the number.
To prove that the expression is also divisible by 11, we can add 7x + 2y – 5z to it until the number is
divisible by 11.
Also, when we multiply a number by an integer that is not a multiple of 11, the divisibility of the number
will not change.
3x – 7y + 12z ⇒ 4(3x – 7y + 12z) + 3(7x + 2y – 5z) = 11(3z – 2y + 3z)
Thus, 3x – 7y + 12 z is divisible by 11.
∙ Divisibility rule for 6, 10, 12, 14, 15, 18, 24 and 36 :
A number is divisible by 6, if the number is divisible by both 2 and 3.
A number is divisible by 10, if the number is divisible by both 2 and 5.
A number is divisible by 12, if the number is divisible by both 3 and 4.
A number is divisible by 14, if the number is divisible by both 2 and 7.
A number is divisible by 15, if the number is divisible by both 3 and 5.
A number is divisible by 18, if the number is divisible by both 2 and 9.
A number is divisible by 24, if the number is divisible by both 3 and 8.
A number is divisible by 36, if the number is divisible by both 4 and 9.

NUMBER SYSTEM 45
OLYMPIAD BOOKLET

What is the greatest three-digit number that is divisible by 6?

Sol: The number must be divisible by both 2 and 3. So the number is even and the sum of its digits is
divisible by 3. If the number is 99x, x = 6 works.
If the 4-digit number 273x is divisible by 12, what is the value of x?
Sol: The 4-digit number 273x is divisible by 3 and 4.
2 + 7 + 3 + x = 12 + x, must be divisible by 3, so x can be 0, 3, 6 and 9. On other hand, x must be even so
that the number is divisible by 4, so we have x = 0 or 6. 3x must also be divisible by 4, so x = 6 is the
only value that works.
Find distinct digits a and B such that A47B is as large as possible and divisible by 36.
Name the number.
Sol: A47B is divisible by 36 and it is also divisible by 9 and 4.
A + 4 + 7 + B = A + B + 11 ⇒ A + B = 7 and A + B = 16
Since A and B are distinct, A + B = 7
7B needs to be divisible by 4 and we want the greatest value of A47B.
A = 5 and B = 2.A47B = 5472.

Note: The following terms have the same meanings : last digit, ones digit and units digits.
∙ Patterns of the last digit of an :
The last digits of an have patterns shown in the table below.
For example, when a = 2.
21 = 2
22 = 4
23 = 8
24 = 16
25 = 32
26 = 64
27 = 128
28 = 256, …
The last digits of 2n demonstrate a pattern : 2, 4, 8, 6, 2, 4, 8, 6 etc.
n 1 2 3 4 Period
1n 1 1
2 n
2 4 8 6 4
3n 3 9 7 1 4
4 n
4 6 2
5n 5 1
6 n
6 1
7n 7 9 3 1 4
8n 8 4 2 6 4
9 n
9 1 2

NUMBER SYSTEM 46
OLYMPIAD BOOKLET

Find the last digit of 31999.

Sol: The pattern for the last digits of 3n is : 3, 9, 7, 1 (repeating every four numbers)
When 1999 is divided by 4, the quotient is 499 and the remainder is 3. The last digit of 3 1999 is the same
as the last digit of 33.
So the last digit of 31999 is 7.
or 31999 = 34 × 499 + 3 = 33 = 27. The last digit is 7.
What is the units digit in the number named by 2 48?
Sol: The pattern for the last digit of 2n is 2, 4, 8, 6, 2, 4 etc.
48 ÷ 4 = 12. In other words, the last digit of 2 48 is the same as the last digit of 24.
So the last digit is 6.
or 248 = 24 × 11 + 4 = 24 = 16. The last digit is 6.
What is the units digit in the number named by 7 22?
Sol: The pattern for the last digit is: 7, 9, 3, 1, 7, 9, 3, 1, etc.
When 22 is divided by 4, the quotient is 5 and the remainder is 2. The last digit of 722 is the same as the
last digit of 72, so the last digit is 9.
or 722 = 74 × 5 + 2 = 72 = 49. The last digit is 9.
What is the units digit of 199881998?
Sol: The units digit of 199881998 is the same as the units digit of 81998.
The pattern for the last digit is: 8, 4, 2, 6, 8, 4, 2, 6, etc.
When 1998 is divided by 4, the quotient is 499 and the remainder is 2. The last digit of 8 1998 is the same
as the last digit of 82, so the last digit is 4.
or 81998 = 84 × 499 + 2 = 82 = 64. The last digit is 4.
Same very useful formulas:
an – bn = (a – b) (an – 1 + an – 2b + an – 3b + … + abn – 2 + bn – 1) where n is positive integer
an – bn = (a + b) (an – 1 – an – 2b + an – 3b – … + abn – 2 – bn – 1) where n is even
an + bn = (a + b) (an – 1 – an – 2b + an – 3b – … – abn – 2 + bn – 1) where n is odd
What are the last two digits of 2202?
Sol: 04, (order is important)
First we find the last digit of 2 202. We know that it is the same as the last digit of 22, which is 4.
The tens digit of 2202 can be obtained by the following way:
1 202 4 2 2 2
(2 − 4) = (2200 − 1) = (2200 − 1) = (1650 − 1) = (16 − 1)(1649 + 1648 +  + 16 + 1)
10 10 5 5 5
= 6(649 + 648 +  + 6 + 1)  6(6 + 6 + 6 + n + 6 + 1) = 6(49  6 + 1) = 1770  0(mod 3)
49

So the last two digits are 04.

q n
Note: When we obtain the form ( x − y n ), where (p, q) = 1, n is positive integer, we need to make
p
sure that p | x – y. This is a necessary condition in order to get the correct digit.
2 2
For example, (2200 − 1) is not a good form for example 1 but (1650 − 1) is.
5 5

NUMBER SYSTEM 47
OLYMPIAD BOOKLET

Find the last two digits of 62002.

Sol: Method-1:
61 = 06 62 = 36 63 = 16 64 = 96
6 = 76
5
6 = 56
6
67 = 36 68 = 16
69 = 96 610 = 76 611 = 56
The last two digits of 6 (n ≥ 2) have the pattern : 36, 16, 96, 76, 56, … which repeats every 5 terms.
n

2002 = 5 × 400 + 2. The remainder of 2002 divided by 5 is 2, so the last two digits are equivalent to 6 2,
which is 36.
Method-2:
We know that the last digit of 62002 is 6.
The tens digit can be obtained by the following way :
1 2002 6 3 3
(6 − 6) = (62001 − 1) = (62001 − 1) = (6 − 1)(6 2000 + 61999 +  + 6 + 1)
10 10 5 5
= 3(62000 + 61999 +  + 6 + 1) = 3((6 + 6 + 6 + n + 6} + 1) = 3(2000  6 + 1)  3(Mod.3)
20006 s
So, the last two digits are 36.
Find the last three digits of 62002.
Sol: As we know that the last two digits of 62002 are 36. The hundreds digit can be obtained in the following
way:
1 2002 36 2000 9 9 9
(6 − 36) = (6 − 1) = (62000 − 1) = [(65 )400 − 1] = (7776400 − 1)
100 100 25 25 25
9
 (7776 − 1)(7776399 + 7776398 +  + 7776 + 1) = 9  311 (6 + 6 + 6 + n + 6 + 1)
25 399

= 9 × 1 × (399 × 6 + 1) = 9 × 1 × (9 × 6 + 1) = 9 × 1 × 5 ≡ 5(Mod. 10)

So, the last three digits of 62002 are 536.
Find the last two digits of 72005.
Sol: The pattern for the last digit is: 7, 9, 3, 1, 7, 9, 3, 1, etc.
2005 ÷ 4 = 501R1. That means that the last digit of 72005 is the same as the last digit of 71, so the last digit
is 7.
The tens digit can be obtained the following way:
1 2005 7 7 7
(7 − 7) = (7 2004 − 1) = [491002 − 1] = (49 + 1)(71001 − 71000 +  + 7 − 1)
10 10 10 10
≡ 35 (71001 – 71000 + … + 7 – 1) ≡ 5(7 + 250 × (7 – 1 + 3 – 9) – 1) ≡ 30 ≡ 0 (mod 10)
So the last two digits are 07.
Note: an – bn = (a + b) (an – 1 – an – 2b + an – 3b – … + abn – 2 – bn – 1) when n is even.
Find the last three digits of 72005.
Sol: We know that the last two digits of 72005 are 07. The hundreds digit can be obtained the following way :
1 2005 7 2004 7 7
(7 − 7) = (7 − 1) = [(7 4 )501 − 1] = (2401 − 1)(2401500 + 2401499 +  + 2401 + 1)
100 100 100 100

NUMBER SYSTEM 48
OLYMPIAD BOOKLET

≡ 7 × 24 × (2401500 + 2401499 + … + 24017 + 1) ≡ 7 × 4 × (1500 + 1499 + … + 1 + 1)

≡ 8 × (501) ≡ 8 × 1 ≡ 8 (mod 10)
So the last three digits of 72005 are 807.
Find the last three digits of 52012.
Sol: We use f (x) to represent the last three digits of x.
f (51) = 005
f (52) = 025
f (53) = 125
f (54) = 625
f (55) = 125
f (56) = 625
Observe the pattern that when x is an even power of 5, the last three digits are 625 when x > 53. Since
2012 is even, the last three digits are 625.
Find the last non-zero digit in 30!.
Sol: We first obtain the prime factorization of 30!. Observe that 29 is the largest prime number less than 30.
We have
 30   30   30   30 
 2  +  22  +  23  +  24  = 26
       
 30   30   30 
 3  +  32  +  33  = 14
     
 30   30 
 5  +  52  = 7
   
 30 
 7 =4
 
 30 
 11  = 2
 
 30 
 13  = 2
 
 30   30   30   30 
 17  =  19  =  23  =  29  = 1.
       
Thus, 30! = 226 · 314 · 57 · 74 · 112 · 132 · 17 · 19 · 23 · 29
30!
107 = 219 · 314 · 74 · 112 · 132 · 17 · 19 · 23 · 29
= 614 · 25 · 74 · 112 · 132 · 17 · 19 · 23 · 29
= 6(2)(1)(1)(9)(7)(9)(3)(9) (mod 10)
= 2(– 1)(– 3)(– 1)(3)(– 1)(mod 10)
= 8(mod 10)
showing that the last non-zero digit is 8.

NUMBER SYSTEM 49
OLYMPIAD BOOKLET

Let S be the smallest positive multiple of 15, that comprises exactly 3k digits with k '0's,
k'3's and k'8's. Find the remainder when S is divided by 11.
Sol: S being a multiple of 5 and 3 must end with '0' and has the sum of digits divisible by 3. Since 3 + 8 = 11,
the smallest positive k such that k × 11 is divisible by 3 is 3. Thus S = 300338880 and the remainder is
0 – 8 + 8 – 8 + 3 – 3 + 0 – 0 + 3 = – 5 = 6 (mod 11).
Let n be a positive integer. Find the number of possible remainders when 2013 n – 1803n –
1781n + 1774n is divided by 203.
Sol: For any positive integer n,
2013n – 1803n – 1781n + 1774n = (2013n – 1803n) – (1781n – 1774n)
= (2013 – 1803)u – (1781 – 1774)v = 210u – 7v
2013n – 1803n – 1781n + 1774n = (2013n – 1781n) – (1803n – 1774n)
= (2013 – 1781) x – (1803 – 1774) y = 29x – 29y.
So 2013n – 1803n – 1781n + 1774n is divisible by 7 × 29 = 203 for every positive integer n.
Find the total number of positive integers n not more than 100 such that n4 + 5n2 + 9 is
divisible by 5.
Sol: Note that n4 + 5n2 + 9 = n4 – 1 + 5n2 + 10 = (n – 1) (n + 1) (n2 + 1) + 5 (n2 + 2).
If n = 1 or 4 (mod 5), then 5 divides n – 1 or n + 1.
If n = 2 or 3 (mod 5), then 5 divides n2 + 1.
If n = 0 (mod 5), then 5 does not divide (n – 1)n(n2 + 1) but divides 5 (n2 + 2), hence does not divide
n4 + 5n2 + 9.
Thus, there are 100 ÷ 5 = 20 multiples of 5 from 1 to 100. The number of integers thus required is
100 – 20 = 80.

1. Given 1x6y7 is a five-digit number divisible (a) 1 (b) 2

by 9. The number of ordered pairs (x, y) (c) 3 (d) 4
satisfying this is 5. The years of 20th century and 21th century are
(a) 5 (b) 6 of 4 digits. The number of years which are
(c) 8 (d) 11 divisible by the product of the four digits of
the year is
2. The number of three-digit numbers that are
(a) 7 (b) 8
divisible by 2 but not divisible by 4 is
(c) 9 (d) none of these
(a) 200 (b) 225 6. The number of numbers of the form 30a0b03
(c) 250 (d) 450 that are divisible by 13, where a, b are digits, is
3. a, b, c are the digits of a nine digit number (a) 5 (b) 6
abcabcabc. Calculate the quotient when this (c) 7 (d) 0
number is divided by 1001001. 7. A natural number n has exactly two divisors
(a) 100a + 10c + b (b) 100c + 10b + a and (n + 1) has three divisors. The number of
(c) 100a + 10b + c (d) 10a + c divisors of (n + 2) is
4. Find the number of integers n for which (a) 2
(b) 3
n (c) 4
is the square of an integer.
20 − n (d) depends on the value of n

NUMBER SYSTEM 50
OLYMPIAD BOOKLET

8. If n = 1010 – 1, the number of digits in n3 is 20. Total number of 0's at the end of the value of
(a) 30 (b) 28 the product 1 × 2 × 3 × 4 × … × 2008 is n,
(c) 32 (d) 27
then find the value of n + 125 ?
9. The last two digits of 32012, when represented
21. Let n denote the smallest positive integer that
in decimal notation, will be
is divisible by both 4 and 9, and whose base-
(a) 81 (b) 01
10 representation consists of only 4's and 9's,
(c) 41 (d) 21 with at least one of each. What will be the sum
10. Give the units digit of the number 32011.
of the last four digits of n?
(a) 7 (b) 8
22. An n-digit positive integer is cute if its n digits
(c) 10 (d) 11
are an arrangement of the set {1, 2, …, n} and
11. When written out completely 162011 has m
its first k digits form an integer that is divisible
digits and 6252011 has n digits. Find the value by k, for k = 1, 2, …, n. For example, 321 is a
of (m + n).
cute 3-digit integer because 1 divides 3, 2
(a) 8000 (b) 4045
divides 32, and 3 divides 321. How many cute
(c) 8045 (d) 7040
6-digit integers are there?
12. Find the units digit of (2013)2013.
23. Consider the non-decreasing sequence of
(a) 2 (b) 3 positive integers
(c) 5 (d) 7
1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, …
13. Suppose that n is the product of three
in which the nth positive integer appears n
consecutive integers and that n is divisible by
times. The remainder when the 2019th term is
7. Which of the following is not necessarily a
divided by 5 is
divisor of n? 24. Mary chose an even 4-digit number n. She
(a) 14 (b) 21
wrote down all the divisors of n in increasing
(c) 28 (d) 6
n
14. Find the last two digits of 9100 – 1. order from left to right: 1, 2, …, , n. At
2
15. Find the sum of digits of the largest positive
some moment Mary wrote 323 as a divisor of
integer n such that n! ends with exactly 100
n. If the smallest possible value of the next
zeros.
divisor written to the right of 323 is n. Find
16. Find the number of positive integers n such
N
that n + 2n2 + 3n3 + … + 2005n2005 is divisible the value of .
10
by n – 1.
25. The largest divisor of 2, 014, 000, 000 is itself.
17. Let n be the number
If its fifth largest divisor is x. Find sum of all
(99999999999)2 − (66666666)2 the digits of x.
20069s 20066 s 26. How many three-digit numbers are not
Find the reminder when n is divided by 11. divisible by 5, have digits that sum to less than
18. What is the sum of all the digits of the largest 20, and have the first digit equal to the third
positive integer n for which n3 + 2006 is digit?
divisible by n + 26? 27. How many even integers are there between
19. Find the smallest positive integer n such that 200 and 700 whose digits are all different and
n(n + 1)(n + 2) is divisible by 247. come from the set 1, 2, 5, 7, 8, 9?

NUMBER SYSTEM 51
OLYMPIAD BOOKLET

'a' and 'b' are two natural numbers with a + b = 8. If a ≥ b and a2 + b2 has minimum value,
then a and b are given by
(a) 7, 1 (b) 6, 2 (c) 4, 4 (d) 5, 2
Sol: a2 + b2 = a2 + (8 – a)2 = 2a2 – 16a + 64 = 2 (a2 – 8a + 16) + 32 = 2(a – 4)2 + 32
This is minimum when a = 4
Then b = 4.
A certain number has exactly eight factors including 1 and itself. Two of its factors are 21
and 35. The number is
(a) 105 (b) 210 (c) 420 (d) 525
7 3
Sol: Since the number has exactly eight factors, it has the representation, p1 , p1 p2 or p1p2p3 where p’s are
primes. As 21 and 35 are its factors 3, 5, 7 are its factors. Hence the number is 3 × 5 × 7 = 105.
Find the sum of all three digit numbers that can be written using the digits 1, 2, 3, 4
(repetitions allowed).
Sol: We may have any one of the four digit 1, 2, 3, 4 in the hundreds place, tens place or units place.
Therefore we have 4 × 4 × 4 = 64 three digit numbers in all. If we consider the units place of these 64
numbers, we see that each of the four digit appears 16 times. The same conclusion is true about tens
place and hundreds place. So the sum of the 64 three digit numbers that we can form from the gives four
digits is
S = 16(1 + 2 + 3 + 4) × 100 + 16(1 + 2 + 3 + 4) × 10 + 16(1 + 2 + 3 + 4) × 1
∴ S = 16000 + 1600 + 160 = 17760
How many two digit numbers divide 109 with a remainder of 4?
(a) 2 (b) 4 (3) 3 (d) None
Sol: As remainder is 4, we need two-digit divisors of 109 – 4 = 105.
As 105 = 5 × 3 × 7. Two digit divisors are 15, 21 and 35. Thus there are 3 such divisors.
1
If a2 + a + 1 = 0 then a 2 + 2 is a
a
(a) Positive integer
(b) Positive fraction which is not an integer
(c) Negative integer
(d) Negative fraction which is not an integer
Sol: As a ≠ 0 from a2 + a + 1 = 0, we have
2
1  1
a+ = −1 and  a +  = 1
a  a
2 2
1 1
∴ a2 + + 2 = 1 or a 2 + = −1  0
a a
The number of integers whose square is a factor of 2000 is
(a) 3 (b) 6 (c) 10 (d) 12
Sol: As 2000 = 24 × 53 the factors which are square numbers are 22, 24, 52, 22 × 52, 24 × 52. Trivially 12 = 1 is
also a factor. Thus the squares of the six numbers 1, 2, 4, 5, 10, 20 are factors of 2000.

NUMBER SYSTEM 52
OLYMPIAD BOOKLET

A three digit number with digits A, B, C in that order is divisible by 9. A is an odd digit
and C is an even digit. B and C are non zero. The number of such three digit numbers is
(a) 4 (b) 8 (c) 16 (d) 20
Sol: A + B + C = 9, 18 or 27 and a is odd and C is even, B, C non-zero.
We shall fix the digit A as 1, 3, 5, 7 and 9 and find the corresponding values of B and C and count the
number of numbers.
ABC ABC ABC ABC
(1) 1 6 2 (6) 3 2 4 (11) 5 7 6 (16) 7 3 8
(2) 1 4 4 (7) 3 9 6 (12) 5 5 8 (17) 9 7 2
(3) 1 2 6 (8) 3 7 8 (13) 7 9 2 (18) 9 5 4
(4) 1 9 8 (9) 5 2 2 (14) 7 7 4 (19) 9 3 6
(5) 3 4 2 (10) 5 9 4 (15) 7 5 6 (20) 9 1 8
Thus there are 20 such numbers.
The least number of numbers to be deleted from the set {1, 2, 3, …, 13, 14, 15} so that
the product of the remaining numbers is a perfect square is
(a) 1 (b) 2 (c) 3 (d) 4
Sol: The product of all the numbers from 1 to 15 (i.e. 15!) is 1 × 2 11 × 36 × 53 × 72 × 111 × 131
= 2 × 210 × 36 × 53 × 72 × 111 × 131 = 1 × 210 × 36 × 52 × 72 × 10 × 11 × 13
When the numbers from 1 to 15 expressed as a product of even powers of prime numbers, the numbers
10, 11, 13 have odd powers. So these three numbers to be deleted so that the product of other numbers
become a perfect square.
A number is formed by writing the first 10 primes in the increasing order. Half of the
digits are now crossed out, so that the number formed by the remaining digits without changing the order, is as
larger as possible. The second digit from the left of the new number is
(a) 2 (b) 3 (c) 5 (d) 7
Sol: The initial number is 2357111317192329. This has 16 digits, 8 of which are to be deleted. To get the
largest number the leading digits should be as large as possible. Starting with 9 there can be only at the
most 5 digits. So 9 can neither the first digit nor the second digit. The first two digits can be 7 . The
largest possible new number is 77192329.
10 Let n be the number of integers less than 10, 000 which are divisible by all integers
from 2 to 10. Then
(a) N = 0 (b) 1 ≤ n < 5 (c) 5 ≤ n < 10 (d) 10 ≤ n < 15
Sol: The numbers divisible by all the integers from 2 to 10 are the multiples of the LCM of all the integers
from 2 to 10 which is 8 × 9 × 5 × 7 = 2520.
So, the multiples of 2520 less 10, 000 are 2520, 2 × 2520 = 5040, 3 × 2520 = 7560
Thus there are exactly three numbers less than 10, 000 and divisible by all integers from 2 to 10.
The number of primes less than 100 but having 7 as the unit digits is
(a) 6 (b) 7 (c) 8 (d) 9
Sol: The numbers less than 100 but having "7" as the unit digit are 7, 17, 27, 37, 47, 57, 67, 77, 87 and 97. 27,
57, 77 and 87 are composite numbers whereas the numbers 7, 17, 37, 47, 67 and 97 are primes. They are
6 in numbers.

NUMBER SYSTEM 53
OLYMPIAD BOOKLET

The number of two-digit numbers whose digit sum is divisible by 6 is

(a) 13 (b) 8 (c) 7 (d) 22
Sol: The sum of the digits of such two digit numbers can be 6, 12 or 18.
∴ The numbers 15, 24, 33, 42, 51 give a digit sum 6, the numbers 39, 48, 57, 66, 75, 84, 93 give a
digit sum 12 and 99 gives a digit sum 18.
∴ There are (5 + 7 + 1) = 13 such 2 digit numbers.
The number of ordered triples (a, b, c) 1 ≤ a, b, c ≤ 9 such that ac = b2 – 1 is
(a) 9 (b) 7 (c) 14 (d) 18
Sol: ac = b – 1 ⇒ a × c = (b – 1)(b + 1) with this property we find that any 2 consecutive numbers, satisfy
2

the condition; the ordered triples are (1, 2, 3), (3, 2, 1), (2, 3, 4), (4, 3, 2), (3, 4, 5), (5, 4, 3), (4, 5, 6),
(6, 5, 4), (5, 6, 7), (7, 6, 5), (6, 7, 8), (8, 7, 6), (7, 8, 9), (9, 8, 7). Again we have (1, 3, 8), (8, 3, 1),
(3, 5, 8) and (8, 5, 3).
Thus there are 18 ordered triples satisfying the given conditions.
The tens place of two three digit numbers is 8 and both the numbers are divisible by 4.
Then the difference between the biggest and the smallest such numbers is
(a) 888 (b) 808 (c) 708 (d) 788
Sol: The smallest three digit number with 8 in the tens place and divisible by 4 is 180 and the biggest such
number is 988. So the differences is 988 – 180 = 808
The number 111…1111 is a 2009 digit number. It is multiplied by 2009. The third digit
from the left of the product is
(a) 1 (b) 2 (c) 3 (d) 9
Sol: The actual multiplication of the 2009 digit number 111…1111 is shown below.
1111 111  2009
9999 9999
00000 000
000000 00
2222222 2
2232222 21999
The carry over 1 by adding 9 + 2 starts from the 5th place from the right. The carry over 1 from the 4 th
place from the left is added to the digit 2, and there are no more carry overs. The product is
2232222 all these digit are 21999
So the third digit from the left is 3.
The remainder when the number (2 × 3 × 4 × 2007 × 2008 × 2009) – 2008 is divided by
2009 is
(a) 0 (b) 2008 (c) 1 (d) 2007
Sol: 2 × 3 × 4 × 2007 × 2008 × 2009 – 2008 = 2 × 3 × 4 × 2007 × 2008 × 2009 – 2009 + 1
= 2009 × [2 × 3 × 4 × 2007 × 2008 – 1] + 1
2009 divides 2009 [2 × 3 × 4 × 2007 × 2008 – 1]. Hence when the given number is divided by 2009, this
remainder is 1.

NUMBER SYSTEM 54
OLYMPIAD BOOKLET

A certain number n is divisible by 21, 28 and 49. The smallest possible value of n is
Sol: 'n' is divisible by 21, 28 and 49. So n is divisible by the prime numbers 2, 3 and 7. The greatest power of
these numbers in the divisors of n are 2, 1 and 2 respectively. So the least value of n is 22 × 31 × 72 = 588.
Using the digits 2 and 7, and addition or subtraction operations only, the number 2010 is
written. The maximum number of 7 that can be used, so that the total numbers used is a minimum is
(a) 284 (b) 286 (c) 288 (d) 290
Sol: 2010 = 7 × 287 + 1, gives
2010 = 7 + 7 + 7 + + 7 + 1 …(i)
287 times

The number of digits used being 287 + 1; but only the digits 7 and 2 are to be used.
∴ 2010 = 7 × 286 + 4 × 2 = 7 + 7 + 7 +  + 7 + 2 + 2 + 2 + 2 …(ii)
286 times 4 times

The total number used is 290.

Again 2010 = 7 × 288 – 3 × 2 = 7 + 7 + 7 +  + 7} − 2 − 2 − 2} …(iii)
288 times 3 times

Total numbers used have is 288 + 3 = 291 > 290

In (ii), we use 286 sevens and the total number of digits used is 290 which is the minimum.
1 1 1
+ = where a, b are natural numbers.
a b 13
(1) a = b = 26 (2) a = 13, b = 13 × 14 (3) a = 14, b = 13 × 14
Of these statements the correct statements are
(a) (1) and (2) (b) (1) and (3) (c) (2) and (3) (d) (1) (2) and (3)
1 1 1
Sol: + =
a b 13
(1) a = b = 26 gives
1 1 2 1
+ = = is a correct statement or true statement
26 26 26 13
(2) a = 13, b = 13 × 14
1 1 1 1 14 + 1 15 1
+ = + = = 
a b 13 13 14 13 14 13 14 13
∴ It is false
(3) a = 14, b = 13 × 14
1 1 1 1 13 + 1 14 1
+ = + = = =
a b 14 13 14 13 14 13 14 13
(1) true statement, So (1) and (3) are the correct statements.
A number is called a palindrome if it reads the same forward of backward. For example 13531
is a palindrome. The difference between the biggest 10 digit palindrome and the smallest 9 digit palindrome is
(a) 976666666 (b) 9888888888 (c) 9899999998 (d) 9777777777
Sol: The biggest 10 digit palindrome number is 99999

The smallest 9 digit palindrome number is 1 00001}

7 times

The difference is 98 99998

7 times

NUMBER SYSTEM 55
OLYMPIAD BOOKLET

It is given that a and b are positive integers such that a has exactly 9 positive divisors and b
has exactly 10 positive divisors. If the least common multiple (LCM) of a and b is 4400, find the value of |a – b|.
Sol: Since the number of positive divisors of a is odd, a must be a perfect square. As a is a divisor of 4400 =
24 × 52 × 11 and a has exactly 9 positive divisors, we see that a = 22 × 52. Now the least common
multiple of a and b is 4400 implies that b must have 2 4 × 11 as a divisor. Since 24 × 11 has exactly 10
positive divisors, we deduce that b = 24 × 11 = 176. Hence |a – b| = 76.
It is given that a, b and c are three positive integers such that a2 + b2 + c2 = 2011. Let the
highest common factor (HCF) and the least common multiple (LCM) of the three numbers a, b, c be denoted by
x and y respectively. Suppose that x} + y} = 388. Find the value of a + b + c.
Sol: Without loss of generality, we may assume that a ≥ b ≥ c. Let the HCF (or GCD) of a, b and c be d. Then a
2
2011
= da1, b = db1 and c = dc. Let the LCM of a1, b1 and c1 be m. Thus, a12 + b12 + c12 = and d + md = 388
d
388
or 1 + m = . So, d2 | 2011 and d | 388. Note that 2011 is a prime. Thus we must have d = 1, and it
d
follows that a = a1, b = b1, c = c1, and thus a2 + b2 + c2 = 2011. In particular, a2 + b2 + c2 < 2025 = 452, so
that one has a, b, c < 45. Furthermore we have m = 387 = 32 × 43. Thus a, b and c can only be 1, 3, 9 or 43,
since they must be less than 45. Then it is easy to check that 432 + 92 + 92 = 2011, and a = 43, b = c = 9 is
the only combination which satisfies the given conditions. Thus we have a + b + c = 43 + 18 = 61.
How many triples of non-negative integers (x, y, z) satisfying the equation xyz + xy + yz +
zx + x + y + z = 2012?
Sol: (x + 1)(y + 1)(z + 1) = 2013 = 3 × 11 × 61.
If all x, y, z are positive, there are 3! = 6 solutions.
If exactly one of x, y, z is 0, there are 3 × 6 = 18 solutions.
If exactly two of x, y, z are 0, there are 3 solutions.
6 + 18 + 3 = 27.
Let L denote the minimum value of the quotient of a 3-digit number formed by three
distinct digits divided by the sum of its digits. Determine [L]. (where [·] denotes greatest integer function)
Sol: A three-digit number can be expressed as 100a + 10b + c, and so we are minimizing
100a + 10b + c
F (abc) =
a+b+c
Observe that with distinct digits abc, F(abc) has the minimum value when a < b < c. Thus we assume
that 0 < a < b < c ≤ 9.
Note that
100a + 10b + c 99a + 9b
F (abc) = = 1+
a+b+c a+b+c
We observe now that F(abc) is minimum when c = 9.
99a + 9b 9(a + b + 9) + 90a − 81 9(10a − 9)
F (ab9) = 1 + = 1+ = 10 +
a+b+9 a+b+9 a+b+9
Now F (a b 9) is minimum when b = 8.

NUMBER SYSTEM 56
OLYMPIAD BOOKLET

9(10a − 9) 90(a + 17) − 1611 1611

F (a89) = 10 + = 10 + = 100 −
a + 17 a + 17 a + 17
which has the minimum value when a = 1, and so L = F (189) = 10.5 and [L] = 10.
If the total number of sets of positive integers (x, y, z), where x, y and z are positive
integers, with x < y < z such that x + y + z = 203 is n, then find the sum of the digits of n.
 202  202(201)
Sol: First note that there are  = = 20301 positive integer sets (x, y, z) which satisfy the given
 2  2
equation. These solution sets include those where two of the three values are equal. If x = y, then 2x + z =
203. By enumerating, z = 1, 3, 5, …, 201. There are thus 101 solutions of the form (x, x, z). Similarly,
there are 101 solutions of the form (x, y, x) and (x, y, y). Since x < y < z, the required answer is
1   202   20301 − 303
  − 3(101)  = = 3333
3!   2   6
If a and b are positive integers such that a2 + 2ab – 3b2 – 41 = 0, find the value of a + b.
Sol: We have a + 2ab – 3b2 = (a – b)(a + 3b) = 41. Since 41 is a prime number, and a – b < a + 3b, we have
2

a – b = 1 and a + 3b = 41. Solving the simultaneous equations gives a = 11 and b = 10. Hence a + b = 21.
What is the smallest positive integer n, where n ≠ 11. such that the highest common factor
of n – 11 and 3n + 20 is greater than 1?
Sol: Let d > 1 be the highest common factor of n – 11 and 3n + 20. Then d | (n – 11) and d | (3n + 20). Thus d
| [3n + 20 – 3(n – 11)], i.e., d | 53. Since 53 is a prime and d > 1, it follows that d = 53. Therefore n – 11
= 53k, where k is a positive integer, so n = 53k + 11. Note that for any k, 3n + 20 is a multiple of 53 since
3n + 20 = 3(53k + 111) + 20 = 53(3k + 1). Hence n = 64 (when k = 1) is the smallest positive integer
such that HCF (n – 11, 3n} + 20) > 1.
If the number of integers between 1 and 2013 with the property that the sum of its digits
equals 9 is k then find the sum of digits of k.
Sol: Case 1: n < 1000. Write n = abc . Then a + b + c = 9, a, b, c ∈ {0, 1, …, 9}.
Case 2: 1000 ≤ n < 2000. Write n = 1abc . Then a + b + c = 8, a, b, c ∈ {0, 1, …, 8}.
Case 3: 2000 ≤ n ≤ 2013. Then n = 2007.
 9 + 3 − 1  8 + 3 − 1
Therefore, there are  +  + 1 = 55 + 45 + 1 = 101 such numbers.
 9   8 
Let A be a 4-digit integer. When both the first digit (left-most) and the third digit are
increased by n, and the second digit and the fourth digit are decreased by n, the new number is n times A. Find
the sum of digits of A.
Sol: [18]
Let the 4-digit number be A = abcd . Then 1000 (a + n) + 100 (b – n) + 10 (c + n) + (d – n) = nA.
It gives A + 909n = nA; or equivalently, (n – 1) A = 909n.
Note that (n – 1) and n are relatively prime and 101 is a prime number. We must have (n – 1) is a factor
of 9. So n = 2 or n = 4.
If n = 4, then A = 1212, which is impossible since b < n. So n = 2 and A = 909 × 2 = 1818.

NUMBER SYSTEM 57
OLYMPIAD BOOKLET

1. The sum of the digits of the number 10 n – 1 is 8. The remainder when the number
3798. The value of n is (2 × 3 × 4 × 2012 × 2013 × 2014 × 2015) –
(a) 431 (b) 673 2008 is divided by 2015 is
(c) 422 (d) 501 (a) 1 (b) 2008
2. a, b, c, d are natural numbers such that a = bc, (c) 7 (d) 2007
b = cd, c = da and d = ab. Then (a + b) (b + c) 9. The last digit in the finite decimal
2004
(c + d) (d + a) is equal to 1
representation of the number   is
(a) (a + b + c + d)2 5
(b) (a + b)2 + (c + d)2 (a) 8 (b) 6
(c) (a + d)2 + (b + c)2 (c) 4 (d) 2
(c) (a + c)2 + (b + d)2 10. A natural number n has exactly two divisors
3. A three digit number with digits A, B, C in that and (n + 1) has three divisors. The number of
order is divisible by 9. A is an odd digit and C divisors of (n + 2) is
is an even digit. B and C are non zero. The (a) 2
number of such three digit numbers is (b) 3
(a) 4 (b) 8 (c) 4
(c) 16 (d) 20 (d) depends on the value of n
4. Nine numbers are written in ascending order. 11. The sum of two natural number is 100. Which
The middle number is also the average of the of the following can be the greatest product of
nine numbers. The average of the 5 larger the numbers.
numbers is 68 and the average of the 5 smaller (a) 1000 (b) 4000
(c) 2500 (d) 900
numbers is 44. The sum of all the numbers is
12. A computer is printing a list of the seventh
(a) 540 (b) 450
powers of all natural numbers, that is the
(c) 504 (d) 501
sequence 17, 27, 37,…. The number of terms
5. If the average of 20 different positive integers
(or numbers) between 521 and 428 are
is 20 then the greatest possible number among
(a) 12 (b) 130
these 20 numbers can be (c) 14 (d) 150
(a) 210 (b) 200 13. For a positive integer k, we write
(c) 190 (d) 180 (1 + x) (1 + 2x) (1 + 3x)…(1 + kx) = a0 + a1x +
6. If a, b are natural numbers such that a + b = a 2x 2 + … + a k x k
2008, then (– 1)a + (– 1)b is where a0, a1, …, ak are the coefficients of the
(a) 1 (b) – 1 polynomial. Find the sum of all the digits of
(c) 2 (d) 2 or – 2 smallest possible value of k if a0 + a1 + a2 +
7. The number 16 is obtained from the number
12
… + ak – 1 is divisible by 2005.
84 by raising the smaller number to the power 14. The smallest three-digit number n such that if
n. Then n is the three digits are a, b and c, then
(a) 3 (b) 4 n = a + b + c + ab + bc + ac + abc
16 8 n +1
(c) (d) Evaluate .
3 3 5

NUMBER SYSTEM 58
OLYMPIAD BOOKLET

15. What is the largest positive integer n 23. How many four-digit numbers n have the
satisfying n200 < 5300? property that the three-digit number obtained by
16. n pieces of candy are made and packed into removing the leftmost digit is one ninth of n?
boxes, with each box containing 45 pieces. If 24. If a, b, and c are positive real numbers such
n is a non-zero perfect cube and 45 is one of that a (b + c) = 152, b (c + a) = 162, and c (a +
its factors, what is the least possible number of abc
b) = 170, then is
boxes that can be packed? 12
17. For any non-empty finite set a of real 25. If x, y, and z are positive numbers satisfying
numbers, let s(A) be the sum of the elements x + 1/y = 4, y + 1/z = 1, and z + 1/x = 7/3
in a. There are exactly 61 3-element subsets a then find xyz?
of {1, …, 23} with s(A) = 36. The total number 26. There are x integer values of n (not necessarily
n
of 3-element subsets of {1, …, 23} with s(A) < 2
positive) so that value of 4000.   is an
n + 45 5
36 is given by n. Then evaluate .
25 integer. What is x2?
18. Let the sum of the digits of the given product 27. Let S be a set of 6 integers taken from {1, 2,
is written as A8B6C. Find A + B + C …12} with the property that if a and b are
(111111111111)  2007 elements of S with a < b, then b is not a
2007 1s multiple of a. What is the square of the least
19. When 2007 bars of soap are packed into n possible value of an element in S?
boxes of equal size, where n is an integer 28. R nonnegative integers can be written in the
strictly between 200 and 300, there are extra 5 form a7 · 37 + a6 · 36 + a5 · 35 + a4 · 34 + a3 ·
bars remaining. Find last two digit of n. 33 + a2 · 32 + a1 · 31 + a0 30, where a1 ∈ {–1, 0,
20. Let the number of distinct integers among the 1} for 0 ≤ i ≤ 7. What is the last two digits of
numbers is n. Find the sum of all digits of n. R?
29. How many odd positive 3-digit integers are
 12   22   20072  divisible by 3 but do not contain the digit 3?
 ,
   , n,  
 2007   2007   2007  30. Let p and q be positive integers such that
21. For each integer n ≥ 4, let an denote the base- 5 p 4
  and q is as small as possible. What
n number 0.133n . The product a4a5…a99 can 9 q 7
m is (q – p)2?
be expressed as . where m and n are 31. A function f is defined recursively by f (1) = f
n!
positive integers and n is as small as possible. (2) = 1 and f (n) = f (n – 1) – f (n – 2) + n for
What is the value of sum of the digits of m? all integers n ≥ 3. What is the sum of the digits
22. The square is a multiplicative magic square. of f (2018)?
That is, the product of the numbers in each 32. Sunita has 30 thin rods, one each of every
integer length from 1 cm through 30 cm. She
row, column, and diagonal is the same. If all
places the rods with lengths 3 cm, 7 cm, and
the entries are positive integers, what is the
15 cm on a table. She then wants to choose a
sum of the possible values of g?
fourth rod that she can put with these three to
50 b c form a quadrilateral with positive area. How
d e f many of the remaining rods can she choose as
g h 2 the fourth rod?

NUMBER SYSTEM 59
OLYMPIAD BOOKLET

33. A five-digit palindrome is a positive integer 41. The difference between the highest common
with respective digits abcba, where a is non- factor and the lowest common multiple of x
zero. Let S be the sum of all five-digit and 18 is 120. Find the value of x.
palindromes. What is the sum of the digits of S? 42. Given that n is a ten-digit number in the form
34. The products (8) (888…8), where the second 2007 x2008 y where x and y can be any of the
factor has k digits. is an integer whose digits
digits 0, 1, 2, …, 9. How many such numbers
have a sum of 1000. What is the sum of digits
n are there that are divisible by 33?
of k?
43. How many positive integers n, where 10 ≤ n ≤
35. There are total P positive integers value of n,
n2 − 9
n 100, are there such that is a fraction in
so that is also a positive integer. What n2 − 7
30 − n
its lowest terms?
is P2?
44. Let n be a positive integer such that n2 + 19n +
36. Let S be the set of positive integers n for
48 is a perfect square. Find the value of n.
1
which has the repeating decimal 45. Find the smallest integer n such that
n
n( 101 − 10)  1 .
representation 0·ab = 0. ababab…, with a
46. Find the smallest positive integer N such that
and b different digits. The sum of the elements
2n > n2 for every integer m in {N, N + 1, N + 2,
of S is a three digit number abc. What is the
N + 3, N + 4}.
abc
value of ? 47. The highest natural number which are
11
divisible by 30 and have exactly 30 different
37. Let a, b, and c be digit with a ≠ 0. The three-
positive divisors can be written as A1B5C then
digit integer abc lies one third of the way from
find A + B + C.
the square of a positive integer to the square of
48. Let p and q represent two consecutive prime
the next larger integer. The integer acb lies
numbers. For some fixed integer n, the set {n
two thirds of the way between the same two
– 1, 3n – 19, 38 – 5n, 7n – 45} represents {p,
squares. What is a + b + c?
2p, q, 2q}, but not necessarily in that order.
38. There are p pairs of positive integers (a, b)
Find the value of n.
a 14b 49. If a, b and c are positive real numbers such
such that gcd (a, b) = 1 and + is an
b 9a that ab + a + b = bc + b + c = ca + c + a = 35
integer. What is 7 × p? then the value of (a + 1) (b + 1) (c + 1) = xy.
39. Let a, b, c, d, e, f, g and h be distinct elements Find the product of x and y.
in the set {–7, –5, –3, –2, 2, 4, 6, 13}. What is 50. Find the largest possible value of n such that
the minimum possible value of (a + b + c + d)2 there exist n consecutive positive integers
+ (e + f + g + h)2. whose sum is equal to 2010.
40. There are 88 numbers a1, a2, a3, …, a88 and 51. Let S be the set of all integers n such that
each of them is either equals to –3 or –1.
8n3 − 96n 2 + 360n − 400
Given that a12 + a22 + n + a882 = 280, and is an integer. Find
2n − 7
a14 + a24 + n + a884 = 103 a + b . Find the product the value of |n | .
of a and b nS

NUMBER SYSTEM 60
OLYMPIAD BOOKLET

52. Find the sum of all positive integers p such 64. The sum of the digits of a two-digit number is
that the expression (x – p)(x – 13) + 4 can be subtracted from the number. The units digit of
expressed in the form (x + q)(x + r) for distinct the result is 6. How many two-digit numbers
integers q and r. have this property?
1 1
2 3
1 65. For how many positive integers N does 1 + 2
53. Let Pk = 1 + − − , where k is a positive + … + n evenly divide from 6n?
k k k
integer. Find the sum of all the digits of least 66. For each positive integer m > 1, let P (m)
positive integer n such that the product P2P3… denote the greatest prime factor of m. For how
Pn exceeds 2010. many positive integers n is it true that both
54. What is the sum of the digits of the square of P(n) = n and P(n + 48) = n + 48 ?
111, 111, 111? 67. Suppose that 4a = 5, 5b = 6, 6c = 7 and 7d = 8.
55. Let a, b, c, and d be real numbers with |a – b|  a.b.c.d 
= 2, |b – c| = 3 and |c – d| = 4. What is the sum What is  ?
 2 
of all possible values of |a – d|?
68. All of David's telephone numbers have the
56. Let k = 20082 + 22008. What is the units digit of
form 555 – abc –defg, where a, b, c, d, e, f and
k2 + 2k?
g are distinct digits and in increasing order
57. The numbers from 1 to 8 are placed at the
and none is either 0 or 1. How many different
vertices of a cube in such a manner that the
telephone numbers can David have?
sum of the four numbers on each face is the
69. For how many positive integers n less than or
same. What is this common sum?
equal to 24 is n! evenly divisible by 1 + 2 + …
58. The saxena family consists of a mother, a
+ n?
father, and some children. The average age of
70. Let x and y be two-digit integers such that y is
the members of the family is 20, the father is
obtained by reversing the digits of x. Suppose
48 years old, and the average age of the
that the integers x and y satisfy x2 – y2 = m2 for
mother and children is 16. How many children
some positive integer 'm'. What is the value of
are in the family?
59. How many ordered pairs (m, n) of positive  x+ y+m
 ?
integers, with m > n, have the property that  11 
their squares differ by 96? 71. A subset 'B' of the set of integers from 1 to
60. For each positive integer n, let S(n) denote the 100 inclusive, has the property that no two
sum of the digits of n. For how many values of elements of B sum to 125. What is the
n is n + S(n) + S(S(n)) = 2007? maximum possible number of elements in B?
61. If n is the number of four-digit positive 72. Let n be a 5-digit number, and let q and r be
integers have at least one digit that is a2 or a3 the quotient and remainder, respectively, when
then find the sum of the digits present in n? n is divided by 100. Let the total number of
62. How many three-digit numbers satisfy the value of n for which q + r divisible by 11 is P.
property that the middle digit is the average of Then find the last two digits of P.
the first and the last digits? 73. Let F(x) denote the sum of the digits of the
63. How many positive integer cubes divide positive integer x. For example, F(8) = 8 and
3!·5!·7!? F (123) = 1 + 2 + 3 = 6. For how many two-
digit values of x is F(F(x)) = 3?

NUMBER SYSTEM 61
OLYMPIAD BOOKLET

74. Given that 38 · 52 = ab, where both a and b are digits of N is equal to N. The year 1991 is the
positive integers, find the smallest possible only year in the current century with the
 a + b + 93  following two properties:
value for  .
 25  (a) It is a palindrome.
75. What is the largest integer that is a divisor of (b) It factors as a product of a 2-digit prime
(n + 1) (n + 3) (n + 5) (n + 7) (n + 9) for all palindrome and a 3-digit prime
positive even integers n? palindrome.
76. The product of three consecutive positive How many years in the millenium between
integers is 8 times their sum. What is the sum 1000 and 2000 (including the year 1991) have
of their squares? properties (a) and (b)?
77. Let P(n) and S(n) denote the product and the 84. The two-digit integers from 19 to 92 are
sum, respectively, of the digits of the integer written consecutively to form the large integer
n. For example, P(23) = 6 and S(23) = 5. N = 19202122 … 909192
Suppose n is a two-digit number such that N = If 3k is the highest power of 3 that is a factor
P(N) + S(N). What is the units digit of N? of N, then k =
78. The mean of three numbers is 10 more than 85. For how many N in {1, 2, 3, …, 100} is the
the least of the numbers and 15 less than the tens digit of N2 odd?
greatest. The median of the three numbers is 5. 86. If a and b are digits for which
What is their sum? 2 a
79. Two non-zero real numbers, a and b, satisfy  b 3
ab = a – b. Then find the possible value of 6 9
a b 9 2
+ − ab ?
b a 9 8 9
80. There are N number of positive integers not
then a + b =
exceeding 2001 & are multiples of 3 or 4 but
87. For positive integers n, denote by D(n) the
 N −1  number of pairs of different adjacent digits in
not 5. Then find the value of  .
 100  the binary (base two) representation of n. For
81. In the magic square shown, the sums of the example, D(3) = D(112) = 0, D(21) =
numbers in each row, column, and diagonal D(101012) = 4, and D(97) = D(11000012) = 2.
are the same. Five of these numbers are For how many positive integers n less than or
represented by v, w, x, y, and z. Find y + z. equal to 97 does D(n) = 2?
v 24 w Call a 7-digit telephone number d1d2d3 –
18 x y d4d5d6d7 memorable if the prefix sequence
25 z 21 d1d2d3 is exactly the same as either of the
sequences d4d5d6 or d5d6d7 (possibly both).
82. A subset of the integers 1, 2, …, 100 has the Assuming that each di can be any of the ten
property that none of its members is 3 times decimal digits 0, 1, 2, … 9. Suppose the total
another. What is the largest number of no. of different memorable telephone no.s is
members such a subset can have? 'n'. Then find the sum of digits of 'n'.
83. A positive integer N is a palindrome if the
integer obtained by reversing the sequence of

NUMBER SYSTEM 62
OLYMPIAD BOOKLET

89. The number of ordered pairs of integers (m, n) circular track at their constant speeds. The
for which mn ≥ 0 and m3 + n3 + 99mn = 333 is least time S > 0, in minutes, at which all 10
equal to horses will again simultaneously be at the
90. All even numbers from 2 to 98 inclusive, starting point is S = 2520. Let T > 0 be the
except those ending in 0, are multiplied least time, in minutes, such that at least 5 of
together. What is the rightmost digit (the units the horses are again at the starting point. What
digit) of the product? is the sum of the digits of T?
91. Given that xyz = 2014, and x, y and z are 97. How many ordered triples (x, y, z) of positive
positive integers such that x < y < z, how many integers satisfy lcm (x, y) = 72, lcm (x, z) =
possible triples (x, y, z) are there? 600 and lcm (y, z) = 900?
92. In the following equation, each of the letters 98. For the greatest value of x, if 2x is a factor of
represents uniquely a different digit in base x
101002 – 4501. Find the value of .
ten : (YE). (ME) = TTT 15
The sum E + M + T + Y equals 99. In base 10, the number 2013 ends in the digit
93. Let a, b, c, and d be positive integers such that 3. In base 9, on the other hand, the same
gcd (a, b) = 24, gcd (b, c) = 36, gcd (c, d) = number is written as (2676) 9 and ends in the
54, and 70 < gcd (d, a) < 100. Which of the digit 6. For how many positive integers b does
following must be a divisor of a? the base-b representation of 2013 end in the
94. For a positive integer n and nonzero digits a, digit 3?
b, and c, let An be the n-digit integer each of 100. Real numbers x and y satisfy the equation x2 +
whose digits is equal to a; let Bn be the n-digit y2 = 10x – 6y – 34. What is x + y?
integer each of whose digits is equal to b, and 101. The number 2013 has the property that its
let Cn be the 2n-digit (not n-digit) integer each units digit is the sum of its other digits, that is
of whose digits is equal to c. What is the 2 + 0 + 1 = 3. How many integers less than
greatest possible value of a + b + c for which 2013 but greater than 1000 share this
there are at least two values of n such that Cn – property?
Bn = An2 ? 102. The number 2013 is expressed in the form
95. How many ordered pairs (a, b) of positive a ! a  am !
2013 = 1 2 , where a1 ≥ a2 ≥ … ≥ am
integers satisfy the equation b1 !b2 bn !
a · b + 63 = 20 · lcm (a, b) + 12 · gcd (a, b), and b1 ≥ b2 ≥ … bn are positive integers and a1
where gcd (a, b) denotes the greatest common + b1 is as small as possible. What is |a1 – b1|?
divisor of a and b, and lcm (a, b) denotes their 103. Two integers have a sum of 26. When two
least common multiple? more integers are added to the first two
96. There are 10 horses, named Horse 1, Horse 2, integers the sum is 41. Finally when two more
…, Horse 10. They get their names from how integers are added to the sum of the previous
many minutes it takes them to run one lap four integers the sum is 57. What is the
around a circular race track: Horse k runs one minimum number of even integers among the
lap in exactly k minutes. At time 0 all the 6 integers?
horses are together at the starting point on the 104. How many ordered pairs of positive integers
track. The horses start running in the same M 6
direction, and they keep running around the (M, N) satisfy the equation = ?
6 N

NUMBER SYSTEM 63
OLYMPIAD BOOKLET

105. Geeta and Babeeta play the following game. 106. A majority of the 30 students in Mrs.
An integer between 0 and 999, inclusive, is Bhatnagar's class bought pencils at the school
selected and given to Geeta. Whenever Geeta bookstore. Each of these students bought the
receives a number, he doubles it and passes same number of pencils, and this number was
the result to Babeeta. Whenever Babeeta greater than 1. The cost of a pencil in paisa
receives a number, she adds' 50 to it and was greater than the number of pencils each
passes the result to Geeta. The winner is the student bought, and the total cost of all the
last person who produces a number less than pencils was ₹ 17.71. What was the cost of a
1000. Let N be the smallest initial number that pencil in paisa?
results in a win for Geeta. What is the sum of
the digits of N?

Find [100r]. (For real x, [x] is the greatest

1. Let x, y and z all exceed 1 and let w be a integer less than or equal to x.)
positive number such that logxw = 24, logyw = 5. How many of the first 1000 positive integers
40 and logxyzw = 12. Find logzw. can be expressed in the form [2x] + [4x] + [6x]
2. For positive integers n and k, let f (n, k) be the + [8x], where x is a real number, and [z] denotes
remainder when n is divided by k, and for n > the greatest integer less than or equal to z?
1 let F(n) = max f (n, k ) . Find the remainder 6. Positive numbers x, y, and z satisfy xyz = 1081
n
1k 
2
and (log10x) (log10yz) + (log10y) (log10z) = 468.
100 Find (log10 x)2 + (log10 y)2 + (log10 z )2 .
when  F (n) is divided by 1000.
n = 20 7. Given that
3. A bored student walks down a hall that (1) x and y are both integers between 100
contains a row of closed lockers, numbered 1 and 999, inclusive;
to 1024. He opens the locker numbered 1, and (2) y is the number formed by reversing the
then alternates between skipping and opening digits of x; and
each locker thereafter. When he reaches the (3) z = |x – y|
end of the hall, the student turns around and How many distinct values of z are possible?
starts back. He opens the first closed locker he 8. For how many pairs of consecutive integers in
encounters, and then alternates between {1000, 1001, 1002, …, 2000} is no carrying
skipping and opening each closed locker required when the two integers are added?
thereafter. The student continues wandering 9. Let N be the number of ways to write 2010 in
back and forth in this manner until every the form 2010 = a3 · 103 + a2 · 102 + a1 · 10 +
locker is open. What is the number of the last a0, where the ai's are integers, and 0 ≤ ai ≤ 99.
locker he opens? An example of such a representation is 1 · 10 3
4. Suppose r is a real number for which + 3 · 102 + 67 · 101 + 40 · 100. Find N.
10. For any positive integer x, let S(x) be the sum
 19   20   21 
 r + 100  +  r + 100  +  r + 100  +  of the digits of x, and let T(x) be |S(x + 2) –
      S(x)|. For example, T(199) = |S(201) – S(199)|
 91  = |3 – 19| = 16. How many values of T(x) do
+ r +
100  = 546. not exceed 1999?
 

NUMBER SYSTEM 64
OLYMPIAD BOOKLET

11. Find the least positive integer k for which the 21. The increasing sequence 1, 3, 4, 9, 10, 12, 13
 2002  … consists of all those positive integers which
equation  = k has no integer solutions
 n  are powers of 3 or sums of distinct powers of
for N. (The notation [x] means the greatest 3. Find the 100th term of this sequence.
integer less than or equal to x.) 22. Let [r, s] denote the least common multiple of
12. Someone observed that 6! = 8 · 9 · 10. Find positive integers r and s. Find the number of
the largest positive integer N for which N! can ordered triples (a, b, c) of positive integers for
be expressed as the product of N – 3 which [a, b] = 1000, [b, c] = 2000, and [c, a] =
consecutive positive integers. 2000.
13. If a < b < c < d < e are consecutive positive 23. What is the smallest positive integer with six
integers such that b + c + d is a perfect square positive odd integer divisors and twelve
and a + b + c + d + e is a perfect cube, what is positive even integer divisors?
the smallest possible value of c? 24. Let n = 231319. How many positive integer
14. For each real number x, let [x] denote the divisors of n2 are less than n but do not divide n?
greatest integer that does not exceed x. For 25. Let N be the number of consecutive 0 's at the
how many positive integers N is it true that N right end of the decimal representation of the
< 1000 and that [log2n] is a positive even product 1!2!3!4!…99!100!. Find the
integer? remainder when N is divided by 1000.
15. Find the sum of all positive two-digit integers 26. Let K be the product of all factors (b – a) (not
that are divisible by each of their digits. necessarily distinct) where a and b are integers
16. What is the largest positive integer N for satisfying 1 ≤ a < b ≤ 20. Find the greatest
which N3 + 100 is divisible by N + 10? positive integer n such that 2n divides K.
17. Let n be the smallest positive integer that is a 27. What is the largest positive integer that is not
multiple of 75 and has exactly 75 positive the sum of a positive integral multiple of 42
integral divisors, including 1 and itself. Find and a positive composite integer?
n 28. Let T = {9k : k. is an integer, 0 ≤ k ≤ 4000}.
.
75 Given that 94000 has 3817 digits and that its
18. Let S be the set of all rational numbers r, 0 < r first (leftmost) digit is 9, how many elements
< 1, that have a repeating decimal expansion of T have 9 as their leftmost digit?
in the form 0. abcabcabc… = 0. abc , where 29. Let S be the sum of all numbers of the form
the digits a, b, and c are not necessarily a/b, where a and b are relatively prime
distinct. To write the elements of S as fractions positive divisors of 1000. What is the greatest
in lowest terms, how many different integer that does not exceed S/10?
numerators are required? 30. Let N be the number of positive integers that
19. Find the number of positive integers with are less than or equal to 2003 and whose base-
three not necessarily distinct digits, abc, with 2 representation has more 1's than 0's. Find the
a ≠ 0 and c ≠ 0 such that both abc and cba are remainder when N is divided by 1000.
multiples of 4. 31. The product N of three positive integers is 6
20. What is the largest 2-digit prime factor of the times their sum, and one of the integers is the
 200  sum of the other two. Find the sum of all
integer n  ?
 100  possible values of N.

NUMBER SYSTEM 65
OLYMPIAD BOOKLET

32. Find the sum of all positive integers n for 9. Let N = 12345678910111213…4344 be the
which n2 – 19n + 99 is a perfect square. 79-digit number obtained that is formed by
33. Find the least positive integer such that when writing the integers from 1 to 44 in order, one
its leftmost digit is deleted, the resulting after the other. The remainder when N is
1 divided by 45 is r. What is r2?
integer is of the original integer. 10. Let k = 20082 + 22008. What is the square of the
29
34. There exist r unique non – negative integers n1 units digit of k2 + 2k?
> n2 > … > nr and r unique integers ak (1 ≤ k ≤ 11. Anna randomly picked five integers from the
following list: 53, 62, 66, 68, 71, 82, 89 and
r) with each ak either 1 or –1 such that
discover that the average value of the five
a1 3n1 + a2 3n2 +  + ar 3nr = 2008 . Find n1 + n2
integers she picked is still an integer. If two of
+ … + nr. the integers she picked were 62 and 89, find
35. It is known that, for all positive integers k, 12 the mean of the remaining three integers.
k (k + 1)(2k + 1) 12. Total number of 0's at the end of the value of
+ 2 2 + 3 2 + … + k2 = . Find
6 the product 1 × 2 × 3 × 4 × … × 2008 is n,
the smallest positive integer k such that 12 + 22 then find the value of n + 125 .
+ 32 + … + k2 is a multiple of 200. 13. Find the remainder when (1! × 1) + (2! × 2) +
(3! × 3) + … + (286! × 286) is divided by 24 ×
5 3.
1. Find the last two digits of 9100 – 1. 14. What is the remainder when 30 + 31 + 32 + …
2. Find the sum of digits of the largest positive + 32009 is divided by 8?
integer n such that n! ends with exactly 100 15. Let n denote the smallest positive integer that
zeros. is divisible by both 4 and 9, and whose base-
32005
10 representation consists of only 4's and 9's,
3. Find the last two digits (in order) of 7 .
with at least one of each. What will be the sum
4. Find the smallest two-digit number N such of the last four digits of n?
that the sum of digits of 10N – N is divisible by 16. How many distinct four-digit numbers are
170. divisible by 3 and have 23 as their last two
5. Find the number of positive integers n such digits?
that n + 2n2 + 3n3 + … + 2005n2005 is divisible 17. Suppose that n is the product of three
by n – 1. consecutive integers and that n is divisible by
6. Let n be the number 7. Then largest two-digit number with which n
(999999999999)2 − (666666666666)2 is divisible is?
20066 s 20066s
18. An n-digit positive integer is cute if its n digits
Find the reminder when n is divided by 11. are an arrangement of the set {1, 2, …, n} and
7. What is the sum of all the digits of the largest its first k digits form an integer that is divisible
positive integer n for which n3 + 2006 is by k, for k = 1, 2, …, n. For example, 321 is a
cute 3-digit integer because 1 divides 3, 2
divisible by n + 26?
divides 32, and 3 divides 321. How many cute
8. Find the smallest positive integer n such that n
6-digit integers are there?
(n + 1) (n + 2) is divisible by 247.

NUMBER SYSTEM 66
OLYMPIAD BOOKLET

19. Consider the non-decreasing sequence of 28. N pieces of candy are made and packed into
positive integers: boxes, with each box containing 45 pieces. If
1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, … N is a non-zero perfect cube and 45 is one of
in which the nth positive integer appears n its factors, what is the least possible number of
times. The remainder when the 2019th term is boxes that can be packed?
divided by 5 is 29. For any non-empty finite set a of real
20. Mary chose an even 4-digit number n. She numbers, let s(A) be the sum of the elements
wrote down all the divisors of n in increasing in a. There are exactly 61, 3-element subsets a
n of {1, …, 23} with s(A) = 36. The total
order from left to right: 1, 2, …, , n . At
2 number of 3-element subsets of {1, …, 23}
some moment. Mary wrote 323 as a divisor of with s(A) < 36 is given by N, then evaluate
n. If the smallest possible value of the next n + 45
.
divisor written to the right of 323 is n, find the 25
n 30. Let the sum of the digits of the given product
value of .
10 is written as A8B6C. Find A + B + C.
21. For some positive integer n, the number 110 n3 (111111111111)  2007
has 110 positive integer divisors, including 1 2007 1s

and the number 110n3. How many positive 31. When 2007 bars of soap are packed into N
integer divisors does the number 9n2 have? boxes of equal size, where N is an integer
22. What is the last two digits of 20152016 – 2017? strictly between 200 and 300, there are extra 5
23. The largest divisor of 2014000000 is itself. If bars remaining. Find last two digit of N.
is fifth largest divisor is x. Find sum of all the 32. Let the number of distinct integers among the
digits of x. numbers is N. Find the sum of all digits of N.
24. How many three-digit numbers are not  12   22   20072 
divisible by 5, have digits that sum to less than ,
 2007   2007  , ,  2007  .
     
20, and have the first digit equal to the third
33. For each integer n ≥ 4, let an denote the base-n
digit?
25. For a positive integer k, we write number 0.133n . The product a4a5 … a99 can
(1 + x)(1 + 2x)(1 + 3x) …(1 + kx) m
be expressed as . where m and n are
= a0 + a1x + a2x2 + … + akxk, where a0, a1, …, n!
ak are the coefficients of the polynomial. Find positive integers and n is as small as possible.
the sum of all the digits of smallest possible What is the value of sum of the digits of m?
value of k if a0 + a1 + a2 + … + ak – 1 is 34. The square is a multiplicative magic square.
divisible by 2005. That is, the product of the numbers in each
26. The smallest three-digit number n such that if row, column, and diagonal is the same. If all
the three digits are a, b and c, then n = a + b + the entries are positive integers, what is the
n +1 sum of the possible values of g?
c + ab + bc + ac + abc. Evaluate .
5 50 b c
27. What is the largest positive integer n d e f
satisfying n200 < 5300? g h 2

NUMBER SYSTEM 67
OLYMPIAD BOOKLET

35. How many four-digit numbers N have the 45. A five-digit palindrome is a positive integer
property that the three-digit number obtained by with respective digits abcba, where a is non-
removing the leftmost digit is one ninth of N? zero. Let S be the sum of all five-digit
36. If a, b, and c are positive real numbers such palindromes. What is the sum of the digits of S?
that a (b + c) = 152, b (c + a) = 162, and c (a + 46. The products (8) × (888…8), where the
abc second factor has k digits. is an integer whose
b) = 170, then find .
12 digits have a sum of 1000. What is the sum of
37. If x, y, and z are positive numbers satisfying x digits of k?
+ 1/y = 4, y + 1/z = 1, and z + 1/x = 7/3, then 47. There are total P positive integers value of n,
find xyz? n
so that is also a positive integer. What
38. There are x integer values of n (not necessarily 30 − n
2
n is P2?
positive) so that value of 4000.   is an 48. Let S be the set of positive integers n for
5
1
integer. What is x ?2
which has the repeating decimal
n
39. Let S be a set of 6 integers taken from {1, 2,
… 12} with the property that if a and b are representation 0·ab = 0.ababab, with a and
elements of S with a < b, then b is not a b different digits. The sum of the elements of
multiple of a. What is the square of the least S id a three digit number abc. What is the
possible value of an element in S? abc
value of ?
40. R non-negative integers can be written in the 11
form a7 · 37 + a6 · 36 + a5 · 35 + a4 · 34 + a3 · 33 + 49. Let a, b, and c be digit with a ≠ 0. The three-
a2 · 32 + a1 · 31 + a0 · 30, where ai ∈ {–1, 0, 1} digit integer abc lies one third of the way from
for 0 ≤ i ≤ 7. What is the last two digits of R? the square of a positive integer to the square of
41. How many odd positive 3-digit integers are the next larger integer. The integer acb lies
divisible by 3, but do not contain the digit 3? two thirds of the way between the same two
42. Let p and q be positive integers such that squares. What is a + b + c?
5 p 4 50. There are p pairs of positive integers (a, b)
  and q is as small as possible. What
9 q 7 a 14b
such that gcd (a, b) = 1 and + is an
is (q – p)2? b 9a
43. A function f is defined recursively by f (1) = f integer. What is 7 × p?
(2) = 1 and f (n) = f (n – 1) – f (n – 2) + n for 51. Let a, b, c, d, e, f, g, and h be distinct elements
all integers n ≥ 3. What is the sum of the digits in the set {–7, –5, –3, –2, 2, 4, 6, 13}. What is
of f (2018)? the minimum possible value of (a + b + c + d)2
44. Sunita has 30 thin rods, one each of every + (e + f + g + h)2?
integer length from 1 cm through 30 cm. She 52. There are 88 numbers a1, a2, a3, …, a88 and
places the rods with lengths 3 cm, 7 cm, and each of them is either equals to –3 or –1.
15 cm on a table. She then wants to choose a Given that a12 + a12 +  + a882 = 280, and
fourth rod that she scan pot with these three to
a14 + a24 +  + a884 = 103a + b. Find the product
form a quadrilateral with positive area. How
many of the remaining rods can she choose as of a and b.
the fourth rod?

NUMBER SYSTEM 68
OLYMPIAD BOOKLET

53. The difference between the HCF and the LCM 1 1 1

65. Let Pk = 1 + − − , where k is a positive
of x and 18 is 120. Find the value of x. k k2 k3
54. Given that n is a ten-digit number in the form integer. Find the sum of all the digits of least
2007 x2008 y where x and y can be any of the positive integer n such that the product P2P3
digits 0, 1, 2 …, 9. How many such numbers n … Pn exceeds 2010.
are there that are divisible by 33? 66. What is the sum of the digits of the square of
55. How many positive integers n, where 10 ≤ n ≤ 111111111?
n2 − 9 67. Let a, b, c and d be real numbers with |a – b| =
100, are there such that is a fraction in
n2 − 7 2, |b – c| = 3 and |c – d| = 4. What is the sum
its lowest terms? of all possible values of |a – d|?
56. Let n be a positive integer such that n2 + 19n + 68. The numbers from 1 to 8 are placed at the
48 is a perfect square. Find the value of n. vertices of a cube in such a manner that the
57. Find the smallest integer n such that n sum of the four numbers on each face is the
( 101 − 10)  1 . same. What is this common sum?
58. Find the smallest positive integer n such that 69. The Saxena family consists of a mother, a
2n > n2 for every integer n in {n, n + 1, n + 2, n father and some children. The average age of
+ 3, n + 4}. the members of the family is 20, the father is
59. The highest natural number that are divisible 48 years old, and the average age of the
by 30 and have exactly 30 different positive mother and children is 16. How many children
divisors can be written as A1B5C, then find A are in the family?
+ B + C. 70. How many ordered pairs (m, n) of positive
60. Let p and q represent two consecutive prime
integers, with m > n, have the property that
numbers. For some fixed integer n, the set {n
their squares differ by 96?
– 1, 3n – 19, 38 – 5n, 7n – 45} represents {p,
71. For each positive integer n, let S(n) denote the
2p, q, 2q}, but not necessarily in that order.
Find the value of n. sum of the digits of n. For how many values of
61. If a, b and c are positive real numbers such n is n + S(n) + S(S(n)) = 2007?
that ab + a + b = bc + b + c = ca + c + a = 35, 72. If n is the number of four-digit positive
then the value of (a + 1) (b + 1) (c + 1) = xγ. integers have at least one digit that is a 2 or a
Find the product of x and y. 3 then find the sum of the digits present in n?
62. Find the largest possible value of n such that 73. How many three-digit numbers satisfy the
there exist n consecutive positive integers property that the middle digit is the average of
whose sum is equal to 2010. the first and the last digits?
63. Let S be the set of all integers n such that 74. How many positive integer cubes divide 3!·
8n3 − 96n 2 + 360n − 400 5!· 7!?
is an integer. Find
2n − 7 75. The sum of the digits of a two-digit number is
the value of  |n | . subtracted from the number. The unit digit of
nS
the result is 6. How many two-digit numbers
64. Find the sum of all positive integers p such have this property?
that the expression (x – p) (x – 13) + 4 can be
76. For how many positive integers n does 1 + 2 +
expressed in the form (x + q) (x + r) for
… + n evenly divide from 6n?
distinct integers q and r.

NUMBER SYSTEM 69
OLYMPIAD BOOKLET

77. For each positive integer m > 1, let P(m) 87. The product of three consecutive positive
denote the greatest prime factor of m. For how integers is 8 time their sum. What is the sum
many positive integers n is it true that both of their squares?
88. Let P(n) and S(n) demote the product and the
P(n) = n and P(n + 8) = n + 48 ?
sum, respectively, of the digits of the integer
78. Suppose that 4a = 5, 5b = 6, 6c = 7 and 7d = 8.
n. For example, P(23) = 6 and S(23) = 5.
What is 2(a · b · c · d)? Suppose N is a two-digit number such that N =
79. All of David's telephone numbers have the P(N) + S(N). What is the units digit of N?
form 555abc – defg, where a, b, c, d, e, f, and 89. The mean of three numbers is 10 more than
g are distinct digits and in increasing order the least of the numbers and 15 less than the
and none is either 0 or 1. How many different greatest. The median of the three numbers is 5.
telephone numbers can David have? What is their sum?
80. For how many positive integers n less than or 90. Two non-zero real numbers, a and b, satisfy
equal to 24 is n! evenly divisible by 1 + 2 + … ab = a – b. Then find the possible value of
+ n? a b
+ − ab ?
81. Let x and y be two-digit integers such that y is b a
obtained by reversing the digits of x. Suppose 91. There are N number of positive integers not
that the integers x and y satisfy x2 – y2 = m2 for exceeding 2001 and are multiples of 3 or 4 but
some positive integer 'm'. What is the value of  N −1 
not 5. Then find the value of  .
 x+ y+m  50 
 ?
 11  92. In the magic square shown, the sums of the
82. A subset 'B' of the set of integers from 1 to numbers in each row, column, and diagonal
100 inclusive, has the property that no two are the same. Five of these numbers are
elements of B sum to 125. What is the represented by v, w, x, y, and z. Find y + z.
maximum possible number of elements in B? v 24 w
83. Let n be a 5-digit number, and let q and r be 18 x y
the quotient and remainder, respectively, when 25 z 21
n is divided by 100. Let the total number of
93. A subset of the integers 1, 2, …, 100 has the
value of n for which q + r divisible by 11 is P.
property that none of its members is 3 times
Then, find the last two digits of P.
another. What is the largest number of
84. Let F(x) denote the sum of the digits of the
members such a subset can have?
positive integer x. For example, F(8) = 8 and
94. A positive integer N is a palindrome if the
F(123) = 1 + 2 + 3 = 6. For how many two-
integer obtained by reversing the sequence of
digit values of x is F(F(x)) = 3? digits of N is equal to N. The year 1991 is the
85. Given that 38 · 52 = ab, where both a and b are only year in the current century with the
positive integers, find the smallest possible following two properties:
 a + b + 93  (a) It is a palindrome.
value for  .
 25  (b) It factors as a product of a 2-digit prime
86. What is the largest integer that is a divisor of palindrome and a 3-digit prime palindrome.
(n + 1) (n + 3) (n + 5) (n + 7) (n + 9) for all How many years in the millennium between
positive even integers n? 1000 and 2000 (including the year 1991) have
properties (a) and (b)?

NUMBER SYSTEM 70
OLYMPIAD BOOKLET

95. The two-digit integers from 19 to 92 are 103. In the following equation, each of the letters
written consecutively to form the large integer represents uniquely a different digit in base
N = 19202122…909192 ten: (YE) · (ME) = TTT
If 3k is the highest power of 3 that is a factor Find the sum E + M + T + Y.
of N, then k is 104. For how many (not necessarily positive)
96. For how many n in {1, 2, 3, …, 100} is the n
2
tens digit of n2 odd? integer values of n is the value of 4000.  
5
97. If a and b are digits for which
an integer?
2 a
105. Let S be a set of 6 integers taken from {1, 2,
 b 3
…, 12} with the property that if a and b are
6 9
elements of S with a < b, then b is not a
9 2
multiple of a. What is the least possible values
9 8 9
of an element in S?
then a + b = 106. The total number of non-negative integers can
98. For positive integers n, denote by D(n) the be written in the given form are N. Then find
number of pairs of different adjacent digits in sum of all the digits of Na7 · 37 + a6 · 36 + a5 ·
the binary (base two) representation of n. For 35 + a4 · 34 + a3. 33 + a2 · 32 + a1 · 31 + a0 · 30,
example, D(3) = D(112) = 0, D(21) = where a1 ∈ {–1, 0, 1} for 0 ≤ i ≤ 7?
D(101012) = 4, and D(97) = D(11000012) = 2.
107. Let a, b, c, and d be positive integers such that
For how many positive integers n less than or
gcd (a, b) = 24, gcd (b, c) = 36, gcd(c, d) = 54,
equal to 97 does D(n) = 2?
and 70 < gcd (d, a) < 100. Which of the
99. Call a 7-digit telephone number d1d2d3-
following must be a divisor of a?
d4d5d6d7 memorable if the prefix sequence
108. For a positive integer n and non-zero digits a,
d1d2d3 is exactly the same as either of the
b, and c, let An be the n-digit integer each of
sequences d4d5d6 or d5d6d7 (possibly both).
Assuming that each d1 can be any of the ten whose digits is equal to a; let Bn be the n-digit
decimal digits 0, 1, 2, … 9. Suppose the total integer each of whose digits is equal to b, and
no. of different memorable telephone no.s is let Cn be the 2n-digit (not n-digit) integer each
'n'. Then find the sum of digits of 'n'. of whose digits is equal to c. What is the
100. Find the number of ordered pairs of integers greatest possible value of a + b + c for which
(m, n) for which mn ≥ 0 and m3 + n3 + 99mn = there are at least two values of n such Cn – Bn
333. = a n2 ?
101. All even numbers from 2 to 98 inclusive, 109. How many ordered pairs (a, b) of positive
except those ending in 0, are multiplied integers satisfy the equation a · b + 63 = 20.
together. What is the rightmost digit (the units lcm (a, b) + 12. gcd (a, b), where gcd (a, b)
digit) of the product?
denotes the greatest common divisor of a and
102. Given that xyz = 2014, and x, y and z are
b, and lcm (a, b) denotes their least common
positive integers such that x < y < z, how many
multiple?
possible triples (x, y, z) are there?

NUMBER SYSTEM 71
OLYMPIAD BOOKLET

110. There are 10 horses, named Horse 1, Horse 2, integers the sum is 41. Finally, when two more
…, Horse 10. They get their names from how integers are added to the sum of the previous
many minutes it takes them to run one lap four integers the sum is 57. What is the
around a circular race track: Horse k runs one minimum number of even integers among the
lap in exactly k minutes. At time 0 all the 6 integers?
horses are together at the starting point on the 118. How many ordered pairs of positive integers
track. The horses start running in the same M 6
(M, N) satisfy the equation = ?
direction, and they keep running around the 6 N
circular track at their constant speeds. The 119. Geeta and Babeeta play the following game.
least time S > 0, in minutes, at which all 10 An integer between 0 and 999, inclusive is
horses will again simultaneously be at the selected and given to Geeta. Whenever Geeta
starting point is S = 2520. Let T > 0 be the receives a number, he doubles it and passes
least time, in minutes, such that at least 5 of the result to Babeeta. Whenever Babeeta
the horses are again at the starting point. What receives a number, she adds 50 to it and passes
is the sum of the digits of T? the result to Geeta. The winner is the last
111. How many ordered triples (x, y, z) of positive person who produces a number less than 1000.
integers satisfy lcm (x, z) = 600, gcd (x, y) = Let N be the smallest initial number that
72 and lcm (y, z) = 900? results in a win for Geeta. What is the sum of
112. For the greatest value of x, if, 2x is a factor of the digits of N?
x 120. A majority of the 30 students in Mrs.
101002 – 4501. Find the value of .
15 Bhatnagar's class bought pencils at the school
113. In base 10, the number 2013 ends in the digit bookstore. Each of these students bought the
3. In base 9, on the other hand, the same same number of pencils, and this number was
number is written as (2676), and ends in the greater than 1. The cost of a pencil in paisa
digit 6. For how many positive integers b does was greater than the number of pencils each
the base-b representation of 2013 end in the student bought, and the total cost of all the
digit 3? pencils was ₹17.71. What was the cost of a
114. Real numbers x and y satisfy the equation x2 + pencil in paisa?
y2 = 10x – 6y – 34. What is x + y? 121. Find last two digit of largest natural number N
115. The number 2013 has the property that its such that N + 10 divides N3 + 100.
units digit is the sum of its other digits, that is 122. Find the last two digits of the greatest integer
2 + 0 + 1 = 3. How many integers less than less than (2 + 3) 4 .
2013 but greater than 1000 share this
1
property? 123. Consider the function f ( x) = . Find
3x + 3
116. The number 2013 is expressed in the form
a ! a  am ! the value of 3 [f (–5) + f (–4) + f (–3) +
2013 = 1 2 where a1 ≥ a2 ≥ … ≥ am f (–2) + f (–1) + f (0) + f (1) + f (2) + f (3) + f
b1 !b2 bn !
(4) + f (5) + f (6)].
and b1 ≥ b2 ≥ … bn are positive integers and a1
124. How many ordered pairs of positive integers
+ b1 is as small as possible. What is |a1 – b1|?
117. Two integers have a sum of 26. When two (x, y) satisfy the equation x y+y x+

more integers are added to the first two 2006 xy − 2006 x − 2006 y − 2006 = 0 ?

NUMBER SYSTEM 72
OLYMPIAD BOOKLET

125. Evaluate x in its simplest form then find sum 135. Suppose that real number x satisfies
of all digits of x. Where x is given as x = 2 2
49 − x − 25 − x = 3 . What is the value of
2008 + 2007 2008 + 2007 2008 + 2007 n . 49 − x 2 + 25 − x 2 ?
126. Find the number of ordered pairs of positive 136. If the value of 9 − 6 2 + 9 + 6 2 is k, find
integers (x, y) that satisfy the equation
25
x y + y x + 2009 xy − 2009 x − 2009 y k .
6
−2009 = 0 . 27
137. Find the remainder of 4737 when it is
127. Evaluate 3
77 − 20 13 + 3 77 + 20 13 . divided by 11.
128. Find the value of (25 + 10 5)1/3 138. What is the remainder when 91990 is divided by
11?
+(25 − 10 5)1/3 . 139. Find the last two digits of 2999.
1 + 2009 140. Find the remainder of (25733 + 46)26 when it is
129. Let a = . Find the value of (a3 –
2 divided by 50.
503a – 500)5. 141. Let p be a prime number such that the next
130. Let n be the positive integer such that larger number is a perfect square. Find the
1 1 sum of all such prime numbers. (For example,
+ + if you think that 11 and 13 are two such prime
9 11 + 11 9 11 13 + 13 11
numbers, then the sum is 24.)
1 1 1
++ = 142. The value of greatest integer N such that N ≤
13 15 + 15 13 n n + 2 + (n + 2) n 9
N −2
20072 − 20070 + 31 . Find .
1 1  100
131. If x =  3 2009 − 3  and
2 2009  143. Find the sum of all the digit of largest integer
2 3 N such that both N + 496 and N + 224 are
y = ( x + 1 + x ) , then find the sum of the
perfect squares.
digits of y. 144. The sum of 18 consecutive positive integers is
132. Let x and y be real numbers satisfying y = a perfect square. In the smallest possible value
2008x + 2009 2008x + 2009 of this sum, find the sum of first two integers?
+ + 25 . Find
2010 x − 2011 2011 − 2010x 145. Let n be the smallest positive integer such that
the value of γ. n is divisible by 20, n2 is a perfect cube, and n3
2( 2 + 6) is a perfect square. The number n contains n
133. If the value of fraction is equal to digits. What is n2?
2 2+ 3 146. How many positive integers n are there such
P that 7n + 1 is a perfect square and 3n + 1 <
. Find P.
12 2008?
1 1 1 147. Let M = 1! × 2! × 3! × 4! × 5! × 6! × 7! × 8! ×
134. Let T = − + −
3− 8 8− 7 7− 6 9!. The number of factors of M which are
1 1 perfect squares is 21 × b. Then find the value
+ ; then find the value of T. of b.
6− 5 5−2

NUMBER SYSTEM 73
OLYMPIAD BOOKLET

148. Find the number of ordered pairs (x, y), where 156. For any real number x, let [x] denote the
x is an integer and y is a perfect square, such smallest integer that is greater than or equal to
that y = (x – 90)2 – 4907. x and [x] denote the largest integer that is less
149. The number 2564 .6425 is the square of a than or equal to x (for example, [1.23] 2 and
positive integer N. In decimal representation,
[1.23] = 1). Find the value of 2010 –
the sum of the digits of N is.
n
2010
 2010  2010  
150. For how many integers n is the square   k
−
 k  
.
20 − n k =1

of an integer? 157. Given that x = [11/3] + [21/3] + [31/3] + … +

151. If 554 is the base b representation of the  x 
square of the number whose base b [79991/3], find the value of  , where [γ]
 5000 
representation is 24, then find b, when written
in base 10. denotes the greatest integer less than or equal
152. If x is a real number that satisfies to γ. (For example, [2.1] = 2, [30] = 30, [–
 11   12   99  10.5] = – 11.)
 x + 100  +  x + 100  +  +  x + 100  = 765 158. What is the greatest integer less than or equal
      ,
find the value of [900] – [100x]. Here [a] 3100 + 2100
to ?
denotes the largest integer ≤ a. 396 + 296
153. Find the number of consecutive 0 's at the end 159. Let [x] denote the greatest integer less than or
of the base 10 representation of 206!. equal to x. If there are N values of x satisfy the
154. There are P number of positive integer N less equation x2 + 10,000[x] = 10,000x. Then find
n n n N +1
than 2007 such that   +   +   = n the value of .
2 3 6 4
where [x] is the greatest integer less than or 10

equal to x. Write the last two digit of P. 160. Let f (x) =  ([kx] − k[ x]),
k =2
where [r] denotes
(For example, [2.5] = 2; [5] = 5; [ – 2.5] = – 3,
etc.) the greatest integer less than or equal to r.
155. Let [x] denote the greatest integer less than or How many distinct values does f (x) assume
equal to x. Some P real values of x satisfy the for x ≥ 0?
equation x2 + 10,000[x] = 10,000x. What is P
– 100?

2. Let Sn = n2 + 20n + 12, n a positive integer.

1. Rama was asked by her teacher to subtract 3 What is the sum of all possible values of n for
from a certain number and then divide the which Sn is a perfect square?
result by 9. Instead, she subtracted 9 and then [PRE – PRMO – 2012]
divided the result by 3. She got 43 as the 3. Let P(n) = (n + 1)(n + 3)(n + 5)(n + 7)(n + 9).
answer. What would have been her answer if What is the largest integer that is a divisor of
she had solved the problem correctly? P(n) for all positive even integers n?
[PRE – PRMO – 2012] [PRE – PRMO – 2012]

NUMBER SYSTEM 74
OLYMPIAD BOOKLET

1 14. For how many natural numbers n between 1 and

4. If = m − n , where m
8n
2011 + 20112 − 1 2014 (both inclusive) is an integer?
9999 − n
and n are positive integers, what is the value
[PRE – PRMO – 2014]
of m + n?
[PRE – PRMO – 2012] 15. Let E(n) denote the sum of the even digits of
5. How many non-negative integral values of x n. For example, E (1243) = 2 + 4 = 6. What is
the value of E (1) + E (2) + E (3) + … + E
x x
satisfy the equation   =   ? (100)?
5 7
[PRE – PRMO – 2015]
[PRE – PRMO – 2012] 16. How many two-digit positive integers N have
6. What is the sum of the squares of the roots of
the property that the sum of N and the number
the equations x2 – 7[x] + 5 = 0?
obtained by reversing the order of the digits of
[PRE – PRMO – 2012]
N is a perfect square?
7. What is the smallest positive integer k such
[PRE – PRMO – 2015]
that k (33 + 43 + 53) = an for some positive
17. Let n be the largest integer that is the product
integers a and n, with n > 1?
of exactly 3 distinct prime numbers, x, y, and
[PRE – PRMO – 2013]
8. Let S(M) denote the sum of the digits of a 10x + y, where x and y are digits. What is the
positive integer M written in base 10. Let N be sum of the digits of n?
the smallest positive integer such that S(N) = [PRE – PRMO – 2015]
2013. What is the value of S(5N + 2013)? 18. The digits of a positive integer N are four
[PRE – PRMO – 2013] consecutive integers in decreasing order when
9. Let m be the smallest odd positive integer for read from left to right. What is the sum of the
which 1 + 2 + … + m is a square of an integer possible remainders when N is divided by 37?
and let N be the smallest even positive integer [PRE – PRMO – 2015]
for which 1 + 2 + … + n is a square of an 19. How many positive integers less than 1000
integer. What is the value of m + n? have the property that the sum of the digits of
[PRE – PRMO – 2013] each such number is divisible by 7 and the
10. What is the maximum possible value of k for number itself is divisible by 3?
which 2013 can be written as a sum of k [PRE – RMO – 2017]
consecutive positive integers? 20. Find the number of positive integers, N such
[PRE – PRMO – 2013]
that n + n + 1  11 .
11. What is the sum (in base 10) of all the natural
[PRE – RMO – 2017]
numbers less than 64 which have exactly three
21. Suppose x is a positive real number such that
ones in their base 2 representation?
[PRE – PRMO – 2013] {x}, [x] and x are in a geometric progression.
12. A natural number k is such that k2 < 2014 < (k Find the least positive integer n such that xn >
+ l)2, What is the largest prime factor of k? 100. (Here [x] denotes the integer part of x and
[PRE – PRMO – 2014] {x} = – [x])
13. For natural numbers x and y, let (x, y) denote [PRE – RMO – 2017]
the greatest common divisor of x and y. How 22. Suppose an integer 'x', a natural number 'N'
many pairs of natural numbers x and y with x and a prime number 'p' satisfy the equation 7x2
≤ y satisfy the equation xy = x + y + (x, y)? – 44x + 12 = pn. Find the largest value of p?
[PRE – PRMO – 2014] [PRE – RMO – 2017]

NUMBER SYSTEM 75
OLYMPIAD BOOKLET

23. Let p, q be prime numbers such that n3pq – n is 31. Let the rational number p/q be closest to but not
a multiple of 3pq for all positive integers n. equal to 22/7 among all rational numbers with
Find the least possible value of p + q. denominator <100. What is the value of p – 3q?
[PRE – RMO – 2017] [PRE – RMO – 2019]
24. For each positive integer n, consider the 32. A natural number k > 1 is called good if there
highest common factor hn of the two numbers exist natural numbers a1 < a2 < … < ak such
n! + 1 and (n + 1 )!. For n < 100, find the 1 1 1
that + ++ = 1 . Let f (n) be
largest value of hn. a1 a2 ak
[PRE – RMO – 2017] the sum of the first n good numbers, n ≥ 1.
25. Consider all 6-digit numbers of the form Find the sum of all values of n for which
abccba where b is odd. Determine the number f (n + 5)/f (n) is an integer.
of all such 6-digit numbers that are divisible [PRE – RMO – 2019]
by 7. 33. Find the smallest positive integer n ≥ 10 such
[PRE – RMO – 2018] that n + 6 is a prime and 9n + 7 is a perfect
26. The equation 166 × 56 = 8590 is valid in some square.
base b ≥ 10 (that is 1, 6, 5, 8, 9, 0 are digits in [PRE – RMO – 2019]
base b in the above equation). Find the sum of 34. How many ordered pairs (a, b) of positive
all possible values of b ≥ 10 satisfying the integers with a < b and 100 ≤ a, b ≤ 1000
equation. satisfy gcd (a, b) : lcm (a, b) = 1 : 495?
[PRE – RMO – 2018] [PRE – RMO – 2019]
27. Determine the sum of all possible positive 35. Consider the set E of all natural numbers N
such that when divided by 11, 12, 13,
integers n, the product of whose digits equals
respectively, the remainders, in that order, are
n2 – 15n – 27.
distinct prime numbers in an arithmetic
[PRE – RMO – 2018]
progression. If N is the largest number in E,
28. Let T be the smallest positive integers which,
find the sum of digits of N.
when divided by 11, 13, 15 leaves remainders
[PRE – RMO – 2019]
in the sets {7, 8, 9}, {1, 2, 3}, {4, 5, 6} 36. Positive integers x, y, z satisfy xy + z = 160.
respectively. What is the sum of the square of Compute the smallest possible value of x + yz.
the digits of T? [PRE – RMO – 2019]
[PRE – RMO – 2018] 37. Let E denote the set of all natural numbers N
29. Let x1 be a positive real number and for every such that 3 < n < 100 and the set {1, 2, 3, …,
integer n ≥ 1 let xn + 1 = 1 + x1x2 … xn – 1xn. If x5 n} can be partitioned in to 3 subsets with
= 43, what is the sum of digits of the largest equal sums. Find the number of elements of E.
prime factor of x6? [PRE – RMO – 2019]
[PRE – RMO – 2019] 38. Consider the sequence of number
30. Let abc be a three digit number with nonzero  1
 n + 2n + 2  for n ≥ 1 where [x] denotes the
digits such that a2 + b2 = c2. What is the
greatest integer not exceeding x. If the missing
largest possible prime factor of abc ?
integers in the sequence are n1 < n2 < n3 <…
[PRE – RMO – 2019]
then find n12.
[PRE – RMO – 2019]

NUMBER SYSTEM 76
OLYMPIAD BOOKLET

39. Find the number of positive integers less than 47. What is the smallest prime number p such that
101 that cannot be written as the difference of p3 + 4p2 + 4p has exactly 30 positive divisors?
two squares of integers. [PRE – RMO – 2019]
[PRE – RMO – 2019] 48. Consider the set E of all positive integers N
40. Let N be the smallest positive integer such that such that when divided by 9, 10, 11,
N + 2N + 3N + … + 9N is a number all whose respectively, the remainders (in that order) are
digits are equal. What is the sum of the digits all > 1 and form a non-constant geometric
progression. If N is the largest element of E,
of N?
find the sum of digits of E.
[PRE – RMO – 2019]
[PRE – RMO – 2019]
41. Let s(n) denote the sum of the digits of a
49. For n ≥ 1, let an be the number beginning with
positive integer n in base 10. If s(m) = 20 and n 9's followed by 744; e.g., a4 = 9999744.
s(33m) = 120, what is the value of s(3m)? Define f (n) = max {m ∈ n | 2m divides an}, for
[PRE – RMO – 2019] n ≥ 1. Find f (1) + f (2) + f (3) + … + f (10).
42. Let Fk (a, b) = (a + b)k – ak – bk and let S = {1, [PRE – RMO – 2019]
2, 3, 4, 5, 6, 7, 8, 9, 10}. For how many 50. For any real number x, let [x] denotes the
ordered pairs (a, b with a, b ∈ S and a ≤ b is integer part of x; {x} be the fractional part of x
F5 (a, b) ({x} = x|x|). Let a denote the set of all real
an integer? [PRE – RMO – 2019] numbers x satisfying {x} =
F 3(a, b)
x + [ x] + [ x + (1/ 2)]
43. Consider the sequence . If S is the sum of all
20
1, 7, 8, 49, 50, 56, 57, 343, …
numbers in A, find [S].
which consists of sums of distinct powers of 7,
[PRE – RMO – 2019]
that is 70, 71, 70, 71, 72, …, in increasing order.
51. A number N in base 10, is 503 in base b and
At what position will 16856 occur in this 305 in base b + 2. What is the product of the
sequence? digits of N?
[PRE – RMO – 2019] [IOQM – 2021]
44. In base-2 notation, digits are 0 and 1 only and 52. What is the least positive integer by which 25 ·
the places go up in powers of –2. For example, 36 · 43 · 53 – 67 should be multiplied so that,
11011 stands for (–2)4 + (–2)3 + (–2)1 + (–2)0 the product is a perfect square?
and equals number 7 in base 10. If the decimal [IOQM – 2021]
number 2019 is expressed in base-2 how many 53. A 5-digit number (in base 10) has digits k, k +
non-zero digits does it contain? 1, k + 2, 3k, k + 3 in that order, from left to
[PRE – RMO – 2019] right. If this number is m2 for some natural
45. Let n denote the number of all natural number m, find the sum of the digits of m.
numbers n such that n is divisible by a prime [IOQM – 2021]
54. Find the sum of all positive integers n for
p n and p < 20. What is the value of n?
which |2n + 5n – 65| is a perfect square.
[PRE – RMO – 2019] [IOQM – 2021]
46. Let a, b, c be distinct positive integers such 55. The product 55 × 60 × 65 is written as the
that b + c – a, c + a – b and a + b – c are all product of five distinct positive integers. What
perfect squares. What is the largest possible is the least possible value of the largest of
value of a + b + c smaller than 100? these integers?
[PRE – RMO – 2019] [IOQM – 2021]

NUMBER SYSTEM 77
OLYMPIAD BOOKLET

56. How many two digit numbers have exactly 4 64. Let α and β be positive integers such that
positive factors? (Here 1 and the number N are 16  7
  . Find the smallest possible value
also considered as factors of N.) 37  16
[IOQM – 2021] of β.
57. For a positive integer < n >, let n denote the [IOQM – 2023]
perfect square integer closest to n. For example, 65. Find the number of triples (a, b, c) of positive
< 74 > = 81, < 18 > = 16. If N is the smallest integers such that,
positive integer such that < 91 > . <120> . (a) ab is a prime;
<143> . <180> . < N > = 91.120.143. 180. N (b) bc is a product of two primes;
Find the sum of the squares of the digits of N. (c) abc is not divisible by square of any
[IOQM – 2021] prime and
58. A natural number N is said to be good if N is (d) abc ≤ 30
the sum of r consecutive positive integers, for [IOQM – 2023]
some r3 2. Find the number of good numbers 66. A positive integer m has the property that m2
in the set {1, 2, …, 100}. is expressible in the form 4n2 – 5n + 16 where
[IOQM – 2021] n is an integer (of any sign). Find the
ab maximum possible value of |m – n|.
59. Positive integers a, b, c satisfy =c.
a −b [IOQM – 2023]
What is the largest possible value of a + b + c 67. For n ∈ , let P(n) denote the product of the
not exceeding 99?
digits in n and S(n) denote the sum of the
[IOQM – 2021]
digits in n. Consider the set
60. Find the number of pairs (a, b) of natural
A = {n ∈  : P(n) is non-zero, square free and
numbers such that b is a 3-digit number, a + 1
divides b – 1 and b divides a2 + a + 2. S(n) is a proper divisor of P(n)}.
[IOQM – 2021] Find the maximum possible number of digits
61. For any real number t, let [t] denote the largest of the numbers in a.
integer ≤ t. Suppose that n is the greatest [IOQM – 2023]
  68. In the land of Binary, the unit of currency is
integer such that    n    = 4 , Find the called Ben and currency notes are available in
   
  denominations 1, 2, 22, 23, … Bens. The rules
sum of digits of n. of the Government of Binary stipulate that one
[IOQM – 2022] can not use more than two notes of any one
62. Let n be a positive integer such that 1 ≤ n ≤ denomination in any transaction. For example,
1000. Let Mn be the number of integers in the one can given a change for 2 Bens in two
set xn = 4n + 1, 4n + 2,, 4n + 1000 . Let ways: 2 one Ben notes or 1 two Ben note. For
a = max {Mn: 1 ≤ n ≤ 1000}, and b = min {Mn: 5 Ben one can given 1 one Ben note and 1
1 ≤ n \leq 1000}. Find a – b. four Ben note or 1 one Ben note and 2 two
[IOQM – 2023] Ben notes. Using 5 one Ben notes or 3 one
63. Find the number of elements in the set Ben notes and 1 two Ben notes for a 5 Ben
{(a, b) ∈ N: 2 ≤ a, b ≤ 2023, loga(b) + 6logb(a) transaction is prohibited. Find the number of
ways in which one can given change for 100
= 5}
Bens, following the rules of the Government.
[IOQM – 2023]
[IOQM – 2023]

NUMBER SYSTEM 78
OLYMPIAD BOOKLET

69. A positive integer n > 1 is called beautiful if n 70. Let d(m) denote the number of positive integer
can be written in one and only one way as n = divisors of a positive integer m. If r is the
a1 + a2 + … + ak = a1 · a2 … ak for some number of integers n ≤ 2023 for which
positive integers a1, a2, … ak, where k > 1 and n

a1 > a2 > … > ak (For example 6 is beautiful  d (i)

i =1
is odd, find the sum of the digits of r.
since 6 = 3 · 2 · 1 = 3 + 2 + 1, and this is [IOQM – 2023]
unique. But S is not beautiful since 8 = 4 + 2 +
1 + 1 = 4 · 2 · 1 · 1 as well as 8 = 2 + 2 + 2 + 1
+ 1 + = 2 · 2 · 2 · 1 · 1, so uniqueness is lost.)
Find the largest beautiful number less than 100.
[IOQM – 2023]

So the sum is 6 + 3 × (6 + … + 31) + 31 + 32

= 1512, it is also 17 + 20 + 23 + … + 95, so
1. The logarithmic notation doesn't tell us much, the answer is 512.
so we'll first convert everything to the 3. On his first pass, he opens all of the odd
equivalent exponential forms. x24 = w, y40 = w, lockers. So there are only even lockers closed.
and (xyz)12 = w. If we now convert everything Then he opens the lockers that are multiples of
to a power of 120, it will be easy to isolate z 4, leaving only lockers 2(mod 8) and 6(mod
and w. 8). Then he goes ahead and opens all lockers
x120 = w5, y120 = w3, and (xyz)120 = w10. 2(mod 8), leaving lockers either 6(mod 16) or
14(mod 16). He then goes ahead and opens all
With some substitution, we get w5w3z120 = w10
lockers 14(mod 16), leaving the lockers either
and logzw = 060.
6(mod 32) or 22(mod 32). He then goes ahead
2. We can find that
and opens all lockers 6(mod 32), leaving
20 ≡ 6 (mod 7)
22(mod 64) or 54(mod 64). He then opens
21 ≡ 5 (mod 8)
54(mod 64), leaving 22(mod 128) or 86(mod
22 ≡ 6 (mod 8)
128). He then opens 22(mod 128) and leaves
23 ≡ 7 (mod 8)
86(mod 256) and 214(mod 256). He then
24 ≡ 6 (mod 9)
opens all 214(mod 256), so we have 86(mod
25 ≡ 7 (mod 9)
512) and 342(mod 512), leaving lockers 86,
26 ≡ 8 (mod 9) 342, 598, and 854, and he is at where he
Observing these and we can find that the started again. He then opens 86 and 598, and
remainders are in groups of three continuous then goes back and opens locker number 854,
integers, considering this is true, and we get leaving locker number 342 untouched. He
99 ≡ 31 (mod 34) opens that locker.
100 ≡ 32 (mod 34) Lockers that are 2(mod 8) and 6(mod 8) are
just lockers that are 2(mod 4).

NUMBER SYSTEM 79
OLYMPIAD BOOKLET

4. Note that the value of r up to the closest show that the latter partition doesn't
1 work. So we cannot obtain 3.
multiple of doesn't matter, so assume 100
100 4: We can partition as 1 + 1 + 2, and from
r is an integer. By Hermite's Identity, this 1
the previous case we see that works.
equation is equivalent to [100r] – 4
 1   18   92  5: We can partition as 1 + 2 + 2, from
 r +  +  +  r + 100  +  r + 100  +  + 1
  100      which we find that works.
 99   3
 r + 100   = 546. 6: We can partition as 1 + 2 + 3, from
 
5. Noting that all of the numbers are even, we 3
which we find that works.
can reduce this to any real number x between 8
1 n Out of these 6 cases, only 3 fails. So between
0 to , as this will be equivalent to to 1 and 10 we can reach only the integers 1, 2,
2 2
4, 5, 6, 10; hence our solution is 6 · 100 = 600.
n +1
for any integer n. So now we only need 6. Using the properties of logarithms, log10xyz =
2
81 by taking the log base 10 of both sides, and
to test every 10 numbers; and our answer will
(log10x) (log10y) + (log10x) (log10z) + (log10y)
be 100 times the number of integers we can
(log10z) = 468 by using the fact that log10ab =
reach between 1 and 10.
log10a + log10b.
We can now approach this by directly
Through further simplification, we find that
searching for the integers or brute forcing all
log10x + log10y + log10z = 81. It can be seen
of the cases.
that there is enough information to use the
We can match up the greatest integer functions
formula (a + b + c)2 = a2 + b2 + c2 + 2ab + 2ac
with one of the partitions of the integer. If we
+ 2bc, as we have both a + b + c and 2ab +
1
let x = then we get the solution 10 ; now
2 2ac + 2bc, and we want to find a 2 + b 2 + c 2 .
1 After plugging in the values into the equation,
consider when x  : [2x] = 0, [4x] ≤ 1, [6x] we find that (log10x)2 + (log10y)2 + (log10z)2 is
2
≤ 2, [8x] ≤ 3. But according to this the equal to 6561 – 936 = 5625.
maximum we can get is 1 + 2 + 3 = 6, so we However, we want to find
only need to try the first 6 numbers. ( log10 x )
2
+ ( log10 y ) + ( log10 z ) ,
2 2
so we
1: Easily possible, for example try plugging
take the square root of 5625, or 075.
1
in x = . 7. We express the numbers as x = 100a + 10b + c
8
and y = 100c + 10b + a. From this, we have
1
2: Also simple, for example using . z = |100a + 10b + c – 100c – 10b – a|
6 = |99a – 99c| = 99|a – c|
3: The partition must either be 1 + 1 + 1 or Because a and c are digits, and a and c are
1 both between 1 and 9 (from condition 1), there
1 + 2. If [4x] = 1, then x ≥ , but then
4 are 009 possible values (since all digits except
[8x] ≥ 2; not possible; and vice versa to 9 can be expressed this way).

NUMBER SYSTEM 80
OLYMPIAD BOOKLET

8. For one such pair of consecutive integers, let We wish to count the ordered triples (A, B, C).
the smaller integer be 1ABC where A, B and C By casework, we consider all possible forms
are digits from 0 through 9. of the larger integer, as shown below.

Case Thousands Hundreds Tens Ones Conditions for No of Ordered Triples

Carrying
0≤C≤8 1 A B C+1 0 ≤ A, B, C ≤ 4 53
0 ≤ B ≤ 8; C = 9 1 A B+1 0 0 ≤ A, B ≤ 4; C = 9 52
0 ≤ A ≤ 8; B = C = 9 1 A+1 0 0 0 ≤ A ≤ 4; B = C = 9 5
A=B=C=9 2 0 0 0 A=B=C=9 1

Together, the answer is 53 + 52 + 5 + 1 = 156. 2002, which is easy to solve by trial, as the
9. If we choose a3 and a1 such that (103) (a3) + 2002 .)
solution is obviously =
(10) (a1) ≤ 2010 there is a unique choice of a2
We can now compute:
and a0 that makes the equality hold. So N is
just the number of combinations of a3 and a1  2002   2002   2002 
 45  = 44  44  = 45  43 
we can pick.      
If a3 = 0 or a3 = 1 we can let a1 be anything  2002 
= 46   = 47
from 0 to 99. If a3 = 2 then a1 = 0 or a1 = 1.  42 
Thus N = 100 + 100 + 2 = 202.  2002   2002 
10. For most values of x, T(x) will equal 2. For  41  = 48  40  = 50.
   
those that don't, the difference must be From the observation above (and the fact that
bumping the number up a ten, a hundred, etc.
 2002 
If we take T(a 999) as an example, |(a + 1) + 0  2002  = 1) we know that all integers
+ 0 + 1 – (a + 9 + 9 + 9)| = |2 – 9(3)| And in
between 1 and 44 will be achieved for some
general, the values of T(x) will then be in the
values of N. Similarly, for N < 40 we
form of |2 – 9n| = 9n – 2. From 7 to 1999,
1999 − 7   2002 
there are  9  = 222 solutions;    50
obviously have  n  .
including 2 and there are a total of 223 Hence the least positive integer k for which
solutions.  2002 
the equation  = k has no integer
2002 2002  n 
11. Note that if −  1, then either
n n +1 solutions for N is 049. Note: After getting that
 2002   2002   2002   2002   2002 
 n  =  n + 1  , or  n  =  n + 1  + 1 .  45  = 44, for ease of computation above,
Either way, we won't skip any natural we can use the fact that (40 + k) (49 – k)
numbers. varies solely based on k2 and checking these
2002 2002 gives us that the pattern fails at k = 0 giving us
The greatest N such that −  1 is n
n n +1 049 as the answer.
= 44. (The inequality simplifies to n(n + 1) <

NUMBER SYSTEM 81
OLYMPIAD BOOKLET

12. The product of N – 3 consecutive integers can b) and 10a + b ≡ b (mod a), or a divides into b
(n − 3 + a)! and b divides into 10a. Thus b = a, 2a or 5a
be written as for some integer a.
a! (note that if b = 10a, then world not be a
(n − 3 + a)! digit).
Thus, N ! = , from which it
a! b = a, we have N = 11 a for nine possibilities,
becomes evident that a ≥ 3. Since (n – 3 + a)! 9(10)
giving sum of 11 · = 495.
> n!, we can rewrite this as 2
n !(n + 1)(n + 2) n(n − 3 + a) For b = 2a, we have N = 12 a for four
= n! possibilities (the higher ones give b > 9),
a!
⇒ (n + 1)(n + 2) …(n – 3 + a) = a!. 4(5)
giving us a sum of 12 · = 120.
For a = 4, we get N + 1 = 4! so N = 23. For 2
greater values of a, we need to find the For b = 5a, we have N = 15 a for one
product of a – 3 consecutive integers that possibility (again, higher ones give b > 9),
giving us a sum of 15.
equals a!. n can be approximated as a −3
a !,
If we ignore the case b = 0 as we have been
which decreases as a increases. Thus, N = 23 doing so far, then the sum is 495 + 120 + 15 =
is the greatest possible value to satisfy the 630.
given conditions. 16. If n + 10 |n3 + 100|, gcd (n3 + 100, n + 10) = n
13. Since the middle term of an arithmetic + 10. Using the Euclidean algorithm, we have
progression with an odd number of terms is gcd (n3 + 100, n + 10) = gcd (–10n2 + 100, n +
the average of the series, we know b + c + d = 10) = gcd (100n + 100, n + 10) = gcd (–900, n
3c and a + b + c + d + e = 5c. Thus, c must be + 10), so n + 10 must divide 900. The greatest
in the form of 3 · x2 based upon the first part integer n for which n + 10 divides 900 is 890;
and in the form of 52 · y3 based upon the we can double-check manually and we find
second part, with x and y denoting an integers. that indeed 900 | 8903 + 100.
c is minimized if it's prime factorization 17. The prime factorization of 75 = 3152 = (2 + 1)
contains only 3, 5, and since there is a cubed (4 + 1) (4 + 1). For N to have exactly 75
term in 52 · y3, 33, must be a factor of c. 33 52 integral divisors, we need to have
= 675, which works as the solution.
n = p1e1−1 p2e 2 −1 … such that e1e2 … = 75.
14. For integers k, we want [log2n] = 2k, or 2k ≤
log2n < 2k + 1 ⇒ 22k ≤ n < 22k + 1. Thus, N must Since 75 | n, two of the prime factors must be
satisfy these inequalities (since N < 1000) : 3 and 5. To minimize n, we can introduce a
4≤n<8 third prime factor, 2. Also to minimize n, we
16 ≤ n < 32 want 5, the greatest of all the factors, to be
64 ≤ n < 128 raised to the least power. Therefore, n = 24 34
256 ≤ n < 512 n 243452
= = 16 ·27 = 432
There are 4 for the first inequality, 16 for the 52 and 75 3 ·52 .
second, 64 for the third, and 256 for the 18. We consider the method in which repeating
fourth, so the answer is 4 + 16 + 64 + 256 = decimals are normally converted to fractions
340. with an example:
15. Let our number be 10a + b, a, b ≠ 0. Then we
x = 0.176
have two conditions: 10a + b ≡ 10a ≡ 0 (mod

NUMBER SYSTEM 82
OLYMPIAD BOOKLET

times in the numerator, so 3p < 200. The

⇒ 1000x = 176.176
largest such prime is 061, which is our answer.
⇒ 999x = 1000x – x = 176
21. Rewrite all of the terms in base 3. Since the
176 numbers are sums of distinct powers of 3, in
x=
⇒ 999 base 3 each number is a sequence of 1s and 0s
Thus, let x = 0.abc (if there is a 2, then it is no longer the sum of
distinct powers of 3). Therefore, we can recast
⇒ 1000x = abc ·abc this into base 2 (binary) in order to determine
⇒ 999x = 1000x – x = abc the 100th number. 100 is equal to 64 + 32 + 4,
abc so in binary form we get 1100100. However,
x=
⇒ 999 we must change it back to base 10 for the
If abc is not divisible by 3 or 37, then this is in answer, which is 36 + 35 + 32 = 729 + 243 + 9
lowest terms. Let us consider the other = 981.
multiples: 333 multiples of 3, 27 of 37, and 9 22. It's clear that we must have a = 2j5k, b = 2m5n
of both 3 and 37, so 999 – 333 – 27 + 9 = 648, and c = 2p5q for some non-negative integers j,
which is the amount that are neither. The 12 k, m, n, p, q. Dealing first with the powers of
numbers that are multiples of 81 reduce to 2: from the given conditions, max (j, m) = 3
multiples of 3 . We have to count these since it max (m, p) = max (p, j) = 4. Thus we must
will reduce to a multiple of 3 which we have have p = 4 and at least one of m, j equal to 3.
removed from 999, but, this cannot be This gives 7 possible triples (j, m, p) : (0, 3,
removed since the numerator cannot cancel 4), (1, 3, 4), (2, 3, 4), (3, 3, 4), (3, 2, 4), (3, 1,
the 3. There aren't any numbers which are 4) and (3, 0, 4).
multiples of 372, so we can't get numerators Now, for the powers of 5 : we have max (k, n)
which are multiples of 37. Therefore 648 + 12 = max (n, q) = max (q, k) = 3. Thus, at least
= 660. two of k, n, q must be equal to 3, and the other
19. A positive integer is divisible by 4 if and only can take any value between 0 and 3. This
if its last two digits are divisible by 4. For any gives us a total of 10 possible triples: (3, 3, 3)
value of b, there are two possible values for a and three possibilities of each of the forms (3,
and c, since we find that if b is even, a and c 3, n), (3, n, 3) and (n, 3, 3).
must be either 4 or 8, and if b is odd, a and c Since the exponents of 2 and 5 must satisfy
must be either 2 or 6. There are thus 2 · 2 = 4 these conditions independently, we have a
ways to choose a and c for each b, and 10 total of 7 · 10 = 70 possible valid triples.
ways to choose b since b can be any digit. The 23. We use the fact that the number of divisors of
final answer is then 4 · 10 = 040. a number n = p1e1 p2e 2  pkek is (e1 + 1) (e2 + 1)
20. Expanding the binomial coefficient, we get … (ek + 1). If a number has 18 = 2 · 3 · 3
 200  200! factors, then it can have at most 3 distinct
 = . Let the required prime be
 100  100!100! primes in its factorization.
p; then 10 ≤ p < 100. If p > 50, then the factor Dividing the greatest power of 2 from n, we
of p appears twice in the denominator. Thus, have an odd integer with six positive divisors,
we need p to appear as a factor at least three which indicates that it either is (6 = 2 · 3) a
prime raised to the 5th power, or two primes,

NUMBER SYSTEM 83
OLYMPIAD BOOKLET

one of which is squared. The smallest example 26. In general, there are 20 – n pairs of integers
of the former is 35 = 243, while the smallest (a, b) that differ by n because we can let b be
example of the latter is 32 · 5 = 45. any integer from n + 1 to 20 and set a equal to
Suppose we now divide all of the odd factors b – n. Thus, the product is (119) (218) … (191)
18 (or alternatively, 19!.18! ... 1!.)
from n; then we require a power of 2 with
6 When we count the number of factors of 2, we
= 3 factors, namely 23 – 1 = 4. Thus, our answer have 4 groups, factors that are divisible by 2 at
is 22 · 32 · 5 = 180. least once, twice, three times and four times.
24. We know that n2 = 262338 must have (62 + 1) × Numbers that are divisible by 2 at least once:
(38 + 1) factors by its prime factorization. If 2, 4, …, 18 Exponent corresponding to each
we group all of these factors (excluding n) one of them 18, 16, … 2.
into pairs that multiply to n2, then one factor (20)(9)
Sum = 2 + 4 + … + 18 = = 90
per pair is less than n, and so there are 2
63  39 − 1 Numbers that are divisible by 2 at least twice:
= 1228 factors of n2 that are less
2 4, 8, …, 16 Exponent corresponding to each
than n. There are 32 × 20 – 1 = 639 factors of one of them 16, 12, ... 4
n, which clearly are less than n, but are still (20)(4)
Sum = 4 + 8 + … + 16 = = 40
factors of n. Therefore, using complementary 2
counting, there are 1228 – 639 = 589 factors Numbers that are divisible by 2 at least three
of n2 that do not divide n. times: 8, 16
25. A number in decimal notation ends in a zero Exponent corresponding to each one of them
for each power of ten which divides it. Thus, 12, 4
we need to count both the number of 5 s and Sum = 12 + 4 = 16
the number of 2s dividing into our given Number that are divisible by 2 at least four
expression. Since there are clearly more 2s times: 16 Exponent corresponding to each one
than 5s, it is sufficient to count the number of of them 4
5s. Sum = 4
One way to do this is as follows: 96 of the Summing these give an answer of 150.
numbers 1!, 2!, 3!, 100! have a factor of 5.91 27. The requested number mod42 must be a
have a factor of 10. 86 have a factor of 15. composite number. Also, every number that is
And so on. This gives us an initial count of 96 a multiple of 42 greater than that prime
+ 91 + 86 + … + 1. Summing this arithmetic number must also be prime, except for the
series of 20 terms, we get 970. However, we requested number itself. So we make a table,
have neglected some powers of 5 – every n! listing all the primes up to 42 and the numbers
term for n ≥ 25 has an additional power of 5 that are multiples of 42 greater than them,
dividing it, for 76 extra; every n! for n \geq 50 until they reach a composite number.
has one more in addition to that, for a total of
51 extra; and similarly there are 26 extra from
those larger than 75 and 1 extra from 100.
Thus, our final total is 970 + 76 + 51 + 26 + 1
= 1124, and the answer is 124.

NUMBER SYSTEM 84
OLYMPIAD BOOKLET

29. Since all divisors of 1000 = 23 53 can be

1 43 85
2 44 a
3 45 written in the form of 2 5 , it follows that b
m n

can also be expressed in the form of 2x 5y,

5 47 89 131 173 215
where – 3 ≤ x, y ≤ 3. Thus every number in the
7 49
form of a/b will be expressed one time in the
11 53 95 product (2–3 + 2–2 + 2–1 + 20 + 21 + 22 + 23)
13 55 (5–3 + 5–2 + 5–1 + 50 + 51 + 52 + 53)
17 59 101 143 Using the formula for a geometric series, this
19 61 103 145 reduces to
23 65 2−3 (27 − 1) 5−3 (57 − 1) 127 ·78124
S= · =
29 71 113 155 2 −1 5 −1 4000
31 73 115 437 S
 
= 2480 + , and   = 248.
37 79 121 1000 10 
41 83 125 30. In base – 2 representation, all positive
Since 215 is the greatest number in the list, it numbers have a leftmost digit of 1. Thus there
is the answer. Note that considering mod 5 n
are   numbers that have n + 1 digits in
would have shortened the search, since gcd (5, k
42) = 1, and so within 5 numbers at least one base 2 notation, with k + 1 of the digits being
must be divisible by 5. 1 's.
28. Lemma: For all positive integers n, there's In order for there to be more 1 's than 0 's, we
exactly one n-digit power of 9 that does not n +1 n −1 n
have a left-most digit 9 If there is exactly 1 n- must have k + 1  k  k  .
2 2 2
digit power of 9, then such a number m cannot Therefore, the number of such numbers
m corresponds to the sum of all numbers on or to
begin with 9 since that would result in also
9 the right of the vertical line of symmetry in
being an n-digits, hence a contradiction. Pascal's Triangle, from rows 0 to 10 (as 2003
Therefore, this single n-digit power of 9 must < 211 – 1). Since the sum of the elements of
not begin with 9. In the case that there are 2 n- the rth row is 2r, it follows that the sum of all
digit powers of 9, we have already discovered elements in rows 0 through 10 is 2 0 + 21 + …
that one of them must begin with 9, let it be 9 k + 210 = 211 – 1 = 2047. The center elements are
m  2i 
= m. The integer 9k – 1 = – 1 s t then be an in the form   , so the sum of these
9  i 
n-digit number that begins with 1. Using this 5
 2i 
lemma, out of the 4001 powers of 9 in T, elements is   i  = 1 + 2 + 6 + 20 + 70 +

exactly 3816 must not begin with 9 (one for i =0

each digit). Therefore, the answer is 4000 – 252 = 351. The sum of the elements on or to
3816 = 184 numbers have 9 as their leftmost the right of the line of symmetry is thus
digits. 2047 + 351
= 1199. However, we also counted
2

NUMBER SYSTEM 85
OLYMPIAD BOOKLET

the 44 numbers from 2004 to 211 – 1 = 2047. · 32 + 1 · 30. In order to rewrite as a sum of
Indeed, all of these numbers have at least 6 1's perfect powers of 3, we can use the fact that
in their base-2 representation, as all of them 2 · 3k = 3k + 1 – 3k: 2008 = (37 – 36) + (36 – 35)
are greater than 1984 = 111110000002, which + (34 – 33) + 32 + 30 = 37 – 35 + 34 – 33 + 32 +
has 5 1's. Therefore, our answer is 1199 – 44 = 30
1155, and the remainder is 155. The answer is 7 + 5 + 4 + 3 + 2 + 0 = 021.
31. Let the three integers be a, b, c. N = abc = 6(a k (k + 1)(2k + 1)
35. is a multiple of 200 if k (k +
+ b + c) and c = a + b. Then N = ab (a + b) = 6 6
(a + b + a + b) = 12 (a + b). Since a and b are 1)(2k + 1) is a multiple of 1200 = 24 · 3 · 52.
positive, ab = 12 so {a, b} is one of {1, 12}, So 16, 3, 25 | k(k + 1) (2k + 1) |.
{2, 6}, {3, 4} so a + b is one of 13, 8, 7 so the Since 2k + 1 is always odd, and only one of k
sum of all possible values of N is 12. (13 + 8 + and k + 1 is even, either k, k + 1 ≡ 0 (mod 16).
7) = 12(28) = 336. Thus, k ≡ 0, 15 (mod 16).
32. Suppose there is some k such that x2 – 19x + If k ≡ 0 (mod 3), then 3 | k. If k ≡ 1 (mod 3),
99 = k2. Completing the square, we have that then 3 | 2k + 1. If k ≡ 2 (mod 3), then 3 | k + 1.
(x – 19/2)2 + 99 – (99/2)2 = k2, that is, (x – Thus, there are no restrictions on k in (mod 3).
19/2)2 + 35/4 = k2. Multiplying both sides by 4 It is easy to see that only one of k, k + 1, and
and rearranging, we see that (2k)2 – (2x – 19)2 2k + 1 is divisible by 5. So either k, k + 1, 2k +
= 35. Thus, (2k – 2x + 19) (2k + 2x – 19) = 35. 1 ≡ 0 (mod 25). Thus, k ≡ 0, 24, 12 (mod 25).
We then proceed as we did in the previous From the Chinese Remainder Theorem, k ≡ 0,
solution. 112, 224, 175, 287, 399 (mod 400). Thus, the
33. Suppose the original number is N = smallest positive integer k is 112.
an an−1 aa a0 , where the ai are digits and the
first digit, an, is nonzero.
1. 9100 – 1 = (10 – 1)100 – 1
Then the number we create is N0 = an−1 a1a0
By binomial expansion
so N = 29 N0. But N is N0 with the digit an = multiple of (100) – 100C (10)1 + (1)100 − 1
added to the left, so N = N0 + an · 10n. Thus,
N0 + an · 10n = 29 N0 an · 10n = 28 N0. The = multiple of (100) – 100 (10)
right-hand side of this equation is divisible by = multiple of (100)
seven, so the left-hand side must also be So last two digits are '00'
divisible by seven. The number 10n is never 2. Zeros in n! are appears when 2 is multiplied
divisible by 7, so an must be divisible by 7. by 5 or the occurrence of a 10.
But an is a nonzero digit, so the only Every second number is multiple of 2 so there
possibility is an = 7. This gives 7 · 10n = 28 N0 will a lot of 2 compare to multiple of 5.
or 10n = 4 N0. Now, we want to minimize both So we can just count the number of 5 s in the
N and N0, so we take N0 = 25 and N = 2. Then multiplication.
N = 7 · 102 + 25 = 725 and indeed, 725 = 29 · We know that number of 5 s in general way
25. n  n   n 
=  + +  +
34. In base 3, we find that 200810 = 22021013. In  5   25  125 
other words, 2008 = 2 · 36 + 2 · 35 + 2 · 33 + 1 Now number of 5's in 400 !

NUMBER SYSTEM 86
OLYMPIAD BOOKLET

 400   400   400  5. n + 2n2 + 3n3 + … + 2005n2005

= + +  + (n – 1 + 1) + 2(n – 1 + 1)2 + 3(n – 1 + 1)3 + …
 5   25   125 
= 80 + 16 + 3 + 0 … = 99 + 2005(n – 1 + 1)2005
So we want 1 more five If it is divisible by (n – 1) then it is multiple of
So in 405! There will be 100 zeros but this not (n – 1).
a largest. So (n – 1) + 1 + multiple of (n – 1) + 2(1)2 +
From 405! to 409! There will be 100 zeros at multiple of
the end and 409 is largest. (n – 1) + 3(1)2 + … + multiple of (n – 1) +
Sum of digits = 4 + 0 + 9 = 13 2005(1)2005
3. Last two digit of (7)1 = 07 = multiple of (n – 1) + [1 + 2 + 3 + … +
Last two digit of (7)2 = 49 2005]
Last two digit of (7)3 = 43 If it is divisible by (n – 1) then (1 + 2 + 3 + …
Last two digit of (7)4 = 01 + 2005) is also multiple of 2005.
Last two digit of (7)5 = 07 Now 1 + 2 + 3 + … + 2005
Last two digit of (7)6 = 49 2005  2006
=
Means pattern are repeated after 4 powers 2
means cyclicity of 7 in two digit are also 4. = 2005 × 1003
So now find the remainder when 32005 divided = 5 × 401 × 17 × 59
by 4. It is also multiple of (n – 1)
(4 – 1)2005 = multiple of (4) – 1 Factors of 5 × 401 × 17 × 59
So remainder is = – 1 + 4 = 3 = 2 × 2 × 2 × 2 = 16
So check the last two digit of 73 and it is 43. So, total 16 values of (n – 1) are possible for
So, correct answer is 43. which given number is divisible by (n – 1).
4. 10N – N = 100000000 − N − (999999)2 9 − (6666666) 2 6
N times 2006 times 2006 times
N is a two digit number so if we take N = 10 9 (11111) − 6(111111) 2
2 2

then pattern is like this 2006 times 2006 times

= 10000000000 – 10 45  (111111) 2

= 9999999990 2006 times

(sum of digits = 81 not divisible by 170) (111111) 2

If N = 11 then ⇒ 99999999989 Number 2006 times is a multiple of 11.
(Sum of digits = 98 not divisible by 170) So if we divided this number by 11 we get '0'
From N = 11 to 20 pattern is as a remainder.
9999 7. n3 + 2006 = (n + 26) (n2 – 26n + 676) – 15570
8 – depends on last digit of N.
( N − 2)times
So if n3 + 2006 is divisible by (n + 26) then
We want sum of digits is divisible by 170. 15570 is divisible by (n + 26).
So if put N = 20 then So largest value of n = 15570 – 26 = 15544
Sum of digits = 9 × 18 + 8 + 0 = 170 Sum of digits = 1 + 5 + 5 + 4 + 4 = 19
This is the smallest multiple of 170. 8. 247 = 13 × 19
So N = 20 is also smallest We know that 13 × 3 = 39 and 19 × 2 = 38
Hence correct answer is 20. 38 and 39 are two consecutive terms.

NUMBER SYSTEM 87
OLYMPIAD BOOKLET

Now n(n + 1)(n + 2) is divisible by 247 then it So here N = 2008 and [ ] = G.I.F
is also divisible by 13 and 19. Number of zeros at the end
So here two of three factors should be  2008   2008   2008   2008 
multiple of 13 and 19. = + + +  +
 5   25   125   625 
38 and 39 are two consecutive numbers. = 401 + 80 + 16 + 3 = 500
So if we take (n + 1) = 38 and (n + 2) = 39 then n So n = 500
= 37 and 37 × 38 × 39 is divisible by 247.
Now n + 125 = 500 + 125 = 625 = 25
So n = 37
13. (1! × 1) = 1 = 2! – 1
9. n = 123456789101213 … 4344
(1! × 1) + (2! × 2) = 5 = (3! – 1)
Sum of digits of n = 225 and it is divisible by
(1! × 1) + (2! × 2) + (3! × 3) = 23 = (4! – 1)
9 So N is also divisible by 9.
(1! × 1) + (2! × 2) + (3! × 3) + (4! × 4)
N 123454344
Now = = 119 = 5! – 1 So by this similar pattern
45 45
(1! × 1) + (2! × 2) + (3! × 3) + …(286! × 286)
Divided by 9 in numerator and denominator.
= 287! – 1
We know that n is divisible by 9 so last digit
287! is a multiple of 24 × 53
should be 6 because only 54 is divisible by 9
So if (287! – 1) is divided by 24 × 53 = 2000
at 6 times when unit digit is 4 so we get = 6
then
So 6 is divided by 5 we get '1' remainder but
Remainder is – 1 or – 1 + 2000 = 1999
actual remainder is 9 × 1 = 9 because we cut it
14. 30 + 31 + 32 + 33 + … + 32009
by 9 already.
So r = 9 and r2 = 81 1(32010 − 1)
This is a G.P and Sum =
10. k = 20082 + 22008 3 −1
Unit digit of k = 4 + 6 = 0  a(r n − 1) 
 Sum of G.P = r − 1 
Also k is a multiple of 4 by observation.  
Now k2 + 2k ≡ 0 + 6 ≡ 6 (mod 10)
32010 − 1 91005 − 1 (8 + 1)1005 − 1
So square of unit digit = 36. = = =
2 2 2
11. Given numbers are 53, 62, 66, 68, 71, 82, 89.
Anna picked 62 and 89. So remaining 3 multipleof (82 ) + 1005  8 + 1 − 1
=
integers are picked from 53, 66, 68, 71 and 82. 2
Given that average of these five numbers is = multiple of (8) + 4020
also an integer so sum of these five numbers Now if it is divided by 8 we get '4' as a
are divisible by 5 . remainder.
So there is only one possibility for sum is 15. Possibilities of last two digits are 44, 49, 94,
divisible by 5 is 62 + 89 + 66 + 71 + 82 99 but number 'n' is divisible by 4 so only 44
So remaining three numbers are 66, 71, 82. is possible.
66 + 71 + 82 219 Now again number is divisible by 9 also and
Mean = = = 73. with at least one 4 and 9 so for smallest value
3 3
12. Number = 1 × 2 × 3 × … × 2008 = 2008! of 'n' we take 9 times 4 and 1 times 9
We know that number of zeros at the end in n! n = 4444444944
Sum of last four digits = 4 + 9 + 4 + 4 = 21.
n  n   n   n 
=  + + +  +
 5   25  125   625 

NUMBER SYSTEM 88
OLYMPIAD BOOKLET

16. Let the numbers are in the form of xy 23. 19. Sequence is 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, …
Numbers are divisible by 3 so sum of digits are You want to find the largest integer N that satisfy
multiple of 3. Here, x > 0 maximum sum is 9 + n  (n + 1)
9 + 2 + 3 = 23 but number is divisible by 3 so  2019
2
possible sum of digit are 6, 9, 12, 15, 18, 21. n(n + 1) < 4038
So possible sum of x +y = 1, 4, 7, 10, 13, 16 So largest n = 63
So possible pairs of (x, y) are Therefore the next value of the sequence is 64
(1, 0), (1, 3), (2, 2), (3, 1), (4, 0), (1, 6), (2, 5), and when 64 is divided by 5 remainder is 4.
(3, 4), (4, 3), (5, 2), (6, 1), (7, 0), (9, 1), (8, 2), 20. Let the next largest divisor be x
(7, 3), (6, 4), (5, 5), (4, 6), (3, 7), (2, 8), (1, 9), Suppose HCF (x, 323) = 1
(9, 4), (8, 5), (7, 6), (6, 7), (5, 8), (4, 9), (9, 7), Then n is divisible by x and 323.
(8, 8), (7, 9). Here x > 323
Hence total 30 numbers are possible. So if we take x = 324
17. Let n = x × (x + 1) (x + 2) Then 323 × 324 > 9999
There are two cases for x, x is even or odd also Therefore, HCF (x, 323) ≠ 1
n is multiple of 7. Note that 323 = 17 × 19
We know that product of three consecutive Therefore, the smallest HCF can be is 17 and
number is divisible by 3. our answer is 323 + 17 = 340.
Case 1: If x is odd then 21. 110n3 = 2 × 5 × 11 × n3
(x + 1) is even If we take n = 1 then number of factors are
So n is divisible by 2 also. =2×2×2=8
Case 2: If x is even then But if we take n = 53 × 11
x and (x + 2) both are even Then 110n3 = 2 × 510 × 114
So n is divisible by 4 also. Total = 2 × 11 × 5 = 110 factors
For the largest two digit number we take
So n2 = 56 × 112 and 9n2 = 32 × 56 × 112
Case 2: Means n is divisible by 7 × 3 × 4 = 84
Number of factors = 3 × 7 × 3 = 63
18. Let the six digit number is abcdef
22. 20152016 – 2017
So ab is divisible by 2, abcd is divisible by 4
(2010 + 5)2016 – 2017
and abcdef is divisible by 6 so that b, d and f
By binomial expansion
are even digits and a, c, e are odd digits
Multiple of (100) + 2016 × 2010 × 5 2015 +
again abcde is divisible by 5, so that e = 5.
52016 – 2017
abcd is divisible by 4 so cd is divisible by 4.
= multiple of (100) + 52016 – 17
So possible value of cd are 12, 16, 32, 36
Now we know that any power of 5, greater
again abc is divisible by 3, so def is also
than 1 ends with 25.
divisible by 3.
So last two digits of 52016 is 25
If d = 2, then sum of d, e and f is 7 + f.
So last two digit of given number
So value of f is not possible.
= 25 – 17 = 08
If d = 6 then sum of d, e and f is 11 + f. So if f
23. First five divisors of 2014000000 are 1, 2, 4,
= 4 then sum is 15, which is divisible by 3.
2014000000
So now possible 6 digit numbers are ab1654, 5, 8 so last five divisors are ,
ab3654 8
Now the value of b = 2 2014000000 2014000000 2014000000
, , ,
So numbers are 321654 and 123654 5 4 2
Total 2 numbers are possible. 2014000000

NUMBER SYSTEM 89
OLYMPIAD BOOKLET

Largest fifth divisor If n is 3 digit number then n + 1 is also three

2014000000 digit or 4 digit number.
= = 251750000
8 Put a = 1, b = 4, c = 9 for three digit numbers
Sum of digits we get n = 149 but product
= 2 + 5 + 1 + 7 + 5 + 0 + 0 + 0 + 0 = 20 (1 + a) (1 + b) (1 + c) = 100
24. Let three digit numbers are in the form of xyx, So n + 1 ≠ 100 (reject)
where x ≠ 5/0 and x +y + x < 20 So if you are put a = 1, b = 9, c = 9 by this
So 2x + y <20 similar pattern you get
Now if x = 1 then possible values of y are n + 1 = 199 + 1 = 200
from 0 to 9 because x and y are single digit and (1 + a) (1 + b) (1 + c) = 2 × 10 × 10 = 200
numbers again if x = 2, 3, 4 then possible also 200
values of y are also 0 to 9. So n + 1 = (1 + a) (1 + b) (1 + c) = 200
(40 cases) n + 1 200
= = 40
Now if x = 6 then y is from 0 to 7. 5 5
If x = 7 then y is from 0 to 5 27. n200 < 5300
If x = 8 then y is from 0 to 3 (n2)100 < (53)100
If x = 9 then y is from 0 to 1 So n2 < 125
So total 40 + 8 + 6 + 4 + 2 = 60 cases. Largest positive integer n is 11 because 112 <
25. (1 + x)(1 + 2x)(1 + 3x)(1 + 4x) … (1 + kx) = a0 125
+ a1x + a2x2 + … + akxk So n = 11
Put x = 1 28. ∵ 45 = 32 × 51
(2) (3) (4) (5) … (1 + k) = a0 + a1 + a2 + … ak and given that n is perfect cube with 45 is one
(1 + k)! = a0 + a1 + a2 + … ak of its factor so
Here ak is the coefficient of xk and its value is N = 32 × 51 × 3 × 5 2
1 × 2 × 3 × … × k = k! (complete the 3 – 3 pairs of each prime
So a0 + a1 + a2 + … + ak – 1 = (1 + k)! – k! numbers)
= k!(1 + k – 1) N = 33 × 53
= k × k! N 33  53
Now 2005 = 5 × 401 and 401 is a prime. Now number of boxes = = = 75
45 32  51
So if a0 + a1 + a2 + … + ak – 1 = k × k! is
29. Minimum sum of 3-element subset of a
divisible by 2005 then it is also divisible by
=1+2+3=6
40!
and maximum sum of 3-element subset of a
So smallest value of k is 401
= 21 + 22 + 23 = 66
Sum of digits of k = 4 + 0 + 1 = 5
36 is exactly middle sum between 6 and 66.
26. Let n is a 3 digit number in the form of abc
So now selection of 3 numbers from
with digits a, b and c and
1 to 23 = 23C3 = 1771
n = a + b + c + ab + bc + ca + abc
Since 36 is the middle number so no. of ways
n + 1 = 1 + a + b + c + ab + bc + ca + abc
selecting 3 numbers whose sum is less than 36
n + 1 = (1 + a) (1 + b) (1 + c)
and greater than 36 are equal.
Here a > 0
So for S(A) < 36

NUMBER SYSTEM 90
OLYMPIAD BOOKLET

1771 − 61 Means we get all numbers from 0 to 500.

Number of ways (n) = = 855
2 10033   2007 2 
Now from   to   we get
n + 45 855 + 45  2007   2007 
Now = = 36
25 25 different integer from different numbers no
  two numbers get same value.
30. 11111111  2007
 2007 1's  10032  10042 
Like   = 501,   = 502
= 22299999 777  2007   2007 
2004 9s
 20072 
So sum of digits   = 2007
= 2 + 2 + 2 + 9 × 2004 + 7 + 7 + 7  2007 
= 6 + 18036 + 21 So total integers are
= 18063 = A8B6C = 501 + (2007 – 1002) = 501 + 1005 = 1506
So A = 1, B = 0 and C = 3 So sum of digits = 1 + 5 + 0 + 6 = 12
Now A + B + C = 1 + 0 + 3 = 4 1 3 3 1 3 3
33. (133) x = + 2 + 3 + 4 + 5 + 6 + 
31. Total bars = 2007 x x x x x x
When its packed into N box then 5 bars are 1 3 3 1 3 3
So ax = + 2 + 3 + 4 + 5 + 6 + 
remaining. x x x x x x
So only 2007 – 5 = 2002 bars are packed into x ax = x + 3x + 3 + ax
3 2

N boxes. (x3 – 1) ax = x2 + 3x + 3
2002 = 2 × 7 × 11 × 13 3 2 3
x 2 + 3x + 3 = x + 3x + 3x = ( x + 1) − 1
Here given is 200 < N < 300 and N should be ax =
x3 − 1 x( x3 − 1) x( x 3 − 1)
divisor of 2002.
Now a4a5…a99
So only one possible value of N is = 2 × 11 ×
13 = 286 Last two digits are 86. (53 − 1)(63 − 1) (1003 − 1)
=
4  5  699  (43 − 1)(53 − 1) (992 − 1)
 12   22   44 2 
32. From   ,  … to   all
 2007   2007   2007  (1003 − 1) 1  2  3
=
values are 0. 1 2  3  4 99  (43 − 1)
 452   632  999999  6 99 10101 6 962 m
From   to   all values are 1 = = = =
 2007   2007  99! 63 99! 63 98! n !
So m = 962
 64 2   77 2 
From   to  2007  all values are 2 Sum of digits = 9 + 6 + 2 = 17
 2007   
50 b c
 782   80 2  34. d e f
From   to  2007  all values are 3
 2007    g h 2
 90 2   100 2 
From   to  =4 We want to all unknown entries can be
 2007   2007  expressed in terms of b. So
So from similar way we get 50 × e × 2 = beh = ceg = def
10022  100 100 100
So h = ,g = ,f =
  = 500 b c d
 2007 

NUMBER SYSTEM 91
OLYMPIAD BOOKLET

From row (1) and (3) 35. Let the four digit number N = abcd
50bc = gh × 2 So according to question
100 100 abcd = bcd × 9
50bc = 2   1000a + 100b + 10c + d
c b
(bc)2 = 400 = (100b + 10c + d) × 9
1000a = 800b + 80c + 8d
20
c= 125a = 100b + 10c + d
b
125a = bcd
From column (1) and (3)
(Here bcd is a 3 digit number)
50dg = 2cf
125 × a is a 3 digit number for the values of a
100 100 from 1 to 7
50d = 2c 
c d So total 7 values are possible of N.
c 20 36. ab + ac = 152 …(1)
d = and we know that c =
5 b bc + ab = 162 …(2)
20 / b 4 ac + bc = 170 …(3)
So d = =
5 b By adding all three equations we get
100 100 2 (ab + bc + ca) = 484
g= = = 5b ab + bc + ca = 242 …(4)
c 20 / b
Subtracting equation (1) from (4)
100 100
f = = = 25b bc = 90
d 4/6
similarly ca = 80
and 50 × b × c = 50 × e × 2
and ab = 72
20 so (bc) (ca) (ab) = 90 × 80 × 72
b  = e 2
b a2b2c2 = (8 × 9 × 10)2
So e = 10 abc = 8 × 9 × 10
Now magic square will be converted into
abc 8  9 10
20 = = 60
50 b 12 12
b 1
4 37. Given that x + = 4
10 25b y
b
100 1
5b 2 y+ =1
b z
1 7
Because all entries are positive integers so z+ =
x 3
100 4
and must be positive integers. So Multiply all three equations we get
b b
possible values of b are 1, 2, 4.  1  1  1 7
 x +  y +  z +  = 4 1
Now g = 5b  y  z  x 3
So possible values of g are 1 1 1 1 28
xyz + y + x + z + + + + =
= 5 × 1, 5 × 2, 5 × 4 x y z xyz 3
= 5, 10, 20
Sum of all values are = 5 + 10 + 20 = 35

NUMBER SYSTEM 92
OLYMPIAD BOOKLET

1  1  1  1  28 38 − 1
xyz + +x+ + y+ +z+  = 37 + 36 + 35 + … 3 0 = = 3280
xyz  y  z  x 3 3 −1
So therefore 3280 are positive integers and 1
1 28 7
xyz + = − 4 −1 − is '0' so total 3281 cases.
xyz 3 3
R = 3281
1 Last two digit are = 81.
xyz + =2
xyz 41. There are four choices for the last digit (1, 5,
Let xyz = A so 7, 9) and 8 choices for the first digit (exclude
1 0).
A+ =2 Now for second digit there are 3 possible
A
A2 – 2A + 1 = 0 values of second digit mode 3, 0, 1 and 2.
(A – 1)2 = 0 So second digit is pick from one of the sets
A=1 ({0, 6, 9}, {1, 4, 7}, {2, 5, 3})
xyz = 1 So the answer is 4 × 8 × 3 = 96
n 5 p 4
2 42.  
38. 4000    = integer 9 q 7
5
p 5 9 p − 5q
2
n
Now − =
25  53    = integer q 9 9q
5
for smallest value of q, 9p – 5q = 1 …(1)
⇒ 2 5+n
× 53 – n = integer
4 p 4q − 7 p
For integer values 5 + n ≥ 0 and 3 – n ≤ 0 Again − =
7 q 7q
n ≥ – 5 and n ≤ 3
for smallest value of q, 4q – 7p = 1
So integer values of n are – 5, – 4, – 3, – 2,
By solving equation (1) and (2)
– 1, 0, 1, 2, 3 Total values are 9.
We get q = 16 and p = 9.
39. If we start with 1, we can not include any
So (q – p)2 = (16 – 9)2 = 49
other number If we start with 2 then we would
43. f (n) = f (n – 1) – f (n – 2) + n
have to include every odd number except 1,
f (n) = f (n – 2) – f (n – 3) + (n – 1) – f (n – 2)
but then 3 and 9 break the rule. Now if we
+n
start with 3, then we include 7, 11 one of from
f (n) = 2n – 1 – f (n – 3)
5 and 10 and one of from 4 and 8 but then no
Put n = n – 3 in equation (1)
one place for 6th digit.
f (n – 3) = 2(n – 3) – 1 – f (n – 6)
So now if start from 4 then sequence is 4, 5, 6,
f (n – 3) = 2(n – 7) – f (n – 6)
7, 9, 11. Square of least possible value = 16.
Put this value in equation (1)
40. a7 · 37 + a6 · 36 + a5 · 35 + a4 · 3 4 + a3 · 3 3 +
f (n) = (2n – 1) – (2n – 7) + f (n – 6)
a2 · 22 + a1 · 21 + a0 · 20 and given that ai ∈
f (n) – f (n – 6) = 6
{– 1, 0, 1} for 0 ≤ i ≤ 7.
So f (2018) – f (2012) = 6
The least non-negative integer that can be
f (2012) – f (2006) = 6
represented is 0, when all ai = 0 and the
f (2006) – f (2000) = 6
highest number will be the number when all ai
⋮ ⋮ ⋮
= 1 that will be
f (8) – f (2) = 6
By adding these 336 equation we get

NUMBER SYSTEM 93
OLYMPIAD BOOKLET

f (2018) – f (2) = 6 × 336 30 – n ≠ 30

f (2018) = 2016 + 1 = 2017 Because then n = 0 and we have positive value
Sum of digits = 2 + 0 + 1 + 7 = 10 of n.
44. Triangle inequality generalize to all polygon so So there are 7 values of (30 – n) are possible
3 + 7 + 15 > x …(i) so n has also 7 values.
x + 3 + 7 > 15 …(ii) P=7
From equation (i) and (ii) P2 = 49
5 < x < 95 ab 1
48. ab = =
Total 19 values but we Sunita already taken 7 99 n
and 15 so only 19 – 2 = 17 rods can she choose. So that 99 is a multiple of ab
45. a is from 1 to 9 Possible values of ab are 01, 03, 09, 11, 33, 99
There are 10 × 10 ways of choosing b and c By checking each of these
for each digit of a. 1 3 09
So a's contribute = .01, = .03, = .09
99 99 99
= (1 + 2 + … + 9) × 10 × 10 (104 + 1)
11 33 99
For each digit b = 0, 1, … 9 there are = . 1, = .3 and =1
9 × 10 ways to choosing a and c 99 99 99
1 3 1 9 1
So b's contribute So only , = , = are satisfy the
(0 + 1 + 2 + … + 9) × 10 × 9 (103 + 10) 99 99 33 99 11
For each digit c = 0, 1, … 9 there are also 9 × given condition.
10 ways to choosing a and b So possible values of n are 99, 33 and 11
So 's contribute Sum = 99 + 33 + 11 = 143 = abc
= (0 + 1 + 2 + … 9) × 10 × 9 × 102 abc 143
= = 13
So total sum = (1 + 2 + … 9) × 100 × (104 + 11 11
1) + (1 + 2 + … 9) × 90 × (103 + 1) + (1 + 2 + 49. Let the square and next larger square numbers
… + 9) × 90 × (102) are x2 and (x + 1)2
= (1 + 2 + … 9) [106 + 100 + 90000 + 900 + 1
Given that abc = x 2 + [( x + 1)2 − x 2 ] …(1)
9000] 3
= 45 × [1000000 + 99900 + 100] [one third of the way from the square of a
= 45 × 1100000 = 49500000 positive integer]
Sum of digits = 18 2
and acb = x 2 + [( x + 1)2 − x 2 ]
8  8888 = 71111104 3
46. k digits ( k − 2)times1 From equation (1)
Sum of digits = 7 + (k – 2) + 0 + 4 = 1000 1
= k = 991 abc = x 2 + [2 x + 1]
3
Sum of digits = k = 19 so (2x + 1) is divisible by 3.
n 30 − [30 − n] 30 Take x = 10, 13, 16, 19, 22, 25, 30
= = −1
30 − n 30 − n 30 − n (reject 1, 4, 7 because square of these are
So factors of 30 are 1, 2, 3, 5, 6, 10, 15, 30 small)
(reject negative values because number is So if we take x = 13
positive integer)

NUMBER SYSTEM 94
OLYMPIAD BOOKLET

1 So possible pairs of (a, b) are (14, 3), (1, 3),

abc = 132 + (27) = 178 and
3 (2, 3) (7, 3) Total 4 pairs
2 7 × p = 7 × 4 = 28
acb = 132 + (27) = 187 51. The sum of the set is
3
We also check that 132 and 142 or 169 and 196 – 7 – 5 – 3 – 2 + 2 + 4 + 6 + 13 = 8
A third of the distance between them is 9 and So if we find the sum in each set be 4 then
169 + 9 = 178 and 178 + 9 = 187. minimum value = 2 (42) = 32
So a = 1, b = 7, c = 8 But here sum of four numbers are 4 is not
a + b + c = 1 + 7 + 8 = 16 possible so we take closest integer to 4, 3 and 5.
13 + 2 – 7 – 5 = 3 and 6 + 4 – 3 – 2 = 5
a
50. Let x = So 32 + 52 = 34
b
52. We know that (– 3)2 = 9 and (– 1)2 = 1
So x is a rational numbers
So we take n times (–3) from a1, a2, … a88 and
a 14b
Now + =k (k is an integer) remaining (88 – n) times (– 1)
b 9a 2 2 2
14 So a1 + a2 +  + a88 = 280
x+ =k n (9) + (88 – n)(1) = 280
9x
9x2 – 9kx + 14 = 0 8n = 192
n = 24
9k  81k 2 − 504 k 9k 2 − 56 means 24 times (– 3) and 64 times (– 1)
x= = 
18 2 6 4 4 4 3
∵ x is a rational number so Now a1 + a2 + n + a88 = 10 a + b
9k2 – 56 must be a perfect square. 24 (81) + 64 = 1000 a + b
9k2 – 56 = p2 (Let) 2008 = 1000 a + b
(9k2 – p2) = 56 So a = 2 and b = 8
(3k + p) (3k – p) = 56 × 1 (take only positives) Product ab = 2 × 8 = 16
= 28 × 2 = 14 × 4 = 8 × 7 53. HCF (x, 18) = HCF (diff between LCM and
Case 1: When 3k + p = 56 and 3k – p = 1 HCF 18)
= HCF (120, 18)
55
p= HCF (x, 18) = 6
2 (not an integer)
Now LCM} – HCF = 120
Case 2: When 3k + p = 28 and 3k – p = 2
LCM – 6 = 120
p = 13, k = 5
LCM = 126
Case 3: When 3k + p = 14 and 3k – p = 4
We know that LCM × HCF = a × b
p = 5 and k = 3
126 × 6 = x × 18
Case 4: When 3k + p = 8 and 3k – p = 7
x = 42
p = 1/2 (not an integer)
54. Divisible by 33 means divisible by 3 and 11
Put these solution into equation we get
For 11: (2 + 0 + x + 0 + 8) – (0 + 7 + 2 + 0 +
5 13 3 5 y) = 0/m(11)
x=  and x = 
2 6 2 6 1 + x– y = 0/multiple of 11 …(1)
a 14 1 a 2 7 For 3: 2 + 0 + 0 + 7 + x + 2 + 0 + 0 + 8 + y =
= and = and
b 3 3 b 3 3 multiple of (3)
19 + x + y = multiple of (3) …(2)

NUMBER SYSTEM 95
OLYMPIAD BOOKLET

From equation (1) we can see that maximum (2n + 19 + 2k) (2n + 19 – 2k) = 164 × 1
and minimum values of x and y are 9 and 0 so = 13 × 13 = 1 × 169
only one value of 1 + x – y is possible which is (2n + 19 + 2k) > (2n + 19 – 2k)
'0'. So take 2n + 19 + 2k = 169 and 2n + 19 – 2k = 1
1+x–y=0 [∵ x ≥ 0 so y ≥ 1] By solving these equations we get
x=y–1 n = 33, k = 42
Put in equation (2) So n = 33
19 + y – 1 + y = multiple of (3) 57. We know that
18 + 2y = multiple of (3) ( 101 + 10)( 101 − 10) = 1
So possible values of y are 3, 6, 9 respectively Here n( 101 − 10)  1
corresponding values of x are 2, 5, 8
So there are 3 numbers So n  101 + 10
2 2
n − 9 n − 7 − 2 (n − 7) − 22 Hence n is just greater than 20.
55. = = So smallest integer value of n = 21.
n2 − 7 n2 − 7 (n 2 − 7)
∴ 2n > n 2
So numerator and denominator are
Put n = 1 21 > 12
consecutive odd or consecutive even numbers.
Put n = 2 22 = 22
Now 10 ≤ n ≤ 100 n ∈ n
Put n = 3 23 < 32
So these 91 values of N are possible. In which
Put n = 4 24 = 42
46 are even and 45 are odd. Put n = 5 25 > 52
n2 − 9 Put n = 6 26 > 62
Now if we are put n = even in
n2 − 7 and so on.
Then both numerator and denominator are So smallest positive integer n = 5
consecutive odd numbers and fraction 59. Number is divisible by 30, means 30 is a
becomes in lowest terms because no common factor of number.
factor between numerator and denominator 30 = 2 × 3 × 5
n2 − 9 Now number have exactly 30 factors and 30 is
but if we put n = odd in then both are also factor of number means 2, 3 and 5 are
n2 − 7
consecutive even number and numerator and also factor of that number.
So let number is = 2x × 3y × 5z
denominator both have 2 as a common factor
Here 30 = (x + 1) (y + 1) (z + 1)
so fraction is not in lowest form.
2 × 3 × 5 = (x + 1) (y + 1) (z + 1)
So there are 46 positive integer values of n.
For largest number we take maximum power
56. n2 + 19n + 48 = k2 (Let k is an integer)
of larger prime compare to smaller prime so
2 2
 19   19  x = 1, y = 2 and z = 4
n 2 + 19n +   + 48 −   = k 2
 2  2 So number is = 2 × 32 × 54
19 
2 2 = 11250 = A1B5C
 2  19 
 n +  − k =   − 48 So A = 1, B = 2 and C = 0
 2  2
A+B+C=1+2+0=3
2
 2n + 19  2 361 − 192 60. p, 2p, q, 2q all are greater than zero so all four
  −k =
 2  4 numbers (n – 1), (3n – 19), (38 – 5n), (7n –
(2n + 19)2 – (2k)2 = 169 45) are also greater than zero.

NUMBER SYSTEM 96
OLYMPIAD BOOKLET

So 38 – 5n > 0 and 7n – 45 > 0 So largest value of (a – b) = n = 60

38 45 By solving a = 63 and b = 3
So n  and n 
5 7 So (1 + 2 + … + 63) – (1 + 2 + 3) = 2010
38 45 So n = 60 is correct answer.
n 8n3 − 96n 2 + 360n − 400
5 7 63. = integer
7.6 > n > 6.4 2n − 7
So only one integer value of n is possible n = By dividing we get
7. 27
[4n2 − 34n + 61] + = integer
By putting the value of n = 7 we get 2n − 7
6, 2, 3, 4 For integer value (2n – 7) is a factor of 27.
So n = 7 is correct answer. So possible values of (2n – 7)
61. ab + a + b = 35 = 1, 3, 9, 27, –1, – 3, – 9, – 27
Add 1 on both sides So corresponding n are
1 + a + b + ab = 36 = 4, 5, 8, 17, 3, 2, – 1, – 10
(a + 1) (b + 1) = 36 S = {4, 5, 8, 17, 3, 2, – 1, – 10}
Similarly (b + 1) (c + 1) = 36 Now  |n |
ns
and (c + 1) (a + 1) = 36
= 4 + 5 + 8 + 17 + 3 + 2 + | – 1| + | – 10| = 50
multiply all three equations we get
64. (x – p) (x – 13) + 4 = (x + q) (x + r)
[(a + 1)(b + 1)(c + 1)]2 = 363
x2 – (p + 13) x + 13p + 4 = x2 + (q + r) x + qr
(a + 1) (b + 1) (c + 1) = 63 = xy
By comparison
So x × y = 6 × 3 = 18
q + r = – p – 13 …(1)
62. Let a, b are two numbers such that a > b and a
qr = 13p + 4 …(2)
is positive integer and b is whole number and
multiply equation (1) by 13 and add with
a – b = n.
equation (2)
Then according to question
13q + 13r + qr = – 169 + 4
[1 + 2 + … + a] – [1 + 2 + … b]} = 2010
169 + 13q + 13r + qr = 4
a(a + 1) b(b + 1) (13 + q)(13 + r) = 4
− = 2010
2 2 = 4 × 1, 2 × 2, 1 × 4, (–4) × (–1), (–2) × (–2),
a2 + a – b2 – b = 4020 (–1) × (–4)
(a2 – b2) + (a – b) = 4020 So, by calculating the value of q and r by each
(a – b) (a + b + 1) = 4020 pair we get.
n (a + b + 1) = 1 × 4020 (q, r) = (– 9, – 12), (– 11, – 11), (– 12, – 9)
= 2 × 2010 = (– 17, – 14), (– 15, – 15), (– 14, – 17)
= 3 × 1340 But q and r are distinct integers so (– 11, – 11)
= 4 × 1005 and (– 15, – 15) are removed.
= 5 × 804 Now from equation (1)
= 6 × 670 P = – 13 – q – r
⋮ So put the value of q and r
= 60 × 67 We get p = 8, 8, 18, 18
= 67 × 60 So values of p are only 8 and 18
(but this is not valid because (a – b) < (a + b + 1) Sum = 8 + 18 = 26

NUMBER SYSTEM 97
OLYMPIAD BOOKLET

1 1 1 a – d = (2 + 3 + 4) /(2 + 3 – 4) /(2 – 3 + 4) /(2

65. Pk = 1 + − −
k k2 k3 – 3 – 4)/(– 2 + 3 + 4)/(– 2 + 3 – 4)/(– 2 – 3 +
4)/ (– 2 – 3 – 4)
k 3 + k 2 − k −1
= a – d = 9/1/3 / – 5/5 / – 3 / – 1 / – 9
k3
So possible values of
k 2 (k + 1) − 1(k + 1) |a – d| = 9, 5, 3, 1
=
k3 Sum of all values are 9 + 3 + 5 + 1 = 18
(k 2 − 1)(k + 1) 68. Each number at the vertices is added three
=
k3 time for each three adjacent faces.
(k + 1)2 (k − 1) So total sum of the numbers of the face
= = 3 {1 + 2 + 3 + 4 + 5 + 6 + 7 + 8}
k3
= 3 × 36 = 108
Now so
This sum is divided equal to all six faces so
32 1 42  2 52  3 62  4 108
P2 P3  Pn =  3  3  3  common sum = = 18.
23 3 4 5 6
(n 2 )(n − 2) (n + 1) 2 (n − 1) 69. Let the Saxena family consists 'n' children and

(n − 1)3 n3 total ages of children is x. Then
[32  42  52 (n + 1)2 ][1 2 (n − 1)] F +M +x
= = 20
[23  33 n3 ] n+2
F + M + x = 20(n + 2)
(n + 1)2
= 48 + M + x = 20(n + 2)
22  n
M + x = 20 (n + 2) – 48 …(1)
(n + 1) 2 M +x
Now  2010 Now = 16
4n (n + 1)
n2 + 2n + 1 > 8040n
So M + x = 16 (n + 1)
n2 – 8038n + 1 > 0
Put the value in equation (1)
Now if put n = 8038 then
16(n + 1) = 20(n + 2) – 48
(8038)2 – (8038)(8038) + 1 > 0
48 = 4n + 24
Satisfy
4n = 24
but if n = 8037
n=6
(8037)2 – (8037)(8038) + 1 is not greater than
So total 6 children are in the family.
zero.
70. Given that m2 – n2 = 96
So smallest value of n = 8038
(m + n) (m – n) = 96 × 1, 48 × 2, 32 × 3, 24 ×
Sum of digits = 19
4, 16 × 6, 12 × 8
66. (111111111)2 = 12345678987654321
[Reject all other cases because (m + n) is
So sum of digits = (1 + 2 + 3 + 4 + 5 + 6 + 7 +
greater than (m – n)] (m + n) and (m – n) both
8) × 2 + 9 = 81
are also odd or both are also even for integer
67. |a – b| = 2 ⇒ a – b = ±2
values of m and n. So (32 × 3) and (96 × 1) are
|b – c| = 3 ⇒ b – c = ± 3
also reject so total four cases for m and n.
|c – d| = 4 ⇒ c – d = ± 4
So total 4 ordered pairs are possible.
Add all three equations and create all pairs

NUMBER SYSTEM 98
OLYMPIAD BOOKLET

71. Let Tn = n + S(n) + S(S(n)) S(S(n)) = 2 + a (For a < 7)

First of all n < 2007 and the maximum value Tn = 2000 + a + 2 + a + 2 + a
of S(0) + S(S(n)) is when n = 1999 2007 = 2004 + 3a
Sum is 28 + 10 = 38 a=1
So, the minimum value of n is So fourth solution is 2001
2007 – 38 = 1969 So total four solution are possible 1977, 1980,
Now we work on tens digit. 1983, 2001.
Case 1: For 1969 72. Total number of four digit numbers without
Tn = 1969 + 25 + 7 = 2001 ≠ 2007 any instruction = 9 × 10 × 10 × 10 (first digit
Case 2: For 197a can't be zero) = 9000
S(n) = 1 + 9 + 7 + a = 17 + a Now total number of four digit numbers
and S(n) = 8 + a for a ≤ 2 without any 2 or 3 is
= a – 1 for a > 2 = 7 × 8 × 8 × 8 = 3584
So Tn = 197a + 17 + a + 8 + a for a ≤ 2 So that therefore the total number of four digit
2007 = 1995 + 3a integers that have atleast one 2 or 3 = N =
for a ≤ 2 9000 – 3584
a = 4 (not possible) N = 5416
But again Tn = 197a + 17 + a + a – 1 for a > 2 Sum of digits = 16
2007 = 1986 + 3a for a > 2 73. We can find middle digit is uniquely by half of
a = 7 (first solution 1977) sum of first and third digit means sum must be
Case 3: For 198a even.
S(n) = 18 + a Even number are formed by adding two even
and S(S(n)) = 9 + a for a ≤ 1 numbers or two odd numbers.
S(S(n)) = a for a > 1 So there are two cases and when first and last
So Tn = 1980 + a + 18 + a + 9 + a (for a ≤ 1) digits are odd, then we have to select digit
2007 = 2007 + 3a from 1, 3, 5, 7, 9 so there are 5 × 5 = 25
a = 0 (2nd solution 1980) numbers are possible.
and Tn = 1980 + a + 18 + a + a (for a > 1) Now when first and last digits are even then
2007 = 1998 + 3a we have to select first digit from 2, 4, 6 and 8
a = 3 (3rd solution 1983) and third digit from 0, 2, 4, 6 and 8 so there
Case 4: For 199a are 4 × 5 = 20 numbers are possible.
S(n) = 19 + a Total numbers = 25 + 20 = 45
S(S(n)) = 10 + a (for a = 0) 74. Let N = 3!5!7!
S(S(n)) = 1 + a (for a > 0) N = 28 × 34 × 52 × 71
So Tn = 1990 + a + 19 + a + 10 + a So number of perfect cubes divisors are
2007 = 2019 + 3a =3×2×1×1=6
a = – 4 (not possible) [ 3 for 20, 23, 26]
and Tn = 1990 + a + 19 + a + 1 + a (for a > 0) [2 for 30, 33]
2007 = 2010 + 3a [1 for 50 and last 1 for 70]
a = – 1 (not possible) So 6 positive integer cube divides N.
Case 5: For 200 a 75. Let the two digit number is 10a + b
S(n) = 2 + a So sum of digits = a + b
According to question

NUMBER SYSTEM 99
OLYMPIAD BOOKLET

(10a + b) – (a + b) = a number with unit digit 13 19

is 6 P1 = P2 =
2 2
9 × a = x 6 (let) If P2 + P1 = 12 and P2 – P1 = 4
For unit digit 6, a must be 4 so P1 = 4 and P2 = 8
9 × 4 = 36 If P2 + P1 = 8 and P2 – P1 = 6
But the value of b does not depends on a, so P1 = 1 P2 = 7
10 values of b are possible. The only one solution when P1 and P2 are
So that there 10, 2 digit numbers possible prime is P2 = 13 and P1 = 11
from 40, 41, … 49. So n = 1
6n 78. 4a = 5, 5b = 6, 6c = 7, 7d = 8
76. = integer
1+ 2 + n + n 5b = 6 Put the value of 5
6n (4a)b = 6
= integer
n(n + 1) Again 6c = 7 Put the value of 6
2 (4ab)c = 7
12 Again 7d = 8 Put the value of 7
= integer (4ab)d = 8
(n + 1)
4abcd = 8
So Definity (n + 1) is a factor of 12
22abcd = 23
Factor of 12 are 1, 2, 3, 4, 6 and 12 but n + 1 ≠
3
1 because then n = 0 so five values of n = 1, 2, So abcd =
2
3, 5 and 11 are possible.
Now 2abcd = 3
77. P ( n) = n 79. The digit which are used for phone numbers
2
Then n = P where P1 is a prime number.
1
are 2, 3, 4, 5, 6, 7, 8, 9 (total 8) and we have to
choose 7 digits from these 8 digits in
Again P(n + 48) = n + 48 increasing order for a, b, c, d, e, f, g.
So n + 48 = P22 Means just choose 1 number not to be used
P2 is a different prime number. and then arrange remaining numbers into
Put the value of n increasing order. So there are 8 ways to do it.
P12 + 48 = P22 n!
80. = integer
2 2
1 + 2 + 3 + …+ n
P − P = 48
2 1 n( n − 1)!
(P2 + P1) (P2 – P1) = 48 × 1/24 × 2/16 × 3/12 = integer
n( n + 1)
× 4/8 × 6 2
∵ P2 + P1 > P2 – P 1 2(n − 1)!
Now looking for each pair = integer
n +1
If P2 + P1 = 48 and P2 – P1 = 1 This fraction is an integer unless (n + 1) is an
49 47 odd prime.
Then P2 = and P1 =
2 2 So there are 3, 5, 7, 11, 13, 17, 19, 23 primes
If P2 + P1 = 24 and P2 – P1 = 2 less than 24.
P2 = 13 P1 = 11 Total 8
(both are primes) So that 24 – 8 = 16 number less than or equal
If P2 + P1 = 16 and P2 – P1 = 3 to 24 that satisfy the condition.

NUMBER SYSTEM 100

OLYMPIAD BOOKLET

81. Let x = 10a + b so So, now we can find five digit numbers which
y = 10b + a are divisible by 11.
Here a and b are single digit numbers with a,  99999  10000 
So, numbers are =  −
b ≠ 0.  11   11 
Now x2 – y2 = m2
= 9090 – 909
(x + y) (x – y) = m2
P = 8181
(11a + 11b) (9a – 9b) = m2
Last two digit of P = 81
11 × 3 × 3(a + b)(a – b) = m2
84. F(F(x)) = 3
RHS is perfect square number so LHS
First of all x is a two digit number so
becomes also a perfect square number.
maximum sum of digits of x
Maximum value of a + b = 9 + 9 = 18
= F(x) ≤ 18
So take (a + b) = 11 for making perfect
Now if F(F(x)) = 3 then possible
square.
F(x) = 03, 12 [∵ F(x) ≤ 18]
Now for a – b are 1 and 4 but if we take a – b
For F(x) = 03
= 4 and a + b = 11
Possible x are = 12, 21, 30
15 7
Then a = and b = which is impossible For F(x) = 12
2 2
Possible x are = 39, 48, 57, 66, 75, 84, 93
But if we take a – b = 1 and a + b = 11 then a
So, total 10 values of x are possible.
= 6 and b = 5
85. 38 × 52 = ab
So, x = 65, y = 56 and m = 33
(34)2 × 52 = ab
x + y + m 65 + 56 + 33 (34 × 5)2 = ab or (38 × 52)1 = ab
= = 14
11 11 (405)2 = ab or (38 × 52)1 = ab
82. The integer from 1 to 24 can be include
But for smallest value we take a = 405, b = 2
because you cannot make 125 with integers
a + b + 93 405 + 2 + 93
from 1 to 24 with the number being greater Now = = 20
25 25
than 100.
86. We know that product of 'n' consecutive odd
Now make the pairs for sum = 125
(25, 100), (26, 99), (27, 98), …(62, 63) that is integer is always divisible by n.
38 pairs If we select one number from each Here (n + 1), (n + 3), (n + 5), (n + 7) and (n +
pair then sum cannot be equal to 125 . 9) all are odd. So that product of these five
So total numbers in subset B = 24 + 38 = 62 consecutive odd numbers is divisible by 5.
83. Let the five digit number is abcde Again this is also product of 3 consecutive
When it is divided by 100 quotient odd numbers so this is also divisible by 3.
q = abc and remainder r = de Meanwhile product is divisible by 5 × 3 = 15.
q + r = abc + de 87. Let numbers are (x – 1), x and (x + 1)
= 100 a + 10 b + c + 10 d + e So according to question
= 99 a + a + 11 b – b + c + 11 d – d + e (x – 1) x (x + 1) = 8 [x – 1 + x + x + 1]
= 11 × m + (a – b + c – d + e) (x2 – 1) x = 8 × 3x
So, q + r is divisible by 11 if x2 – 1 = 24
a – b + c – d + e is divisible by 11 x = 5 (take only positive)
Means five digit number a b c d e is divisible So numbers are 4, 5 and 6
by 11. Sum of their squares are = 42 + 52 + 62 = 77

NUMBER SYSTEM 101

OLYMPIAD BOOKLET

88. N = P(N) + S(N) Number of numbers which are divisible by

Let N = 10a + b where a and b are unit digit both 3 and 5
and a ≠ 0  2001
10a + b = ab + a + b =  = 133 = n(3  5)
 15 
9a = ab Number of numbers which are divisible by
b=9 both 4 and 5
So unit digit of N = b = 9
 2001
89. Median is the middle number so middle =  = 100 = n(4  5)
number is 5 and let smaller number is x and  20 
Number of numbers which are divisible by
larger number is y then
both 4, 5 and 6 are
x +5+ y
= x + 10  2001
3 =  = 33 = n(4  5  6)
x + y + 5 = 3x + 30  60 
Now numbers which are divisible by 3 or 4
y + 5 = 2x + 30 …(1)
but not 5
x +5+ y
and = y − 15 = numbers which are divisible by 3 or 4 –
3
numbers which are divisible by 3 and 5 or 4
x + y + 5 = 3y – 45
and 5
x + 5 = 2y – 45 …(2)
= [n(3) + n(4) – n(3 ∩ 4)] – [n(3 ∩ 5) + n(4 ∩
add equation (1) and (2) we get 5) – n(3 ∩ 4 ∩ 5) ]
x + y + 10 = 2(x + y) – 15 = [667 + 500 – 166] – [133 + 100 – 33]
So (x + y) = 25 = 1001 – 200
Sum of all three numbers are N = 801
= x + y + 5 = 25 + 5 = 30 N − 1 801 − 1
a b Then = = 16
90. + − ab 50 50
b a
v 24 w
a 2 + b2 (a − b)2 + 2ab
= − ab = − ab 92. 18 x y
ab ab
25 z 21
Put a – b = ab
From first row and first column
(ab) 2 + 2ab
= − ab v + 18 + 25 = v + 24 + w
ab = ab + 2 – ab = 2 w = 19
91. Number of number which are divisible by 3 From both diagonals
 2001 v + x + 21 = 25 + x + w
=  = 667 = n(3) v = 25 + 19 – 21 = 23
 3 
Number of numbers which are divisible by 4 From first column, third row and third column
v + 18 + 25 = 25 + z + 21 = w + y + 21
 2001
=  = 500 = n(4) 23 + 18 + 25 = 25 + z + 21 = 19 + y + 21
 4 
From first two
Number of numbers which are divisible by
z = 20
both 3 and 4
From first and last
 2001 y = 26
=  = 166 = n(3  4)
 12  So y + z = 26 + 20 = 46

NUMBER SYSTEM 102

OLYMPIAD BOOKLET

93. If we include from numbers 34 to 100 then 2 a

none of the number is 3 times the other  b 3
because 34 × 3 = 102 Now from 1 to 33, if we
97. 6 9
include 1, 2, 4, 5, 7, 8, 9, 10 and 11 then its
9 2
multiple of 3 are also not include in subset
So total numbers = (100 – 33) + 9 = 76 9 8 9
94. Four digit palindrome numbers are like this We can see that if a is multiplied by 3 and
abba. give 9 as a unit digit then a must be 3.
= 1000a + 100b + 10b + a Again if a = 3 multiplied by b and give 2 as a
= 1001a + 110b unit digit then b must be 4 so a + b = 3 + 4 = 7
= 11(91a + 10b) 98. If D(n) is even, then the binary expansion of n
Means all palindrome 4 digit numbers will both begin and end with a 1 and
multiple of two digit prime palindrome.
minimum 3 digits are required for D(n) = 0
Now second factor 3-digit prime palindrome
and maximum 7 digits because number is less
2000
number is less than means 181.8 than 7.
11 For 3 numbers: 101
Means first and last digit of 3-digit prime
For 4 numbers: 1001, 1011, 1101
palindrome number is 1.
For 5 numbers: 11101, 11011, 10111, 11001,
So, lets check from 101, 111, 121, … 181.
10011, 10001.
111, 121, 141, 161, 171 are not a prime so
For 6 numbers: 111101, 111011, 110111,
reject now
101111, 111001, 110011, 100111, 110001,
11 × 101 = 1111
11 × 131 = 1441 100011, 100001.
11 × 151 = 1661 For 7 numbers: 1011111, 1001111, 1000111,
11 × 181 = 1991 1000011, 1000001, 1100001
So, there are four numbers. So, total 26 numbers are possible.
95. N = 19202122 … 909192 99. There are two cases
Sum of digits of N d1d2d3 = d4d5d6 or d1d2d3 = d4d5d6
= 1 + 9 + 10(2 + 3 + 4 + … + 8) + 7(1 + 2 + 3 So if we can arrange d4d5d6d7 then d1d2d3 are
+ … + 9 + 0) + 9 + 0 + 9 + 1 + 9 + 2 = 705 already arrange.
705 is divisible by 3 but not by 9 So possible ways for arranging d4d5d6d7
Means N is only divisible by 31. = 10 × 10 × 10 × 10 × 2 = 20000
So k = 1 [2 for 2 cases]
96. Let n = 10a + b so But if d4 = d5 = d6 = d7 then gives only one
n2 = (10a + b)2 sequence so subtract these results
= 100a2 + 20ab + b2 So finally our answer is = 20000 – 10 = 19990
100a2 is the hundreds place digit Sum of digits = 1 + 9 + 9 + 9 + 0 = 28
So check only 20ab + b2 100. m3 + n3 + 99mn = 333
20ab is even so if b2 must carry odd numbers m3 + n3 – 333 = – 99mn
than 20ab have an odd tens-digits. m3 + n3 + (– 33)3 = 3 × m × n (– 33)
So only square of 4 and 6 gives odd carry. if a3 + b3 + c3 = 3abc then
Hence unit digit of n must be 4 or 6. a + b + c = 0 or a = b = c
So total numbers are = 10 × 2 = 20 so m + n – 33 = 0 or m = n = – 33

NUMBER SYSTEM 103

OLYMPIAD BOOKLET

m + n = 33 or m = n = – 33 105. If we start from 1, we can not include any

So possible ordered pairs for mn ≥ 0 are other number.
(0, 33), (1, 32), (2, 31) … (33, 0) and (–33, – If we start with 2, then we would have to
33) total 35 pairs include every odd number except 1, but then 3
101. (2 × 4 × 6 × 8 × 12 … × 98) and 9 break the rule. Now if we start with 3,
For finding unit digit we can only multiply then we include 7, 11, one of from 5 and 10,
unit digit. and one of from 4 and 8 but then no one place
(2 × 4 × 6 × 8)10 = (384)10 for 6th digit.
Now check only 410 So now if we start from 4 then sequence is 4,
Divide 10 by 4 we get 2 as a remainder. 5, 6, 7, 9, 11
So lets check unit digit of 42 = 16 Least possible value of sequence = 4
Hence unit digit is 6. 106. a7 37 + a6 3 6 + a5 35 + a4 34 + a3 33 + a2 32 + a1
102. xyz = 2014 = 1 × 2 × 19 × 53 31 + a0 30 and given that ai ∈ {–1, 0, 1} for 0 ≤
So possible triples of (x, y, z) such that x < y < i≤7
z are (1, 2, 1007), (1, 38, 53), (2, 19, 53), (1, The least non negative integer that can be
19, 106). represented is 0, when all ai = 0 and the
Total 4 pairs highest number will be the number when all ai
103. T T T = 100 T + 10 T + T = 111 T = 1 that will be
= 3 × 37 × T 37 + 36 + 35 + 34 + 33 + 32 + 31 + 30
37 is a two digit prime number.
So, one of them from YE and ME is 37. 38 − 1
= = 3280
Lets take YE = 37 so Y = 3, E = 7 3 −1
Now come to ME So therefore 3280 positive integer and one
ME = 3 × T number is 0. So total numbers are 3281.
M7=3×T n = 3281
So now if multiple 3 by 9 then get Sum of all the digits = 14
7 as a unit digit so T = 9 107. gcd (a, b) = 24
and M 7 = 27 gcd (b, c) = 36
M=2 gcd (c, d) = 54
T T T = 27 × 37 = 999 and we know that 24 = 23 × 3
E + M + T + y = 7 + 2 + 9 + 3 = 21 36 = 22 × 32
n 54 = 2 × 33
2
104. 4000    = integer So a = 23 × 3 × p
5
b = 23 × 32 × q
2n c = 22 × 33 × r
25  53  = integer
5n d = 2 × 33 × s
25 + n × 53 – n = integer So gcd (a, d) = 2 × 3 × t
For integer value (Here p, q, r, s and t are same positive
5 + n ≥ 0 and 3 – n ≥ 0 integers)
n ≥ – 5 and n ≤ 3 Now P does not divide by 3 because then
So integer values of n are –5, –4, –3, –2, –1, 0, gcd (a, b) = 23 × 32
1, 2, 3 Total 9 values Again S does not divide by 2 because then

NUMBER SYSTEM 104

OLYMPIAD BOOKLET

gcd (c, d) = 22 × 33 a2
So, gcd (a, d) = 6 × gcd (p, s) a+ a will be maximum
3
Means gcd (p, s) does not divide by 2 and 3. It If we take a = 9 then b = 18 (not possible)
divides only prime whose greater or equal to 5. So take a = 6, b = 8, c = 4
But gcd (a, d) lie between 70 and 100 So a + b + c = 6 + 8 + 4 = 18
So only possible value is 78. 109. a · b + 63 = 20 LCM (a, b) + 12 GCD (a, b)
∵ 78 = 6 × 13 Let LCM (a, b) = p and GCD (a, b) = q
So 78 = 2 × 3 × 13 So a · b = LCM × HCF = pq
So largest prime divisor = 13. So pq + 63 = 20p + 12q
  pq – 20p – 12q = – 63
108. An =  aaaa a 
 n times  d 240 on both sides
= a × 10n – 1 + a × 10n – 2 + … + a × 10 + a pq – 20p – 12q + 240 = – 63 + 240
= a (10n – 1 + 10n – 2 + … a1 + 1) p (q – 20) – 12(q – 20) = 177
(p – 12) (q – 20) = 177
(10n − 1) a n
= a = (10 − 1) = 177 × 1/59 × 3
(10 − 1) 9 LCM is greater than GCD so take first factor
b n larger
Similarly Bn = (10 − 1)
9 By solving we get
c c p = 189, q = 21 and p = 71 and q = 23
Cn =
9
(102 n − 1) = (10n + 1)(10n − 1)
9 LCM is always divisible by GCD so reject
Given that second case.
Cn – Bn = An2 So only one pair is possible.
2 110. We want to find the smallest number such that
c n b a 
(10 − 1)(10n + 1) − (10n − 1) =  (10n − 1)  atleast five number from 1, 2, 3, … 10 divide it
9 9  9 
So 12 is smallest number which have six
a2 factor. So have
c(10n + 1) − b = (10n − 1)
9 1, 2, 3, 4 and 6 (leave 12) are at the starting
This is a linear equation in 10n. Thus if two point after 12 minutes.
distinct values of n satisfy it, then all values of T = 12
n will So put n = 0 Sum of digits = 1 + 2 = 3
2c – b = 0 …(1) 111. Given that
and put n = 1 LCM (x, y) = 72
11c – b = a2 …(2) LCM (x, z) = 600
From equation (1) and (2) LCM (y, z) = 900
a2 2a 2 We know that 72 = 23 × 32
c= and b =
9 9 600 = 23 × 31 × 52
900 = 22 × 32 × 52
Now for greater value of a + b + c So maximum power of 2 in x is 3
Maximum power of 3 in x is 1
2a 2 a 2
a+ + x not contained 5
9 9
again maximum power of 2 in y = 2

NUMBER SYSTEM 105

OLYMPIAD BOOKLET

maximum power of 3 in y = 2 Now if hundreds digit is 0 then possible last

y also not contained 5. two digits are 01, 12, 23, … 89
Again maximum power of 2 in z = 2 Total 9 numbers
maximum power of 3 in z = 1 Now if increase hundreds digit by 1. Then
maximum, power of 5 in z = 2 number of possibilities down by 1.
So conclude that x = 23 × 3a So total number from 1001 to 1999 are
y = 2b × 32 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 45
z = 2c × 3d × 52 Again from 2000 to 2012
Pair of (a, d) = (0, 1), (1, 1), (1, 0) Only number 2002 follow the given
Pair of (b, c) = (0, 2), (1, 2), (2, 2), (2, 1), (2, conditions so
0) so total 3 × 5 = 15 cases are possible Total numbers are 45 + 1 = 46
for (x, y, z) 116. We know that 2013 = 61 × 11 × 3
112. 101002 – 4501 So we want a factor '61' in numerator for
= (2 × 5)1002 – 22 × 501 minimize a1, a1 must be 61.
= 21002 [51002 – 1] Now, for minimize the b1, b1 must be larger
= 21002 [(4 + 1)1002 – 1] prime number less than 61, which is 59.
= 21002 [multiple of (4) + Because if we take smaller number from 59
1002
C1001 (4) (1)1001 + 1002C1002 (1)1002 – 1] than in numerator 59 will appear because this
= 21002 [multiple of (4) + 1002 × 4] is not be cancelled out.
= 21002 × 23 [multiple of (4) + odd] So a1 = 61 and b1 = 59
So 21005 is a factor of given no x = 1005 Now |a1 – b1| = 2
x 1005 61!19!11!
= = 67 One possible way is = = 2013
15 15 59!20!10!
113. We want '3' at a unit digit. So if we divide 117. Let first two integers are a and b then a + b =
2013 by any base 'b' then remainder is 3. 26
Means 2010 is divisible by 6 Because sum is even so both numbers are
Factors of 2010 = 2 × 3 × 5 × 67 even or odd. For minimum number of even
Number of factor numbers we take both numbers is odd.
= (1 + 1) (1 + 1) (1 + 1) (1 + 1) = 16 Now again take two more integer c and d.
But in base 1, 2, 3, digit 3 is not included 26 + c + d = 41
So total 16 – 3 = 13 numbers possible So here 1 number must be odd, because sum is
114. x2 + y2 = 10x – 6y – 34 odd.
x2 – 10x + y2 + 6y + 34 = 0 Now take two more integers e and f so
x2 – 10x + 25 + y2 + 6y + 9 = 0 41 + e + f = 57
(x – 5)2 + (y + 3)2 = 0 e + f = 16
If sum of two perfect squares is zero then both By same reason e and f both are odd
squares are zero so So here only minimum 1 even integer among
x = 5 and y = – 3 the integer.
Now x + y = 5 – 3 = 2 M 6
118. =
115. Numbers from 1001 to 1999. 6 N
Thousands digit is always 1. MN = 36

NUMBER SYSTEM 106

OLYMPIAD BOOKLET

So possible pairs of (M, N) for positive 2

122. (2 + 3) 4 = (2 + 3)2 
integers are (36, 1), (18, 2), (12, 3), (9, 4), (6,
6), (4, 9), (3, 12), (2, 18), (1, 36) = [7 + 4 3]2
Total 9 pairs
= 49 + 48 + 56 3
119. Let in starting, Geeta receives a number x then
= 97 + 96.99 = 193.99
Babita receive = 2x
So greatest integer less than this is 193.
Again Geeta receive = 2x + 50
Last two digits are 93.
Babita = 4x + 100
1
Geeta = 4x + 150 123. Given f ( x) = x
3 + 3
Babita = 8x + 300
Geeta = 8x + 350 and 3[ f (−5) + f (−4) + f (−3) + n + f (4) +
Babita = 16x + 700 f (5) + f(6)]
Geeta = 16x + 750  1 1 1
Babita = 32x + 1500 = 3  −5 + −4 + −3 + +
3 + 3 3 + 3 3 + 3
But 32x + 1500 > 1000 so if Geeta wins then
16x + 700 is less than 1000. 1 1 1 
+ + 
950 < 16x + 700 < 1000 34 + 3 35 + 3 36 + 3 
250 < 16x < 300 3 1 1 1
= + + +
15.6 < x < 18.1 3  3
−11/ 2
+ 1 3−9/ 2 + 1 3−7/ 2 + 1
So minimum integer value of x = 16 1 1 1 
Sum of digits = 1 + 6 = 7 + 7/ 2 + +
3 + 1 39/ 2 + 1 311/ 2 + 1
120. Let the number of students who bought the
pencil = x and number of pencils each student  1 1   1 1  
 3−11/ 2 + 1 + 311/ 2 + 1  +  3−9/ 2 + 1 + 39/ 2 + 1  +
bought = y and the cost of each pencil in paisa     
=z  311/ 2 + 1 + 3−11/ 2 + 1  39/ 2 + 1 + 3−9/ 2 + 
So xyz = 1771 (in paisa) =  −11/ 2 +
 (3 + 1 )( 311/ 2
+ 1)  ( 3−9/ 2 + 1)( 39/ 2 + 1)
xyz = 7 × 11 × 23  
given that majority of students bought pencil 311/ 2 + 3−11/ 2 + 2 39/ 2 + 3−9/ 2 + 2
= + +
sox = 23 and cost of pencil > number of pencil 11/ 2
1+ 3 + 3 −11/ 2
+ 1 1 + 39/ 2 + 3−9/ 2 + 1
so cost of pencil is 11 paisa. =1+1+1+1+1+1=6 (total 6 pairs)
n3 + 100 124. x y + y x + 2006 xy − 2006 x − 2006 y
121. = integer
n + 10 −2006 = 0
2 900 xy [ x + y + 2006] − 2006
(n − 10n + 100) − = integer
(n + 10)
[ x + y + 2006] = 0
So, for integer value (n + 10) is a factor of
900. [ xy − 2006][ x + y + 2006] = 0
We want largest natural number so (n + 10) Second factor is always greater than 0, so only
should be largest and largest factor of 900 is first factor is equal to zero.
also 900 xy = 2006
So, n + 10 = 900 xy = 2006 = 2 × 17 × 59
n = 890 So total factor of 2006 = 2 × 2 × 2 = 8
Last two digits are 90 So possible ordered pairs of (x, y) are also 8.

NUMBER SYSTEM 107

OLYMPIAD BOOKLET

125. X = 2008 + 2007 2008 + 2007 2008 +  25 + 10 5 + 25 − 10 5

+3  3 (25 + 10 5)(25 − 10 5)
So X = 2008 + 2007 X
X2 = 2008 + 2007X (25 + 10 5)1/3 + (25 − 10 5)1/3  = x3
 
X2 – 2007X – 2008 = 0
X2 – 2008X + X – 2008 = 0 50 + 3  3 625 − 500  x = x3
X(X – 2008) + 1(X – 2008) = 0 50 + 15x = x3
(X + 1)(X – 2008) = 0 x3 – 15x – 50 = 0
So X = – 1 and X = 2008 (x – 5) (x2 + 5x + 10) = 0
Negative value of X is not possible So real values of x = 5
So X = 2008 1 + 2009
129. a=
Sum of digits = 10. 2
126. x y + y x + 2009 xy − 2009 x − 2009 y 2a = 1 + 2009
Square on both sides
−2009 = 0 xy [ x + y + 2009] −
4a2 = 1 + 2009 + 2 2009
2009[ x + y + 2009] = 0
2a2 = 1005 + 2009
[ xy − 2009][ x + y + 2009] = 0 Now (a3 – 503a – 500)5
Second factor is always greater than zero. So = [a (a2 – 503) – 500]5
take first factor is equal to zero. 5
 2009 + 1  1005 2009  
xy = 2009 =  
 2 + − 503 
 − 500 
 2  2  
xy = 2009 = 72 × 41
5
So possible ordered pair of (x, y) = number of  2009 + 1  2009 − 1  
divisor of 2009 = 3 × 2 = 6 =  
  − 500
 2  2  
3
127. 77 − 20 13 + 3 77 + 20 13 = x(let) 5
 2009 − 1 
Cube on both sides. = − 500
 4 
∵ (a + b)3 = a3 + b3 + 3ab (a + b) = 25 = 32
So 77 − 20 13 + 77 + 20 13 + 1 1
130. +
9 11 + 11 9 11 13 + 13 11
3 (77 − 20 13)(77 + 20 13)
3

1
+ +
[ 3 77 − 20 13 + 3 77 + 20 13 ] = x3 13 15 + 15 13
154 + 3  3 772 − (20 13 )2 ·x = x3 1 1
+ =
n n + 2 + (n + 2) n 9
154 + 3  3 729 ·x = x3
x3 – 27x – 154 = 0 By rationalization
(x – 7) (x2 + 7x + 22) = 0 (11 9 − 9 11) (13 11 − 11 13)
+ +
So only real value of x = 7. 2
(11 9) − (9 11) 2
(13 11) 2 − (11 13) 2
128. (25 + 10 5)1/3 + (25 − 10 5)1/3 = x(let)
((n + 2) n ) − (n n + 2) 1
Cube on both sides + =
2
((n + 2) n ) − (n n + 2) 2
9

NUMBER SYSTEM 108

OLYMPIAD BOOKLET

11 9 − 9 11 13 11 − 11 13 2008 x + 2009 2008 x + 2009

+ + 132. y= + + 25
2  9 11 2 13 2010 x − 2011 −(2011 − 2010 x)
(n + 2) n − n n + 2 1 In both terms, only difference is sign so one is
+ = positive and one is negative in root but for real
2  (n + 2)(n) 9
values of x and y negative numbers in root is
1 1 1 1 1 not define.
 − + − +
2 9 11 11 13 So only one solution of this problem is for
1 1  1 terms are equal to zero.
+ − =
n n+2 9 So y = 0 + 0 + 25
y = 25
1 1 1  1
 − = 2( 2 + 6) P
2 9 n+2 9 133. =
3( 2 + 3 ) 12
1 1 2
− =
3 n+2 9 P
2( 2 + 6) = 3  ( 2 + 3)
1
1 2 12
= − Squaring on both sides
n+2 3 9
1
1 1 4(2 + 6 + 2 12) = 9   P 2 (2 + 3)
= 144
n+2 9
1
n + 2 = 81 4  4(2 + 3) = 9   P2 (2 + 3)
n = 79 144
9 2
131. Let
3
2009 = a 16 = P
144
1 1 16 144
x = a −  P2 =
So 2  a 9
1 4 12
4x2 = a2 + −2 P= = 16
a2 3
1 1 1 1 1
a2 + 2 − 2 134. T= − + −
x2 = a 3− 8 8− 7 7− 6 6− 5
4 1
2 3 +
Now y = ( x + 1 + x ) 5 −2
3 By rationalizing the denominator of each
 1 
1  a2 + 2 − 2  terms.
1 a
=   a −  + 1+  3+ 8 8+ 7 7+ 6 6+ 5
2  a 4  T= − + −
  1 1 1 1
3 5+2
1  1 1 1  +
=   a −  +  a +   = ( a )3 1
2  a 2 a  T=3+2
y = ( 3 2009)3 = 2009 T=5
Sum of digits of y = 11

NUMBER SYSTEM 109

OLYMPIAD BOOKLET

135. Given 49 − x 2 − 25 − x 2 = 3 and So remainder when 1990 is divided by 10 is 0

so now lets check the remainder when.
2 2
Let 49 − x + 25 − x = z (let) 90 is divided by 11.
Multiply both equations we get and it is 1.
( 49 − x 2 ) 2 − ( 25 − x 2 ) 2 = 3 z 2999
139.
(49 – x2) – (25 – x2) = 3z 100
24 = 3z We know that
z=8 210 = 1024 ≡ (– 1) (mod 25)
So 2999 = 2990 × 29 = (–1)99 × 29 ≡ – 512 ≡ –12
136. 9−6 2 + 9+6 2 = k ≡ 13 (mod 25)
So the remainder (2999 mod 100) must be in
6 + 3− 2 3  2 + 6 + 3+ 2 3  2 = k
set {13, 13 + 25, 13 + 50, 13 + 75}
6+3− 2  3  6 + 6+3+ 2  3  6 = {13, 38, 63, 88}
=k Because number 2999 is a multiple of 4
So remainder must be 88.
( 6 − 3) 2 + ( 6 + 3) 2 = k
So last two digits are also 88.
( 6 − 3) + ( 6 + 3) = k 140. (25733 + 46)26 mod 50
[(250 + 7)33 + 46]26 mod 50
k =2 6
[733 + 46]26 mod 50
25 25
k =  2 6 = 50 [72 × 16.7 + 46]26 mod 50
Now 6 6 [4916.71 + 46]26 mod 50
[(50 – 1)16.7 + 46]26 mod 50
27
4737
137.
11 [1.7 + 46]26 mod 50
Euler number of prime P is P – 1 [53]26 mod 50
So Euler number of 11 is 10 (3)26 mod 50
37 27 7 27 7  7 2 13 Now 50 = 2 × 52
So  
10 10 10  1  1 
E (50) = 50 1 − 1 −  = 20
13
7(49 ) 7(50 − 1) 13  2  5 
= − So 320 ≡ 1 mod 50 and 36 ≡ 729 ≡ 29 mod 50
10 10
So 326 = 320 × 36 ≡ 1 × 29 mod 50
Remainder is 7(– 1)13 = – 7
So remainder = 29.
or – 7 + 10 = 3
141. According to given data.
So our question converts into
p + 1 = n2
473 (44 + 3)3 So p = n2 – 1
=
11 11 p = (n + 1) (n – 1)
33 27 ∵ p is a prime number so one of factor
⇒ =
11 11 should be 1.
Remainder is 5 Here n – 1 = 1
91990 n=2
138.
11 So only prime number is possible
Euler no. of 11 is 10 p = n2 – 1 = 22 – 1 = 3

NUMBER SYSTEM 110

OLYMPIAD BOOKLET

= (24 × 54)3 and also n3 = 218 × 513 = (29 × 59)2

142. N  20072 − 20070 + 31
So N = 26 × 56 = (10)6} = 1000000
N  (2007) 2 − 2(2007)(5) + 52 + 6 Number of digit in N = N = 7
So N2 = 49
N  (2007 − 5) 2 + 6 146. 3n + 1 < 2008
2
N  (2002) + 6 3n < 2007
So greatest integer N is 2020. 2007
n
N − 2 2002 − 2 3
= = 20 n < 669 …(1)
Now 100 100
and 7n + 1 is a prefect square so let
143. N + 496 = x2 and N + 224 = y2 (let)
7n + 1 = P2
So N = (x2 – 496) and N = y2 – 224
So x2 – 496 = y2 – 224 P2 − 1
n=
x2 – y2 = 496 – 224 7
(x + y) (x – y) = 272 Put the value of N in inequality of (1)
= 2 × 136/4 × 68/8 × 17 … P2 −1
 669
Here sum and difference of x and y are both 7
odd or both even and for largest value of N P2 < 4684
sum of x + y should be largest ⇒ P < 69
So take x + y = 136 Now again 7n = P2 – 1
x–y=2 7n = (P + 1) (P – 1)
by solving these equation we get So one of factor from (P + 1) and (P – 1) is a
So x = 69 and y = 67 multiple of 7.
N = 692 – 496 = 4761 – 496 = 4265 So P = 7k ± 1
Sum of digits = 17 Possible values of P = 1, 6, 8, 13, 15, 20, 22,
144. Let the numbers are x, x + 1, …x + 17 27, 29, 34, 36, 41, 43, 48, 50, 55, 57, 62, 64.
So sum is 18x + (1 + 2 + … + 17) Here P ≠ 1 because then N = 0
= 18x + 153 So except P = 1 there are 18 values of N are
If sum is perfect square then let possible
18x + 153 = P2 147. M = 1! × 2! × 3! × 4! × 5! × 6! × 7! × 8! × 9!
9(2x + 17) = P M = (1) × (21) × (31 × 21) × (23 × 3) × (23 × 31
9 is already perfect square so 2x + 17 also × 51) × (24 × 32 × 51) × (24 × 32 × 5 × 7) × (27
becomes perfect square. × 32 × 5 × 7) × (27 × 34 × 5 × 7)
So smallest value of x is 4 so that 2x + 17 = 25 M = 230 × 313 × 54 × 73
Hence sum of first two integers = 4 + 5 = 9 So number of perfect square factors of M
145. Prime factorization of 20 = 22 × 51 = 16 × 7 × 3 × 2 = 21 × 32 = 216
Here N is multiple of 20 and N2 is a perfect So b = 32
cube and N3 is a perfect square. 148. Let y = k2 so
So LCM (2, 3) = 6 m2 = (x – 90)2 – 4907
So for the minimum values of N take powers (x – 90)2 – k2 = 4907
of 2 and 3 are 6. (x + k – 90)(x – k – 90) = 4907 × 1 = 701 × 7
So smallest N = 26 × 56 Number of factors of 4907 = (1 + 1)(1 + 1) = 4
It is multiple of 20, also N2 = 212 × 512 So total pairs of (x, y) are also 4.

NUMBER SYSTEM 111

OLYMPIAD BOOKLET

149. 2564 × 6425  11   12   99 

152. x+ +x+  + +  x +  = 765
252 × 32 × (82)25  100   100   100 
(2532)2 × (825)2 (11 + 12 +  + 99)
(2532 × 825)2 89 x + = 765
100
(564 × 275)2
48.95
So N = 564 × 275 89 x = 765 −
100
= (10)64 × 211 89x = 716.05
= 204800000 x = 8.04
64 zeros
So now [900] – [100 × 8.04]
Sum of the digits of N = 14. = 900 – 804 = 96
n 153. 206!
150. = perfect square
20 − n Number of zeros at the end of the number
n = highest power of 5 which divided 206!
Here is positive numbers so numerator
20 − n  206   206   206 
= + +  +
and denominator both are the same sign and  5   25   125 
denominator is also not equal to zero. = 41 + 8 + 1 + … = 50
So 0 < n < 20 154. If n = 1, LHS = 0 + 0 + 0 = 0 ≠ n
n If n = 2, LHS = 1 + 0 + 0 = 1 ≠ n
Now is a perfect square and its If n = 3, LHS = 1 + 1 + 0 = 2 ≠ n
20 − n
If n = 4, LHS = 2 + 1 + 0 = 3 ≠ n
maximum value is 20.
If n = 5, LHS = 2 + 1 + 0 = 3 ≠ n
So perfect squares between 0 to 20 are 1, 4, 9,
If n = 6, LHS = 3 + 2 + 1 = 6 = n
16
Means every multiple of 6 is satisfy the given
n data.
So if = 1 then n = 10
20 − n
 2007 
n So there are  possible numbers less
If = 4 then n = 16  6 
20 − n
than 2007. P = 334
n Last two digits of P = 34
If = 9 then n = 18
20 − n 155. x2 + 10000[x] = 10000x
n 320 ∵ x = [x] + {x}
If = 16 then n = (not an integer)
20 − n 17 x2 + 10000[x] = 10000([x] + {x})
So only 3 values of n are possible. x2 = 10000{x}
151. (24)b = (2 × b + 4)10 x2
{x} =
Now [(2b + 4)2]10 = [554]b 10000
4b2 + 16b + 16 = 5b2 + 5b + 4 0 ≤ {x} < 1
b2 – 11b – 12 = 0 x2
(b + 1) (b – 12) = 0 0 1
10000
So b = – 1 and b = 12 0 ≤ x2 < 10000
b = – 1 is not possible so b = 12 x2 < 10000

NUMBER SYSTEM 112

OLYMPIAD BOOKLET

So –100 < x < 100 19

So we can see that x have 2(99) + 1 = 199 x =  ( 3n3 + 3n 2 + n )

n =1
potential value of x. 2
So P = 199  n(n + 1)   n(n + 1)(2n + 1) 
x = 3  + 3 
P – 100 = 199 – 100 = 99  2 n =19  6  n =19
2010
 2010  2010    n(n + 1) 
156. 2010 −   −  + 
k =1  k  k    2  n =19
We know that [x] = x – {x} x = 108300 + 7410 + 290
x = 116000
2010
 2010 2010  2010 
So = 2010 −   − +   x  116000 
k =1  k k  k  So  = = 23
 5000   5000 
2010
  2010 
= 2010 −      3100 
k =1   k  2100  100 + 1
158.
3100 + 2100
= 2 
 2010 
The value of   is lie between 0 to 1.0 396 + 296  396

 k  296  96 + 1
2 
2010
when is an integer and 2010 = 2 × 3 × 5  3100  100
k 24  100 + 1 24  3
2
× 67. =  96  2100
96
So total number of factors are = 2 × 2 × 2 × 2 3 3
+1
= 16 296 296
 2010  We can ignore 1's on the end but the answer is
Means   will be '0' be at 16 times very close but less than the new fraction.
 k 
otherwise it is greater than 0. 3100
24 
  2010  Now 2100 = 81
96
So    will be zero 16 times and 1094 3
  k  296
times 1. So our number is also less than 81 but just
Again = 2010 – (16(0) + 1094(1)) = 16 close to 81. So GIF value is 80
157. x = [11/3] + [21/3] + [31/3] + … + [79991/3] 159. x2 + 10000[x] = 10000x
So we can see that ∵ x2 + [x] = {x}
x = (8 – 1)(1) + (27 – 8)(2) + (64 – 27)(3) + … So x + 10000[x] + {x} = 10000([x] + {x})
2
+ (203 – 193)(19) x2 = 10000{x}
(From 11/3 to 71/3 values are 1, from 81/3 to
x2
261/3 values are 2 … and so on) {x} =
x = (23 – 13) (1) + (32 – 23) (2) + … + (203 – 10000
We know that
193)
19
So 0 ≤ {x} < 1
x =  (n + 1)3 − n3 (n) x2
n =1 0 1
19
10000
x =  ( 3n2 + 3n + 1)n So x2 < 10000
n =1 –100 < x < 100

NUMBER SYSTEM 113

OLYMPIAD BOOKLET

So we can see that x have 199 potential value. 10

f ( x) = [k{x}]
So N = 199 k =2

N + 1 199 + 1 We can see that for each value of k[k{x}] can

= = 50
4 4 equal integer from 0 to k – 1 and clearly the
10
value of [k{x}] changes only when x is equal
160. f ( x) =  ([kx] − k[ x])
k =2 1 2 k −1
to any of the fraction , ,
10 k k k
f ( x) =  ([k[[ x] + {x}]] − k[ x]) By graphing there are 46 values of f (x) but in
k =2
10
this on an average 3 in each of the 5 intervals
f ( x) =  ([k[ x] + k{x}] − k[ x]) don't work. This means total
k =2 = 46 – 3(5) + 1 = 32
10
=  (k[ x] + [k{x}] − k[ x]) 1 for the value of f (x) is atleast 0.
k =2 So total 32 different possible values of f (n).

3. P(n) = (n + 1)(n + 2)(n + 5)(n + 7)(n + 9)

1. Let the number be 'x' n is even, so all five factors are odd.
So Rama subtract 9 from x and then divide it P(n) is product of five consecutive odd
by 3. numbers so it is divisible by 5. Also P(n) is
x−9 product of three consecutive odd numbers so it
= 43 is also divisible by 3.
3
x – 9 = 129 So P(n) is divisible by 5 × 3 = 15.
x = 138 So, largest integer that is divisor of P(n) is 15.
138 − 3 135 1
Now correct answer = = = 15 4. = m− n
9 9 2011 + 20112 − 1
2. Sn = n2 + 20n + 12 = P2 (let)
n2 + 20n + 100 + 12 = P2 + 100 1

( 2011 − 20112 − 1)
(n + 10)2 – P2 = 88
(n + 10 + P)(n + 10 – P) = 88 ( 2011 + 2011 − 1 )
2
( 2011 − 2011 − 1 )
2

So possible pairs of 88 are

= m− n
(n + 10 + P) = 88 44 22 11
(n + 10 − P) = 1 2 4 8 2011 − 2010  2012
= m− n
Add both numbers (2011) 2 − ( 20112 − 1)
2(n + 10) = 89, 46, 26, 19
89 46 26 19 2011 − 2 1005 1006
n + 10 = , , , = m− n
2 2 2 2 (1)
∵ n is a positive integer so take only
(1005 + 1006) − 2 1005  1006 = m − n
positive integer value of (n + 10)
n + 10 = 23/13 ⇒ n = 13/3 ( 1006 − 1005)2 = m − n
So, sum of all values of n = 13 + 3 = 16
1006 − 1005 = m − n

NUMBER SYSTEM 114

OLYMPIAD BOOKLET

So m = 1006, n = 1005 For 6 ≤ x < 7, [x] = 6

m + n = 1006 + 1005 = 2011 So x2 – 42 + 5 = 0; x2 = 37
x x x = 37 [6,7)
5.  5  =  7 
Now x ≥ 7
Here multiple of 5 and 7 are critical points. x2 + 5 > 7x ≥ 7[x] no roots in [7, ∞)
Case 1: 0 ≤ x < 5 So sum of squares of roots
LHS = 0, RHS = 0 = 2 + 23 + 30 + 37 = 92
So, x = 0, 1, 2, 3, 4 (satisfy) 7. k (33 + 43 + 53) = an
Case 2: 5 ≤ x < 7 k (216) = an
LHS = 1, RHS = 0 an
So, no value of x is satisfy. k=
216
Case 3: 7 ≤ x < 10 If we take a = 6 and n = 3; an = 216
LHS = 1, RHS = 1
63
So, x = 7, 8, 9 (satisfy) Then k = =1
63
Case 4: 10 ≤ x < 14
So smallest value of k = 1
LHS = 2, RHS = 1
8. S(N) = 2013 = 9 × 223 + 6
So, no value of x is satisfy.
For smallest value of N we take N as.
Case 5: 14 ≤ x < 15
LHS = 2, RHS = 2 N = 6999999
223 times
So x = 14 satisfy
5 N = 34999995 + 2013
Further more no value of x is satisfy So 222 times
So, total 9 values of x satisfy.
5 N + 2013 = 34999995 + 2013
6. x2 – 7[x] + 5 = 0 So 222 times
For x < 1, 7[x] = 0 = 350 … 0002008
So x2 + 5 = 0 ⇒ no root in (– ∞, 1) So sum of digit of N = S(N) = 3 + 5 + 2 + 8 =
For 1 ≤ x < 2, [x] = 1 18
So x2 – 7 + 5 = 0; x2 = 2 9. Given sequence is 1 + 2 + 3 + … + k
x = 2 [1, 2) k (k + 1)
=
For 2 ≤ x < 3, [x] = 2 2
So x2 – 14 + 5 = 0; x2 = 9 Lets start from smallest odd value k = m = 1
x = 3 ∉ [2, 3) no root Sum is 1 and 1 is a perfect square
For 3 ≤ x < 4, [x] = 3 So m = 1
So x2 – 21 + 5 = 0; x2 = 16 Now Lets check for even numbers
x = 4 ∉ [3, 4) no root For n = 2
For 4 ≤ x < 5, [x] = 4 Sum = 2 (not a perfect square)
So x2 – 28 + 5 = 0; x2 = 23 For n = 4
x = 23 [4,5) Sum = 10 (not a perfect square)
For n = 6
For 5 ≤ x < 6, [x] = 5
Sum = 21 (not a perfect squares)
So x2 – 35 + 5 = 0; x2 = 30
For n = 8 sum = 36 = 62
x = 30 [5,6) So smallest n = 8

NUMBER SYSTEM 115

OLYMPIAD BOOKLET

Now m + n = 1 + 8 = 9 2
k1 = 1 +
10. Let k consecutive numbers are n, n + 1, n + 2, k2 − 1
…, n + k – 1, n + k. For integer value of k1, (k2 – 1) is a factor of 2.
So sum = (n + 1) + (n + 2) + … + (n + k) So k2 – 1 = 1/2
k k2 = 2/3
2013 = [2(n + 1) + (k – 1)(1)]
2 So pairs of (k1, k2) = (2, 3) and (3, 2)
[by sum of A.P] Now when k1 = k2, h = k1
k
2013 = [2n + k + 1] = k(2n + k + 1) k12 = k1 + k2 + k1
2
Here 2n + k + 1 > k and for the largest value of k12 = 3k1
k, we can factories 4026 as 61 × 66 k1 = 0 or 3
So k = 61 and 2n + k + 1 = 66 k1 ∈ N so x = y = 3
So largest value of k = 61 So (3, 3) is also a pair.
11. ∵ (64)10 = (1000000)2 So total 3 pairs of (x, y) are possible.
So number less than 64 have at most 6 digits 8 8
in binary 14. = = integer
9999 − n 9999 − 1
So there are 6C3 = 20 numbers with exactly n
three '1'
 9999 
Means here 20 numbers have three '1' so total For integer value  − 1 is a factor of 8.
 n 
60 '1' in all numbers. If we added these
numbers than 60 '1' distributed equally in 6  9999 
So possible values of  − 1 = 1, 2, 4, 8
digits.  n 
So that sum = 10 (25 + 24 + 23 + 22 + 21 + 20) 9999
= 2,3,5,9
= 630 n
12. k2 < 2014 < (k + 1)2 9999 9999
442 < 2014 < 452 n= ,3333, ,1111
2 5
So k = 44 = 4 × 11 ∵ n < 2014
Largest prime factor of k = 44 is 11
So only possible value of n = 1111
13. Let takes x = hk1
So 1 is correct answer.
y = hk2
15. E(1) + E(2) + E(3) + … E(100)
and (x, y) = h and x ≤ y
[2 + 4 + 6 + 8] + [2 + 4 + 6 + 8] + [2 × 10 + 2
So k1 ≤ k2
+ 4 + 6 + 8] + … + [8 × 10 + 2 + 4 + 6 + 8] +
Now xy = x + y + (x, y)
[2 + 4 + 6 + 8]
h2k1 k2 = hk1 + hk2 + h
= 10(2 + 4 + 6 + 8) + 10(2 + 4 + 6 + 8)
hk1k2 = k1 + k2 + 1 …(1)
= 20(2 + 4 + 6 + 8) = 20 × 20 = 400
Case 1: For h = 1
16. Let two digit N = 10a + b
k1k2 = k1 + k2 + 1
According to given condition
k1 (k2 – 1) = k2 + 1
(10a + b) + (10b + a) = perfect square
k −1 + 2 11(a + b) = perfect square.
k1 = 2
k2 − 1 So (a + b) is a multiple of 11.

NUMBER SYSTEM 116

OLYMPIAD BOOKLET

a and b are single digit number, so that only 61

possible value of a + b = 11 n +1 =
11
No pairs of (a, b) = (2, 9), (3, 8), …(9, 2) 3721
Total 8 numbers. n +1 =
121
17. For the largest value of n, x, y and (10x + y) 3721 3600
also should be largest. n= −1 = 29.75
121 121
So take x = largest single digit prime = 7 if we So, if we take the value of n less than 29.75
take y = 5 then 75 is not a prime so take y = 3 than we satisfying our inequality
So all three prime numbers are 7, 3, 73
n + n + 1  11.
Product of primes = 1533
So, total 29 values of n are possible.
Sum of digit of n = 1 + 5 + 3 + 3 = 12
21. {x}, [x], and x are in G.P so that [x]2 = {x}·x
18. Possible values of n are 9876, 8765, 7654, Lets take {x} = a, [x] = ar, x = ar2
6543, 5432, 4321, 3210.
∵ x = [x] + {x}
When numbers are divided by 37, the
So, ar2 = ar + a
corresponding remainders are 34, 33, 32, 31,
r2 – r – 1 = 0
30, 29, 28.
So, sum of all remainder = 217. 1 5
r= (take only positive sign)
19. If number is divisible by 3 then sum of digit is 2
also divisible by 3. Again given sum of digit is 1 5
r=
divisible by 7. So sum of digit of 3-digit 2
numbers is divisible by 21. ar = Integer (I)
Means overall we are find the coefficient of 1+ 5 
a   = I
x21 in (x0 + x1 + x2 + … + x9)3  2 
(1 − x10 )3 2I
= = (1 – 3x10 + 3x20 – x30) (1 – x)–3 a= and 0  a  1
(1 − x )3 1+ 5
So coefficient of x21 is 2I
= 3 + 21 – 1C21 – 3 × 3 + 11 – 1C11 + 3 × 3 + 1 – 1C1 0 1
1+ 5
= 23C21 – 3 × 13C11 + 3 × 1C1
5 +1
= 253 – 234 + 9 = 28 0I 
2
20. Given that n + n + 1  11 Only one value of I is possible
So I = 1
Lets take n + n + 1 = 11
ar = 1
1 1
Then = 2 5 −1
n + n + 1 11 a= =
1+ 5 2
n +1 − n 1
= 5 +1
1 11 …(1) x = ar 2 =
2
Add equation (1) and equation (2) Now xN > 100
1 122 N
2( n + 1) = 11 + =  5 +1
11 11    100  N  9.5
 2 
So minimum possible value of N is 10.

NUMBER SYSTEM 117

OLYMPIAD BOOKLET

22. 7x2 – 44x + 12 = pn ⇒ let us start from n = 99

7x2 – 42x – 2x + 12 = pn ⇒ 99! + 1 and 100!
y
(7x – 2) (x – 6) = P + P
y 1 2
HCF = 100 is not possible because 99! + 1 is
(Here y1 + y2 = n) not divisible by 100.
So 7x – 2 = P y1 and (x – 6) = P y2 (test's take) Here, we can see that composite number will
So, subtract 7 times of equation (2) from not be able to more it.
equation (1) we get So, lets take n = 97
y y
96! + 1 and 97! Both are multiple of 97.
40 = P 1 − 7 P 2 So HCF = 97.
If y1, y2 ∈ N then P is divisors of 40. So, 25. abccba
possible values of P = 2/5. = 105a + 104b + 103c + 102c + 10b + a
If P = 2 then 40 = 2 y1 − 7  2 y2 = (100001)a + (10010)b + (1100)c
23  5 = 2 y1 − 7  2 y2 = (7m + 6)a + (7m′)b + (7m′′ + 1)c
y
If we take y2 = 3 then 2 = 23 × 5 + 7 × 23
1 = 6a + c + 7m = (c – a) + multiple of (7)
But then y1 ∉ z (no solution) So, if number is divisible by 7 then
c – a = 7/0 / – 7
Now if P = 5 then 23 × 51 = 5 y1 − 7  5 y2
So possible pair of (a, c) = (9, 2), (8, 1), (1, 8),
If we take y2 = 1 then 5 y1 = 15 × 5 (2, 9), (7, 0), (1, 1), (1, 2), …(9, 9)
So, again y1 ∉ z Total 14 pairs
So, now if we take P = 47, α = 1 and β = 0 Now b is odd so five values of b are possible.
Then 40 = 47 – 7(1) (satisfy) So total 6 digit numbers are 14 × 5 = 70
So largest value of P = 47 26. (166)b × (56)b = (8590)b
23. By using Euler function: (b2 + 6b + 6) × (5b + 6) = (8b3 + 5b2 + 9b)
aϕ(n) ≡ 1 (mod n) 5b3 + 30b2 + 30b + 6b2 + 36b + 36
3pq |n3pq – n ⇒ 3pq| n (n3pq – 1 – 1) = 8b3 + 5b2 + 9b
So that from here we can see that p and q both 3b – 31b – 57b – 36 = 0
3 2

are odd and neither can be 3. (b – 12) (3b2 + 5b + 3) = 0

So 3, p, q are pair wise relatively prime. So from here b = 12 is only real value.
⇒ ϕ |3pq| = 2(p – 1) (q – 1) So sum of all values of b is also 12.
∴ 3pq| n (n3pq – 1) ∀ n ∈ I+ if ϕ(3pq)|(3pq –1) 27. n2 – 15n – 27
 2( p − 1)(q −1) | (3 pq −1) Equation n2 – 15n – 27 then
and (p – 1) | (3pq – 1) ⇔ (p – 1) | (3q – 1) 15  225 + 108
(q – 1) | (3pq – 1) ⇔ (q – 1) | (3p – 1) n=
2
So, the least value of p = 10 and q = 17
15  333
Sum of p + q = 10 + 17 = 28. = = 16.62, −1.62
24. n! + 1 is not divisible by 1, 2, 3, … n and (n + 2
Means if n > 16.62 then n2 – 15n – 27 > 0 and
1)! is divisible by 1, 2, 3, … (n + 1)
if – 1.62 < n < 16.62 then n2 – 15n – 27 < 0
So, HCF ≥ (n + 1)
So lets check from n = 17
Also (n + 1)! is not divisible by (n + 2) when
(17)2 – 15(17) – 27 = 17 (satisfy)
(n + 2) 1. prime.
For n = 18
so let us take HCF = (n + 1)
(18)2 – 15(18) – 27 = 27 (not satisfy)

NUMBER SYSTEM 118

OLYMPIAD BOOKLET

For n = 19 22q − 7 p
(19)2 – 15(19) – 27 = 49 (not satisfy) should be smallest.
7q
This is the increasing function so for the larger
Now if we take q = 99 and 22q – 7p = 1
value of x will also not satisfy.
So only n = 17 is possible. We get 22(99) – 7p = 1
For 3-digit numbers maximum product is 729 p = 311
and for n = 100. 311 22
So is very close to
(100)2 – 15(100) – 27 = 8473 > 729 99 7
So none of 3-digit number is possible So p – 3q = 311 – 3(99) = 14
Hence answer is only 17. 1 1 1
32. + ++ =1
28. T ≡ {4, 5, 6} (mod 15) a1 a2 ak
So possible values of T when divided by 15
gives remainder 4, 5 or 6 are Let us take a1 = A12 , a2 = A22 , ak = Ak2
4, 5, 6, 19, 20, 21, 34, 35, 36, 49, 50, 51, … 1 1 1
So + ++ =1
184, 185, 186, 199, 200, 201, … A1 A2 Ak
Now if we check by direct hit and trial to Lets check for k = 2
dividing these numbers by 11 and 13.
We get a smallest number 184. 1 1
+ =1
When 184 is divided by 11, remainder is 8 and A1 A2
when divided by 13, remainder is 2. So there do not exist any value of A1, A2 for
So, sum of squares of digit of 184 1 1
which + = 1 . So '2' is not a good
= 12 + 82 + 42 = 81. A1 A2
29. x5 = 1 + x1x2x3x4
number.
43 = 1 + x1x2x3x4
Now for k = 3
So x1x2x3x4 = 42
Now x6 = 1 + x1x2x3x4x5 1 1 1
+ + =1
= 1 + 42 × 43 = 1807 2 3 6
= 13 × 139 So 3 is a good number.
So, largest prime factor of x6 is 139. For k = 4
Sum of digits of 139 = 13 1 11 1 1
+  + +  = 1 so 4 is a good number.
30.  abc is a three-digit number, so a, b and c 2 2 2 3 6
are single digit numbers. So k will be good for k ≥ 3.
Now a2 + b2 = c2, we know by Pythagoras Now f (n) = 3 + 4 + 5 + … + (n + 2) [n terms]
theorem. (n + 2)(n + 3) (n)(n + 5)
32 + 42 = 52 = −3 =
2 2
So possible abc = 345 or 435 (n + 5)(n + 10)
345 = 3 × 5 × 23 and 435 = 5 × 3 × 29 and f (n + 5) =
2
So largest possible prime factor is 29.
f ( n) n + 10 10
p 22 Now = = 1+
31.  is closet to so f (n + 5) n n
q 7
It is integer if n is a factor of 10.
22 p So possible value of n = 1, 2, 5, 10
− to be as small as possible
7 q Sum of all values = 18.

NUMBER SYSTEM 119

OLYMPIAD BOOKLET

33. 9n + 7 is a perfect square so 11 32.5 10, 11, …, 22 for (100 ≤ a, b ≤

Lets take 9n + 7 = k2 1000)
Again n + 6 is a prime so n is odd So total 7 + 13 = 20
So take n = 2m + 1 Ordered pairs (a, b) possible
So 9(2m + 1) + 7 = k2 35. When N is divided by 11, 12, 13 the
18m = k2 – 16 remainders are distinct primes in A.P.
18m = (k + 4) (k – 4) So possible remainders are 3, 5, 7.
18m is even so (k + 4) and (k – 4) both are also Means when N is divided by 11 remainder is
even. So, lets take 3, divided by 12 remainder is 5, and when
So k = 2p divided by 13 remainder is 7.
18m = 2 × 2 (p + 2) (p – 2) So smallest value of N is 29.
9m = 2(p + 2) (p – 2) But we want largest value of N so any number
Here we can see that p must be in the form of in the form of 11 × 12 × 13 × m + 29 satisfy
(9q + 2) or (9q – 2) all the conditions.
So lets take p = 7 So we can't decide largest value of N. So this
So k = 14 question is bonus.
9n + 7 = 196 xy + z = 160
n = 21 Case 1: z = 1, xy = 159 = 53 × 3
n + 6 = 27 (not a prime) Smallest value of x + yz at x = 53 and y = 3 is
and Now take P = 11 53 + 3(1) = 56
So k = 22 Case 2: z = 2, xy = 158 = 79 × 2
and 9n + 7 = 484 Smallest value of x + yz at x = 79 and y = 2 is
n = 53 79 + 2(2) = 83
Case 3: z = 3, xy = 157 = 157 × 1
n + 6 = 59 (prime)
Smallest value of x + yz at x = 157 and y = 1 is
So n = 53
157 + 3(1) = 160
34. Lets take gcd (a, b) = h and a = hk1 and b =
Case 4: z = 4, xy = 156 = 26 × 6
hk2 where k1 and k2 are coprime.
Smallest value of x + yz at x = 26 and y = 4 is
gcd(a, b) 1
So, = 26 + 6(4) = 50 (select)
LCM(a, b) 495
Case 5: z = 5, xy = 155 = 31 × 5
h 1 Smallest value of x + yz at x = 31 and y = 5 is
=
hk1k2 495 31 + 5(5) = 56
k1k2 = 32 × 5 × 11 Similarly in all other cases value is greater
Now we know a < b and 100 ≤ a, b ≤ 1000 than 50. So answer is 50.
So possible values of 37. Set is {1, 2, 3, …, n}
k1 k2 G.C.D This set can be partitioned into 3 subsets with
1 32.5.11 no values in the range of 100 ≤ equal sums, so that sum is divisible by 3.
a, b ≤ 1000 n(n + 1)
Means is divisible by 3.
3 2
5.11 12, 13, …, 18 for (100 ≤ a, b ≤ 2
1000) Means n(n + 1) is divisible by 6.
5 32.11 no values in the range of 100 ≤ So n will be in the form is 6k, 6k + 2, 6k + 3,
a, b ≤ 1000 6k + 5.

NUMBER SYSTEM 120

OLYMPIAD BOOKLET

Case 1: If n = 6k Case 2: when a – b = 2

First we can group the number in 6 bundles of 22 – 02 = 4
the form 1, 2, 3, 4, 5, 6. 32 – 12 = 8
So from each group we can select in subsets 42 – 22 = 12
like [(1, 6), (2, 5), (3, 6)] ⋮
Case 2: If n = 6k + 2 262 – 242 = 100
Then remaining 8 numbers 1, 2, 3, 4, 5, 6, 7, 8 All multiples of 4 can be expressed as
can be select in subsets like this [(1, 2, 3, 6), difference of two square.
(4, 8), (5, 7)] Now if difference of a – b = 3 then we get
Case 3: If n = 6k + 3 again odd numbers which are already counted
Then remaining numbers are 1, 2, 3, 4, 5, 6, 7, and if difference of a – b = 4 then we get again
8, 9 can be select in subsets like this [(1, 2, 3, multiple of 4 which are already counted.
9), (4, 5, 6), (7, 8)] So numbers which cannot be expressed as a
Case 4: If n = 6k + 5 difference of square of two integer = 100 – [50
Then remaining numbers are from 1 to 11 can + 25] = 25.
be select in subset like this [(1, 10, 11), (5, 8, 40. Let y = N + 2N + 3N + … + 9N
9), (2, 3, 4, 6, 7)] We can have 16 numbers of y = 45N
all these types. So total numbers are 16 × 4 = If we multiply 45 to N we get 0 or 5 as a unit
64 digit but y have all same digits so 0 is not
 1  1 possible.
38.  n + 2n + 2  = n +  2n + 2  Hence, y = 5555555
a times
n 2n [ 2n + .5] n + [ 2n + .5] Also y is multiple of 45 means multiple of 9.
1 1.4 1 2 So for smallest value of N we take 9 times of 5.
2 2 2 4 y = 555555555
3 2.4 2 5 y 555555555
So N = = = 12345679
4 2.8 3 7 45 45
5 3.1 3 8 Sum of digits of N = 37.
6 3.4 3 9 41. Let N = 11111
7 3.7 4 11 20times

⋮ ⋮ ⋮ ⋮ So S(n) = 20
So we can see that missing numbers are 1, 3, Now 33n = 11111  33 = 36666663
6, 10, 15, … 20times 19 times

So 12th number in this sequence = 78 So sum of digits of 33n = 3 + 3 + 19 × 6 = 120

39. Let c = a2 – b2 So sum of digit of 3n
Case 1: When difference of a and b is 1. = 3 + 3 +  + 3 = 60
12 – 02 = 1 20 times
22 – 12 = 3 F5 (a, b) (a + b)5 − a 5 − b5
32 – 22 = 5 42. =
F3 (a, b) (a + b)3 − a 3 − b3
502 – 492 = 99
So, all odd numbers can be expressed as 5a 4b + 10a3b2 + 10a 2b3 + 5ab 4
=
difference of two squares. 3a 2b + 3ab 2

NUMBER SYSTEM 121

OLYMPIAD BOOKLET

For prime number 3, n = 3, 6 are satisfy the all

5 ab ( a + 2a b + 2ab + b )
3 2 2 3

= condition So if prime number is p then (p – 1)

3 ab(a + b)
numbers are satisfy all the conditions.
5  ( a + b ) + 2ab(a + b)  So, total numbers are
3 3

=   (2 – 1) + (3 – 1) + (5 – 1) + (7 – 1) + (11 – 1)
3 ( a + b) 
 + (13 – 1) + (17 – 1) + (19 – 1) = 69
5 2 46. b + c – a, c + a – b, a + b – c all are integer
=
3
( a + b2 + ab )  I add all three numbers we get a + b + c and we
When a and b gives same remainder then a2 + know a + b + c < 100
b2 + ab is divisible by 3. So, possible values of (a + b – c)
So total possible pairs of (a, b) = (1, 1), (1, 4), (b + c – a), (c + a – b) = 1, 4, 9, 16, 25, 36, 49,
(1, 7), (1, 10), (2, 2), (2, 5), (2, 8), (3, 3), (3, 6), 64, 81.
(3, 9), (4, 4), (4, 7), (5, 5), (4, 10), (5, 8), (6, 6), Also either all three are even or odd
(6, 9), (7, 7), (8, 8), (9, 9), (7, 10), (10, 10) For largest possible value of (a + b + c)
Total 22 ordered pairs. b + c – a = 81
43. 1, 7, 8, 49, 50, 56, 57, 343, … c+a–b=9
70, (71), (70 + 71), (72), (72 + 70), (72 + 71), (72 a+b–c=1
+ 71 + 70), 73, … So, a + b + c = 91
We know 16856 = 75 + 72 47. p3 + 4p2 + 4p
By observation we can see that p (p2 + 4p + 4)
70 71 72 75 p(p + 2)2
If p (p + 2)2 have exactly 30 divisors than (p +
71 + 70 72 + 70 75 + 7 0
2)2 have 15 divisors.
7 2 + 71  75 + 71
2 1 0
15 = 3 × 5
7 +7 +7 75 + 70 + 71 2 4

75 + 7 2 So (p + 2)2 is in the form of p1  p2

2
So, numbers of terms up to 75 + 72 So (p + 2) is in the form of p1 × p2
= 20 + 21 + 22 + 23 + 24 + 5 = 36 Now if we take smallest prime number '2' as
44. 2019 is closest to 211 = 2048 p1 or p2 then p + 2 will becomes even. p also
So it must be contain atleast 13 digits. becomes even but p is prime so not possible.
2048 – 2019 = 29 So, for the smallest value of p we take p1 = 5
and 29 = 32 – 4 + 2 – 1 and p2 = 3
(2019)10 = (1000000100111)2 So p + 2 = 5 × 32 = 45
= 1 × (–2)2 + 1 × (–2)5 + 1 × (–2)2 + (–2)1 + (–2)0 p = 43
= 2048 – 32 + 4 – 2 + 1 = 2019 48. Remainders will be always less than divisor so
So, there are 5-non zero digits. remainder are less than 11.
45. p  n and p  20 Also remainders form G.P so possible G.P's
p2 > n and n is multiple of p are 2, 4, 8 and 3, 6, 9
and n is less than p2 Here we want sum of digits of E, which is not
For prime number 2, only n = 2 is satisfy the possible because E is a set again here we can
all condition. not find the maximum N. In this question we
find the sum of the smallest N.

NUMBER SYSTEM 122

OLYMPIAD BOOKLET

Now for G.P 2, 4, 8 3 6 9

Smallest N is 74, when 74 is divided by 9, x = 0,1 + , 2 + ,3 +
19 19 19
remainder is 2, when divided by 10, remainder 22 44 66
is 4 and when divided by 11, remainder is 8. ∴ x = 0, , ,
19 19 19
So sum of digit = 7 + 4 = 11
1 
(Bonus) Case 2: f   ,1
2 
49. a1 = 9744 = 24 × 609
24 divides a1 so m = 4, f(1) = 4  1
So  f +  = 1
So a2 = 99744 = 25 × 3117  2
m = 5, f (2) = 5 3I + f + 1
∴ f =
So a3 = 999744, = 26 × 15621 20
m = 6, f (3) = 6 3I + 1
For a4 = 9999744, m = 7 f =
19
For a5 = 99999744, m = 13
1 3I + 1
For a6, m = 8  1
2 19
For a7, m = 8
17
⋮ I 6
For a10, m = 8 6
So I = 3, 4, 5
So f (1) + f (2) + f (3) + … + f (10)
10 13 16
= 4 + 5 + 6 + 7 + 13 + 5(8) = 75 ∴ f = , ,
50. Let x = I + f, I is integer part and f is fractional 19 19 19
part 67 89 111
So x = , ,
So, by given equation 19 19 19
22 44 66 67 89 111
 1 Now S = 0 + + + + + +
I + f +I +I +f +  19 19 19 19 19 19
 2
f = 399
20 =
 1 19
Case 1: f  0,  [S] = 21
 2
51. (N)10 = (503)b = (305)b + 2
 1
So  f +  = 0 ∴ N = 5b2 + 3 = 3(b + 2)2 + 5
 2
∴ 5b2 – 2 = 3 (b2 + 4 + 4b)
3I + f ⇒ 2b2 – 12b – 14 = 0
∴ f =
20 ⇒ b2 – 6b – 7 = 0
3I ⇒ (b – 7)(b + 1) = 0
f =
19 ⇒ b=7
3I 1 19 ∴ N = 5(49) + 3 = 248
0  0I 
19 2 6 ∴ Products of digits of N = 2 × 4 × 8 = 64
 19  52. Let M = 25 · 36 · 43 · 53 · 67
I  0,   I = 0,1, 2,3
 6 ⇒ M = 2 5 + 6 + 7 · 36 + 7 · 53
3 6 9 = 218 · 313 · 53
f = 0, , , For M to be c perfect square, M should be
19 19 19
multiplied by 3 · 5 = 15

NUMBER SYSTEM 123

OLYMPIAD BOOKLET

53. According to the question, P1 = 7 P2 ∈ (71, 13, 1) = 2

m2 = 104(K) + 103(K + 1) + 102(K + 2) + 101 P3 = 3 3
(3K) + K + 3 Total number = 13 + 9 + 5 + 2 + 1 = 30
= 104 K + 103 K + 102 K + 10 (3K) + K + 103 + 57. < 91> = 100
102 · 2 + 3 <120> = 121
= K (104 + 103 + 102 + 31) + 1203 <143> = 144
= K (11131) + 1203 < 180 > = 169
For K = 3 ∴ 81.121.144.169.<N> = 91.120.143.180.N
⇒ m2 = 34, 596 91 ·120 ·143 ·180 ·N
⇒ m = 186   N =
100 ·121 ·144 ·169
∴ Sum of the digits of m = 15
21
54. Let m2 = |2n + 5n – 65|  N = N
22
For n = 2, m2 = |4 + 25 – 65| = | – 36| = 62
Now to make <N> to be a perfect square, we
For n ≥ 3, m2 = |2n + 5 (5n – 1 – 13)|
can take smallest N to be 2.11.3.7 = 162
If n = 4, m2 = 576 = 242
21 3 ·7 ·2 ·11 ·3 ·7
If n ≥ 5, m2 = 2n + 5(ab25 – 13)  N  = N= = (21)2 = 441
= 2n + 5ab12 = 2n + xab 60 22 2 ·11
Which is the nearest perfect square to 462.
(where x ∈ I+)
∴ Sum of square of digits of 462 is 4 2 + 62
So, for n = 1, 3, 5, 7 … not possible as unit
+ 22 = 16 + 36 + 4 = 56
digit is 2 and 8.
58. Let us check several values of r starting from
Also, for n = 2k
2 i.e.
m2 = 4k + 5 (52k – 1 – 13)
r = 2 : {(1, 2):(2, 3) ;(3, 4) ; …(49, 50)}
⇒ m2 – (2k)2 = 5 (52k – 1 – 13)
These are 49 pairs with N = 3, 5, 7 … 99
⇒ (m – 2k) (m + 2k) = 5 (52k – 1 – 13)
r = 3 : {(1, 2, 3) ;(2, 3, 4) ; …(32, 33, 34)}
Here, last 2 digit always ends with 60 in RHS.
These are 32 pairs with N = 6, 9, 12, … 99.
So, not possible for n = 6, 8, 10, …
r = 4 : {(1, 2, 3, 4) ;(2, 3, 4, 5) ;(3, 4, 5, 6)
∴ n = 2 and 4
…(23, 24, 25, 26)}
⇒ Sum of n = 6
These are 23 pairs with N = 10, 14 … 98
55. 55 × 60 × 65
N = 5 × 11 × 12 × 5 × 13 × 5 r = 5 : (1, 2,3, 4,5 ) : (18,19, 20, 21, 22 )
N = 5 × 11 × 13 × 15 × 20 These are 18 pairs with N = 15, 20, … 100.
So, least value of largest of these integers = 20 r = 11 : {(1, 2, … 11); (2, 3, … 12); …(4, 5 …
56. If P1 and P2 are prime then 14)}
N = P1 × P2 or N = P3. r = 12 : {(1, 2, … 12) ;(2, 3, … 13)}
Primes less than so are r = 13 : {(1, 2, … 13)}
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, Observing this, we observe that N = 1, 2, 4, 8,
47 16, 32, 64 is not coming.
For P1 = 2 P2 ∈ (5, …, 47) = 13 ∴ Good numbers = 100 – 7 = 93
P1 = 3 P2 ∈ (5, …, 31) = 9 59. a, b, c ∈ I+
P1 = 5 P2 ∈ (7, 11, … 19) = ab
5 =c
a −b

NUMBER SYSTEM 124

OLYMPIAD BOOKLET

a −b 1 Now, 100 ≤ b ≤ 999

= So, 100 ≤ 2k2 + 1 | ≤ 999
ab c
Checking certain values of k, we get k ∈ [7,
1 1 1
− = 22]
b a c
These are 16 possible values by b.
1 1 1 16 pairs of (a, b).
= + ∴
b a c Alternate Sol:
so gcd (a, c) = k, a, b ∈ N and b is 3 digit
then a = kx, c = ky, which in turns gives b also a + 1 | b – 1 ⇒ b – 1 = (a + 1) k for some k ∈
to be a multiple of k. So, a, b, c all must be a N
multiple of k.
b | a 2 + a + 2  a 2 + a + 2 = b forsome  N
1 1 1
One possible solution is = +
2 3 6  a 2 + a + 2 = [(a + 1)k + 1]
i.e., a = 3, b = 2, c = 6  a 2 + a (1 − k ) + 2 − k − = 0
So, other solutions can be taken
D = (k − 1) 2 − 4(2 − k − )
a = 3k, b = 2k, c = 6k
Now, a + b + c ≤ 99 D = (k + 1) 2 + 4( − 2)
kx + ky + kz ≤ 99 ∵ a ∈ N, D = perfect square = λ2 for some λ
k (x + y + z) ≤ 99 = 9 × 11 ∈N
Lets check for the largest possible value i.e, 99 (k + 1) 2 + 4( − 2) =  2
k (x + y + z) = 99
Case 1: If = 2, D = (k + 1) 2
Suppose k = 9 and considering
a = 3 × 9 = 27 k −1 + k + 1
a= = k = 2k
b = 2 × 9 = 18 2
and c = 6 × 9 = 54. And checking k = 7, b = (a + 1) k + 1 = 2k2 + k + 1
1 1 1 k = 8, b = 106, a = 14
= + which is satisfying and giving k = 137, a = 16
18 27 54
the largest possible value of a + b + c to be 18 k = 22, b = 991, a = 44
+ 27 + 54 = 99 16 pairs of (a, b)
60. a, b ∈ N Case 2: If  2   2 − (k + 1) = 4( − 2)
a+1|b–1  ( + k + 1)( − k − 1) = 4( − 2)
b | a2 + a + 2 ⇒ Both λ + kℓ + 1 and λ – kℓ – 1 must be even
Let b – 1 = k(a + 1), where k is any positive
 + k +1 = − 2
integer.  + k + 1 = 2( − 2)
−k
b = ka + k + 1  − k −1 = 4
Now ka + k + 1 | a2 + a + 2 k + 1) = − 6
2(k + 1) = 2( − 3)
⇒ ka + k + 1 | ka2 + ka + 2k k =4 k +1 = −4
2
ka + k + 1| ka 2 + ka + 2k − ( ka 2 + ka + a )  
 
ka + k + 1 | 2k – a Not possible
Not possible
Put a = 2x, such that ka + k + 1 | 0
Then b = k (2k) + k + 1 = 2k2 + k + 1

NUMBER SYSTEM 125

OLYMPIAD BOOKLET

If we further reduce the value of λ + kℓ + 1 and .

increase λ – kℓ – 1 we can see that after .
subtracting both equation, LHS > ℓ but RHS < ℓ. (12, 1728)
Hence only case 1 (ℓ = 2) is possible 16 (32, 1024)
ordered pairs. .
  .
61.    N    = 4 (33, 1089)

(44, 1936)

4   N     5 Possible value of a = 43
   Possible values of b = 11
16  
  N    25 ∴ 43 + 11 = 54
Number of elements = 54
162  [ N ]  625 16  7
64.  
162  N  625 37  16
(256) 2  N  (625) 2 16β < 37α 16α < 7β
Largest N = (625)2 – 1 = 390624 37 16
 
Sum of digits = 24 16 7
62. { 4n + 1, 4n + 2,, 4n + 1000} 16 37

n=1 7 16
xn = [ 5, 6, 7, 8, 9, 10,, 1004] For α = 1, 2, 3 … 9, β ∉ I+
At α = 10
n=2
22.8571 < β < 23.125
x2 = [ 9, 10, 11,, 1008] β = 23
x3 = [ 13, 14 · 15,, 1012 ] 65. abc ≤ 30
and abc is not divisible by 4, 9, 25
x1000 = 4001, 4002, 4003, 5000
So abc can take values:
Mn is max. when N = 1 and N = 2 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21,
a = max (Mn) = 29 22, 23, 26, 29 and 30
Min (Mn) is when N = 1000 ∵ ab is prime.
b = Min (Mn) = 7 Case 1: When a = 1 and b is prime number.
a – b = 29 – 7 = 22 a = 1, b = 2, c = 3, 5, 7, 11, 13
6 b = 3, c = 2, 5, 7
63. t+ =5
t b = 5, c = 2, 3
∴ t2 + 6 = 5t b = 7, c = 2, 3
t – 5t + 6 = 0
2
b = 11 c = 2
t = 2, 3 b = 13 c = 2
logab = 2, logab = 3 there are total 14 triples of (a, b, c)
∴ b = a2, b = a3 Case 2: When b = 1 and a is prime number.
(2, 4) (2, 8) b = 1, a = 2 c = 15
(3, 9) . a = 3 c = 10
(4, 16) . a=5c=6

NUMBER SYSTEM 126

OLYMPIAD BOOKLET

there are 3 triples of (a, b, c). 26, 24, 24, 22

from case I and case II total 17 triples of (a, b, 25, 25, 24, 24, 21, 20, 20
c) are possible. 26 , 24 , 24 , 21 , 21
66. m2 = 4n2 – 5n + 16
25 , 25 , 24 , 23 , 23 , 22
16m2 = 64n2 – 80n + 256
16m2 = (8n – 5)2 + 231 26 , 24 , 24 , 21 , 20 , 20
(4m)2 – (8n – 5)2 = 7 × 11 × 3 25 , 25 , 24 , 23 , 23 , 21 , 21
(4m + 8n – 5) (4m – 8n + 5) = 7 × 11 × 3 26 , 24 , 23 , 23 , 22
By property and for max. of 'm'
25 , 25 , 24 , 23 , 23 , 21 , 20 , 20
4m + 8m – 5 = 1
4m – 8m + 5 = 231 26 , 24 , 23 , 23 , 21 , 21
8 m = 232 25 , 25 , 24 , 23 , 22 , 22 , 21 , 21
m = 29 26 , 24 , 23 , 23 , 21 , 20 , 20
So n = not integer 8n = – 110
25 ,25 ,24 ,23 ,22 ,22 ,21 ,20 ,20
So 4m – 8m – 5 = 77
4m + 8m + 5 = 3 26 ,24 ,23 ,22 ,22 ,21,21
8m = 80 Total 19 possible ways.
⇒ m = 10 69. We can see that for x to be a beautiful number
n=–4 It must be a product of 2 primes because such
∴ |m – n| = |10 – (–4)| = 14 a number has only two ways to express itself
67. A = {n ∈ N; p(n) ≠ 0, p(n) is square free and largest such number is equal to 95
s(n) is proper divisor of p(n)}  95 = 19 + 5 + 1 + 1 + + 1 = 19  5 111
p(n) is square free so number n can containing 71 times 71 times

digit 1, 2, 3, 5, 7 or 1, 5, 7, 6. 70. For a number to have odd divisors it must be a

(r′) is proper divisor of p(n). perfect square
so max. possible value of N ≤ 2023. Nearest square is 442
s(n) = 3 × 5 × 7 = 105. But as this is an even square
n = 442
for making digit sum 105, n contain digit 2, 3,
5 and 7 one time and digit 1, 88 times.
 d (i) →
i =1
even

s(n) = 2 + 3 + 5 + 7 + 1 × 88 = 105 Adding odd number even times makes it even

p(n) = 2 × 3 × 5 × 7 × 1 … 1 = 210 432

max. number of digits in n = 88 + 4 = 92   d (i) is odd

i =1
68. No. of ways to make 100 Bens, as per Binary
it will remain true for the numbers between
land government rules are as follows:
(442 – 432) + (422 – 412) + … + (92 – 12)
26, 25, 22
44 + 43 + 42 + 41 + … + 9 + 1
26, 24, 23, 22, 22, 21, 20, 20
26, 25, 21, 21 44
 45 = 990
25, 25, 24, 24, 22 2
26, 25, 21, 20, 20 sum of its digits = 18
25, 25, 24, 24, 21, 21

NUMBER SYSTEM 127