ISI and CMI

MOCK-EXAM 2019

Date:-14/12/2018

Instructions

1. The paper consists of 6 subjective problems

2. The allotted time is 3(+1/2) hours

3. Clearly explain your entire reasoning , no credits will be given without reasoning

4. Credits allotted to each problem are indicated with problems

5. The test solutions must be submitted on or before 17 DECEMBER 2019

6. Submit your solutions to the email address given at last

Best of Luck
PROBLEM (1)

(a) Prove that there exist infinite prime numbers which are of the form 4k+3 where k is a whole
number.(5)
(b) Prove that there exists a number divisible by 23 consisting of only 0’s and 1’s in base 10
form.(5)

PROBLEM (2)
1
(a) A species of ORCS either produces 1 offspring with probability 4 , 2 offspring with
1 1
probability 4 and dies with probability 2 , What is the probability that no orcs remain after

a very long time given there were a total of 10 in the beginning ? (5)
(b) Three Boxes are labelled as X,Y,Z and each box contains 5 magical potions the power of
which are labelled by numbers 1,2,3,4,5. One potion is chosen randomly from each of the
three boxes. If a,b,c are the powers on the potions chosen from X,Y,Z respectively then find
the probability that a=b+c. (5)

PROBLEM (3)

(a) Prove that in a sequence consisting of 𝑛 2 +1 numbers in a row you can always find a
monotonic subsequence consisting of n+1 numbers (7)
(b) In number theory , a modular multiplicative inverse of an integer A is an integer 𝑛
Such that the product A×n is congruent to 1 with respect to the modulus m, Does 𝑛
Always exists for any chosen A and m or there exists a condition which must be ensured for
the existence of 𝑛(Derive the condition if it exists). (3)

PROBLEM (4)

(a) The Dark Lord Sauron is angry with the defeat of his forces and decides to hold a meeting of
his top 36 commanders .The meeting hall is in the form of a 6×6 Checkerboard where each
unit square serves as a seat for the commanders. Each of them asks all his
neighbours (sitting next to, in front of, or behind him, i.e. 4 members at most ) how much
they coins they earn. They all have a lot of envy towards each other, a commander is
content with his salary only if he has at most one neighbour who has a higher earning. Since
the Dark Lord wants only the happy and content commanders, He arranges them in such a
way that maximum number of commanders are happy. Read the mind of The Dark Lord and
find out with proof the maximum number of happy and content commanders (Assume that
every commander has a different earning ). (15)

PROBLEM (5)

(a) Let 𝑓(𝑥) = max(|5 − 𝑥|, 7−|𝑥| , Find the points of discontinuity and non-differentiability
of 𝑓(𝑥). (5)
PROBLEM (6)

1
𝑥 2, 0 ≤ 𝑥 <
2
(a) Let us define a function 𝑓(𝑥) = { 1 and another function 𝑔(𝑥) such
(𝑥 − 1)2 , ≤𝑥≤1
2
that the area enclosed by curves 𝑓(𝑥) 𝑎𝑛𝑑 𝑥 − 𝑎𝑥𝑖𝑠 between the ordinate 𝑥 = 𝑎 𝑎𝑛𝑑 𝑥 =
1 1
𝑎 + 𝑔(𝑎) is half the area enclosed by 𝑓(𝑥) 𝑎𝑛𝑑 𝑥 − 𝑎𝑥𝑖𝑠 ( where 0 < 𝑎 < and < 𝑎 +
2 2
𝑔(𝑎) < 1)
Find the value of the limit given below. (10)

(𝑔(𝑥) + 𝑥 − 1)3
lim
𝑥→1/2 1
(𝑥 − )
2

Test by

1. Ishaan Singh (Creator and Marker)

2. Vidit Jain (Creator)

3. Shreyansh Singh (Marker)

Submit your solutions on ishaansingh600@gmail.com

(Bonus problems and one more subjective will be given in the objective test)