RankRizz
JEE ADVANCED 2024 · PAPER 2+3HARDTRANSCRIBED

JEE Advanced 2024 Mathematics question — Arrangements with restrictions

If the value of n(Y)+n(Z)n(Y) + n(Z) is k2k^2, then ∣k∣|k| is ______.

SOLUTION

The set S={1,2,3,4,5,6}S = \{1,2,3,4,5,6\} has six elements. Every relation under consideration must satisfy the two fixed conditions:

(i) it contains exactly 66 ordered pairs, and
(ii) each ordered pair (a,b)(a,b) in it obeys ∣a−b∣≥2|a-b|\ge 2.

We study the two subsets of relations, YY and ZZ, separately.

Case 1: Counting n(Y)n(Y)

By definition, each relation R∈YR\in Y has a range that is a single element, say {b}\{b\}. Hence the only possible pairs in such an RR are of the form (a,b)(a,b) with a∈Sa\in S. Because RR must contain exactly six distinct ordered pairs, every first component a=1,2,3,4,5,6a=1,2,3,4,5,6 must occur once:

R={(1,b),(2,b),(3,b),(4,b),(5,b),(6,b)}.R=\{(1,b),(2,b),(3,b),(4,b),(5,b),(6,b)\}.

For this relation to be admissible, each pair must satisfy ∣a−b∣≥2|a-b|\ge 2. In particular, ∣b−b∣=0<2|b-b|=0\lt 2 fails for the pair (b,b)(b,b). Therefore no value of bb can make all six pairs valid, and hence

n(Y)=0.n(Y)=0.

Case 2: Counting n(Z)n(Z)

A relation R∈ZR\in Z is a function from SS to SS. Thus for every a∈Sa\in S there is exactly one ordered pair (a,f(a))(a,f(a)) in RR. The requirement ∣a−f(a)∣≥2|a-f(a)|\ge 2 must hold for each aa.

We list the permissible images for every element of SS:

For a=1a=1: ∣1−b∣≥2⟹b=3,4,5,6|1-b|\ge 2\Longrightarrow b=3,4,5,6  ⇒\Rightarrow  4 choices.
For a=2a=2: ∣2−b∣≥2⟹b=4,5,6|2-b|\ge 2\Longrightarrow b=4,5,6  ⇒\Rightarrow  3 choices.
For a=3a=3: ∣3−b∣≥2⟹b=1,5,6|3-b|\ge 2\Longrightarrow b=1,5,6  ⇒\Rightarrow  3 choices.
For a=4a=4: ∣4−b∣≥2⟹b=1,2,6|4-b|\ge 2\Longrightarrow b=1,2,6  ⇒\Rightarrow  3 choices.
For a=5a=5: ∣5−b∣≥2⟹b=1,2,3|5-b|\ge 2\Longrightarrow b=1,2,3  ⇒\Rightarrow  3 choices.
For a=6a=6: ∣6−b∣≥2⟹b=1,2,3,4|6-b|\ge 2\Longrightarrow b=1,2,3,4  ⇒\Rightarrow  4 choices.

Because the six choices are independent (the function need not be one-to-one), the total number of such functions equals the product of the individual counts:

n(Z)=4⋅3⋅3⋅3⋅3⋅4=42 34=16⋅81=1296.n(Z)=4\cdot 3\cdot 3\cdot 3\cdot 3\cdot 4 =4^{2}\,3^{4}=16\cdot 81=1296.

Final computation

n(Y)+n(Z)=0+1296=1296=k2  ⟹  ∣k∣=1296=36.n(Y)+n(Z)=0+1296=1296=k^{2}\; \Longrightarrow\; |k|=\sqrt{1296}=36.

Hence the required value is 36.

Tagged Arrangements with restrictions. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicArrangements with restrictions
TypeNumerical answer