Permutations & CombinationshardFree

Ordered pairs of subsets with max(X) greater than min(Y) | JEE Advanced

JEE Maths question with a full step-by-step solution.

Question
Suppose AA is the set of the first 33 natural numbers. Taking XX, YY as non-empty subsets of AA, the number of ordered set pairs (X,Y)\left(X,Y\right) such that max⁡(X)>min⁡(Y)\max\left(X\right)>\min\left(Y\right) is 2p2^{p}; then pp is equal to
Solution
Answer: 5
Step 1: Write n=∣A∣n = \left|A\right| and count the complementary event max⁡(X)≤min⁡(Y)\max\left(X\right) \le \min\left(Y\right). Fixing m=max⁡(X)m = \max\left(X\right), the set XX must contain mm and may contain any of 1,…,m−11,\ldots,m-1:
2 m−1 choices2^{\,m-1}\ \text{choices}
 Step 2: min⁡(Y)≥m\min\left(Y\right) \ge m means YY is a non-empty subset of {m,m+1,…,n}\left\{m,m+1,\ldots,n\right\}, a set of n−m+1n-m+1 elements:
2 n−m+1−1 choices2^{\,n-m+1}-1\ \text{choices}
 Each admissible pair has exactly one value of mm, so summing over mm counts every pair once:
#{max⁡X≤min⁡Y}=∑m=1n2 m−1(2 n−m+1−1)=∑m=1n(2n−2 m−1)=n2n−(2n−1)\#\left\{\max X \le \min Y\right\} = \sum_{m=1}^{n}2^{\,m-1}\left(2^{\,n-m+1}-1\right) = \sum_{m=1}^{n}\left(2^{n}-2^{\,m-1}\right) = n2^{n}-\left(2^{n}-1\right)
 Step 3: The total number of ordered pairs of non-empty subsets is (2n−1)2\left(2^{n}-1\right)^2, so
#{max⁡X>min⁡Y}=(2n−1)2−n2n+2n−1\#\left\{\max X>\min Y\right\} = \left(2^{n}-1\right)^2-n2^{n}+2^{n}-1
=22n−2 n+1+1−n2n+2n−1=22n−2n(n+1)=2n(2n−n−1)= 2^{2n}-2^{\,n+1}+1-n2^{n}+2^{n}-1 = 2^{2n}-2^{n}\left(n+1\right) = 2^{n}\left(2^{n}-n-1\right)
 Step 4: Putting n=3n = 3,
23(23−3−1)=8×4=32=252^{3}\left(2^{3}-3-1\right) = 8\times4 = 32 = 2^{5}
2p=32⟹p=52^{p} = 32 \quad\Longrightarrow\quad p = 5
 Distinct powers of 22 are unequal, so p=5p = 5 is the only value. (Direct enumeration over the 7×7=497\times7 = 49 ordered pairs of non-empty subsets of {1,2,3}\left\{1,2,3\right\} confirms 3232.) Answer: 55
Still stuck on this question?Ask your doubt on WhatsApp
Similar questions
Permutations & Combinations · medium
If NN is the number of ways in which 1010 biscuits can be distributed to five beggars seated in a row such that no two consecutive beggars remain without biscuit, then N100\dfrac N{100} is
Permutations & Combinations · hard
If SS is the sum of all the possible integral values of xx satisfying the equation 20[x3−5x2+6x4−x−1C5]−4[x−1C4−4(x−1C3)]>0,20\left[\frac{x^3-5x^2+6x}4-{}^{x-1}C_5\right]-4\left[{}^{x-1}C_4-4\left({}^{x-1}C_3\right)\right] > 0, then the number of divisors of SS is
Permutations & Combinations · medium
There are four colour-shifting balls of colours C1C_1, C2C_2, C3C_3 and C4C_4 initially. Each ball can change into any other colour or can regain its own colour at every second. The number of ways theircolours can change, if the maximum possible number of arrangements of all four balls is to be possible after 11 second, is equal to
Permutations & Combinations · medium
77 points are given in a plane (as shown in the below figure): points 11, 22, 33 lie on one straight line and points 33, 44, 55, 66, 77 lie on another straight line, the two lines meeting at point 33. Then using these 77 points

Solve more, learn faster

Sign up free to solve more JEE Maths questions and explore doMath — timed drills, mastery sprints, bookmarks, and chapter-wise progress tracking.

Sign up freeExplore doMath