RankRizz
JEE MAIN 2020 · 06 SEP S1+4EASYTRANSCRIBED

JEE Main 2020 Mathematics question — Sets, subsets, power sets and set operations

Set AA has mm elements and set BB has nn elements. If the total number of subsets of AA is 112 more than the total number of subsets of BB, then the value of m⋅nm \cdot n is___.

SOLUTION

We have two finite sets, set AA with mm elements and set BB with nn elements.

First, we state the basic formula: for any set containing rr elements, the total number of its subsets is 2 r2^{\,r}. This is because each element can be either “chosen” or “not chosen”, giving two possibilities per element and hence 2×2×⋯×2=2 r2 \times 2 \times \dots \times 2 = 2^{\,r} possibilities in all.

Applying this formula to the two given sets, the number of subsets of AA is 2 m2^{\,m} and the number of subsets of BB is 2 n2^{\,n}.

We are told that

2 m=2 n+112.2^{\,m} = 2^{\,n} + 112.

To handle the difference of two powers of two, we isolate the common factor 2 n2^{\,n} on the right hand side. Subtracting 2 n2^{\,n} from both sides and then factoring gives

2 m−2 n=112⟹2 n(2 m−n−1)=112.2^{\,m} - 2^{\,n} = 112 \quad\Longrightarrow\quad 2^{\,n}\bigl(2^{\,m-n} - 1\bigr) = 112.

Let us introduce a new positive integer kk defined by k=m−nk = m - n. Because m>nm > n gives a positive difference, we have k≥1k \ge 1. Substituting kk into the previous expression, we get

2 n(2 k−1)=112.2^{\,n}\bigl(2^{\,k} - 1\bigr) = 112.

The integer 112112 can be written in its prime-factor form:

112=16×7=24×7.112 = 16 \times 7 = 2^{4} \times 7.

This factorisation tells us that any power of two dividing 112112 must be at most 242^{4}, so we must have 2 n≤242^{\,n} \le 2^{4} and therefore n≤4n \le 4 (since nn is a non-negative integer).

Now we test each possible value of nn from 00 to 44, computing the corresponding value of 2 k−12^{\,k} - 1 and checking whether it is an integer power of two.

• If n=0n = 0, then 2 n=12^{\,n} = 1 and

1(2 k−1)=112  ⟹  2 k−1=112  ⟹  2 k=113,1\bigl(2^{\,k} - 1\bigr) = 112 \;\Longrightarrow\; 2^{\,k} - 1 = 112 \;\Longrightarrow\; 2^{\,k} = 113, which is not a power of two. So n=0n = 0 is impossible.

• If n=1n = 1, then 2 n=22^{\,n} = 2 and

2(2 k−1)=112  ⟹  2 k−1=56  ⟹  2 k=57,2\bigl(2^{\,k} - 1\bigr) = 112 \;\Longrightarrow\; 2^{\,k} - 1 = 56 \;\Longrightarrow\; 2^{\,k} = 57, and 5757 is not a power of two. So n=1n = 1 is impossible.

• If n=2n = 2, then 2 n=42^{\,n} = 4 and

4(2 k−1)=112  ⟹  2 k−1=28  ⟹  2 k=29,4\bigl(2^{\,k} - 1\bigr) = 112 \;\Longrightarrow\; 2^{\,k} - 1 = 28 \;\Longrightarrow\; 2^{\,k} = 29, but 2929 is not a power of two. So n=2n = 2 is impossible.

• If n=3n = 3, then 2 n=82^{\,n} = 8 and

8(2 k−1)=112  ⟹  2 k−1=14  ⟹  2 k=15,8\bigl(2^{\,k} - 1\bigr) = 112 \;\Longrightarrow\; 2^{\,k} - 1 = 14 \;\Longrightarrow\; 2^{\,k} = 15, and 1515 is not a power of two. So n=3n = 3 is impossible.

• If n=4n = 4, then 2 n=162^{\,n} = 16 and

16(2 k−1)=112  ⟹  2 k−1=7  ⟹  2 k=8.16\bigl(2^{\,k} - 1\bigr) = 112 \;\Longrightarrow\; 2^{\,k} - 1 = 7 \;\Longrightarrow\; 2^{\,k} = 8.

Because 8=238 = 2^{3} is indeed a power of two, this case works with k=3k = 3. Therefore

m−n=k=3  ⟹  m=n+3=4+3=7.m - n = k = 3 \;\Longrightarrow\; m = n + 3 = 4 + 3 = 7.

Now that we have m=7m = 7 and n=4n = 4, we compute the required product:

m⋅n=7×4=28.m \cdot n = 7 \times 4 = 28.

So, the answer is 2828.

Tagged Sets, subsets, power sets and set operations. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicSets, subsets, power sets and set operations
TypeNumerical answer