0% found this document useful (0 votes)
53 views3 pages

IOQM-2021-22 - (Answers & Solutions) - Part-B

Uploaded by

Sukanya Kuruhuri
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
0% found this document useful (0 votes)
53 views3 pages

IOQM-2021-22 - (Answers & Solutions) - Part-B

Uploaded by

Sukanya Kuruhuri
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/ 3

Date: 06/03/2022 Time: 2hr.

30 Minutes

Number of Questions: 3 Max Marks: 51

Corporate Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 | Ph.: 011-47623456

Answers & Solutions


for
IOQM – 2021-22
INSTRUCTIONS TO CANDIDATES
1. Calculators (in any form) and protractors are not allowed.

2. Rulers and compasses are allowed.

3. All questions carry equal marks. Maximum marks: 51.

4. No marks will be awarded for stating an answer without justification.

5. Answer all the questions.

-1-
IOQM-2021-22

Part - B
1. Let D be an interior point on the side BC of an 2. Find all natural numbers n for which there exists
acute-angled triangle ABC. Let the circumcircle of a permutation  of 1, 2, …, n such that
triangle ADB intersect AC again at E( A) and the n
  ( i )( –2)
i –1
circumcircle of triangle ADC intersect AB again at =0
F( A). Let AD, BE and CF intersect the i =1
circumcircle of triangle ABC again at D1( A), Note : A permutation of 1, 2…, n is a bijective
E1( B) and F1( C), respectively. Let I and I1 be function from {1, 2, …, n) to itself.
the incentres of triangles DEF and D1E1F1, Sol. Claim : If n = k satisfies the condition
respectively. Prove that E, F, I, I1 are concyclic. n

Sol.  (i )  (−2)i −1 = 0 , then n = k + 3 also satisfies


i =1
this condition.
Proof : Let (i) be a required permutation such
n
that  (i )  (−2)i −1 = 0 for n = k, then let a
i =1

permutation (i) for n = k + 3 such that (1) = 2,


(2) = 3, (k + 3) = 1 and (i + 2) = (i) + 3  1
 i  k.
k+3
Then  (i )  ( −2)i −1
i =1

k+ 2
= 2 − 23 +  (i )  (−2)i −1 + 1 ( −2)k + 2
i =3

k
Refer to Diagram = − 4 +  (i + 2)( −2)i +1 + ( −2)k + 2
i =1
ADF = ACF = (say)
k
and ADE = ABE = (say) = ( −2)k + 2 − 4 + 4  ( −2)i −1((i ) + 3)
So FDE =  +  i =1

 +  k k 
Hence FIE = 90° +   …(i) = ( −2)k + 2 − 4 + 4  (i )( −2)i −1 + 3 ( −2)i −1 
 2   i =1 i =1 
{because I is incentre of DEF}  3(1 − ( −2)k ) 
= ( −2)k + 2 − 4 + 4 0 + 
Similarly F1D1E1 = AD1F1 + AD1E1  3 
=+
=0
 + 
Hence F1I1E1 = 90° +   …(ii) Clearly, n = 2 and n = 3 satisfy the given condition.
 2  For n = 2,
Now, BE1D1 = BAD1 = FAD = FCD = F1CB (1) = 2 and (2) = 1
= F1E1B For n = 3,
So EE1 is angle bisector of E1 in D1E1F1 (1) = 2, (2) = 3 and (3) = 1
Similarly FF1 is also angle bisector of F1 in n
D1E1F1. Also,  (i )(−2)i −1 = 0 and (−2)i −1  1 (mod 3)
i =1
 + 
So from (ii), FI1 E = 90° +   …(iii) n
n (n + 1)
 2  So,  (i )  0 (mod 3) 
2
 0 (mod 3)
i =1
Using (i) and (iii), we can conclude that E, F, I and
I1 are concyclic. Clearly, n  1 (mod 3)

-2-
IOQM-2021-22

( )
2n – r
( )
n
Hence, whenever n is 3 or 3 + 2 type positive
T 2n – 1 =  2r –2
C2r –1 –1 (because T(1) = 1)
integer the given condition is satisfied (where r =2
  N).
Index of 2 in
3. For a positive integer N, let T(N) denote the
number of arrangements of the integers 1, 2, …, 2r –2
C2r –1 –1 = ( 2 – 1) + (2 – 1) + ... + (2 – 1)
r –1 r –2 1

N into a sequence a1, a2,…,aN such that ai > a2i


for all i, 1  i < 2i  N and ai > a2i + 1, for all i, 1  i –2( 2 – 1) + ( 2 – 1) + ... + ( 2 – 1)
r –2 r –3 1

< 2i + 1  N. For example, T(3) is 2, since the


possible arrangements are 321 and 312. =r–1

(a) Find T(7) So index of 2 in

( ) ( )
n
(b) If K is the largest non-negative integer so that
T 2n – 1 =  2n – r Index of 2 in 2r – 2
C2r –1 –1
2K divides T(2n –1), show that K = 2n – n – 1. r =2

(c) Find the largest non-negative integer K so n


that 2K divides T(2n + 1) =  ( r – 1)  2n – r
r =2
Sol.
= 2n – n – 1
( ) ( ( ))
2
2n –2
(a) T 2 – 1 =n
C2n–1 –1 T 2 n –1
–1
(c) (
T 2n + 1 = ) 2n
( ) (
C2n –1 –1  T 2n –1 + 1  T 2n –1 – 1  n  1 )
Because a1 (which has value has a fixed 2n–1)
position and other ai’s can be divided into two Similarly
equal groups which can be arranged in
T (2n–1 – 1) ways each.
(
T 2n –1 + 1 = ) 2n –1
(
C2n –2 –1  T 2n – 2 + 1  T 2n – 2 – 1 ) ( )
(
Hence, T 23 – 1 = 6C3 T 22 – 1 ) ( ( ))
2
(
T 2n – 2 + 1 = ) 2n –2
(
C2n–3 –1  T 2n –3 + 1  T 2n –3 – 1 ) ( )
 T(7) = 20(2)2 = 80 ………………………………………………

( ) ( ( ))
………………………………………………
2
2n –2
(b) T 2n – 1 = C2n–1 –1 T 2n –1 – 1

Similarly
(
T 22 + 1 = ) 22
(
C21 –1  T 21 + 1  T 21 – 1 ) ( )
( ( ))
____________________________________
( )
2
2n –1 –2
T 2n –1 – 1 = C2n–2 –1 T 2n –2 – 1
By multiplying all equations, we get

( ) ( ( ))
2
 n r   n –1
)   T (3 )
n –2
T 2n –2 – 1 =
( ) (
2 –2
C2n–3 –1 T 2n –3 – 1 T 2n + 1 =   2 C2r –1 –1    T 2r – 1
 r =2   r =1 
………………………………………………
2r
……………………………………………… Index of 2 in C2r –1 –1 is r, then

( ) ( ( )) n –1
2

( )
22 –2 n
T 22 – 1 = C21 –1 T 21 – 1 Index of 2 in T ( 2n + 1) =  r +  2r – r – 1 + 1
r =2 r =1
____________________________________
Eliminating intermediate terms, we get = 2n  n  2

❑ ❑ ❑

-3-

You might also like