Professional Documents
Culture Documents
TIMO 2024 FRR SS Set 3 Corrected Solution Manual
TIMO 2024 FRR SS Set 3 Corrected Solution Manual
1. There are 100 problems in an international mathematics competition. The scores of each
problem are allocated in the following ways: 2 marks will be given for a correct answer, 1
mark will be deducted from a wrong answer and 0 marks will be given for a blank answer.
Find the minimum number of candidate(s) to ensure that 11 candidates will have the
same scores in the competition.
Answer: 3001
Solution. Using the Pigeonhole Principle, the least number of students such that r among
these necessarily have identical scores in a test consisting of p problems in the competition
with +2, −1, 0 marking scheme is 3p(r − 1) + 1. In the problem, p = 100 and r = 11.
Using the formula,
Therefore, the minimum number of candidate(s) to ensure that 11 candidates will have
the same scores in the competition is 3001.
2. There are n lines that are not parallel with each other on a plane. There are no 3
intersecting lines at a point. If they intersect 276 times, find the value of n2 + 24n − 2024.
Answer: −872
Solution. The number of times n lines intersect such that these lines are not parallel with
each other and no 3 lines intersect at a point is given
n(n − 1)
C2n = 276 =⇒ = 276 =⇒ n2 −n−552 = 0 =⇒ (n+23)(n−24) = 0.
2
7320248 = 7 · 85 + 3 · 84 + 2 · 83 + 0 · 82 + 2 · 81 + 4 · 80
= 229376 + 12288 + 1024 + 0 + 16 + 4
= 24270810
Then we just write down the remainders in the reverse order to obtain the hexadecimal
number which is 3B414 or 3B41416 .
6. In a quiz, no two students had the same score and the score of each student is equal to
n + 2 − 2k where n is a constant and k is the rank of that student. If the total score of
all participants is 2024, find the smallest possible value of n.
Answer: 89
Solution: Let m be the number of students taking the quiz. Then,
Observe that m must be a factor of 2024 = 23 × 11 × 23. Among the 16 factors of 2024,
by checking, both m = 44 and m = 46 give the smallest value of n which is 89.
7. Find the smallest positive integer a such that (a − 2)x2 + (a − 2)x − 2 = 0 has two distinct
real roots.
Answer: 3
Solution. To find the integer values of a such that (a − 2)x2 + (a − 2)x − 2 = 0 has two
distinct real root, its discriminant, we denote it as D, must be strictly greater than 0.
Now,
Solving the quadratic inequality we have a < −6 or a > 2. Therefore, the smallest
positive integer value of a must be 3.
8. Given that x and y are real numbers, find the minimum value of 5x2 +9y 2 +70x−72y+2024.
Answer: 1635
Solution. Observe that rearranging and manipulating the terms, we have
9. Solve the equation log9 x + log27 x + log243 x = 31. (Answer in exponential form)
Answer: 330
Solution: Using the change of base theorem, we have
X 4 X 4
2 4 2 a b c
(2x − 3x + 4) = · (2x ) · (−3x) · 4 = · 2a · (−3)b · 4c · x2a+b
a,b,c≥0
a, b, c a,b,c≥0
a, b, c
4 4!
where a, b, c ≥ 0, a + b + c = 4 and = . Since a + b + c = 4, the only
a, b, c a!b!c!
possible triples (a, b, c) so that 2a + b = 4 are (0, 4, 0), (1, 2, 1) and (2, 0, 2). Therefore, the
coefficient of x4 is given by
4 0 4 0 4 1 2 1 4
· 2 · (−3) · 4 + · 2 · (−3) · 4 + · 22 · (−3)0 · 42
0, 4, 0 1, 2, 1 2, 0, 2
4! 4! 4!
= · 20 · (−3)4 · 40 + · 21 · (−3)2 · 41 + · 22 · (−3)0 · 42
0!4!0! 1!2!1! 2!0!2!
= 1 · 1 · 81 · 1 + 12 · 2 · 9 · 4 + 6 · 4 · 1 · 16
= 81 + 864 + 384
= 1329
13. A 5-digit number has a remainder 2 when divided by 5, has a remainder 8 when divided
by 9, and has a remainder 10 when divided by 13. What is the smallest possible value of
this 5-digit number?
Answer: 10007
Solution. Let x be the 5-digit number. Observe that the given can be written and
expressed as
x ≡ 2 mod 5
x ≡ 62 mod 5
x ≡ 8 mod 9 =⇒ x ≡ 62 mod 9 .
x ≡ 10 mod 13
x ≡ 62 mod 13
Since all of the moduli are relatively prime, we know that by the Chinese Remainder
Theorem that this system of linear congruences has a solution modulo the product of
the moduli, i.e., 5 × 9 × 13 = 585. We need to find the smallest 5-digit number x with
remainder 62 at modulo 585. Observe that the largest 4-digit number which is a multiple
of 585 is 9945 = 17 · 585. Therefore, the smallest possible value of the 5-digit number is
9945 + 62 = 10007.
1 1
14. Given a real number x > 0 and − x = 7. Find the value of x5 − 5 .
x x
Answer: −18557
1
Solution. Let x − = −7. Then
x
2 3
1
1 x− = (−7)3
x− = (−7)2 x
x
1 3 1 1
x2 − 2 + 2 = 49 x −3 x− − 3 = −343
x x x
1 1
x2 + 2 = 51 x3 − 3 = −364
x x
Observe that
2 1 1 1 1
x + 2 x − 3 = x5 − + x − 5
3
x x x x
5 1 1
(51)(−364) = x − 5 + x −
x x
1
−18564 = x5 − 5 − 7
x
1
−18557 = x5 − 5
x
768
x+8= .
768
−8 +
768
−8 +
768
−8 +
−8 + · · ·
768
x+8=
768
−8 +
768
−8 +
768
−8 +
−8 + · · ·
768
x = −8 +
x
2
x = −8x + 768
0 = x2 + 8x − 768
0 = (x + 32)(x − 24).
Hence, there are two possible values of x, i.e., x = −32 and x = 24. Therefore, the
maximum value of x is 24.
16. Let x, y, z be positive integers such that x3 − xyz = −16, y 3 − xyz = 3, and z 3 − xyz = 40.
Find the value of x4 + y 4 + z 4 .
Answer: 353
Solution. Let m = xyz. Multiplying the three equations, we have
80
Solving this equation, we obtain m = 24 or m = − . Since m = xyz > 0, we take
27
m = xyz = 24. This further implies that then x = 2, y = 3, and z = 4. Therefore,
x4 + y 4 + z 4 = 24 + 34 + 44 = 16 + 81 + 256 = 353.
Answer: 625
3 √ 3 √
q q
Solution. Let x = 5+2+ 5 − 2. Using the formula (a+b)3 = a3 +b3 +3ab(a+b),
we have
3
√ √
q q
3 3 3
x = 5+2+ 5−2
√ √ r
√ √ 3 √
q 3 √
q
x3 = 5+2 + 5−2 +3 3
5+2 5−2 5+2+ 5−2
√
x3 = 2 5 + 3x
√ √
Rearranging and factoring the equation we obtain x − 5 x2 + 5x + 2 = 0. Since
√
the quadratic has no real roots, we must have x = 5. Thus,
" q 2024 #
3 √ 3 √ √ 2024
q
= 51012 = 51012 .
5+2+ 5−2 = 5
The last three digit of the powers of 5 follow the pattern 005, 025, 125, 625, 125, 625, . . ..
It follows that the three digit of 51012 is 625.
3
19. In ∆ABC, BC = 5, AC = 4 and cos(A − B) = . Find the value of cos C.
4
37
Answer:
44
Solution. Consider the illustration below.
3
Let D be a point on BC such that DA = DB. Then cos ∠DAC = cos(A − B) = . Let
4
DA = DB = x. Hence, DC = 5 − x and applying cosine law in ∆DAC gives
2 2 2 3
(5 − x) = x + 4 − 2(x)(4)
4
9 9 11
which gives us x = . Thus, DA = and DC = . Applying cosine law on ∆DAC
4 4 4
again, we have 2 2
2 11 9
4 + −
4 4 296 37
cos C = = = .
11 352 44
2·4·
4
20. The side lengths of a triangle are 35, 39, and 46. Find the area of this triangle. (Answer
in terms of simplest surd form.)
√
Answer: 210 10
35 + 39 + 46
Solution. Using Heron’s formula with semiperimeter s = = 60, we have
2
p
Area∆ = 60(60 − 35)(60 − 39)(60 − 46)
√
= 60 × 25 × 21 × 14
√
= 22 × 3 × 5 × 52 × 7 × 3 × 2 × 7
√
= (2 × 3 × 5 × 7) 2 × 5
√
Area∆ = 210 10.
Answer: 100◦
Solution. By the property of incenter,
∠JKL ∠JLK
∠IKL = and ∠ILK = .
2 2
Furthermore,
15
22. For acute angle θ satisfying tan θ = , find the value of sin 2θ − cot θ sin θ.
8
104
Answer:
289
Solution. Using trigonometric identities,
2
15 15 17 8
tan θ = =⇒ 1+ = sec2 θ =⇒ sec θ = =⇒ cos θ = .
8 8 8 17
8 15
Also, since angle θ is acute, cos θ = implies that sin θ = using the Pythagorean
17 17
23. Let G be the centroid of △ABC. If the distance from G to the sides AB, BC, and CA
are 20, 12 and 15 respectively, find the length of BG.
√
Answer: 10 13
Solution. Let M be the midpoint of AC. Since BM = 3GM , the distance from B to AC
is three times the distance from G to AC, i.e. 15 × 3 = 45.
Similarly, the altitudes from A and C have lengths 12×3 = 36 and 20×3 = 60 respectively.
As the length of an altitude is inversely proportional to the corresponding base, we have
1 1 1
AB : AC : BC = : : = 3 : 4 : 5.
60 45 36
2024
Answer:
2025
Solution: Note that
−1 1 −1 (2k + 1) − (2k − 1)
tan = tan = tan−1 (2k + 1) − tan−1 (2k − 1).
2k 2 1 + (2k + 1)(2k − 1)
Hence,
−1 1 −1 1 −1 1
tan tan + tan + · · · + tan
2 · 12 2 · 22 2 · 20242
= tan tan−1 (3) − tan−1 (1) + · · · + tan−1 (2 · 2024 + 1) − tan−1 (2 · 2024 − 1)
1 1 1
25. How many number(s) of sets of integral solutions do + = have?
x y 2028
Answer: 149
Solution. Given the equation, we have
1 1 1
+ =
x y 2028
2028y + 2028x = xy
xy − 2028x − 2028y = 0
xy − 2028x − 2028y + 20282 = 20282
(x − 2028)(y − 2028) = 20282
Observe that the 20282 = 24 × 32 × 134 . Hence, the number of divisors of 20282 is
26. Six mathematicians, four physicists, two chemists and two biologists take part in a chess
tournament. The fourteen players are to compete in seven pairs by drawing lots. What
is the probability that no two mathematicians play against each other?
64
Answer:
429
Solution. Randomly arrange the players in a row, which can be done in 14! ways, so that
the two leftmost players compete against each other, the next two compete against each
other and so on. Now suppose we want no two mathematicians to play against each other.
Then there are 14 possible positions for the first mathematician, then 12 position for the
second mathematician, and similarly 10 for the third, 8 for the fourth, 6 for the fifth and
4 for the last. After the positions of the mathematicians are fixed, there are 8! ways to
arrange the positions of the non-mathematicians. Hence the answer is
14 × 12 × 10 × 8 × 6 × 4 × 8! 64
= .
14! 429
(8 + 5 + 7)! 20!
= = 99768240.
8! × 5! × 7! 8! × 5! × 7!
28. How many ways are there to arrange 12 identical red balls, 6 identical green balls, and 6
identical blue balls in a row so that no two adjacent balls are of the same color?
Answer: 7392
Solution. Consider the following cases:
Case 1: No green ball and blue ball are adjacent to each other.
In this case, the red ball must either occupy the 1st , 3rd , 5th , . . . , 23rd positions or 2nd , 4th , 6th ,
. . . , 24th positions. In each case, there are C612 = 924 ways to arrange the green and blue
balls. Hence, there are altogether 924 × 2 = 1848 ways in this case.
Case 2: A green ball and a blue ball are adjacent to each other.
We place the ‘green-blue pair’ first. Since half of the total number of balls are red, and
that no two red balls may be adjacent, the number of empty spaces before and after this
pair must be both odd. Hence, there are 11 choices of positions of this pair, i.e., 2nd and
3rd , 4th and 5th , . . . , 22nd and 23rd . Of course, there are 2 ways to arrange the two balls
among the pair. After this pair is placed, the position of the red balls are fixed, e.g., if
the pair is placed in the 6th and 7th positions, then the red balls must be placed at the
1st , 3rd , 5th , . . . , 24th positions, and there are C510 = 252 ways to arrange the remaining 4
green balls and 4 blue balls. Hence, there are altogether 11 × 2 × 252 = 5544 ways in this
case.
Combining the two cases, the number of ways is 1848 + 5544 = 7392.
29. Kean, Kian, and Keanne get 2024 candies together. How many different combination are
there if each of them gets at least two candies?
Answer: 2039190
Solution. Let a, b, and c be the number of candies Kean, Kian, and Keanne get, respec-
tively. If the get 2024 candies altogether, we have a + b + c = 2024 with a, b, c ≥ 2. This
further implies that a − 2, b − 2, c − 2 ≥ 0. Using the stars and bars formula, the number
(2024−3(2))+3−1
of combinations for at least each of then get two candies is C3−1 = 2039190.
Case 1: One number is a multiple of 4 and another is a multiple of 7, none of which is 28.
5
The probability that a number is a multiple of 4 but not the number 28 is while the
25
3
probability that a number is a multiple of 7 but not the number 28 is . Since there are
24
2 ways to do these, hence we have
5 3 1
2× × = .
25 24 20
1 1 3 23
+ + = .
20 60 100 300