Scribd
Upload
61 views1 page

ISI Entrance 2024 2 Subjective

The document is a mock test for the ISI/CMI Entrance 2024 conducted by the Ramanujan School of Mathematics, consisting of eight mathematical problems. Each problem covers various topics including set theory, polynomial roots, combinatorial structures, and calculus. The test is designed to assess the mathematical skills of candidates within a time limit of two hours for a total of 80 marks.

Uploaded by

Himanish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
61 views1 page

ISI Entrance 2024 2 Subjective

The document is a mock test for the ISI/CMI Entrance 2024 conducted by the Ramanujan School of Mathematics, consisting of eight mathematical problems. Each problem covers various topics including set theory, polynomial roots, combinatorial structures, and calculus. The test is designed to assess the mathematical skills of candidates within a time limit of two hours for a total of 80 marks.

Uploaded by

Himanish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Ramanujan School of Mathematics

Mock Test for ISI/CMI Entrance 2024

Time Allotted: 2 hours Attempt all the questions Marks: 10 ⇥ 8 = 80

1. Show that the set {1, 2, . . . , 2n} can be split into two disjoint subsets of size n whose union is the
set itself such that the sum of elements of one subset divides that of the other if and only if n is
not of the form 6k + 5.

2. Let z1 , . . . , zp be the complex roots of the polynomial f (x) = xp + c1 xp 1 + · · · + cp 1 x + cp = 0 and


let g(x) = xp + a1 xp 1 + · · · + ap be another polynomial where ci , ai 2 C such that |ci ai | < M i R
and |ci | < M i for every 1  i  p, for some fixed M, R > 0.
P p
(a) Let 1 , . . . , p > 0 satisfy pk=1 1k  1. Then, show that for every i, |zi |  max k k |ck |.
1kp

(b) Show that for every root zj of f, there is some root zp0 of g such that the distance between
p
them is at most 2M p R.

3. A society is called friendly if for every two distinct members a and b of the society, there exists a
third member c such that c is friends with exactly one of a or b. Prove that every friendly society
of n ( 2) people contains a friendly society of n 1 people. (Friendship is a symmetric and
non-reflexive relation.)

4. Let m, n be positive integers. Show that the number of triplets (x, y, z) of non-negative integers
satisfying mx + ny + z = mn equals 12 ((m + 1)(n + 1) + gcd(m, n) + 1) .
n
5. Define xn = 22 + 1 for all n 1. Show that for every n 1, it holds that

1 2 22 2n 1 1
+ + + ··· + < .
x1 x2 x3 xn 3

6. Given any real polynomial f (x), show that it is always possible to find non-constant polynomials
g(x), h(x) with f (x) = g(h(x)) h(g(x)). (Hint: 2ax + b = a ((x + 1)2 x2 ) + (b a))

7. Let f : [a, b] ! R be twice di↵erentiable with f 00 > 0 on [a, b]. Show that for every ⌘ 2 (a, b), there
exists some c 2 [a, b] such that

f (c) f (a) f (b) f (c)


either f 0 (⌘) = or f 0 (⌘) = .
c a b c

8. For any non-empty set of numbers S, (S) and ⇡(S) denote the sum and product, respectively, of
the elements of S. Show that
X (S) ✓ ◆
2 1 1 1
= (n + 2n) 1 + + + ··· + (n + 1),
⇡(S) 2 3 n

where the sum extends over all non-empty subsets of {1, 2, . . . , n}.

If you’re done solving the above, come up with a witty closing remark.

You might also like