08-08-2025

1001CPE404016250005 PE

Mathematics

Section-1

1) Solve for x, y, z which satisfies the equations

and find the value of .

2) x, y, z are positive reals satisfying

x2 + xy + y2 = 2, y2 + yz + z2 = 1, z2 + zx + x2 = 3
Find the value of .

3) Connor is thinking of a two-digit number n, which satisfies the following properties :

∎ If n > 70, then n is a perfect square.
∎ If n > 40, then n is prime.
∎ If n < 80, then the sum of the digits of n is 14.
What is Connor's number?

4) The positive integer 8833 has the property that 8833 = 882 + 332. Find the (unique) other four-

digit positive integer = . Report your answer as a2 + b2 + c2 + d2.

5) Suppose a, b, c and d are non-negative integers such that

(a + b + c + d)(a2 + b2 + c2 + d2)2 = 2023
Find a3 + b3 + c3 + d3.

6) Points K and L are taken on the sides BC and CD of a square ABCD so that ∠AKB = ∠AKL. Find
∠KAL.

7) Suppose △ABC with angles A, B and C, and the corresponding sides a, b and c satisfies equation a

cosB – b cosA = . Then find the value of .

8) In triangle ABC, D is the midpoint of AB and E is the point of trisection of BC nearer to C. Given
that ∠ADC = ∠BAE, find ∠BAC.

9) A wooden cube with edge length n units (where n is an integer > 2) is painted in black all over. By
slices parallel to its faces, the cube is cut into n3 cubes each of unit edge length. If the number of
smaller cubes with just one face painted black is equal to the number of smaller cubes completely
free of paint, what is n?

10) A drawer in a darkened room contains 100 red socks, 80 green socks, 60 blue socks and 40 black
socks. A youngster selects socks one at the time from the drawer but is unable to see the color of the
socks drawn. What is the smallest number of socks that must be selected to guarantee that the
selection contains at least 10 pairs? (A pair of socks is two socks of the same color. No sock may be
counted in more than one pair.)

Section-2

1) Find the sum of all non-negative integer a such that the quadratic equation a2x2 – (3a2 – 8a)x +
2a2 – 13a + 15 = 0 has at least one integer root.

2) For all positive real numbers x, y, z such that xy + yz + zx = 3.

We have : , where m, n ∈ N and are coprime.

Find m2 + n2.

3) Compute the number of non-negative integers k < 220 such that is odd. Find sum of digits of
this number.

4) An arithmetic progression of exactly 10 positive integers has the property that any two elements
are relatively prime. Compute the smallest possible sum of the 10 numbers. Find the sum of squares
of digits of this number.

5) Circles C and C' intersect at O and X. A circle center O meets C at Q and R and meets C' at P and
S. PR and QS meet at Y distinct from X. Find the value of ∠YXO.

6) E is a point on the diagonal BD of the square ABCD. If O and O’ are the circumcenters of ΔABE
and ΔADE respectively, then find ∠OO’E(in degree).

7) In the diagram below, AEB is an isosceles right-angled triangle and ABG is a 30°– 60° – 90° right-
angled triangle with ∠GAB = 30°. The sides AG and BE intersect at H. If the area of triangle AHE is
50 cm2, find the area of triangle BGH in cm2.
8) If the number of functions ƒ : {1,2,...,25} → {2022,2023,2024,2025} satisfying the condition that
ƒ(1) + ƒ(2) + ... + ƒ(25) is odd is 2N. Find N.

9) Compute the number of ordered pairs (x, y) of integers with 1 ≤ x < y ≤ 20 such that ix + iy is a
real number, where i2 = –1.

10) Each unit square of a 3-by-3 unit-square grid is to be colored either blue or red. How many 3-
by-3 unit-square grids contain a 2-by-2 red square ?

Section-3

1) Assume that x1, x2, ....x7 are real numbers such that
x1 + 4x2 + 9x3 + 16x4 + 25x5 + 36x6 + 49x7 = 1
4x1 + 9x2 + 16x3 + 25x4 + 36x5 + 49x6 + 64x7 = 12
9x1 + 16x2 + 25x3 + 36x4 + 49x5 + 64x6 + 81x7 = 123
Find the value of

2) The polynomial x3 – 3(1 + )x2 + ( – 55)x – (7 + ) has three distinct real roots α, β and
3 2
γ. The polynomial p(x) = x + ax + bx + c has roots , , . Find [a2 + b2 + c2], where [·]
represents G.I.F.

3) If the greatest value of

for x ∀ ∈ R – {0} is m/n, (m, n) = 1, find m + n.

4) For positive integer n, let ƒ(n) be the largest integer k such that k! ≤ n, let g(n) = n – (ƒ(n))!, and
for j ≥ 1 let Let n be the smallest positive integer such that gj(n) > 0 for all j <
30
30 and g (n) = 0. Find the sum of digits of n.

5) If ϕ(n) is no. of positive integers less than or equal to n, coprime to n.

, find p + q.

6) Two circles of radii 2025 and 4 are tangent to line L at points A and B respectively and intersect
each other at C and D. Find the radius of circumcircle of triangle ABC.

7) ABCD is a trapezium with AD || BC. It is known that BC = BD = 1, AB = AC, CD < 1 and ∠BAC +
∠BDC = 180° , If CD = x, then find the value of (x + 1)2.

8) P is a point inside ∆ABC. Lines AC and BP intersect at Q. Lines AB and CP intersect at R. It is

known that AR = RB = CP and CQ = PQ. Find the value of 180º – ∠BRC.

9) Consider the function y = ƒ(x), defined from A → A, where A = {1,2,3,4,5,6} and ƒ(ƒ(x)) = ƒ(x).
If m denotes the number of such functions ƒ, then the last two digits of m, is equal to

10) Each of the n persons have a gun, with 1 bullet which they fire randomly at any other person. If
all the shots are fired simultaneously, and no one misses the target at which they aim and shoot,
then P(n) denotes the number of ways in which exactly 1 person is alive after shooting. Find sum of
digits of P(6).
 ANSWER KEYS

Mathematics

Section-1

Q. 1 2 3 4 5 6 7 8 9 10
A. 01 04 59 23 43 45 04 90 08 23

Section-2

Q. 11 12 13 14 15 16 17 18 19 20
A. 09 13 18 46 90 45 25 49 70 95

Section-3

Q. 21 22 23 24 25 26 27 28 29 30
A. 02 21 19 26 29 90 02 60 57 15
 SOLUTIONS

Mathematics

1)
Adding 1 throughout

⇒ where S = x + y + z
Eliminating S ⇒ 2x(y + z) = 3y(x + z) = 5z(x + y)

Expliciting y from first + second eq : ⇒

Expliciting y from first + third eq : ⇒

⇒ ⇒ x = 19z
As regards the second equation in x, z :
Expliciting y from the unmodified first and third eq. yields :

⇒ (5z – 1)(x + z – 2xz) = (2x – 1)(x + y – 5xz) ⇒ 10x2z – 2x2 – 10xz2 +

5z2 = 0
which combined with x = 19z leads to

, ,

2) Let ABC be a triangle with F its Fermat point. Let AB = , BC = 1, and AC = . Then,
from the law of cosines, we have that AF = x, BF = y, and CF = z. Then note that the area of
ABC is

[ABC] = [BAF] + [CAF] + [BCF]. Now using sinC as the area of a triangle, we get that the

area is = . Then note that ABC is a right triangle with

AC the hypotenuse. Thus the area is just . Therefore = ⇒ xy + yz + xz

= .

3) Note that if n > 70, then n > 40 as well, so n is both prime and a perfect square, which is
nonsense. So n ≤ 70. Thus n < 80, so the sum of the digits of n is 14. This means both digits of
n must be at least 5, so n > 40 and thus n is prime. the only 40 < n ≤ 70 with digits summing
to 14 are 59 and 68, of which 59 is prime.

4) Letting = x and = y, we get the equation x2 + y2 = 100x + y, or (x – 50)2 = –y2 + y +

2500. We're given that (88,33) is a solution to this equation. Note that if we change the sign of
x – 50 while keeping y constant, we get another solution to this equation. Thus we want x – 50
= –(88 – 50) = – 38 → x = 12, so 1233 is our answer.
5) Let M = a + b + c + d and N = a2 + b2 + c2 + d2; we have MN2 = 2023. Factoring 2023 = 7 ·
172, we have (M,N) ∈ {(2023,1), (7, 17)}. The former is clearly absurd, so M = 7 and N = 17.
We now look for way to write 17 as sum of four squares. WLOG a ≤ b ≤ c ≤ d. Clearly 3 ≤ d ≤
4.
If d = 4, we must have 1 = a2 + b2 + c2 which only admits (a, b, c) = (0, 0, 1), but 0 + 0 + 1 + 4
≠ 7, so this case fails.
If d = 3, we must have 8 = a2 + b2 + c2. It's easy to see we must have (a, b, c) = (0, 2, 2), and
indeed 0 + 2 + 2 + 3 = 7.
Thus (a, b, c, d) = (0, 2, 2, 3), and a3 + b3 + c3 + d3 = 43
Remark : Rearranging this gives the rather pretty
(2 + 0 + 2 + 3)(22 + 02 + 22 + 32) = 2023

6) We see that CA is the bisector of ∠DCB= ∠LCK and KA is the bisector of ∠LKB, so A is the
excentre of ΔKLC. Thus by exterior angle bisector property ∠KAL = 45°.

7) Through C draw CD ⊥ AB with foot point D. We have a cosB = DB and b cosA = AD. By the

given condition, we have DB – AD = c. Combining it with DB + AD = c, we get AD = c and

DB = c. Therefore, .
Sol. 2 By the given condition and the Law of cosines, we have

, so,

Therefore =

8) Let P be the intersection of AE and CD. Using Menelaus's Theorem on line APE with
triangle BDC, we get

So, PD = PC
using the ratios in the problem. Then, because ∠ADC=∠BAE, △APD is isosceles, and AP=DP.
Because PA=PD=PC, A lies on a circle with diameter CD, so ∠BAC is a right angle i.e 90°.

9) Let us count first the cubs with exactly one face painted black. On each of the 6 faces of the
wooden cube, there are n × n faces of little cubes that are painted black. The "frame" belongs
to cubs that have other faces painted black as well. This leaves us with (n – 2) × (n – 2) faces
that belong to cubs that do not have any other painted face. Therefore, we have 6(n – 2)2 such
cubs. If we remove the painted cubs (the first and last layer from front, rear, top, bottom, left
and right), we obtain an (n – 2) × (n – 2) × (n – 2) cube that is free of paint. It contains (n –
2)3 little cubs. So n must satisfy the condition 6(n – 2)2 = (n – 2)3 therefore n = 8.

10) Consider the following pigeonholes: the box of the red socks, the box of the green socks,
the box of the blue socks and the box of the black socks. Now, you can pair up the socks in
each box; in the end you will have at most one unpaired sock in each box. Consider 23 socks.
Suppose at most 18 of them contribute to making pairs (at most 9 pairs). Then you would have
5 pairs of unpaired socks. You only have 4 boxes; hence one box should contain at least two
unpaired socks. Pair them up and you will have at most 3 pairs of unpaired socks, hence at
least 10 complete pairs. Therefore 23 socks are enough. Next we prove that 22 or less socks
are not necessarily enough. Consider 9 complete pairs and 4 other socks, one of each color.
We cannot make the 10-th pair. Examples for less than 22 socks are obtained by removing
socks from the distribution given for 22.

11) ⇒

⇒ ⇒

(i) ⇒ ⇒x=2– ⇒ a = 1, a = 5

(ii) ⇒ ⇒x=1– ⇒a=3

12) By AM-GM

Summing up we get

⇒ =

13) By Lucas's Theorem, is the same parity as where it's the i-th digit in binary.

Thus, it is odd if and only if there is no .

5 is 1012 in binary. Visualize 5k as 4k + k. If this sum has no carry, then there will be no so

it works. If there is a carry, we consider the right-most carry, and that must result in a .
Thus it suffices to find all binary strings with no substring of 101 or 111.
By casing on whether the first binary digits are 0, 10, 11 we get the recursion that ƒ(n) = ƒ(n –
1) + ƒ(n – 3) + ƒ(n – 4). We also verify that the initial values are ƒ(0) = 1 = F12, ƒ(1) = 2 = F1 *
F2, ƒ(2) = 4 = F12, ƒ(3) = 6 = F2 * F3​.​ We can see that the recursion keeps this pattern. For
example we can see that ƒ(4) = F2 * F3 + F1 * F2 + F12 = F2 * F3 + F1 * F3 = F32 and ƒ(5)
= F32 + F22 + F1 * F2 = F32 + F3 * F2 = F3 * F4.
Thus, we have that ƒ(20) = F211 = 1442 = 20736
Another way to get this is to separate odd and even bits, and we realize that no two
consecutive odd or even bits can be both 1s. The number of way to do the odd/even bits is
Fibonacci, so our answer is the product of the two Fibonacci terms corresponding with the
number of odd bits plus 1 and the number of even bits plus 1.

14) We claim that the answer is 1360, achievable with the sequence 1, 1 + 30, 1, + 30(2), ..., 1
+ 30(9). Let a be the first term of the sequence and d be the common difference so that the
sequence is a, a + d, a + 2d, ..., a + 9d. The sum of the integers is 10a + 45d. Clearly, a ≥ 1.
If , then at least on of a, a + d is even and at least one of a + 2d, a + 3d is even,
regardless of what a is. But then that means two terms in the sequence both have a factor of 2,
contradiction. Hence, 2 | d
Similarly, if , at least one of a, a + d, a + 2d is divisible by 3 and at least one of a + 3d, a
+ 4d, a + 5d is divisible by 3, contradiction. Hence, 3 | d.
Similarly, 5 | d. Thus, 30 | d, implying d ≥ 30.
Thus, the smallest possible sum is 10a + 45d ≥ 10 · 1 + 45 · 30 = 1360, as desired.

15) We show first that YRSX is cyclic. It is

sufficient to show that ∠RYS = ∠RXS. We have
∠RYS = ∠PRQ – ∠RQY = ∠PSQ – ∠RQY
= ∠OSQ – ∠OSP – ∠RQY
= ∠OQS – ∠RQY – ∠OSP
= ∠OQR – ∠OSP
But ∠RXS = ∠RXO – ∠OXS = ∠OQR – ∠OXS
∠OQR – ∠OPS = ∠OQR – ∠OSP. So YRSX is cyclic.
Hence ∠YXO = ∠YXS + ∠SXO = ∠PRS + ∠SXO

= ∠PRS + ∠SPO = ∠POS + ∠SPO = 90°

 16) Let O, O' be the circumcenters of ABE, ADE respectively.
Then OA = OE and ∠AOB = 2, ∠ABE = 90°. Similarly, O'A = O'E and ∠AO'E = 2∠ADE = 90°.
Hence AOEO' is a square.
So ∠OO’E = 45°

17) Observe that ABGE is cyclic, where AB is the diameter of (ABGE). Let α = ∠EAB. Then
∠EBA = α. Thus, ∠EAH = α – 30° and ∠GBH = 60° – α. Since ∠EAH = ∠GBH, we obtain α =

45°. We thus have AE = , where r = is the radius of (ABGE). Also, GB = ABsin30° = r.

Since ΔAEH and ΔBGH are similar we see that

The ratio of similarity is thus , whence [BGH] = [AEH] = 25 cm2.

18)

For the first 24 inputs (k = 1 to 24 ), we can choose any of the 4 values in the codomain for
each ƒ(k). This gives 424 ways to define the first part of the function.

For the final input, k =25, our choice for ƒ(25) is constrained. The sum of the first 24 values,
S24 = ƒ(k), is already fixed as either even or odd.

A. If S24 is even, ƒ(25) must be odd (2 choices: 2023 or 2025).

B. If S24 is odd, ƒ(25) must be even (2 choices: 2022 or 2024).

In every case, there are exactly 2 choices for ƒ(25) that satisfy the condition.The total number of
valid functions is the product of the number of choices:
(Choices for ƒ(1)…ƒ(24))×(Choices for f(25))
424 × 2 = (22)24 × 2 = 248 × 21 =249

19)

Case 1: Both ix and iy are real numbers.

The powers of i are real when the exponent is an even number.

A. ik = 1 if k ≡ 0(mod4). In [1,20], these are {4,8,12,16,20}.

B. ik = –1 if k ≡ 2(mod4). In [1,20], these are {2,6,10,14,18}.
 Combining these gives a set of 10 numbers for which ik is real: {2,4,6,8,10,12,14,16,18,20}.
Any pair (x,y) chosen from this set will result in a real sum. The number of ways to choose two
distinct numbers from this set of 10 is:

Case 2: Both ix and iy are purely imaginary and cancel each other out.
This occurs if one power equals i and the other equals -i.

A. ik = i if k ≡ 1(mod4). In [1,20], this set is S1={1,5,9,13,17}. There are 5 such numbers.

B. ik = –i if k ≡ 3(mod4). In [1,20], this set is S3={3,7,11,15,19}. There are 5 such numbers.

We need to form an ordered pair (x,y) with x < y by picking one number from S1 and one from
S3. For any choice of one number from S1 and one from S3, we can form exactly one valid
ordered pair satisfying x < y. The total number of ways to pick one number from each set is:

|S1| × |S3| = 5 × 5 = 25

Total Number of Pairs

The total number of such pairs is the sum of the counts from both cases:

45 + 25 = 70

20)

This is calculated using the Principle of Inclusion-Exclusion for the four possible 2×2 subgrids.
A 3 × 3 grid has four possible 2 × 2 subgrids. Let's label them by their top-left corner's
position:
A: Top left (cells (1,1),(1,2),(2,1),(2,2))
B: Top-right (cells (1,2),(1,3),(2,2),(2,3))
C: Bottom-left (cells (2,1),(2,2),(3,1),(3,2))
D: Bottom-right (cells (2,2),(2,3),(3,2),(3,3))
Let SA be the set of grids where square A is all red, and similarly for SB,SC,SD. We want to find
the size of the union SA ∪SB ∪ SC ∪ SD. The Principle of Inclusion-Exclusion states:
The Principle of Inclusion-Exclusion states:
|SA ∪ SB ∪ SC ∪ SD| = Σ|Si| – Σ|Si ∩ Sj| + Σ|Si ∩ Sj ∩ Sk| – Σ|SA ∩ SB ∩ SC ∩ SD|
= 128 – 40 + 8 – 1 = 95

21) Sol 1 :
Let ƒ(x) = ax2 + b(x + 1)2 + c(x + 2)2 + .... + g(x + 6)2 be a quadratic polynomial such that
ƒ(1) = 1, ƒ(2) = 12 and ƒ(3) = 123
Then ƒ(x) = mx2 + nx + p
⇒ m + n + p = 1 ..... (1)
⇒ 4m + 2n + p = 12 ..... (2)
⇒ 9m + 3n + p = 123 ..... (3)
On subtracting equation (1) from equation (2), we get
⇒ 3m + n = 11 ...... (4)
On subtracting equation (2) from equation (3), we get
⇒ 5m + n = 111 ...... (5)
On solving equation (4) from equation (5), we get
m = 50, n = – 139 and p = 90
∴ ƒ(4) = 16m + 4n + p = 16(50) + 4(–139) + 90 = 334
Sol : 2
a + 4b + 9c + 16d + 25e + 36ƒ + 49g = 1 ...... (1)
4a + 9b + 16c + 25d + 35e + 49ƒ + 64g = 12 ......(2)
9a + 16b + 25c + 36d + 49e + 64ƒ + 81g = 123 ......(3)
Now, let S = 16a + 25b + 36c + 49d+ 64e + 81ƒ + 100g .... (4)
On subtracting equation 1 from equation 2, we get
3a + 5b + 7c + 9d + 11e + 13ƒ + 15g = 11 ......(5)
On subtracting equation 2 from equation 3, we get
5a + 7b + 9c + 11d + 13e + 15ƒ + 17g = 111 ....... (6)
On subtracting equation 5 from equation 6, we get
a + b + c + d + e + ƒ + g = 50 ....... (7)
On subtracting equation 3 from equation 4, we get
S – 123 = 7a + 9b + 11c + 13d + 15e + 17ƒ + 19g ........(8)
On subtracting equation 6 from equation 8, we get
S – 234 = 2(a + b + c + d + e + ƒ + g)
S – 234 = 2(50) (from equation 7)
S = 234 + 100 = 334

22) x3 – 3(1 + )x2 + ( – 55)x – (7 + ) with roots α, β, γ.

Vieta :
We want p(x) = x3 + ax2 + bx + c with roots p = ,q= ,r= .

First, c = =
3 3
Then, (p + q + r) = a
–2(p3 + q3 + r3) + 3(p2 + q2 + r2)(p + q + r) + 6pqr = a3,
–2 · 3 (1 + + 3(a2 – 2b)(a) + 6( + 1) = a3
3(a2 – 2b)(a) = a3 ⇒ a = 0.
Finally, (pq + qr + rp)3 = b3,
p3q3 + q3r3 + r3p3 + 3pqr[(p2 + q2 + r2)(p + q + r)] – 3pqr(p3 + q3 + r3) + 6p2q2r2 = b3,
+ 3prq[(p2 + q2 + r2)(0)] – 3 ·( + 1) · 3( + 1) + 6( + 1)2 = b3,
2 2 3
– 9·( + 1) + 6( + 1) = b
+ 1) = b ⇒ b3 = –64 ⇒ b = – 4
2 3
– 3·(

23) Let

Put

⇒
⇒

⇒ ⇒

As t = ⇒ t2 ≥ 4 ⇒ t4 – 1 ≥ 3

⇒ Maximum value of y is

24) This is equivalent to finding the smallest n such that its factorial base representation has
digits that sum to 30. This occurs when the representation is 27654321, which corresponds to
3 · 8! – 1 = 120959.

25) ϕ(2025) = = 1080 = 23 × 33 × 5

Now gcd(x, 1080) = d

⇒ For exactly values of x ≤ 1080 satisfy the above equation

26) Let O, O' be the centers of the circles of radius R = 2025, r = 4, respectively. Let α =
∠CAB = ∠AOC/ 2 and β = ∠CBA = ∠BO'C /2. Then AC = 2R sinα and BC = 2r sin β. The
distance from C to AB is AC sinα = BC sin β, which implies sinα / sin β = . The
circumradius of triangle ABC is AC/2sin β = Rsinα /sin β = = = 45 × 2 = 90

27) The condition ∠BAC + ∠BDC = 180° leads us to consider a cyclic quadrilateral. If we
reflect ΔBDC across BC, a cyclic quadrilateral is formed.
Solution outline :
(1) Let E be the reflection of D across BC.
(2) ∠BAC + ∠BDC = 180°
⇒ ∠BAC + ∠BEC = 180°
⇒ ABEC is cyclic,
AD || BC ⇒ AF = FE,
AB = AC ⇒ ∠BEF = ∠FEC

⇒
(3) Let AF = FE = m, AB = AC = n and DC = EC = x.
It follows from Ptolemy's theorem that AE × BC = AC × BE + AB × EC,
i.e. 2m = n(1 + x). Now

So (x + 1)2 = 2

28)
Let S be the point on segment CR such that RS = CP = AR. Since CQ = PQ, we have
∠ACS = ∠QPC = ∠BPR
Also, since RS = CP, we have
SC = CR – RS = CR – CP = RP.
Considering line CR cutting ΔABQ, by Menelaus' theorem, we have

Since AR = RB and CQ = PQ we get AC = BP. Hence, . Then AS = BR = AR =

CP = RS and so ΔARS is equilateral. Thereofre, ∠BRC = 120°.
So 180° – ∠BRC = 60°
29)
m = 6 + 240 + 540 + 240 + 30 + 1 = 1057
The value of m is 1057.

30) P(6) = 6(6 – 1)[D6 – 1 + (6 – 3)(6 – 2)!]

P(6) = 30[D5 + 3 · 4!]
P(6) = 30[44 + 3 · 24]
P(6) = 30[116]
P(6) = 3480