1

Let a1 a2 ... a25 2015 , where a1 , a2 ,..., a25 are positive integers. If d is the
greatest common divisor of a1 , a2 ,..., a25 , find the largest possible value of d.

Ans:

Since 2015 5 13 31 and 2015 a1 a2 ... a25 25d , we must have

2015
d
80
25
. It follows that the largest possible value of d is 65.

This could be attained by a1 a2 ... a29 65 and a30 130 .

2
2
Find the number of integer pairs a, b which satisfy a ab b 2014 ?

Ans:

2
2
It is easy to see that a, b must be both even. Otherwise, a ab b is odd.
2
2
However, if a, b are both even, a ab b is a multiple of 4. This is impossible.

Hence, there is no solution, i.e., 0 pairs.

Given two fair dice, one with the numbers 1,2,2,3,3,4 on its faces and the other
with the numbers 1,3,4,5,6,8 on its faces, one throws the two dice together and
obtains two numbers. If the probability that the sum of these two numbers is 5
equals x% , find the largest integer not exceeding x.

Ans:

We denote the numbers on the dice 1,21,22 ,31,32 ,4 and 1,3,4,5,6,8 respectively.
Out of the 36 possible outcomes, 1,4, 21,3, 22 ,3, 4,1 give a sum of 5.
1
Hence, the probability is 9 , about 11%.

Given a function f such that f 2015 x f 2015 x for any real number x, if
f has exactly four distinct real roots a, b, c, d , find a b c d .

Ans:

Since for any real number x, f 2015 x f 2015 x , we conclude that the
graph of f is symmetric about the line x 2015 .

Hence, a b c d 2015 4 8060, because the roots are symmetric about the
line x 2015 .

Tom and Jerry each has pocket money in S$1 coins. If Tom gives Jerry n dollars,
then Jerrys money is twice Toms money. If Jerry gives Tom S$2, then Toms
money is n times Jerrys money. Find the sum of all possible value of n.

Ans:

Suppose Tom and Jerry has x, y dollars respectively.

y n 2x n
We have
.
x 2 n y 2

It is easy to see that x ny 2n 2 and hence, y n 2ny 3n 2 .

Now y

7n 4
14n 8
15
7
, i.e., 2 y
.
2n 1
2n 1
2n 1

This is only possible when 2n 1 1, 3, 5 or 15.

One may check that n 1, 2, 3 and 8 satisfy the condition, i.e., the sum is 14.

a 2 bc 2a 10 0
Let a, b, c be real numbers such that 2
.
2
b

bc

12
a

15

Find the product of the smallest and largest possible value of a.

Ans:

We have bc a 2 2a 10 .
Hence, b 2 2bc c 2 12a 15 a 2 2a 10 , i.e.,

b c 2 a 2 10a 25 a 52 .
It follows that a 5 4a 2 2a 10 , or a 2 6a 5 0 .
2

Hence, 1 a 5 and the sum is 6.

Find the largest positive integer n satisfying: there exists a unique positive integer
k such that

Ans:

We have

8
n
7

.
15 n k 13

15 n k 13
7 k 6

, i.e.,
8
n
7
8 n 7

One may write it as

98 k 96

.
112 n 112

If n 112 , k 97 is the unique solution.

If n 112 , one sees that

98n 112k 96n

has more than one solution,

112n 112n 112n

because there exist at least two multiples of 112 between 96n and 98n .
In conclusion, the largest possible value of n is 112.

In ABC , AB 35 , BC 56 and AC 49 . P, Q are points on AB, AC

respectively such that the circumcircle of APQ is tangent to BC. Refer to the
A

diagram below on the right.

Find the smallest possible length of PQ.
Ans:

Let R be the circumradius of APQ .

Notice that PQ 2 R sin A where A is a constant.

Hence, PQ attains the smallest value when R is the smallest.

Since the circle touches BC, the diameter is at least the height from A to BC.
It is easy to see that the height is

AB AC sin A 35 7

sin A .
BC
8

Hence, the minimal value of PQ is

35 7
sin A2 35 7 1 cos 2 A
8
8

2
2
35 7 AB 2 AC 2 BC 2 35 7 52 7 2 82

1
1

8
2 AB AC
8 2 5 7

2
35 7 1 35 7 48

30.
8 7
8 49

Note: One should avoid tedious calculation!

Find the smallest prime number p such that p 3 6 p 2 9 p has exactly 30 positive
factors.

Ans:

p 3 6 p 2 9 p p p 3 . Clearly, p 2 or 3 does not satisfy the condition.

2

Now p and p 3 are coprime. It follows that p 3 has 15 positive factors.

2

Notice that p 3 is even. We must have p 3 2 M , where is even and

2

1 | 15 .
If 14 , M 1 and p 3 214 . We have p 27 3 131 .
2

If 4 , M has 3 positive factors. We must have M q 2 .

When q 3 , p 3 24 32 , i.e., p 15 .
2

When q 5 , p 3 24 52 , i.e., p 23 .
2

If 2 , M has 5 positive factors. We must have M q 4 .

When q 3 , p 3 22 54 , i.e., p 53 is the smallest.
2

In conclusion, 23 is the smallest such prime number.

A

10

Refer to the diagram on the right. AB touches O at A.

C
O

C is a point inside O and BC intersects O at D.

Given AB 6 , BD CD 3 , OC 2 and the area of the circle is k , find k.
Ans:

Refer to the diagram below.

We have BD BE AB2 by Tangent Secant Theorem.
Hence, BE 12 and CE 6 .
By Intersecting Chords Theorem, CD CE 18 CF CG
Notice that CF CG r OC r OC r 2 4 , where r denotes the radius of the
circle. It follows that r 2 22.

A
G
E

C
O
F

11

Let x1 , x2 ,..., x2015 be positive real numbers. Find the smallest possible value of
x1

Ans:

x2
x
x4
x2015
4
3
...

.
x1 x1 x2 x1 x2 x3
x1 x2 ...x2014 x1 x2 ...x2015

Applying AM-GM to the last two terms gives

x1

x2
x
x4
x2015
4
3
...

x1 x1 x2 x1 x2 x3
x1 x2 ...x2014 x1 x2 ...x2015

x1

x2
x
x4
x2014
3
...
2
x1 x1 x2 x1 x2 x3
x1 x2 ...x2013

4
x1x2 ...x2014 2

x1

x2
x
x4
x2014
4
3
...

x1 x1 x2 x1 x2 x3
x1 x2 ...x2013 x1 x2 ...x2014

Now apply the argument repeatedly. We have

x1

x2
x
x4
x2015
4
4
3
...

x1 4.
x1 x1 x2 x1 x2 x3
x1 x2 ...x2014 x1 x2 ...x2015
x1

This could be achieved when x1 x2 ... x2015 2 .

12

For any positive integer n, we define an as the smallest positive integer such that

an ! is a multiple of n. If
Ans:

Since an

an 2
, find n.
n 5

2
n , n must be a multiple of 5.
5

Let n 5k . Notice that if k 6 , 5k | k! , which implies an k .

This is impossible because k

n 2
n.
5 5

Hence, k 1, 2, 3, 4 or 5.
Notice that a5 a10 a15 a20 5 and a25 10 , i.e., n 25.

13

How many sequences a1 , a2 ,..., a9 could be formed using 1,2,...,9 without

repetition such that each term in the sequence is either greater than every term in
front of it, or smaller than every term in front of it? For example, 543678921 is
one such sequence.

Ans:

We consider the general case for a1 , a2 ,..., an using 1,2,..., n .

Let I n denote the number of sequences satisfying the condition.
Suppose ai n . We must have an 1 because it must be smaller than every term
in front of it. Similarly, an1 2 , an2 3 and ai 1 n i .
For a1 , a2 ,..., ai 1 , there are exactly I i 1 way to arrange the remaining numbers.
Hence, I n 1 I1 I 2 ... I n1 .
Notice that I n 1 I1 I 2 ... I n2 I n1 2I n1 .
Since I 2 2 , we have I n 2n1 and in particular, I 9 256.

14

Refer to the diagram below on the right. Given that the radius of O is 12, P is a
point outside O and OP 24 . A line passing through P intersects O at A, B .
Let C, D be the point symmetric to A, B about the line OP. If AD, BC intersect
at Q, find OQ.

Ans:

1
Notice that BAQ BOD BOE .
2

A
P

Hence, A, B, O, Q are concyclic.

We have PO PQ PA PB by Tangent Secant Theorem.

Now PA PB is the power of P with respect to O and one may show (by
Tangent Secant Theorem) that PA PB OP 2 OE 2 242 122 3 122 .
It follows that PQ

PA PB 3 122

18 .
OP
24

Hence, OQ OP PQ 6.

B
A
P

C
D

15

Movie tickets are sold at S$5 each. 10 people queue up to purchase the tickets,
where 5 of them each hold a five-dollar note, and the other 5 each hold a tendollar note. However, the receptionist did not bring any cash. These 10 people
queue up randomly, and the receptionist will be complained if he fails to give
change to anyone. If the probability that the receptionist will not be complained is

x% , find the largest integer not exceeding x.

Ans:

10
252
There are 5
ways to receive 5 five-dollar notes and 5 ten-dollar notes

sequentially.
Note that this is equivalent to the number of ways travelling from A to B in 10
unit length in the following diagram. One may perceive travelling towards right
for one unit as receiving a five-dollar note, while travelling downwards for one
unit means receiving a ten-dollar note.

If the receptionist is not complained, it means at any stage, he would not receive
more ten-dollar notes than five-dollar notes. This is equivalent to travelling from
A to B while staying in the upper triangular region and not crossing the main
diagonal. One may easily see that there are 42 ways (using addition).

42 1

Hence, the probability is 252 6 , about 16%.