03-09-2025

1001CPE404016250007 PE

Mathematics

Section-1

1) For some real constant c, the roots of the quadratic x2 + cx – 2026 are r and s. If the quadratic

x2 + rx + s has one distinct root t (not necessarily real) find , where [∙] represents GIF.

2) How many positive integers n are there such that the following equation has at least one real
solution in x? x4 + 4x3 + 24x2 + 40x + n = 0

3) Find last 2 digits of sum of all m ∈ {1, 2, 3 .... 17} such that there
exists where here d(n) is no. of positive divisors of n.

4) Find last 2 digits of sum of digits of largest integer less than 102025 with the property that when

the first digit is moved to the end, the resulting number is times the original one.

5) Find number of natural n ≤ 2025 such that A = 2n + 3n + 5n + 6n is a perfect cube.

6) Find the area of a right triangle in which the lengths of the segments of the hypotenuse
determined by the point of tangency of the inscribed circle is given x = 6 and y = 7 as shown in

figure.

7) An equilateral triangle has sides of length . A point Q is located inside the triangle so that its
perpendicular distances from two sides of the triangle are 1 and 2. What is the perpendicular
distance of Q from the third side?

8) Given ΔABC, D, E, F are points on BC, AC, AB respectively such that BD = 2CD, AE = 3CE and AF
= 4BF. If the area of ΔABC is 240cm2, find the area of ΔDEF.
9) For S = {1,2,3,....,15}, there are N non-empty subsets having an odd sum. Find the sum of digits
of N?

10) In how many ways can 5 identical balls be distributed among 4 distinct boxes so that no two
boxes contain the same number of balls?

Section-2

1) Let P(x) be a monic polynomial of degree 3. Suppose that P(x) has remainder R(x) when it is
divided by (x – 1)(x – 4) and 2R(x) when it is divided by (x – 2)(x – 3). Given that P(0) = 5, find P(5).

2) Let a, b > 0, find the minimum value of

3) X is sum of all integers n written as in decimal representation and in base 7. Find sum
of square of digits of X.

4) Find here is the greatest integer function.

5) Let C1 and C2 be concentric circles, with C2 in the interior of C1. From a point A on C1 one draws
the tangent AB to C2 (B ∈ C2). Let C be the second point of intersection of ray AB and C1, and let D be
the midpoint of AB. A line passing through A intersects C2 at E and F in such a way that the

perpendicular bisectors of DE and CF intersect at a point M on line AB. If the ratio (where x
and y are positive integer with no common factor), then find x + y.

6) In quadrilateral ABCD, ∠DAB = ∠ABC = 110º, ∠BCD = 35º, ∠CDA = 105º, and AC bisects ∠DAB.
Find ∠ABD.

7) Let ABC be a right triangle with inradius r, let h be the length of the altitude CD to the

hypotenuse, and let r’ and r’’ denote the inradii of triangles ACD and BCD. If , (where
m and n are positive integer such that HCF (m, n) = 1), then find the value of m + n.

8) Given 8 points evenly spaced around a circle, how many ways can you draw 4 non-crossing chords
such that all points are joined in pairs?

9) How many integer solutions are there to x1 + x2 + x3 = 15 with xi ≥ 1 and all xi distinct?

10)
Count paths from (0, 0) to (8, 5) moving:
Up : (i, j) → (i + 1, j)
Up-right : (i, j) → (i + 1, j + 1)
bounded within the triangle with vertices (0, 0), (8, 0), (8, 5).

Section-3

1) Solve the equation are find the number of solutions.

2) For any real number x. Let [x] denote the integer part of x; {x} be the fractional part of x. ({x} =
x – [x]). Let A denote the set of all real numbers x satisfying

If S is the sum of all numbers in A, find [S].

3) Consider three series given below.

S : 3, 7, 11, 15, ........
P : 2, 7, 12, 17, ........
Q : 3 × 2, 7 × 7, 11 × 12, 15 × 17, ............

Let Sn, Pn and Qn represent sum of first n terms of respective series. If = 2027.

Evaluate , where [ . ] represents G.I.F.

4) Let ƒ(x) [x] be a polynomial with integer coefficients such that ƒ(1) = –1, ƒ(4) = 2 and ƒ(8) = 34.
Suppose is an integer such that ƒ(n) = n2 – 4n – 18. Determine sum of all possible values of n.

5) x is the sum of all rational numbers less than 1 in lowest terms of the form such that

for integers a, b, c, d, find x/10.

6) Given a semicircle with the diameter AB, C is a point on the semicircle and D is the midpoint of
the minor arc BC. Let AD, BC intersect at E. If CE = 3 and BD = , find AB.

7) Given a rectangle ABCD where AB = 1 and BC = 2, P, Q are on BD, BC respectively. If the

smallest possible value of CP + PQ can be written as (where m and n are positive integers such
that HCF (m,n) = 1), then find the value of m + n.

8) Let ABCDEF be a cyclic hexagon where the diagonals AD, BE, CF are concurrent. If AB = 1, BC =
2, CD = 3, DE = 4 and EF = 5, find the value of 8AF.
9) In S = {1, 2, ...., 10} there are 100 + N non-empty subsets that have the sum divisible by 3 but
not divisible by 2. Find N?

10) How many distinct ways are there to color the faces of a cube with 3 colors such that rotations of
the cube are considered the same coloring?
 ANSWER KEYS

Mathematics

Section-1

Q. 1 2 3 4 5 6 7 8 9 10
A. 92 19 53 99 0 42 03 44 22 00

Section-2

Q. 11 12 13 14 15 16 17 18 19 20
A. 15 28 42 36 08 40 02 14 72 07

Section-3

Q. 21 22 23 24 25 26 27 28 29 30
A. 02 21 02 09 54 10 13 15 72 57
 SOLUTIONS

Mathematics

1) Since the quadratic x2 + rx + s has one distinct root, its discriminant r2 – 4s is zero. Thus, by
Vieta's formula on x2 + cx – 2024, we have rs = r(r2/4) = –2026. Since c = –(r + s) = –(r + r2/4)
is real, it follows that r = –2 . By Vieta's formula on x2 + rx + s, we have t + t = –r, and t
= –r/2 = .

2) Using that (x + 1)4 = x4 + 4x3 + 6x2 + 4x + 1, and that (x + 1)2 = x2 + 2x + 1, we have that :
x4 + 4x3 + 24x2 + 40x + n = (x + 1)4 + 18x2 + 36x + n – 1
= (x + 1)4 + 18(x + 1)2 + n – 19.
Then since (x + 1)4 + 18(x + 1)2 ≥ 0, it follows that if n ≤ 19, the expression has a solution.
Since n must be a positive integer, we see that the answer is 19.

3) m ∈ prime –{2}
⇒ n = 8p ⇒ d(n) = 4 × 2

Let n(m) be such that .

n(1) = 1
n(2) = 8
n(4) = 36
n(p) = 8p p ∈ prime –{2}
n(2p) = 36p p ∈ prime –{2, 3}
n(6) = 72 p ∈ prime –{2, 3}
n(9) = 108
n(12) = 240
n(15) = 2700
n(16) = 128 _

4) Such numbers are those of the form

153846153846153846 .....153846
Obviously, since the number has the same number of digits when multiplied by 3.5, it must
begin with either 1 or 2.
Case 1. The number is of the form 10N + A, A < 10N. So 7/2 × (10N + A) = 10A + 1 is
equivalent to A = (7 × 10N – 2)/13. The powers of 10 repeat with a period of 6 mod 13 (10, 9,
12, 3, 4, 1), so A will be an integer iff n ≡ 5 (mod 6).
This gives the family of solutions above.
Case 2. The number is of the form 2 × 10N + A, A < 10N. Then, as before A = (14 × 10N – 4)/13.
But since A < 10N , this implies 10N < 4, which is impossible.

Sum of digits is = 9099.

5) We will use modular arithmetic. A perfect cube has the form 7k, 7k + 1, or 7k – 1, since (7x
+ 1)3 ≡ (7x + 2)3 = (7x + 4)3 ≡ 1 (mod 7) and (7x + 3)3 ≡ (7x + 5)3 ≡ (7x + 6)3 ≡ –1 (mod 7)
Now observe that 26 = 43 ≡ 1 (mod 7),
36 = 93 ≡ 23 ≡ 1 (mod 7),
56 = (–2)6 = 26 ≡ 1 (mod 7),
66 ≡ (–1)6 ≡ 1 (mod 7). It follows that 26k ≡ 36k ≡ 57k ≡ 66k ≡ 1 (mod 7).
Let an = 2n + 3n + 5n + 6n for n ≥ 0. Set n = 6k + r with r ∈ {0, 1, 2, 3, 4, 5, 6}.
Since 2n ≡ 2r (mod 7), 3n ≡ 3r (mod 7), 5n ≡ 5r (mod 7), and 6n ≡ 6r (mod 7), we have
an ≡ ar (mod 7).
It is eqasy to observe that a0 ≡ a2 ≡ a6 ≡ 4 (mod 7), a1 ≡ a4 ≡ 2 (mod 7), and a3 ≡ 5 (mod 7).
Therefore, an is not a perfect cube.

6)

Let ΔABC in which in circle touch the hypotenuse at D and other sides at E and F respectively.

Also let the in radius be r

so AB = AE + BE = x + r
BC = CF + BF = y + r
by Pythagoras theorem
AC2 = AB2 + BC2
(x + y)2 = (x + r)2 + (y + r)2
x2 + y2 + 2xy = x2 + y2 + 2r(x + y) + 2r2
Now

xy = r (x + y) + r2 s=

xy = r(x + y + r) s=
xy = rs s=x+y+r
xy = Δ ∵ Area Δ = rs
Area = x y = 7 × 6 = 42

7)

The height of the triangle is 6, so the area is . Let the required length be x, and consider
the area as the sum of the areas of the triangles formed by Q and the vertices.
The total area is thus (1 + 2 + x). Solving the equation 12 (1 + 2 + x) gives x =
3.

8)

Observe that . We also have .

It follows that , or [ΔAEF] = [ΔABC] = × 240 = 144.

Similarly, [ΔBDF] = and [ΔCDE] = × 240 = 20

Now [ΔDEF] = [ΔABC] – [ΔAEF] – [ΔBDF] – [ΔCDE]
= 240 – 144 – 32 – 20 = 44 cm2.

9) There are 15 elements; the sum is odd if and only if the subset contains an odd number of
odd elements. There are 8 odd numbers and 7 even numbers. For each subset, choose an odd
subset of the odd elements (excluding the empty set), and any subset of the even elements :

Number of ways to choose an odd-sized subset of 8 elements : Each can be

paired with any of the 27 subsets of evens:
128×128=16384
So, the answer is 22.

10) Let the number of balls in the 4 distinct boxes be x1, x2, x3, x4.
The problem is equivalent to finding the number of ordered 4-tuples of integers
(x1,x2,x3,x4) that satisfy the following conditions :
1. The total number of balls is 5: x1 + x2 + x3 +x4 =5.
2. The number of balls in any box is a non-negative integer: xi ≥ 0 for i∈{1,2,3,4}.
3. The number of balls in each box is unique: xi ≠ xj for all i ≠ j.
Let's try to find a set of four distinct non-negative integers {n1,n2,n3,n4} that could represent
the number of balls in the boxes. Let's order them such that 0 ≤ n1 < n2 < n3 < n4.
The minimum possible sum, Smin, is the sum of these values: Smin = 0+1+2+3=6
This leads to a contradiction. Therefore, no such distribution is possible. The number of ways
is 0.
11) The answer is 15. Let P(x) = x3 + ax2 + bx + 5. We know that R(x) has degree at most 1; let
it be R(x) = cx + d. We also know that P(x) = (x + p)(x – 1)(x – 4) + R(x)
P(x) = (x + q)(x – 2)(x – 3) + 2R(x) Using the x2 terms, the first equation gives a = p – 1 – 4 and
the second gives a = q – 2 – 3. Therefore p = q. Using the x terms, the first equation gives b =
–5p + 4 + c and the second gives b = –5p + 6 + 2c. Therefore c = –2. Using the constant
terms, the first equation gives 5 = 4p + d. Finally, plugging x = 5 into the first equation.
P(5) = (5 + p)(5 – 1)(5 – 4) + 5c + d = 20 + 4p + 5(–2) + d = 20 – 10 + 5 = 15
An alternate solution, starting from the p = q step above, is to notice that when x2 – 5x + 2 is
divided by (x – 1)(x – 4), it leaves half the remainder that it does when divided by (x – 2)(x – 3).

Therefore x2 – 5x + 2 divides P(x). Using P(0) = 5, we determine that the linear factor is ,

so P(x) = (x2 – 5x + 2)(x + ) and P(5) = 15.

12) We begin by rearranging the terms :

=
We will now estimate each group using AM-GM inequality.

= 12

Adding the three inequalities, we obtain

≥ 12 + 12 + 4 = 28.

13) We have
⇔ 999a + 93b = 39c + 342d ⇔ 333a + 31b = 13c + 114d;
hence b ≡ c (mod 3). Since b, c ∈ {0, 1, 2, 3, 4, 5, 6}, the possibilities are :
(i) b = c;
(ii) b = c + 3;
(iii) b + 3 = c.
Also, we note that 13c + 114d ≤ 762 < 3 ∙ 333; hence a ≤ 2.
In the first case we must have a = 2, d = 3d', 37 + b = 19d', d' = 2.
Hence a = 2, d = 6, b = 1, c = 1, and the number is 2116.
In the other cases a = 1. Considering a = 1, we obtain no solutions.

14)

hence = = 36
15) By Power of a point we have

AE × AF = AB2 = . (2AB) = AD × AC
and hence CDEF is cyclic. Then M is the circumcenter of quadrilateral CDEF.

Thus M is the midpoint of (and we are given

already that B is the midpoint of , D is the midpoint of . Thus a quick computation along
gives AM/MC = 5/3.
So x + y = 5 + 3 = 8

16) Let I denote the incenter of ΔABD. Then quadrilateral IBCD

is cyclic since ∠DIB = 90° + ∠DAB = 145°.

Hence we obtain ∠IBD = ∠ICD = 180º – (55º + 105º) = 20º and so ∠ABD = 40°.

17)
Since |AD| = b2 /c and |BD| = a2/c, we can apply the first equality in to each of the three right
triangles to obtain.
r + r' + r" = (1/2) [(a + b – c) + (b2/c + h – b) + (a2/c + h – a)]
= (1/2) [(a2 + b2) /c – c + 2h] = h
So m/n = 1/1, hence m + n = 2

18) This is equivalent to the 4th Catalan number:

19)

Let the values be x1 < x2 < x3, with xi ≥ 1.

Treat x1 = a, x2 = b, x3 = c.
Total sum: a + b + c = 15, with 1 ≤ a < b < c.
Equivalent to the number of partitions of 15 into 3 distinct positive integers.
Try possible values systematically:
a = 1: b + c =14
b = 2, c = 12; b = 3, c = 11; ... up to b = 6, c = 8 (since b < c)
So b can be 2,3,4,5,6 : 5 ways for a = 1
Similarly, continue for a = 2,3,4.

20) For steps Right (1, 0) and Up-right (1, 1), any path to (a, b) is a length-a word with exactly
b U's. The constraint y ≤ (b/a) x is equivalent to "in every prefix of length t, the number of U's

is ≤ [bt/a]." When gcd(a, b) = 1, the cycle lemma gives a direct count : Apply to

a = 8, b = 5 : Justification : encode R as +b and U as – (a – b); good paths are

those with all partial sums ≥ 0, and exactly a of the cyclic shifts are "good," yielding the 1/a
factor.

21) Any solution must satisfy 0 ≤ x ≤ 3/2. Two solutions are x = 0 and x = 1. Note that when 1
< x < 3/2, then
1 – (3x – 2x2) = (x – 1)(2x – 1) > 0, so that

Suppose that 4/19 < x < 1. Then 9(3x – 2x2) – (2 + x)2 = (19x – 4)(1 – x) > 0 and so
Hence, by the arithmetic geometric means inequality, we have

Now, suppose that 0 < x < 3/11. Then (3x – 2x2) – 9x2 = x(3 – 11x) > 0, so that

Since 4/19 < 3/11, we conclude that the equation has no solution in the set (0, 1) ∪ (1, 3/2) and
so x = 0 and x = 1 are the only solutions.

22) ⇒ ⇒
Let x = I + F = [x] + {x}

Case I :

so,

Hence, x = I + f = ;
I = 0, 1, 2, 3

Case II :

so, ⇒ ⇒ 3, 4, 5

Hence,

; I = 3, 4, 5

Thus,
[S] = 21

23) Given
S : 3, 7, 11, 15, .......
General terms tnS = 3 + (n – 1)4
= 4n – 1
P : 2, 7, 12, 17, ........
General terms tnP = 2 + (n – 1)5
= 5n – 3
Q : 3 × 2, 7 × 7, 11 × 12, .....
General terms tnQ = (4n – 1)(5n – 3)
= 20n2 – 17n + 3

Sn i.e. sum of first n terms of

Similarly,

Consider

= 20(n + 1)(2n + 1) – + 34n + 18

= 20(2n2 + 3n + 1) – (51 + 40n)(n + 1) + 34n + 18
2 2
= 40n + 60n + 20 – (40n + 91n + 51) + 34n + 18
= 3n – 13
= 2027 (given)
3n – 13 = 2027

⇒ n = 680

24) Let g(x) = x2 – 4x + 2 then g(1) = ƒ(1), g(4) = ƒ(4), g(8) = ƒ(8)
ƒ(x) = (x – 1)(x – 4)(x – 8)h(x) + g(x)
n2 – 4n – 18 = ƒ(n) = (n – 1)(n – 4)(n – 8)h(n) + n2 – 4n + 2 – 20
= (n – 1)(n – 4)(n – 8)h(n)
n – 1 is divisor of 20 so n = –19, –9, –4, –3, –1, 0, 2, 3, 5, 6, 11, 21
n – 4 is divisor of 20 so n = –16, –6, –1, 0, 2, 3, 5, 6, 8, 9, 14, 24
So n = –1, 0, 2, 3, 5, 6
n – 8 is divisor of 20 so n = 3, 6
Answer is n = 3, 6
25) gcd(p, 2025) = 1 = gcd (2025 – p, 2025)

= 540

We first claim that if m, n are positive integers such that the rational number belongs to

the internal (1, 2), then r can be represented in the form This can be realized by
taking a2 – ab + b2 = a2 – ad + d2, i.e., b + d = a and a + b = 3m, a + d = 2a – b = 3n; that is, a
= m + n, b = 2m – n, d = 2n – m.
We will prove now the required conclusion. If s > 0 is a rational number, take positive integers

p, q such that . There exist positive integers a, b, d such that ,

whence .

26) Let AC extended and BD extended intersect at P. One sees that AD bisects ∠BAC. Since
AB is the diameter, we have AD ⊥ BP and hence, ΔABP is an isosceles triangle where AB = AP

(because ΔABD ≅ ΔAPD). Now BP = 2BD = . It is also easy

to see that ΔBDE ~ ΔBCP since both are right angled triangles. Hence, we have BE. BC = BD.
BP (One may also see this by the Tangent Secant Theorem because C, E, D, P are concyclic.) It
follows that BE (BE + 3) = . , solving which gives BE = 5.

Hence, BC = 8 and by Pythagoras' Theorem,

CP = = .
Since PA × PC = PB × PD by the Tangent Secant Theorem we must have PA × 4 = . ,
. We conclude that AB = PA = 10.

27) Let C' be the reflection of C about BD. Draw C'H ⊥ BC at H. One sees that CP + PQ = C'P
+ PQ ≥ C'Q ≥ C'H. Refer to the left diagram below.

It is easy to see that CC' ⊥ BD and hence, ΔCC'H ~ ΔDBC.

We have . Refer to the right diagram above.

Notice that BC × CD = 2 [ΔBCD] = BD × CC'. Hence, CC' = 2 . It follows that

In conclusion, the smallest value of CP + PQ is , where C' Q ⊥ BC at Q and C' Q intersect BD

at P.
So m + n = 8 + 5 = 13

28)
Refer to the diagram below. It is easy to see that ΔABG ~ ΔEDG.

Hence, (1)

Similarly, ΔBCG ~ ΔFEG which implies (2)

By (1) and (2), and

Since ΔCDG ~ ΔAFG, . If follows that .
So 8AF = 15

29) Let :
A : subsets with sum ≡ 0 mod 3
B : subsets with sum ≡ 0 mod 2
We want :
|A \ B| = |A| – |A ∩ B|
Subsets with sum ≡ 0 mod 3. Using the roots of unity filter, we get :

Subsets with sum ≡ 0 mod 6

To find |A ∩ B|, we count subsets with sum ≡ 0 mod 6 :
|A ∩ B| = # {subsets with sum ≡ 0 mod 6} = 172
|A \ B| = 344 – 172 = 172

30) Identity : 36 = 729

90° face rotations (6) : Fixed colorings 33 = 27. Four side faces cycle, and each pair of
swapped faces must have the same color.
180° face rotations (3) : 34 = 81.
120° vertex rotations (8) : 32 = 9. Two disjoint 3-cycles, each requiring the same color.
180° edge rotations (6) : 33 = 27.

= 57
There are 57 distinct colorings, considering the 24 rotational symmetries of the cube.