Mock Test for ISI and CMI Entrance

Time alloted: 2 hours Attempt all the questions. Marks: 10 × 8 = 80

1. Let {an }n≥1 be an infinite sequence of integers such that for n ≥ 1, an+2 = 7a2n+1 + an , where
a1 = 1 and a2 = 25. What is the remainder when a2023! is divided by 44? (Don’t miss the ! sign)
2. Rectangles BCC1 B2 , CAA1 C2 , and ABB1 A2 are constructed outwardly on the sides of an acute
△ABC. If ̸ BC1 C + ̸ CA1 A + ̸ AB1 B = 180◦ , show that B1 C2 , C1 A2 and A1 B2 are concurrent.
R 2
1
3. Let f : [0, 1] → [0, ∞) be a non-decreasing continuous function. Prove that 0 f (x) dx ≤
R1
0
2x(f (x)2 ) dx.
4. Determine the value of abc if a, b, c are real numbers such that
 
1 1 1 1 1 1 a b c
+ + =4 + + = + + = 4.
a b c b+c c+a a+b b+c c+a a+b

5. Let x1 , x2 , . . . , xk be positive real numbers with x1 x2 · · · xk ≤ 1 and m, n positive real numbers

such that n ≤ km. Prove that m (xn1 + xn2 + · · · + xnk − k) ≥ n (xm m m
1 x2 . . . xk − 1) .
Rx
6. In Economics, the income distribution of a population is often modelled as F (x) = 0 f (t)dt,
R∞
where f : [0, ∞) → [0, ∞) is continuous and 0 f (t)dt = 1. (F (x) represents the proportion of
the population with income less than x.) Assuming that limx→∞ x(1 − F (x)) = 0, show that
Z ∞ Z ∞
1 1
F (x)(1 − F (x)) dx = 1 − (1 − F (x))2 dx, (1)
µ 0 µ 0
R∞
where µ := 0 xf (x)dx is finite (given). Also, calculate the quantity in (1) for the function
f (x) = αk α /xα+1 for x > k, and f (x) = 0 for 0 ≤ x ≤ k, where α, k are greater than 1.
7. A magician has one hundred cards numbered 1 to 100. He puts them into three boxes colored
red, blue and white. A member of the audience selects two of the three boxes, chooses one card
from each and announces the sum of the numbers on the chosen cards. Given this sum, the
magician identifies the box from which no card has been chosen.

(a) Show that if 1 and 2 are put in the same box and 3 in a different box, then the magician
cannot pull this trick. (The boxes have to non-empty for the trick to make sense.)
(b) How many ways are there to put all the cards into the boxes so that this trick always works?

8. Let |U | and σ(U ) denote respectively the number of elements and the sum of a finite set U (both
are 0 if U is empty). Let S be a finite set of positive integers. Prove that the sum
 
X
|U | m − σ(U )
(−1)
U ⊆S
|S|

is same as the product of the elements of S, for any integer m ≥ σ(S). Recall, nk = k!(n−k)! n!


.
k k
You may use the notation that [x ]P (x) = the coefficient of x in P (x). (Yes, this is a hint.)