Senior PreRMO 22

GT 10
October 26, 2022

1. n Indian and 5 American couples meet at a party and shake hands. If no

wife shakes hands with her husband and no Indian wife shakes hands with
a male, if the number of hand shakes that takes place in the party are 280
find n.
ans: 10
sol: There are n+5 men and 5 American women who exchanged n+10


2 −5
handshakes .
While n + 5 women exchanged n2 + 5n handshakes.

(n + 10)(n + 9) n(n − 1)
−5+ + 5n = 280
2 2
n2 + 14n + 40 = 280
n2 + 14n − 240 = 0
(n − 10)(n + 24) = 0

2. AOB is a quarter of a circle with center O . Find the ratio of the inradius
of 4AOB to the radius of the largest circle that can be inscribed in the

1
 minor segment determined by chord AB.

ans: 02
sol: Let r be the radius of largest circle with center√
O.
√
Let the inradius of 4OAB be a , then a = 12 2r − 2r = √r2 ( 2 − 1).
Also let b be the radius of the largest circle that can be inscribed in the
minor segment determined
√ by chord AB.
Then 2b + a(1
√ + 2) = r
√
∴ 2b + √r2 ( 2 − 1)(1 + 2) = r
∴ 2b + √r2 = r
√
∴ 2b = √r2 ( 2 − 1) = a

3. The product of a fifty positive integers is equal to a fifty. What is the

greatest sum these fifty numbers can have?
ans: 99
sol:If two of the numbers a and b are both greater than 1 , then

(a − 1)(b − 1) > 0
ab − a − b + 1 > 0

and
ab + 1 > a + b
That is to say, the numbers ab and 1 yield a sum greater than a + b
without altering the product (ab · 1 = a · b). Therefore, changing all such
pairs (a, b) to (ab, 1), the maximum sum is obtained when all the numbers
are 1 except the final ab. Since the total product is a fifty, the final ab
must itself be a fifty, giving a maximum sum of (49 + 50) = 99.
4. Find the number of ordered triples (x, y, z) of integers such that

x4 + y 4 + z 4 − 4x2 y 2 − 4y 2 z 2 − 4x2 z 2 = 24

ans:00
sol: Clearly for any such solution x4 + y 4 + z 4 is even so each of x, y, z is
even. Hence each term on LHS is divisible by 16 so 16|LHS but 16-RHS
so no solution.
5. Let A1 , A2 , . . . . . . , Am be non-empty subsets of {1, 2, 3, . . . , 100} satisfying
the following conditions:
1. The numbers |A1 | , |A2 | , . . . , |Am | are distinct.

2
 2. A1 , A2 , . . . , Am are pairwise disjoint.
(Here |A| denotes the number of elements in the set A ) Then, the maxi-
mum possible value of m is
ans: 13
Sol. We have, A1 , A2 , A3 . . . ., Am are non-empty subsets of {1, 2, 3, . . . , 100}
|A1 | , |A2 | , . . . , |Am | are distinct.
∴ A1 ∪ A ∪ A3 . . . ∪ Am = {1, 2, 3, . . . , 100}
Let |A1 | = 1 |A2 | = 2 . . . . |Am | = M
A1 , A2 , A3 . . . , Am are disjoint set.
∴ |A1 | + |A2 | . . . + |Am | = 100
1 + 2 + 3 . . . . + m = 100
m(m + 1)
= 100
2
m2 + m − 200 = 0
√ √
−b ± b2 − 4ac −1 ± 1 + 4 · 1 · 200
= =
√
2α √ 2·1
−1 ± 1 + 800 −1 + 801
= =
2 2
−1 + 28.30 27.30
= = = 1665
2 2
1 + 28.30 29.30
m= = = 14.65
2 2
∴ m < 14
∴ Maximum possible of m is 13 . (14th set will have same size as that of
previous size)
Or easy method 14×152 = 105 > 100 and 13×14
2 = 91 = 100 − 9
So we can have | Ax |= x for x = 1 to 12 and | A13 |= 13 + 9 = 22 will
work.
6. M is an arbitrary point on the median AA0 of 4ABC and CM meets AB
AM ·BN
at N Find the ratio M A0 ·AN

ans: 02
AM AN
Claim: M A0 = 2 · N B
Let the straight line through A0 parallel to CM N meet AB at D . Then,
in 4BCN, A0 bisects BC and A0 D is parallel to CN , implying that D is
the midpoint of BN . Now, in 4ADA0 , N M is parallel to DA0 , and so
AM AN
=
M A0 ND

3
 and since N D = 12 N B, we have
AM AN
=2·
M A0 NB
√ √
7. Let f (x) = ( x+ 2)2 (x > 0) and for {an } , a1 = 2, n > 2, an > 0, Sn =
f (Sn−1 ). Find the largest value of n such that the term an ≤ 300.Where
Sn denotes the sum of first n terms of the sequence an .
ans: 75 √ √ 2
Solution: √ 2to f (x) = ( x + 2) and Sn = f (Sn−1 ), we have
p According
Sn = ( Sn−1 + 2) .
√ p √
It means Sn − Sn−1 = 2.
√ p √ p p √ √ √
Thus Sn − Sn−1 = 2, Sn−1 − Sn−2 = 2, · · · , S3 − S2 =
√ √ √ √
2, S2 − S1 = 2. √ √ √
Adding the above √ √ to obtain √ Sn −√ S1 = (n − 1) 2. Since
equations
S1 = a1 = 2, then Sn = 2 + (n − 1) 2 = n 2.
Hence Sn = 2n2 , (n ∈ N ∗ ) .an = Sn − Sn−1 = 2n2 − 2(n − 1)2 = 4n − 2
when n > 2 And a1 = 2 when n = 1.
Therefore, an = 4n − 2 (n ∈ N ∗ ).
8. The n-digit number An = 1599 . . . 9984, n ≥ 4, contains (n − 4)9
√’s. Bn is
the number obtained from A by writing it backwards. Find 1000
47 A2021 B2021 ,
where {x} denotes the fractional part of x.
ans: 00

Prove that the product An Bn is always a perfect square. Observe that

An = 1599 . . . 9984 = 1600 . . . .0000 − 16 = 16 10n−2 − 1

and
Bn = 4899 . . . 9951 = 4900 . . . 0000 − 49 = 49 10n−2 − 1

hence
2
An Bn = 4 · 7 10n−2 − 1


9. D and E are points of trisection on the sides AC and AB of equilateral

triangle ABC, and BD and CE meet at P . Find ∠AP C.

4
 ans: 90
sol:
Claim: ∠AP C is a right angle.
Proof: Since D and E are points of trisection, the triangles AEC and
BDC are congruent (SAS):
2
AC = BC, AE = ( of a side of 4ABC) = DC, ∠A = ∠C = 60◦
3
Thus ∠AEC = ∠BDC, that is, the exterior angle of quadrilateral AEP D
at D is equal to the interior angle at E, and it follows that the quadrilateral
is cyclic. Now, in 4AED, EA is twice side AD and the angle between
them is 60◦ , making it a 30◦ − 60◦ − 90◦ triangle with the right angle at
D. Thus the circle on diameter EA goes through D, and since AEP D is
cyclic, it also goes through P . The diameter EA, then, also subtends a
right angle at P and the conclusion follows.
10. Find the number of irrational roots of the equation x2 − 12[x] + 20 = 0.
ans: 02
sol: As x2 − 12x + 20 ≤ x2 − 12[x] + 20 = 0
∴ (x − 2)(x − 10) ≤ 0
∴ x ∈ [2, 10]
∴ [x] ∈ {2, 3, 4, · · · , 10}

[x] x2 = 12[x] − 20 x
2 4 2 a solution
3 16 √4 not a solution
4 28 √28 not a solution
5 40 40 not a solution
√
6 52 52 not a solution
7 64 √ 8 not a solution
8 76 [ 76] = 8 a solution
√ 
9 88 88 = 9 a solution
10 100 10 a solution
√ √
So irrational roots are 76, 88.

11. Let for odd integers n ≥ 3,

 
1 1 1
f (n) = 1 + + + · · · + (n − 1)!
2 3 n−1

Find the remainder when 47 divides f (2021)

ans:00
sol:
Claim: f (n) is always divisible by n.

5
  
1 1 1
Let N = 1 + 2 + 3 + ··· + n−1
Since n is odd, the n − 1 terms in N go together into n−1
2 pairs to yield
     
1 1 1 1 1
N = 1+ + + + + + ···
n−1 2 n−2 3 n−3
 
1 1
+ +
(n − 1)/2 (n + 1)/2
n n n n
= + + + ··· +
1(n − 1) 2(n − 2) 3(n − 3) [(n − 1)/2][(n + 1)/2]

Since the product of all the denominators here is just (n − 1)!, clearing of
fractions at this point yields terms which have a common factor n, and
the conclusion follows.
Hence 2021 | f (2021) and 2021 = 452 − 22 = 43 × 47
12. Let S = {1, 2, 3, . . . , ṅ} and A = {(a, b) | 1 ≤ a, b ≤ n} = S × S. A subset
B of A is said to be a good subset if (x, x) ∈ B for every x ∈ S. Let Sn
be the number of good subsets of A. Find the number of values of n for
which τ (Sn ) = the number of factors of Sn is a prime number less than
100.
ans: 06
sol: Clearly n elements viz (1, 1), (2, 2), · · ·, (n, n)
must always belong to
any good subset, while each of remaining n2 − n elements of A have a
choice.
Hence the number of good subsets Sn = 2n(n−1) .
∴ τ (Sn ) = n(n − 1) + 1
Let f (n) = τ (Sn ) = n(n − 1) + 1
So we get required primes for f (2) = 2, f (3) = 7, f (4) = 13, f (6) =
31, f (7) = 43, f (9) = 73.
13. Let α and β are the roots of quadratic equation x2 − x − 1 = 0. If
αn −β n −a2010
an = α−β , n = 1, 2, 3, . . . . . . . . . then find the value of a2012 a2011 Ans.
2
01 If α and β are the roots of quadratic equation x − x − 1 = 0 then
α2 − α − 1 = 0 and β 2 − β − 1 = 0
ans: 01
(α2012 −β2012 ) − (α2010 −β2010 ) 2012 2012 2010
+β 2010
For a2012 −a2010
a2011 = (α−β) (α−β)
(α2011 −β 2011 ) = α −βα2011 −α −β 2011 ⇒
(α−β)
α2010 (α2 −1)−β 2010 (β 2 −1)
α2011 −β 2011
α2010 (α)−β 2010 (β)
⇒ α2011 −β 2011 = 1.

14. Find the number of tuples of nonzero real numbers (x, y, z, t) satisfy the

6
 system of equations
x(yz + zt + ty) = 0
y(xz + xt − zt) = 0
z(xt + xy − ty) = 0
t(xy + xz − yz) = 0
ans: 00
Sol:We will prove that at least one of x, y, z, t must be equal to zero; in
fact, show that at least two of them must be zero.
If none of the variables is zero, the equations can be satisfied only if each
of the bracketed factors is zero. In this case, if each bracket is divided by
the product of the three variables it contains, we would have
1 1 1
+ + = 0 − − − (1)
t y z
1 1 1
+ − = 0 − − − (2)
t z x
1 1 1
+ − = 0 − − − (3)
y t x
1 1 1
+ − = 0 − − − (4)
z y x

Adding (2), (3), and (4), and using (1), we get − x3 = 0, which is impossible.
Hence at least one of the variables must be zero.
Now, if x = 0, then the equation y(xz + xt − zt) = 0 yields −yzt = 0
implying a second variable must also be zero; similarly for the other cases.

15. A and B are positive integers in the decimal system such that (i) A = 7B
and (ii) the sum of the digits of A is twice the sum of the digits of B.
If C is the number formed by writing the digits of B immediately after
the digits of A, Find the remainder C (mod 9 )
ans: 00
sol: If B has k digits, then

C = (. . . digits of A . . .)(. . . the k digits of B . . .)

= A · 10k + B
= 7B · 104 + B
= B 7 · 10k + 1

Let S(n) denote the sum of the digits of the integer n. It is given that

S(A) = 2 · S(B)

Hence
S(C) = S(A) + S(B) = 3 · S(B)

7
 and as 3 | n if and only if3 | S(n) , it follows that 3 | C, i.e.,

3 | B 7 · 10k + 1

But
S 7 · 10t + 1 = S(700, ..01) = 8

implying that 7 · 10k + 1 is not divisible by 3 , and so it must be that 3 | B.

Thus 3 | S(B), making S(C) = 3 · S(B) = 3(3t) = 9t, for some positive
integer t and 9 | C .
16. A group of 11 scientists wants to design a cabinet in which to keep their
top secret papers. They propose to outfit the cabinet with a set of locks
and supply a certain number of keys to each scientist so that the cabinet
can be opened only when a majority of the scientists is present, that is,
(i) the group of 5 or fewer is not able to open all the locks, and
(ii) every group of 6 or more is to have keys for all the locks. Let L is the
minimum number of locks that must be built into the cabinet and K is
the minimum number of keys each scientist must be given. Find the value
of S(L) − S(K),where S(n)denotes the sum of the digits of n.
ans: 03
Clearly there must be a lock LABCDE which the 5 scientists (A, B, C, D, E)
cannot open, and also a lock LABCDF which keeps out the minority
(A, E, C, D, F ). But these two locks can’t be the same, for F has a key
for LABCDF but not for LABCDE :
The majority (A, B, C, D, E, F ) can open all the locks, but none of A, B, C, D, E
is able to open LABCDE ; thus it must be F who has the key to this lock.
Thus there needs to be a different lock LP QRST for each subset {P, Q, R, S, T }
of 5 of the scientists. Therefore the project would require
 
11
= 462 different locks,
5

and since each scientist thus carry a key for each subset of 5 other sci-
entists. (which his presence converts from a minority to a majority, thus
requiring him to supply the key to the lock they can’t open), each scientist
would be obliged to carry around.
 
10
= 252 different keys.
5

All of which goes to show that some things that sound plausible are utterly
impractical.
17. Let a, b, c be the side-lengths of triangle ABC with a + b + c = 12. Deter-
mine the smallest value of
a 4b 9c
M= + +
b+c−a c+a−b a+b−c

8
 ans: 11
Solution. Put
b+c−a c+a−b a+b−c
x= ,y = ,z =
2 2 2
Then x, y, z > 0, and
a+b+c
x+y+z = = 6, a = y + z, b = z + x, c = x + y
2
We have
y+z 4(z + x) 9(x + y)
M= + +
2x 2y 2z
     
1 y 4x z 9x 4z 9y
= + + + + +
2 x y x z y z
r r r !
1 y 4x z 9x 4z 9y
≥ 2 · +2 · +2 · = 11
2 x y x z x z

The equality occurs in the above if and only if

 y 4x
 x= y
z 9x
x = z
 4z 9y
y = z

or 
 y = 2x
z = 3x
2z = 3y


Since x + y + z = 6 we receive x = 1, y = 2, z = 3. Thus min S = 11 if and

only if (a, b, c) = (5, 4, 3)
18. (Proposed by Gordon Lessells, Limerick University.) 4ABC is right an-
gled at A and AD is the altitude from A . If E is the midpoint of DC
and AB is extended its own length to F , Find the angle between lines F D
and AE .

ans: 90
With the midpoints of AF and DC figuring prominently, one’s suspicion
might be aroused that other midpoints could be important. Accordingly,

9
 if M is the midpoint of AD , then M E joins the midpoints of two sides
of 4ADC and is therefore parallel to the third side AC. But AC is given
perpendicular to AB, and so EM is also perpendicular to AB, in which
case it lies on the altitude from E in 4ABE. But in 4ABE, AD is the
altitude from A, and so M is actually the orthocenter of 4ABE.
Thus BM lies along the third altitude of 4ABE, making BM perpendic-
ular to AE. But because B and M are midpoints of sides of 4AF D, BM
is parallel to F D, and it follows that F D is also perpendicular to AE.
19. If 10 equally-spaced points around a circle are joined consecutively, a con-
vex regular inscribed decagon P is obtained ; if every third point is joined,
a self-intersecting regular decagon Q is formed . Find the ratio of twelve
times the difference between the length of a side of Q and the length of a
side of P to the radius of the circle.

ans:12
Trigonometric solution:
The requireddifference= 2R(sin54 − sin18) = 4Rsin18cos36
√  √
5−1 5+1
= 4R 4 4 =R
Note : They expect you to know trigonometric values of such
angles.
15o 18o √ 36
o
√ √ √
3−1 5−1 10−2 5
sin √
2 2
√ √ 4 √ √
4
3+1 10+2 5 5+1
cos √
4
2 2
√ √ √ 4 √
5−1 10−2 5
tan 2− 3 √ √ √
5+1
√ √10+2√5 √
10+2 5
cot 2+ 3 √ √ 5+1√
5−1 10−2 5

Wonderful solution:

In Figure AB is a side of P and XY is a side of Q. Clearly the chords

BE and F D divide the points equally and are diameters of the circle.
Since the points are equally-spaced around the circle, clearly the three,

10
 chords AB, F D, and XY are parallel. Similarly, AX, BE, and DY are
parallel. Therefore ABOC and CXY D are parallelograms, and so the
difference between AB and XY is simply the difference between their
opposite sides CO and CD, which is obviously the radius OD.
20. Let α = {a1 , a2 , . . . , ak } be a subset of the first 9 positive integers which
has been arranged in increasing order:

1 ≤ a1 < a2 < · · · < ak ≤ 9

How many such α are there that begin with an odd number and thereafter
alternate in parity:

α = { odd, even, odd, even, ... }?

For convenience, include the empty set D in the count.

ans:89
solution: Let t(n) denote the total number of such α from {1, 2, . . . , n}.
Then t(1) = 2 for α = ∅, {1}
t(2) = 3 for α = ∅, {1}, {1, 2}
t(3) = 5 for α = ∅, {1}, {1, 2), (3}, {1, 2, 3}
t(4) = 8 for α = ∅, {1], {1, 2}, {3}, {1, 2, 3}, {1, 4} for (3, 4}, {1, 2, 3, 4},
strongly suggesting that t(n) = fn+2 , the (n + 2) th term of the Fibonacci
sequence
{fn } = (1, 1, 2, 3, 5, 8, 13, . . .}
As we shall see, this is confirmed by observing that t ( n ) satisfies the
Fibonacci recurrence relation

t(n) = t(n − 1) + t(n − 2)

Clearly
t(n) =( the number of α which do not contain n) + ( the number of α which do contain n)
=t(n − 1) + (the number of α which do contain n)

It remains to show that (the number of α which do contain n ) = t(n − 2).

For definiteness, suppose n is even. Now, there are two kinds of α that
contain n (and therefore end in n ), and two kinds of ordered alternating
subsets β that are counted by t(n − 2)
(i) α = (a1 , a2 . . . . , even, n − 1, n). ending in n − 1, n (an odd-even pair),
(ii) α = (a1 , a2 . . . ., odd, n), where the final odd number is ≤ n − 3,
(iii) β = (a1 , a2 . . . ., even)„ where the final even number is ≤ n − 2,
(iv) β = (a1 , a2 . . . ., odd), where the final odd number is ≤ n − 3.
Clearly, deleting the n − 1 and n from an α of type (i) gives a β of type
(iii), and conversely: and, deleting the n from an α of type (ii) gives a β
of type (iv). and conversely. The conclusion follows.
So for n = 9 , t(9) = f11 = 89.

11
21. The numbers 11 , 21 , . . . , 2020
1
are written on a blackboard. A student chooses
any two of the numbers, say x, y, erases them and then writes down
x + y + xy. He continues to do this until only one number is left on
the blackboard. Let q be the smallest possible number left on the black-
board for any selection of numbers. What is the number of prime factors
of q?
ans: 03
sol: We shall prove by induction that if the original numbers are a1 , . . . , an , n ≥
2, then the last number is (1 + a1 ) · · · (1 + an ) − 1
The assertion is certainly true for n = 2, the base case. Now suppose it is
true for n = k ≥ 2. Consider k + 1 numbers a1 , . . . , ak+1 written on the
board. After one operation, we are left with k numbers. Without loss of
generality, we can assume that the student erases ak and ak+1 and writes
bk = ak + ak+1 + ak ak+1 = (1 + ak ) (1 + ak+1 ) − 1. After a further k
operations, we are left with the number

(1 + a1 ) · · · (1 + ak−1 ) (1 + bk )−1 = (1 + a1 ) · · · (1 + ak−1 ) (1 + ak ) (1 + ak+1 )−1

This completes the proof of the inductive step. Thus the last number is
    
1 1 1
1+ 1+ ··· 1 + − 1 = 2020
1 2 2020

Now 2020 = 22 · 5 · 101

22. Consider the following 502 curves:
i) The vertical lines x = −100, x − 99, . . . , x = 99, x = 100;
ii) The horizontal lines y = −100, y = −99, . . . ., y = 99, y = 100;
iii) The circles centered at the origin with radii π1 , 1 + π1 , . . . , 99 + π1 . No
three of the curves intersect in a common point. What is the sum of the
digits of the total number of points of intersection among these curves?
ans: 12
sol: Each vertical line will intersect each horizontal line so 2012 = 40401
points
There are 100 circles so each one will have 2 points of intersection on
totally 402 lines so 80400 points
So totally there will be 120801points

of polynomials P (x) with real
coefficients such that

23. Determine the number
x3 + 3x2 + 3x + 2 P (x − 1) = x3 − 3x2 + 3x − 2 P (x).



Solution: The polynomials

factor as x3 + 3x2 +

3x + 2 = (x+2) x2 + x + 1
and x3 − 3x2 + 3x − 2 = (x − 2) x2 − x + 1 , respectively

∴ (x + 2) x2 + x + 1 P (x − 1) = (x − 2) x2 − x + 1 P (x)

So −2, ω and ω 2 are the factors
of P .

Let P (x) = (x + 2) x2 + x + 1 Q(x), and get (x + 2) x2 + x + 1 (x +

12




1) x2 − x + 1 Q(x − 1) = (x − 2) x2 − x + 1 (x + 2) x2 + x + 1 Q(x)
or (x + 1)Q(x − 1) = (x − 2)Q(x).
Thus −1 is root of Q(x); letQ(x) = (x + 1)R(x) to get xR(x − 1) =
(x − 2)R(x)
So let R(x) = xT (x) so (x − 1)T (x − 1) = (x − 2)T (x).
So let T (x) = (x − 1)K(x) ∴ (x − 2)K(x − 1) = (x − 2)K(x)
So K(x − 1) = K(x) so K ≡ c

Thus P (x) = c(x − 1)x(x + 1)(x + 2) x2 + x + 1 for any real c.
24. Let three circles Γ1 , Γ2 , Γ3 with centers A1 , A2 , A3 and radii r1 , r2 , r3 re-
spectively be mutually tangent to each other externally. Suppose that the
tangent to the circumcircle of the triangle A1 A2 A3 at A3 and the two ex-
ternal common tangents of Γ1 and Γ2 meet at a common point P , as shown
in the figure below. Given that r1 = 18 cm, r2 = 8 cm and r3 = k cm,
find the value of k.

ans:12
√
sol: First we shall show that r3 = r1 r2 . Let P be the point of concur-
rence of the tangent to the circumcircle of the triangle A1 A2 A3 at A3 and
the two external common tangents of Γ1 and Γ2 . Note that the line joining
A1 and A2 also passes through P . First we have P A23 = P A2 · P A1 , so
 2 q
P A3
P A2 =P A1 r1 P A3
P A2 = r2 . That is, P A2 =
r1
r2 .
On the other hand,
P A3 sin ∠A3 A2 P sin A2 r1 + r3
= = =
P A2 sin ∠A2 A3 P sin A1 r2 + r3
q
r1 r1 +r3
Thus r2 = r2 +r3 .
√
Solving for r3 , we obtain r3 = r1 r2 . Substituting r1 = 18, r2 = 8, we
get r3 = 12.

13