31-08-2025

1001CPE404016250006 PE

Mathematics

Section-1

1) Consider the polynomial ƒ(x) = 2026x2026 – 2025x + 1 = 0. Let the roots of the ƒ(x) be r1, r2, ..., r2026.
Compute (2025r1 – 1)(2025r2 – 1) .... (2025r2026 – 1).

2) If the sum of the possible values of c such that the polynomial x2 – 40x + c = 0 has positive integer

roots (possibly equal to each other) is k, find .

3) Find sum of all unique values of m + n where m + n = 3(mn + 10), m,

4) Find the no. of functions ƒ : N → N such that ƒ(ƒ(n)) = n + 1

5) If sum of all 100 ≥ n ≥ 48 is A. Find sum of digits of A.

6) In the interior of the square ABCD, the point P lies in such a way that ∠DCP = ∠CAP = 25°. Find
the sum of all possible values of ∠PBA.

7) In the classic motion picture the Wizard of Oz (1936), the Scarecrow, misstating the Pythagorean
theorem, says : "The sum of the square roots of any two sides of a right triangle is equal to the
square root of the remaining side." Find the number of triangles which satisfy this property?

8) ΔABC is isosceles with AB = AC and BC = 2. Let G and I be the centroid and incenter of ΔABC,
respectively. Let D be the midpoint of BC. If GI = ID, find AB.

9)

In how many ways can 8 identical balls be placed into 4 distinct boxes such that no box contains
more than 3 balls?

10) How many 6-digit even numbers can be made using the digits 1, 2, 3, 4, 5, 6, 7 with exactly two
digits repeated twice?

Section-2
1) If x and y are real numbers, the minimum possible value of is k, find |k|.

2) Let x1, x2 and x3 be the three roots of the polynomial x3 + 3x + 1. There are relatively prime

positive integers m and n so that + + .

Find m + n.

3) Faizan chooses a positive integer as the starting number and writes it on the board. He then

repeats the next step : he replaces the number n on the board by if n is even and by n2 + 3 if n is
odd. For how many choices of starting numbers below 2025 will Faizan never write a number of
more than four digits on the board?

4) A set consisting of at least two distinct positive integers is called centenary if its greatest element
is 100. We will consider the average of all numbers in a centenary set, which we will call the average

of the set. For example, the average of the centary set {1, 2, 20, 100} is and the average of the
centenary set {74, 90, 100} is 88. Determine last 2 digits of the sum of all integers that occur as the
average of a centenary set.

5) Let ABCD be a cyclic quadrilateral such that the chords AB and DC intersect at P when produce
and the chords BC and AD intersect externally at Q. Find the angle between the angle bisectors of
∠BPC and ∠CQD.

6) Square ABCD has side length 1 unit. Points E and F are on sides AB and CB, respectively, with AE
= CF. When the square is folded along the lines DE and DF, side AD and CD coincide and lie on
diagonal BD. The length of segment AE can be expressed in the form units. What is the
integer value of k + m?

7) A rectangle HOMF has HO = 23 and OM = 7. Triangle ABC has orthocentre H and circumcentre
O. The midpoint of BC is M and F is the foot of the altitude from A. Determine the length of side BC.

8) Let S = {1,2,3,....,10}. How many ways are there to choose a subset T of S such that no two
elements of T differ by 1 or 2 ?

9) A group of 9 students, s1, s2,…., s9, is to be divided into three teams X, Y, and Z of sizes 2, 3, and 4,
respectively. Suppose that s1 cannot be selected for team X, and s2 cannot be selected for team Y.
Then the number of ways to form such teams, is 17N. Then N equals

10) If N is the number of subsets of the set {1, 2, 3, 4, 5, 6, 7, 8, 9} are there in which the sum of
the elements is divisible by 3? Find the sum of the digits of N?
 Section-3

1) Consider a quadratic function P(x) = ax2 + bx + c with distinct positive roots r1 and r2, and a
second polynomial Q(x) = cx2 + bx + a with roots r3 and r4. Jatasya writes four numbers on the
whiteboard : r1, r2, 4r3 and 4r4. What is the smallest possible integer value of the sum of the numbers
Jatasya wrote down?

2) If ,

where (a, b) = 1, find , where represents GIF.

3) Let x, y, z be nonzero numbers, not necessarily real, such that

(x – y)2 + (y – z)2 + (z – x)2 = 24yz

and .

Compute .

4) A frog jumps around on the grid points in the plane, from one grid point to another. The frog
starts at the point (0, 0). Then it makes, successively, a jump of one step horizontally, a jump of 2
steps vertically, a jump of 3 steps horizontally, a jump of 4 steps vertically, et cetera. Determine 100
> n > 0 all such that the frog can be back in (0, 0) after n jumps and find last 2 digits of the sum of
all such n.

5) Let ƒ(x, y) = (x + y)/2, g(x, y) = , h(x, y) = 2xy/(x + y), and let

S = {(a, b) ∈ N × N | a ≠ b and ƒ(a, b), g(a, b), h(a, b) ∈ N}
where denotes the positive integers. Find the minimum of ƒ over S.

6) As shown in the diagram, in ΔABC, ∠A = 60°, AB >AC, point O is a circumcenter and H is the
intersection point of two altitudes BE and CF. Points M and N are on the line segments BH and HF

respectively, and satisfy BM = CN. Determine the square of the value of .

7) In an acute triangle ABC, point H is the intersection point of altitude CE to AB and altitude BD to
AC. A circle with DE as its diameter intersects AB and AC at points F and G, respectively. FG and AH
intersect at point K. If BC = 25, BD = 20, and BE = 7, If the length of AK is denote by d then find [d],
where [x] is the greatest integer less or equal to x.

8) The distance between the centres of two circles is 7 units. A rhombus is drawn so that two of its
opposite vertices lie on one circle, and the other two vertices lie on the second circle. If the radii of
the circles are 20 units and 15 units, what is the length of a side of the rhombus?

9) How many ways are there to color the vertices of a regular 9-gon with 3 colors, such that no two
adjacent vertices have the same color, and colorings are considered the same if they can be obtained
from each other by a rotation?

10) Let F be a family of subsets of {1,2,...,10}, each subset having 5 elements. What is the largest
possible size of such a family F if every pair of sets in F has at least 2 elements in common?
 ANSWER KEYS

Mathematics

Section-1

Q. 1 2 3 4 5 6 7 8 9 10
A. 01 35 30 00 16 40 00 05 31 54

Section-2

Q. 11 12 13 14 15 16 17 18 19 20
A. 01 10 21 59 90 03 52 60 95 14

Section-3

Q. 21 22 23 24 25 26 27 28 29 30
A. 09 03 05 36 25 03 08 24 58 56
 SOLUTIONS

Mathematics

1) We know that 2025r – 1 = 2026r2026 for any root r, so plugging that in we have

20262026 (r1....r2026)2026 as the desired product. By Vieta's, we have r1 ... r2026 = , and the
answer is 1.

2) The only possible root pairs are (1, 39), (2, 38), (3, 37), ...., (20, 20). Then
1 ∙ 39 + 2 ∙ 38 + ... + 20 ∙ 20
= (202 – 192) + (202 – 182) + ... + (202 – 02)
= 20(202) – (12 + 22 + ... + 192)

=
= 8000 – 2470 = 5530

3) m + n = 3(mn + 10) ⇔ m – 3mn = 30 – n

m(1 – 3n) = 30 – n ⇔ m =

1 – 3n ∈ {±1, ±89}
if we try this values, we see that :
n ∈ {0, 30}
and put them in main equation
(m, n) ∈ {(0, 30), (30, 0)}
are solutions. We are done.

4) ƒ(ƒ(n)) = n + 1
⇒ ƒ(n + 1) = ƒ(ƒ(ƒ(n))) = ƒ(n) + 1
⇒ ƒ(n + 1) = ƒ(n) + 1
⇒ ƒ(n + 1) – ƒ(n) = 1
⇒ ƒ(n) = n – 1 + ƒ(1)
⇒ ƒ(ƒ(n)) = ƒ(n – 1 + ƒ(1))
= n – 1 + ƒ(1) – 1 + ƒ(1) = n + 1
⇒ 2ƒ(1) = 1
ƒ(1) = ½ Not possible
Thus no function exists.

5) Consider
gcd (m, n) = mx + ny =
Thus all n ∈ {48, 49 .... 100} are valid

6) Reflect C across B, call the C'. Notice that APCC' is a cyclic quadrilateral, which lies on a
circle of center B. Thus, by BA = BP = BC and the required angle is 40°.

7) No. Let a, b, c denote the sides of a triangle, and assume .

Because and are the sides of a right triangle by the Pythagorean theorem, we have a +
b < c, which is impossible.
So there is no such triangle.

8) Let AD be an altitude. We start recognizing that AG = 2GD.

Consequently, and . Now recall that BI is the angle bisector of ∠B. Now by

applying angle bisector theorem on triangle BAD, we have Hence, since BD = 1,

we have AB = 5.

9)

We count integer solutions to x1 + x2 + x3 + x4 = 8 with 0 ≤ xi ≤ 3.

Unconstrained :

Subtract boxes with xi ≥ 4 :

Add back intersections of two overfull boxes

Therefore, Answer= 165-140+6=31.
10)

We want numbers of the form with multiset {a,a,b,b} (with a ≠ b) and the last digit even.
Choose the unit digit: Let e ∈{2,4,6} – 3 choices.
Choose the other repeated digit: Pick d ≠ e from the remaining 6 digits – 6 choices.
Arrange the first three positions: The remaining multiset is {e,d,d}, which can be arranged in

= 3 ways.
Multiplying, 3⋅6⋅3=54.

11) Note that x4 + 4y4 = (x2 + 2y2 + 2xy)(x2 + 2y2 – 2xy) through the Sophie Germain identity.
Also, the numerator can be written as
4xy(3x2 + 10xy + 6y2) = 12x3y + 40x2y2 + 24xy3
= 5x4 + 12x3y + 40x2y2 + 24xy3 + 20y4 – 5(x4 + 4y4)
= (x2 + 2y2 – 2xy)2 + 4(x2 + 2y2 + 2xy)2 – 5(x4 + 4y4)
Then, we can decompose the given fraction as

=
By the AM-GM in inequality, we have

so the minimum possible value of the original expression is –1.

12) First note that since x3 + 3x + 1 = (x – x1)(x – x2)(x – x3), we get x1 + x2 + x3 = 0,

x1x2 + x1x3 + x2x3 = 3, and x1x2x3 = –1. It also follows that
0 = (x1 + x2 + x3)2 = + 2(x1x2 + x1x3 + x2x3) and = –6.
3
Finally, since each xj satisfies x + 3x + 1 = 0, one gets that
.

Now, + +

The requested sum is 3 + 7 = 10

13) If n = 1 or n = 3 then after some steps n will be converted to initial value.

Let n = 2k + 1, k ≥ 2 then 2k + 1 → 4k2 + 4k + 4 → k2 + k + 1 and k2 + k + 1 – (2k + 1) = k2 –
k ≥ 2 so odd n after some moves will be replaced with bigger odd number.
So number, from which number with more than four digits can not be received, are numbers
2m or 3 * 2m
And there are 21 such number less than 2025.
14) The minimal sum for n numbers in the list, is = , which is
minimized for , giving us in return. This means that every number ≥ 14
could be reached in theory. Now the upperbound :
The maximal sum clearly is 99. In theory, we can reach every number between 13 and 100, we
just need to find configurations.
As configuration we can use next sets
If 14 ≤ n ≤ 50 then set {n – 13, n – 12, n – 11, ..., n – 2, 2n – 10, 100}
For 51 ≤ n ≤ 99 we can use set {2n – 100, 100}

15) Let the angle bisectors of ∠BPC and ∠CQD intersect at X.

Let's introduce the following notations : a = ∠BAD, β = ∠BPC, γ = ∠CQD. Then, three of the

interior angles in the quadrilateral APXQ are α, and . Let the fourth interior angle, which is
a reflex angle1, be δ, and let its explementary angle2 be δ'. We want to prove that δ' = 90°.
From the sum of the interior angles in the quadrilateral APXQ, Property 2.4, we get

. But also, δ + δ' = 360°, so . Using the angle measure of

arcs, we get and .

Finally, we get

16) ΔAED is folded over DE to get ΔDEX.

DE is a line of symmetry for quadrilateral ADXE.
AD = DX
AE = EX
ED = ED
ΔAED ≅ ΔXED
Similarly,
ΔCFD ≅ ΔXFD Once the square is folded, points A and C lie on
the diagonal at point X.
DX = 1
DB = Diagonal of a square =
BE = 1 – AE

Since ΔEBF is a 45 – 45 – 90 triangle : Since DX + XB = DB :

k+m=2+1=3

17) Since the altitude AF passes through H and BC ⊥ AF, it follows that BC and FM coincide.
Let H' be the refection of H in BC. H' is known to lie on the circumcircle of ΔABC, so R = H'O

= . Hence BM = = 26 and BC = 2BM = 52.

18) Write the chosen elements as :

1 ≤ i1 ≤ i2 < ... < ik ≤ 10
with the condition :
ij + 1 ≥ ij + 3 for all j.
Define : yj = if – 2(j – 1)
Then : 1 ≤ y1 < y2 < ... < yk ≤ 10 – 2 (k – 1) = 12 – 2k
 The number of ways to choose y1, ..., yk is : We require : 12 – 2k ≥ k ⇒ k ≤ 4
So k = 0, 1, 2, 3, 4

Total

= 1 + 10 + 28 + 20 + 1
= 60

19) The total number of ways to form the teams is calculated by considering the four valid,
mutually exclusive cases for the placement of students s1 and s2 :

A. s1 in Team Y,s2 in Team X : =105 ways.

B. s1 in Team Y,s2 in Team Z : = 210 ways.

C. s1 in Team Z,s2 in Team X : = 140 ways.

D. s1 in Team Z, s2 in Team Z : = 210 ways.

The total number of ways is the sum of these cases:

Total Ways =105+210+140+210=665.
Given that this total is equal to 7N :

7N = 665

20) We classify numbers by their residues modulo 3 : {1,4,7} ≡1, {2,5,8} ≡ 2, {3,6,9} ≡ 0.
Residue 0 choices: Picking any subset of {3,6,9} does not change the sum modulo 3,
contributing a factor 23 = 8.
Residues 1 and 2: Let a be the number chosen from {1,4,7} and b from {2,5,8}. The sum
modulo 3 is a⋅1+b⋅2 ≡ a – b (mod 3),
so, we need a ≡ b (mod 3). The count is

Multiplying by the residue-0 factor

gives = 8 × 22 = 176.
Alternate solution:

Let F(x) = (1 + xk). The number of subsets whose sum is divisible by 3 is N0 =

(F(1)+F(ω)+F(ω2)), where ω=e2πi/3 and ω3 = 1, ω ≠ 1.
9
Computing each term: F(1) = 2 = 512.
Group exponents modulo 3 to evaluate F(ω) :

F(ω) = (1 + ω3)3(1 + ω)3(1 + ω2)3 = 23((1+ω)(1+ω2))3.

Since (1 + ω)(1 + ω2) = 1 + ω + ω2 + ω3 = 2 + (ω + ω2) = 2 – 1 = 1,
we get F(ω)=8, and by symmetry F(ω2) = 8.

Therefore,

21) We first apply Vieta's formula to P(x), which gives that r1r2 = and r1 + r2 = .
Rearranging, we have c = ar1r2, and b = –a(r1 + r2). Next, we apply Vieta's to Q(x), which gives

r3r4 = and r3 + r4 = . Substituting, we have and

Since we now know that r3 + r4 =

, we can express the sum S of the numbers Jatasya wrote down as

We can re-order this as . Observe that for positive k, any expression of

the form is always at least 4, and minimised when k = 2. Thus,

However, S = 8 is only achieved when r1 = r2 = 2, which

violates our requirement that the roots of P(x) be distinct. The total sum therefore must be
greater than 8, yielding a minimum integer value of 9 (note that the roots themselves don't
necessarily have to be integer values). This can achieved by setting r1 = 1 and r2 = 2.

22) Note that = , so we can write the sum as

23) Via factoring, we get

implies (x + y + z)(x2 + y2 + z2 – xy – yz – zx) = 0 or (x + y + z)((x – y)2 + (y – z)2 + (z – x)2) =
24(x + y + z)yz = 0
As y, z ≠ 0, we have x + y + z = 0 or x = – y – z. Then

Now, substituting – y – z for x in the first equation gives us

(– y – z – y)2 + (y – z)2 + (x + y + z)2 = 4y2 + 4yz + z2 + y2 – 2yz + z2 + y2 + 4yz + 4z2
= 6y2 + 6z2 + 6yz
= 24yz

or
By the Quadratic Formula, we have

It follows that the answer is

=5

24) Taking only the vertical jumps into account, we need to know when it is possible that ±2

±4 ± ... ±2 which is equivalent ±1 ±2 ± ... ± . Since flipping a sign on the LHS

would either add or subtract an even integer,

must be even. Thus, must be either 0 (mod 4) or 3

(mod 4) and n must be 0, 1, 6, 7 (mod 8).
Taking only the horizontal jumps into account, we need to known when it is possible that

±1 ±3 ±5 ± ... ± . Since flipping one of the signs on the LHS would either add

or subtract an even integer, 1 + 3 + 5 + ... + must be even, which

means must be even. Thus, n must be 0 (mod 4) or 3 (mod 4).
From both parts, we see that n must be either 0 or 7 (mod 8).
If n = 8k for some positive integer k, then the frog can go right, up, left, down, right, up in this
order k times, where it would be back to (0, 0) at the end.
If n = 8k + 7 for some nonnegative integer k, then the frog can go right, up, left, up, left,
down, right, in this order, where it returns to (0, 0), and then it can go right, up, left, down,
left, down, right, up in this order k times, where it would also be back to (0, 0) at the end.
Therefore, the answer is all integers n > 0 which are 0 (mod 8) or 7 (mod 8).

25) Given , let d : = gcd (a, b) Then g(a, b) = ⇒ s.t. gcd (m, n)
2 2
= 1, a = m m b = n .
So h(x, y) ⇒ (m2 + n2)|d ⇔ d := (m2 + n2)λ for some , whence
2 2 2 2 2 2
a = m (m + n )λ, b = n (m + n )λ, so we finally have to
minimise subject to m, n ; m ≠ n; (m, n) = 1. Thus, m, n both can't be 1 and should both be
of same parity of or λ must be even. Hence for obtaining the minimal ƒ over S the only two
possible candidates are (m, n, λ) = (1, 2, 2), (1, 3, 1) and minimal ƒ (= 25) is clearly obtained by
the former (namely, for a = 10, b = 40.

26)

We take BK = CH on BE and join OB, OC and OK. From the property of the circumcenter of a
triangle, we know that ∠BOC = 2∠A =120°. From the property of the orthocenter of a
triangle, we get ∠BHC = 180° -∠A = 120°. So ∠BOC = ∠BHC. Then four points B, C, H and O
are concyclic. Hence ∠OBH = ∠OCH
In addition, OB = OC and BK = CH. Therefore, ΔBOK ≅ ΔCOH. It follows that ∠BOK = ∠COH ,
and OK = OH. so , ∠KOH = ∠BOC = 120°, ∠OKH = ∠OHK = 30°. In ΔOKH, by the sine rule,
we get KH = OH. In view of BM =CN and BK = CH, we get KM = NH, and MH+NH
=MH+KM= KH = OH.

Value of Therefore , square of the value will be 3

27) We know that ∠ADB = ∠AEC = 90°, therefore

DADB ∾ ΔAEC,
and , ....... (1)
But BC = 25, BD = 20, and BE = 7, so CD = 15, and CE = 24,
From (1), we obtain

and the solution is

Thus, point D is the midpoint of the hypotenuse AC of Rt ΔAEC, and

Draw line DF, Since point F is on the circle with DE as its diameter, ∠DFE = 90°, we have

Since four points G, F, E and D are concyclic, and four points D, E, B and C are concyclic too,
we get
∠AFG = ∠ADE = ∠ABC
Thus GF || CB, Extend line AH to intersect BC at point P, then

........(2)
Since H is the orthocenter of ΔABC, AP ⊥ BC. From BA = BC
we have AP = CE = 24
Due to (2), we get

So, [d] = [8.64] = 8

28) Let A and B denote two adjacent vertices of the rhombus, M the point of intersection of its
diagonals, O1 and O2 the centres of the circles (O1 on AM, O2 on BM).
We have : |AB|2 = |AM|2 + |BM|2
= (|O2A|2 – |O2M|2) + (|O1B|2 – |O1M|2)
= R2 + r2 – (|O1M|2 + |O2M|2) = R2 + r2 – a2
Answer :
So put the value in above formula side of rhombus = = 24

29)
 Identity k = 0 (d = 9): 29 + 2 (–1)9 = 512 – 2 = 510.
Rotations with gcd(9,k) = 1 (six elements, d = 1) : 21 + 2(–1)1 = 2 – 2 = 0.
Rotations with gcd(9,k) = 3 (two elements, d=3) : 23 + 2(–1)3 = 8 – 2 = 6.

Final count = (510 + 6⋅0 + 2⋅6) = = 58.

So, there are 58 such colorings up to rotation.

30) If every pair of sets has at least 2 elements in common, then no two sets can be disjointed
or share only 0 or 1 element.
Fix two elements, say 1 and 2. Consider all 5-element subsets containing both 1 and 2. Any two
such subsets share at least these two elements, so their intersection size is at least 2.

The number of such subsets is Pigeonhole analogy:

A. Pigeons: the subsets in F.

B. Pigeonholes (cages): the distinct pairs of elements that the subsets contain. Since every pair of
subsets must share at least 2 elements, each subset (pigeon) must be placed into a pigeonhole
corresponding to a pair of elements it contains. To avoid two subsets having intersections less
than 2, all subsets must share the same fixed pair, i.e., be placed in the same pigeonhole.
Therefore, the largest such family consists of all 5-element subsets containing a fixed pair,
giving a maximum size of 56.