CMI BSc entrance exam on May 24, 2025

Unless specified otherwise, in this exam all numbers are real and “function” means a
function whose codomain as well as domain is the set of all real numbers or an implied
subset. You may use the following information if you find it relevant.

sin(2θ)
2025 = 34 × 52 tan(θ) =
1 + cos(2θ)

Instructions for Part A

• Part A is worth 40 points. It has 17 questions, which are numbered 2 to 18
for technical reasons. There is no negative marking.

• For each of the Part A questions, type in your answer as directed.

– In questions where multiple choices are given, type the label(s) of the correct
option(s) from the given list. There are no True/False questions.
– For numerical answers, unless specified otherwise, enter the closest integer.
E.g., enter 3 if the answer is any of e, 3, π, but enter 4 for answer 3.5.
– In remaining cases, the format of the answer is explained with the question
and an example is given in blue. Read the instructions carefully.

• Part A will be used for screening. Part B is assured to be graded if you

meet any one of the following two conditions. (i) You score at least 24 in part A.
(ii) You are among the top 400 students in part A. Thus part B will be graded
for at least 400 students, more if enough students score at least 24 in part A.

Instructions for Part B

• Part B has 6 problems worth a total of 80 points. Solve each part B
problem on the designated pages in the answer booklet.

• Clearly explain your entire reasoning. No credit will be given without

correct reasoning. You may solve a later part of a problem by assuming some
previous part(s), even if you could not do the earlier part(s).

• You are advised to spend at least 2 hours on part B.

 Part A questions
Question numbering deliberately starts at 2.

Information for questions (2) to (5)

Let S = {1, 2, . . . , 100}. Randomly pick an element x from S, every element being equally
probable. Let S1 be the set of all elements in S less than or equal to x and let S2 be the set
of all remaining elements of S, i.e., elements strictly bigger than x. Answer questions (2) to
(5) as per the given instruction.

Instruction for (2) to (5)

If the probability is p%, then your answer should be the integer closest to p. E.g., for
probability 13 = 33.33 . . . %, you should type 33 as your answer. For probability 32 you should
type 67 as your answer.

Questions

(2) What is the probability that 50 belongs to a set of size exactly 60? [1 point]

(3) What is the probability that 20 belongs to S1 and 60 belongs to S2 ? [1 point]

(4) What is the probability that 20 and 60 are both in S1 or they are both in S2 ? [1 point]

(5) What is the probability that the product of sizes |S1 ||S2 | > 900? [2 points]

(6) Let P = (a, b, c) be the point on the plane 3x + 5y − 7z = 9 that is closest to the point
(8, 12, −13). Write the integer that is closest to a2 + b2 + c2 . [3 points]

(7) Write the value of the following number correct to two decimal places. E.g., for e type
2.72 and for 3 type 3.00. If the limit does not exist, type DNE as your answer. [4 points]
!
ln(1 + tx)
lim lim R x p
t→0+ x→0+
0
ex − cos(t) cos(x) dx
Information for questions (8) and (9)

A and B are points on a paper with AB = 10. A fly walks on the paper from A to B in such
a way that for any third point P on the path, ∠AP B = α, where α = the angle opposite to
side 4 in a triangle with sides 3, 4, 5.

Questions

(8) The path traced out by the fly is part of . Fill in the blank with the number of
one of the following options. [1 point]

1. a straight line

2. a circle

3. an ellipse

4. a parabola

5. a hyperbola

6. none of the options numbered 1 to 5

(9) For each point P along the path, consider △AP B. Write the maximum possible area of
such a triangle. [3 points]

Information for questions (10) and (11)

Let C be the curve defined by y = x2 where 0 ≤ x ≤ 2. Let P = (9, −3).

Questions

(10) The x-coordinate of a point on C closest to P satisfies ax3 + bx = c where a, b, c are

integers with gcd(a, b, c) = 1. Write the values of a, b, c separated by commas with no gaps.
E.g., for x3 + 2x = 3, the answer would be 1,2,3. [2 points]

(11) Let d = the minimum distance of P from a point on C. Let D = the maximum distance
of P from a point on C. Write two integers separated by only a comma: the integer closest
to d2 , the integer closest to D2 . E.g., 20,25 is an answer in the correct format. [3 points]

(12) Count the number of ordered tuples of integers (a, n1 , n2 , n3 , n4 ) such that all three
conditions below are satisfied. [4 points]
• a > 0.
• ni ≥ −1 for each i.
• a2 + n1 + n2 + n3 + n4 = 5.
Information for question (13)

Claim: Suppose a, b are distinct roots of a polynomial p(x). Then p(x) is a multiple of
(x − a)(x − b).

Proof from first principles: Use long division to get p(x) = (x − a)q(x) + r where 1
is some constant. Substituting x = 2 , we get r = 3 , so 4 is a multiple of
(x − a). Now substituting x = 5 we get that 6 is a root of 7 . Finally, again
apply the logic in the first two sentences, now to q(x). This shows that 8 is a multiple
of 9 , completing the proof.

Options for the blanks

A. a B. b C. r

D. 0 E. q(a) F. q(b)

G. q(r) H. p(x) I. q(x)

J. (x − a) K. (x − b) L. (x − r)

(13) Complete the given proof by writing a sequence of nine letters indicating the correct
options to fill in the numbered blanks 1 to 9. Do not use any spaces, full stop or any other
punctuation. E.g., ABACDIJKB is in the correct format. [3 points]

Information for question (14)

Logic similar to Question (13) works for a polynomial P (x, y) in two variables: if after
substituting x = f (y) one gets P (f (y), y) = 0, then P (x, y) = (x − f (y))Q(x, y). Similarly
if P (g(y), y) = 0 as well, then an analogous conclusion holds. Assume this.

Now let A(x, y) be a symmetric polynomial, meaning A(x, y) = A(y, x). Let ω = e2πi/3 .
Suppose that substituting x = ωy gives A(ωy, y) = 0. Then A(x, y) is a multiple of 1 .
Therefore it is a multiple of 2 too. Therefore A(x, y) must be a multiple of the following
polynomial with integer coefficients: 3 .

Options for the blanks

A. (x − ωy) B. (y − ωx)

C. (x + ωy) D. (y + ωx)

E. (x + y) F. x2 − 2xy + y 2

G. x2 − xy + y 2 H. x2 + y 2

I. x2 + xy + y 2 J. x2 + 2xy + y 2

(14) Complete the reasoning about A(x, y) by writing a sequence of three letters indicating
the correct options to fill in the numbered blanks 1 to 3. E.g., ABC is in the correct format.
[2 points]
Information for question (15)

Claim: x = y = z = 0 is the only integer solution to x2 + y 2 = 105z 2 .

Proof: Consider an integer solution (x, y, z) with the 1 possible value of |x| + |y| + |z|.
When any perfect square is divided by 3 the possible remainders are 0 and 1. Therefore,
when each term on the left hand side x2 + y 2 is divided by 3, the possible combinations of
remainders are 0 + 0, 0 + 1, 1 + 0, and 1 + 1.
It follows that 2 must be divisible by 3 . Therefore x2 + y 2 is divisible by 4 .
Therefore 5 is divisible by 6 because 105 is divisible by 7 but not by 8 .
Now observe that 9 x, y and z by 10 still gives a solution of the given equation.
Unless x = y = z = 0, this contradicts the first sentence of the proof.

Options for the blanks

A. largest B. smallest

C. x D. y

E. z F. x or y

G. both x and y H. x or y or z

I. all of x, y, z J. dividing

K. multiplying An integer from 0 to 9

(15) Fill each blank with the letter of an option OR an integer between 0 to 9. For example
K9AC6JK1BB is an answer in the correct format. [4 points]

Information for question (16)

Can the argument in Question (15) work with the exact same logic to prove the same claim
for the same integer equation x2 + y 2 = 105z 2 , if we divide by a number other than 3? You
are asked to test this for 5 and 7 and answer as explained in the question.

(16) Write your answer as a single letter from options A,B,C,D followed by listing in increas-
ing order the letter of every equality that is NOT encountered while deciding the correct
option from A to D. For example, AGI is an answer in the correct format. [2 points]

Options for (16)

A. Same argument works for 5 as well as 7
B. Same argument works for 5 but not 7
C. Same argument works for 7 but not 5
D. Same argument works for neither 5 nor 7
E. 0 + 1 = 1 F. 1 + 1 = 2 G. 1 + 2 = 3 H. 1 + 4 = 5
I. 2 + 2 = 4 J. 3 + 3 = 6 K. 4 + 4 = 8
Information for questions (17) and (18)

Suppose a function f (x) has domain R and satisfies the following three conditions.
(A) f is differentiable.
(B) f is increasing.
(C) 0 < f (x) ≤ 1 for each x.
Suppose limx→∞ f ′ (x) = a real number L. Complete the following proof showing L = 0.
Proof: By the given condition 1 , the value of L must be 2 3 . If L is nonzero,
we can choose a large enough N such that for x 4 N , the value of f ′ (x) is ≥ 5 .
Therefore by the following theorem 6 , for any x ≥ 7 , given condition 8 will
be violated, giving a contradiction.

Options for the blanks

A. (A) B. (B) C. (C)

D. = E. ≥ F. ≤

G. 0 H. 1/2 I. 1

J. L/2 K. 2L L. L

L
M. N + 2
N. N + L O. N + 2L

2 1 1
P. N + L
Q. N + L
R. N + 2L

S. Mean value theorem

T. Extreme value theorem

U. Intermediate value theorem

V. Fundamental theorem of calculus

Questions

(17) Write a sequence of 5 letters indicating the correct options to fill in the numbered blanks
1 to 5. For example, BACDE is in the correct format. [2 points]

(18) Write a sequence of 3 letters indicating the correct options to fill in the numbered blanks
6 to 8. E.g., WJE is in the correct format. [2 points]
 Part B Problems for BSc entrance exam on May 24, 2025

B1. [12 points] Suppose five complex numbers z1 , z2 , z3 , z4 , z5 form the vertices of a regular
pentagon that is inscribed in a circle of radius 2 with center at c = 6 + 8i.
(a) Find all possible values of S = z12 + z22 + z32 + z42 + z52 . State a value of z1 maximizing |S|.
(b) Find all possible values of P = z1 z2 z3 z4 z5 . State a value of z1 minimizing |P |.

B2. [12 points] Consider the following functions from R2 = {(a, b) | a, b ∈ R} to itself. Let
Rα be counterclockwise rotation by angle α and let Fα = reflection in the line that makes
counterclockwise angle α with the X-axis. E.g., R90◦ (1, 0) = (0, 1) and F90◦ (1, 0) = (−1, 0).
(a) Evaluate Rα (r cos θ, r sin θ) and Fα (r cos θ, r sin θ), where r ≥ 0 and θ is any angle.
(b) Geometrically describe the composition of functions Fα ◦ F0 . (Note that F0 = reflection
in the X-axis.) You may use any valid method as long as you explain clearly.
(c) For any angles α and β, geometrically describe Fα ◦ Fβ in one crisp sentence. You may
appeal to (b) if you justify why and how your work in (b) can be used here. Find G(P ) for
G = (F20◦ ◦ F25◦ )9 = (F20◦ ◦ F25◦ ) composed with itself 9 times and P = the point (20, 25).

B3. [12 points] A particle starts at (0,0) and travels in the first quadrant along a straight
line. It maintains the slope AND stays in the square bounded by the lines x = 0, x = 1, y = 0
and y = 1 as follows. Whenever it reaches the boundary of this square it magically jumps
1 unit to the left or down or both as applicable. In other words, for a < 1, it jumps to
(a, 0) upon reaching (a, 1), it jumps to (0, a) upon reaching (1, a), and it jumps to (0,0) if it
reaches (1,1). If the particle ever reaches a previously visited point, it stops.
jump jump
For example, (0, 0) → (1/2, 1) −−−→ (1/2, 0) → (1, 1) −−−→ (0, 0) is a trajectory of length
√
5. (Jumps don’t count for length.) Another way to visualize this trajectory is to let the
particle continue across the boundary y = 1 and interpret what happens.
(a) What are all the possible stopping points for finite trajectories?
(b) If the particle starts at the angle 30◦ with respect to the X-axis, show that it never stops.
(c) Find the two smallest possible integer lengths among all finite trajectories.

B4. [12 points] The domain of f is the set of positive integers and f (xy) = f (x) + f (y) for
all x, y. Answer the independent questions below. (Data from (a) are not valid for the rest.)
(a) Suppose f (2025) = 0, f (20) = 10 and f (25) = 20. What is the smallest n for which f (n)
is not uniquely determined? Write values of f (x) for each positive integer x < n.
(b) Is there such a function f for which f (x) = 0 for all positive integers x < 20252025 but f
is not identically 0? Show how to define such f or show that it is not possible.
(c) The domain of a function g is the set of positive rational numbers, codomain the set
of integers*, and g(xy) = g(x) + g(y) for all positive rational x, y. Suppose g(a) = 24,
g(b) = 2025, g(c) = 102025 for some rational numbers a, b, c. Show that there are infinitely
many rational numbers r such that g(r) = 1. (*See solutions for relevance of the codomain.)
B5. [16 points] Solve the following. Part (b) can be done independently and may be easier.

(a) Construct a function f with domain R such that f is differentiable, weakly increasing,
bounded, and limx→∞ f ′ (x) does not exist. (Weakly increasing means f (a) ≤ f (b) for a < b.
Bounded means there are constants m, M such that for every real x, we have m < f (x) < M .)
Possible hints: What kind of function should f ′ (x) be to satisfy the requirements? Thinking
in terms of pictures may help. Is there a way to construct a function whose derivative is a
desired function? If needed, you may take the domain of f to be [0, ∞) instead.
(b) Construct a function g with domain R such that g is differentiable, strictly increasing,
bounded, limx→ −∞ g(x) = 0 , limx→∞ g ′ (x) does not exist, and limx→ −∞ g ′ (x) does not exist.
(Strictly increasing means g(a) < g(b) for a < b.)
Possible hint: You may use your answer to part (a) and adjust as necessary. Even if you did
not do part (a), you may take as given a function f with domain [0, ∞) and the required
properties in (a). Then show with clear explanation how to build g in terms of f .

B6. [16 points] a1 , a2 , a3 , . . . , an is a sequence of distinct numbers, each written on a card.

Take the cards one by one in order. Place them into stacks subject to this rule: one can only
place a smaller number on top of a larger number or one can start a new stack with a card.
Here is a simple greedy strategy. Make stacks along a line and place the incoming card on
top of the leftmost stack possible. So if the incoming card cannot be placed on any existing
stack, then we use that card to start a new stack to the right of all current stacks.
4
For example, with the sequence 3 7 2 5 6 4 9 8 we get the four stacks: 2 5 8
3 7 6 9
(a) Show that under the greedy strategy, the top numbers on the stacks increase from left
to right, e.g., 2 4 6 8 in the example above.
(b) Show that under the greedy strategy, the number of stacks is the length of a longest
possible increasing subsequence of a1 , a2 , a3 , . . . , an . A subsequence means ai1 , ai2 , . . . , aik
with 1 ≤ i1 < i2 < . . . < ik ≤ n. The example given above has an increasing subsequence of
length 4 (e.g., 3 5 6 8 among others) but none of length 5. It also gives 4 stacks as claimed.
Possible hint: for an entry x in the given sequence, let ℓ(x) = the length of a longest
increasing subsequence whose last entry is x. What are the values of ℓ(x) in the example?
(c) Show that the greedy strategy gives the minimum possible number of stacks.
(d) Find two sequences that give the same end result of stacks after using the greedy strategy.
(e) Show that not every sequence of legal stacks is obtainable by using the greedy strategy.
(Legal stack means numbers increase from top to bottom.) Given a sequence of legal stacks
along a line, how will you decide if it arises as the result of using the greedy strategy on
some sequence of numbers?