Olympiad 8 - Test 2

Questions
15. Prime numbers a, b and c satisfies a2 + 6b = 9 + c + b2.
Maths
Find the sum of possible values of a + b + c?
1. 1/3 1/3

Find the value of (25 + 10√5) + (25 − 10√5)

16. For positive integer n, let s(n) denote the sum of the digits
of n. If N be the smallest positive value of n satisfying s(n)
2. Suppose x1, x2, x3 are the roots of (11 – x)3 + (13 – x)3 = (24 = s(n + 864) = 20. Find (N – 35)/22.
– 2x)3. What is the sum of x1 + x2 + x3.
17. Triangle ABC with right angle at C, ∠ BAC < 45° and AB =
¯¯¯¯¯¯¯¯
3. Find the number of ordered pairs (x, y) of positive integers 4. Point P on AB is chosen such that ∠ APC = 2∠ ACP and
satisfying the condition x2 − y 2 = 12345678. CP = 1. If AP/BP = p + q√ r, where p, q, r are positive
integers and r is not divisible by the square of prime. Find
4. Points A, B, C, and D form a rectangle in that order. Point X p + q + r.
¯¯
¯¯¯
¯¯¯¯ ¯¯¯¯¯¯¯¯
lies on CD, and segments BX and AC intersect at P. If
the area of triangle BCP is 3 and the area of triangle PXC is 18. Two congruent right circular cones each with base
radius 3 and height 8 have the axes of symmetry that
2, what is the area of the entire rectangle?
intersect at right angles at a point in the interior of the
cones a distance 3 from the base of each cone. A sphere
5. In a three digit number, the unit digit is sum of the other
with radius r lies within both cones. The maximum
two digits and it exceeds the tens digits by as much as the
possible value of r2 is n , where m and n are relatively
m
ten’s digit exceeds the hundred digit. How many such
numbers exist? prime positive integers. Find m - 3n

6. 19. ABCDE is a regular pentagon inscribed in a circle of radius

If 2x = 3y = 12 then find value of
(x+2y)

xy
1. If the area of the set of points inside the circle that are
farther from A than they are from any other vertex is .
π

7. Let f(x) = x4 + ax3 + bx2 + cx + d be polynomial whose roots

k

Find k.
are all negative integers. If a + b + c + d = 2009, find sum
of digits of d. 20. Let x and y be real numbers such that x2 + y2 = 2x– 2y + 2.
8. Assume that ai ∈{1, –1} for al i = 1, 2, …., 2013. Find the If the largest possible value of x2 + y2 is a + b√2, find a + b.
least positive value of the following expression
∑ ai aj 21. Let ABCD be a quadrilateral with ∠ ABC = ∠ CDA = 45°. AB
1⩽i<j⩽2013 = 7, and BD = 25. If AC is perpendicular to CD, compute
BC2/6.
9. Determine the largest even positive integer which cannot
be expressed as the sum of two composite odd positive 22. Let d(n) be the number of all positive divisors of a natural
integers. number n ≥ 2. Find number of natural numbers n ≥ 3
such that d(n – 1) + d(n) + d(n + 1) ≤ 8.
10. Farmer John has 5 cows, 4 pigs, and 7 horses. If n be the
number of ways in which he can pair up the animals so 23. A natural number a is called is “lucky number” if the sum
that every pair consists of animals of different species? of its digits is 7. Arrange all “lucky numbers” in an
Assume that all animals are distinguishable from each ascending order, and we get a sequence a1, a2, a3, …. If an
other. Find sum of digits of n. = 2005, then find a5n/1000.

11. Let f be the set of all fractions m/n where m and n are 24. Find the number of real solutions (a1, a2, ..., a21) satisfies
positive integers with m + n ≤ 2005. If a be the largest
a1 + a2 +….+ a20 + a21 = 105 and |a1 – a2| = |a2 – a3|
number in f such that a < 16/23 expressed in lowest form
=…..=|a21 – a1|.
as m/n. Find (n - m)/6.

12. Find the number of rational solution (x, y, z) of the 25. Let P(x) = a0xn + a1xn -1 + …. + an-1 x + an with n ≥ 3.
equation x2 + y2 + z2 + 3(x + y + z) + 5 = 0. Suppose that P(x) has n real roots and a0 = 1, a1 = - n, a2 =
2

. Determine coefficients a10 if n is 11.

n −n

2
13. Determine number of primes p for which the system
p + 1 = 2x2 26. Centered at each lattice point in the coordinate plane are
p2 + 1 = 2y2 a circle with radius
1
and a square with sides of length
1

10 5
has a solution in integers x, y. whose sides are parallel to the coordinate axes. The line
segment from (0, 0) to (1001, 429) intersects m of the
14. Suppose the real numbers x and y satisfy the equations squares and n of the circles. Find (m + n - 4)/10.
x3 – 3x2 + 5x = 1 and y3 – 3y2 + 5y = 5. Find x + y
27. Three unit circles ⍵1, ⍵2 and ⍵3 in the plane have the 29. Consider a semicircle of radius 1 unit constructed on the
property that each circle passes through the centers of diameter AB. and let O be its centre. Let C be a point on
the other two. A square S surrounds the three circles in AO such that AC:CO = 2:1. Draw CD perpendicular to AO
such a way that each of its four sides is tangent to at least with D on the semicircle. Draw OE perpendicular to AD
with E on AD. Let OE and CD intersect at H. If DH = here
a
one of ⍵1, ⍵2 and ⍵3. If the side length of the square S is
√b
√a+√b+c
, find a + b + c. Here a, b and c are positive a and b are integers and b does not contain square of any
4
prime. Find a + b.
integers.
.
30. Let S be the set of all 3-digit numbers with all digits in the
set {1, 2, 3, 4, 5, 6, 7} (so in particular, all three digits are
28. For n ≥ 1 call a finite sequence (a1, a2 …an) of positive ¯
¯¯¯
¯¯¯¯

integers progressive if ai < ai +1 and ai divides ai+1 for all nonzero). If n be the number of elements abc of S such
1≤ i ≤ n – 1. Find the number of progressive sequences that at least one of the (not necessarily distinct) "digit
¯
¯¯¯
¯¯¯¯ ¯
¯¯¯
¯¯¯¯ ¯
¯¯¯
¯¯¯¯
such that the sum of the terms in the sequence is equal to cycles" abc, bca, cab is divisible by 7. Find sum of digits
360. of n. (Here, abc denotes the number whose base 10 digits
¯
¯¯¯
¯¯¯¯

are a, b, and c in that order.)

Answer Key

1 2 3 4 5

5.00 36.00 0.00 15.00 3.00

6 7 8 9 10

1.00 15.00 6.00 38.00 9.00

11 12 13 14 15

59.00 0.00 1.00 2.00 20.00

16 17 18 19 20

30.00 7.00 6.00 5.00 10.00

21 22 23 24 25

48.00 3.00 52.00 1.00 11.00

26 27 28 29 30

57.00 16.00 47.00 3.00 10.00

Solutions

1.

2.

3. x
2
− y
2
= 12345678 (x, y ∈ I
+
)

R.H.S. is even, so x, y should be both odd or both even integers but difference of square of two such integers is multiple of 4
but R.H.S is not multiple of 4.

4.

5. Let the three-digit number by xyz

z = x + y, z – y = y – x
z = 2y – x
2y – x = x + y
y = 2x, z = 3x
x:y:z=1:2:3
(x, y, z) can be (1, 2, 3), (2, 4, 6), (3, 6, 9)
Here number 123, 246, 369 are possible.

6.

7.

8. Note that
2
2 2 2 2
∑ ai aj = (a1 + a2 +. . . +a2013 ) − (a + a +. . +a )
1 2 2013
1⩽i<j⩽2013

2
= (a1 + a2 +. . . +a2013 ) − 2013

By the given condition a1 + a2 +. …+a2013 is an odd number between –2013 and 2013 Inclusive
Also note that the minimum positive integer of x2 – 2013 for an integer x is 452 –2013 = 12 when x = 45 or –45. As an
illustration , x = 45 can be achieved by taking a1 = a2 = a3 = …a45 = 1 and the others a46, a47,…a2013 to consist of equal
number of 1’s and –1’s Thus the least value is
12
= 6.
2

9. Let n be an even positive integer. Then each of the following expresses n as the sum of two odd integer: n = (n−15) + 15, (n−
25) + 25 or (n −35) + 35. Note that at least one of n−15, n −25, n −35 is divisible by 3, hence n can be expressed as the sum
of two composite odd number if n > 38. Indeed, it can be verified that 38 cannot be expressed as the sum of two composite
odd positive integers.

10. Since there are 9 cow and pigs combined and 7 horses, there must be a pair with 1 cow and 1 pig, and all the other pairs
must contain a horse. There are 4 × 5 ways of selecting the cow-pig pair, and 7! ways to select the partners for the horses. It
follows that the answer is 4 × 5 × 7! = 100800.
11. We are looking for m/n∈f with 16/23 − m/n = (16n − 23m)/23n as small as possible (and positive). Since 16 and 23 are
relatively prime, we opt to find positive integers m and n such that 16n − 23m = 1, with n is as large as possible, provided that
m + n ≤ 2005.
Solving the linear Diophantine equation 16n – 23m = 1, we find that m = -7 + 16k and n = -10 + 23k for arbitrary kZ. We must
have 1 ≤ k ≤ 51. To ensure that both m and n are positive and m + n ≤ 2005, we must have 1 ≤ k ≤ 51. So the largest n is
obtained when k = 51, and this gives n = 1163. The corresponding m when k = 51 is m = 809. So the desired a = m/n∈f. is a =
809/1163. (n - m)/6 = 59.

12. Let u = 2x + 3, v = 2y + 3, w = 2z + 3. Then the given solution is equivalent to

u2 + v2 + w2 = 7.
It is equivalent to ask that the equation
x2 + y2 + z2 = 7w2
has no nonzero solutions in integers; assume on the contrary that (x, y, z, w) is a nonzero solution with |w|+|x|+|y|+|z|
minimal.
Modulo 4, we have x2 + y2 + z2 = 7w2, but every perfect square is congruent to 0 or 1 modulo 4. Thus we must have x, y, z, w
even, and (x/2, y/2, z/2, w/2) is a smaller solution, contradiction.

13.
The only such prime is p = 7. Assume without loss of generality that x, y ≥ 0. Note that p + 1 = 2x2 is even, so p ≠ 2. Also, 2x2 ≡
1 ≡ 2y2 (mod p) which implies x ≡ ±y (mod p) since p is odd. Since x < y < p, we have x + y = p. Then
p2 + 1 = 2(p – x)2 = 2p2 – 4px + p + 1,
So p = 4x – 1, 2x2 = 4x, x is 0 or 2 and p is –1 or 7. Of course –1 is not prime, but for p = 7, (x, y) = (2, 5) is a solution.

14.

15. a2 – (b - 3)2 = c
(a – b + 3)(a + b - 3) = c
Case I. a - b + 3 = c and a + b - 3 = 1
a + b = 4 implies a = b =2
c=3
Case II. a – b + 3 = 1 and a + b -3 = c
a – b = -2 and a + b = c + 3
2a = c + 1
a = (c + 1)/2, b = (c + 5)/2

clearly c must be odd prime

for c = 5, we have a = 3, b = 5

for c = 6k + 1, b = 3(k + 1) not prime

for c = 6k + 5, a = 3(k + 1)

thus we have only two pairs (2, 2, 3), (3, 5, 5)

Sum = 20
16. First of all, notice that the smallest n with s(n) = 20 is 299. Also, if s(n + 864) = 20, s(n − 136) = 19, (because
subtracting 1000 from the number removes the 1 in the thousands place). After checking s(n − 136) for various n with s(n) =
20, we see that we need to have a carry when subtracting 136. To have this, we must either have a 2 in the tens place or a 5 in
the units place. The minimum n for the former is 929, and for the latter it is 695. We check and see that s(695 − 136) = s(559)
= 19, so our answer is 695.
(N – 35)/22 = 660/22 = 30

17.

Let O be the circumcenter of ABC and let the intersection of CP with the circumcircle be D. It now follows that ∠DOA =
2∠ACP = ∠APC = ∠DPB. Hence ODP is isosceles and OD = DP = 2.
2

Denote E the projection of O onto CD. Now CD = CP + DP = 3. By the Pythagorean Theorem, OE . Now
2 3 7
= √2 − = √
2
2 4

note that EP = 1/2. By the Pythagorean Theorem, OP .

7 1
= √ + = √2
2
4 2

AP AO+OP 2+√2
Hence it now follows that = = = 3 + 2√2
BP BO−OP
2−√2

This gives that the answer is 7.

An alternate finish for this problem would be to use Power of a Point on BA and CD. By Power of a Point Theorem, CP. PD =
1.2 = BP . PA. Since BP + PA = 4, we can solve for BP and PA, giving the same values and answers as above.

18.

Consider the cross section of the cones and sphere by a plane that contains the two axes of symmetry of the cones as shown.
The sphere with maximum radius will be tangent to the sides of each of the cones. The center of that sphere must be on the
axis of symmetry of each of the cones and thus must be at the intersection of their axes of symmetry. Let the sphere be
¯¯¯¯¯¯¯¯
tangent to AB at E. The right triangles ∆ ABD and ∆ CBE are similar, implying that the radius of the sphere is
BC BD−CD 5 15 225
CE = AD. = AD. = 3 × = = √
AB AB √82 +32 √73 73

m – 3n = 225 – 219 = 6

19.
20. (x2 + y2 – 2)2 = 4(x– y)2 = 4(2(x2 + y2) – (x+y)2)
Let x2 + y2 = t
(t – 2)2 = 8t – 4(x+y)2
(t – 6)2 = 32 – 4(x+y)2
t – 6 = 32
t = 6 + 4√2

21.

22. For even numbers k ≥ 6 we have d(k) ≥ 4, since 1, 2,

k
, k are four different divisors. It is clear that n = 3 is a solution, whereas
2

n = 5 is not. For odd numbers n ≥ 7 we have

d(n – 1) + d(n) + d(n + 1) ≥ 4 + d(n) + 4 > 8.
From now on, let n be even, if the number k ≥ 6 is divisible by 3, we have d(k) ≥ 3, since 1, 3, k are three different divisors, We
check that n = 4 and n = 6 satisfy the condition. If n ≥ 8 and n – 1 is divisible by 3, then
d(n – 1) + d(n) + d(n + 1) ≥ 3 + 4 + d(n +1) > 8.
If, on the other hand, n ≥ 8 and n +1 is divisible by 3, then we have
d(n -1) + d(n) + d(n +1) ≥ d(n – 1) + 4 + 3 > 8.
Since among the three successive integers n – 1, n, n + 1 one has to be divisible by 3, the only remaining case is that n is
divisible by 6. In this case n has the six different division 1, 2, 3, , , n, i.e. d(n) ≥ 6 for n ≥ 12. Thus, we get
n n

3 2

d(n – 1) + d(n) + d(n + 1) ≥ d(n -1) + 6 + d(n + 1) > 8.

Hence, there are no further solutions.

23. m + k − 1
Since the numebr of non – negative integer solutions of equatino x1 + x2 + … + xk = m is ( ) , when x1 ≥ 1 and xi
m

m + k − 2
≥ 0 (i ≥ 2), the number of integer solutions, is ( ) , the number of lucky numbers with k digits is P (k ) =
m − 1

k + 5 ¯¯¯¯¯¯¯¯¯¯
( ) . We know 2005 is the minimum lucky number of the type 2abcand P (1) =
6

6 7 8
( ) = 1, P (2) = ( ) = 7, and P (3) = ( ) = 28. Note that the number of four digits lucky numbers of the type
6 6 6

¯¯¯¯¯¯¯¯¯¯ 6 + 3 − 1
1abc is the number of nonnegative integer solutions of a + b + c = 6, i.e. ( ) = 28. Thus 1 + 7 + 28 + 28 + 1 = 65
6

and 2005 is the 65th lucky number, i.e. a65 = 2005, so n = 65, 5n = 325. Furthermore,
5
9 10
P(4) = ( ) = 84, P (5) = ( ) = 210, and ∑ P (k) = 330. Therefore the last six lucky numbers with 5 digits, from
6 6 k=1

the largest to the smallest, are a330 = 70000, a329 = 61000, a328 = 600100, a327 = 60010, a326 = 60001, a325 = 52000. So the
325th lucky is a325 = a5n = 52000.

24. Let |a1 – a2| = |a2 – a3| =….= |a21 – a1| = k,

Then
a1 – a2 = ± k,
a2 – a3 = ± k,
…..
a20 – a19 = ± k,
a21 – a1 = ± k,
Summing these equalities yields 0 = ±k ± k±. . . . ±k = k(±1 ± 1±. . . . ±1)


21
21

±1, ±1±. . . . ±1 is an odd number, we obtain k = 0, hence all numbers, a1, a2,……, a2n+1 are equal. Since a1 + a2 +….+ a21 =

21

105, we find a1 = a2 = …. = a21 = 5.

Therefore, only one solution a1 = a2 = …. = a21 = 5.
25. Let x1, …., xn be n real roots of the polynomial. By Viete formula we have

Then

and

The last equation shows that xi = 1 for all i, and P(x) = (x - 1)n. So coefficients are

A10 = 11C10 = 11

26. First note that 1001 = 143 x 7 and 429= 143 x 3 so every point of the form (7k, 3k) is on the line. See if you can solve the
problem with the following.

let's take the diagram for the origin to (7, 3). We have the origin circle and square intersected, then two squares, then the
circle and square at (7, 3). If we take the circle and square at the origin out of the diagram, we will be able to repeat the
resulting segment (with its circles and squares) end to end from (0, 0) to (1001, 429), which forms the line we need without
overlapping. Since 143 of these segments are needed to do this, and squares and circle are intersected with each, there
are 143 ⋅ (3 + 1) = 572 squares and circles intersected. Adding the circle and square that are intersected at the origin back
into the picture, we get that there are 572 + 2 = 574 squares and circles intersected in total.
27.

28. If the first term is x, then dividing through by x, we see that we can find the number of progressive sequences whose sum is
and whose first term is not 1. If a (k) denotes the number of progressive sequences whose sum is k and whose first
360
− 1
x

term is not 1, then we can express the answer N as follows :

N = a(359) + a(179) + a(119) + a(89) + a(71) + a(59) + a(44) + a(39)
+ a(35) + a(29) + a(23) + a(19) + a(17) + a(14) + a(11) + a (9)
+ a(8) + a(7) + a(5) + a(4) + a(3) + a(2) + a(1) + 1
The + 1 at the end accounts for the sequence whose only term is 360. Fortunately, many of these numbers are prime; we
have a(p) = 1 for primes p as the only such sequence is “p” itself. Also, a(1) = 0. So we have
N = 15 + a(119) + a(44) + a(39) + a(35) + a(14) + a(9) + a(8) + a(4)
For small k, a (k) is easy to compute : a (4) = 1, a (8) = 2, a(9) = 2. For intermediate k (e.g. k = 21 below), a(k) can be computed
recursively using previously – computed values of a (.), similar to dynamic programming. Then we have
a(14) = 1 + a(6) = 1 + 2 = 3
a(35) = 1 + a(6) + a(4) = 1 + 2 + 1 = 4
a(39) = 2 + a(12) =2 + 4 = 6
a(44) = 2 + a(21) + a(10) = 2 + 4 + 2 = 8
a(119) = 1 + a(16) + a(6) = 1 + 3 + 2 = 6
Thus the answer is N = 15 + 6 + 8 + 6 + 4 + 3 + 2 + 2 + 1 = 47
29.

AC 2
=
CO 1
1
OC =
3
2
AC =
3

OD = 1
∆ OCD: OD2 = OC2 + CD2
1
2
1 = + CD
9

8
CD = √
9

Let ∠ ADC = α
AC 2 1 √2
tan α = = = , cos α =
CD √8 √2 √3

DE DA
cos α = =
DH 2DH

DA CD
DH = {∴ cos α = }
2 cos α AD

2
2

Now, DA
2 8 2
= √( ) + (√ ) =
3 9 √3

So, DH
2 1
= =
√2
√2.
2×√3×
√3

a + b = 1 + 2 = 3.

30.