Skip to main content
Back to Binomial Theorem
JEE Main 2024
Binomial Theorem
Binomial Theorem
Medium

Question

The number of elements in the set {n \in {1, 2, 3, ......., 100} | (11) n > (10) n + (9) n } is ______________.

Answer: 11

Solution

Key Concept: Binomial Expansion

This problem leverages the Binomial Theorem, specifically the expansion of (x+y)n(x+y)^n and (xy)n(x-y)^n. The Binomial Theorem states that for any non-negative integer nn: (x+y)n=k=0nnCkxnkyk=nC0xny0+nC1xn1y1+nC2xn2y2++nCnx0yn(x+y)^n = \sum_{k=0}^n {}^n C_k x^{n-k} y^k = {}^n C_0 x^n y^0 + {}^n C_1 x^{n-1} y^1 + {}^n C_2 x^{n-2} y^2 + \dots + {}^n C_n x^0 y^n Similarly, for (xy)n(x-y)^n: (xy)n=k=0nnCkxnk(y)k=nC0xny0nC1xn1y1+nC2xn2y2+(1)nnCnx0yn(x-y)^n = \sum_{k=0}^n {}^n C_k x^{n-k} (-y)^k = {}^n C_0 x^n y^0 - {}^n C_1 x^{n-1} y^1 + {}^n C_2 x^{n-2} y^2 - \dots + (-1)^n {}^n C_n x^0 y^n A useful identity derived from these is the difference: (x+y)n(xy)n=2[nC1xn1y1+nC3xn3y3+nC5xn5y5+](x+y)^n - (x-y)^n = 2[{}^n C_1 x^{n-1} y^1 + {}^n C_3 x^{n-3} y^3 + {}^n C_5 x^{n-5} y^5 + \dots] This identity includes only the terms with odd powers of yy.

Problem Transformation

We are asked to find the number of elements n{1,2,3,,100}n \in \{1, 2, 3, \dots, 100\} such that the inequality (11)n>(10)n+(9)n(11)^n > (10)^n + (9)^n holds. Assuming (X) n denotes XnX^n, the inequality is: 11n>10n+9n11^n > 10^n + 9^n To make this inequality suitable for binomial expansion, we first rearrange it: 11n9n>10n11^n - 9^n > 10^n Now, we can apply the binomial expansion identity. Let x=10x=10 and y=1y=1. Then, 11n=(10+1)n11^n = (10+1)^n and 9n=(101)n9^n = (10-1)^n. Substituting these into the rearranged inequality: (10+1)n(101)n>10n(10+1)^n - (10-1)^n > 10^n Using the identity for (x+y)n(xy)n(x+y)^n - (x-y)^n with x=10x=10 and y=1y=1: 2[nC110n1(1)1+nC310n3(1)3+nC510n5(1)5+]>10n2[{}^n C_1 10^{n-1}(1)^1 + {}^n C_3 10^{n-3}(1)^3 + {}^n C_5 10^{n-5}(1)^5 + \dots] > 10^n 2[nC110n1+nC310n3+nC510n5+]>10n2[{}^n C_1 10^{n-1} + {}^n C_3 10^{n-3} + {}^n C_5 10^{n-5} + \dots] > 10^n To simplify this expression and make the comparison easier, we divide both sides by 10n10^n (which is always positive for n{1,,100}n \in \{1, \dots, 100\}, so the inequality direction remains unchanged): 2[nC110n110n+nC310n310n+nC510n510n+]>12 \left[ \frac{{}^n C_1 10^{n-1}}{10^n} + \frac{{}^n C_3 10^{n-3}}{10^n} + \frac{{}^n C_5 10^{n-5}}{10^n} + \dots \right] > 1 2[nC110+nC3103+nC5105+]>12 \left[ \frac{{}^n C_1}{10} + \frac{{}^n C_3}{10^3} + \frac{{}^n C_5}{10^5} + \dots \right] > 1 This is the simplified inequality we need to evaluate for different values of nn.

Step-by-Step Evaluation

Let Sn=2[nC110+nC3103+nC5105+]S_n = 2 \left[ \frac{{}^n C_1}{10} + \frac{{}^n C_3}{10^3} + \frac{{}^n C_5}{10^5} + \dots \right]. We need to find nn such that Sn>1S_n > 1.

  • For n=1n=1: The series terminates after the first term since 1Ck=0{}^1 C_k = 0 for k>1k > 1. S1=2[1C110]=2[110]=15=0.2S_1 = 2 \left[ \frac{{}^1 C_1}{10} \right] = 2 \left[ \frac{1}{10} \right] = \frac{1}{5} = 0.2 Since 0.210.2 \ngtr 1, the inequality does not hold for n=1n=1.

  • For n=2n=2: The series terminates after the first term since 2Ck=0{}^2 C_k = 0 for k>2k > 2. S2=2[2C110]=2[210]=410=0.4S_2 = 2 \left[ \frac{{}^2 C_1}{10} \right] = 2 \left[ \frac{2}{10} \right] = \frac{4}{10} = 0.4 Since 0.410.4 \ngtr 1, the inequality does not hold for n=2n=2.

  • For n=3n=3: The series includes terms for nC1{}^n C_1 and nC3{}^n C_3. S3=2[3C110+3C3103]=2[310+11000]=2[0.3+0.001]=2×0.301=0.602S_3 = 2 \left[ \frac{{}^3 C_1}{10} + \frac{{}^3 C_3}{10^3} \right] = 2 \left[ \frac{3}{10} + \frac{1}{1000} \right] = 2 [0.3 + 0.001] = 2 \times 0.301 = 0.602 Since 0.60210.602 \ngtr 1, the inequality does not hold for n=3n=3.

  • For n=4n=4: The series includes terms for nC1{}^n C_1 and nC3{}^n C_3. S4=2[4C110+4C3103]=2[410+41000]=2[0.4+0.004]=2×0.404=0.808S_4 = 2 \left[ \frac{{}^4 C_1}{10} + \frac{{}^4 C_3}{10^3} \right] = 2 \left[ \frac{4}{10} + \frac{4}{1000} \right] = 2 [0.4 + 0.004] = 2 \times 0.404 = 0.808 Since 0.80810.808 \ngtr 1, the inequality does not hold for n=4n=4.

  • For n=5n=5: The series includes terms for nC1{}^n C_1, nC3{}^n C_3, and nC5{}^n C_5. S5=2[5C110+5C3103+5C5105]S_5 = 2 \left[ \frac{{}^5 C_1}{10} + \frac{{}^5 C_3}{10^3} + \frac{{}^5 C_5}{10^5} \right] Recall: 5C1=5{}^5 C_1 = 5, 5C3=10{}^5 C_3 = 10, 5C5=1{}^5 C_5 = 1. S5=2[510+101000+1100000]=2[0.5+0.01+0.00001]=2×0.51001=1.02002S_5 = 2 \left[ \frac{5}{10} + \frac{10}{1000} + \frac{1}{100000} \right] = 2 [0.5 + 0.01 + 0.00001] = 2 \times 0.51001 = 1.02002 Since 1.02002>11.02002 > 1, the inequality holds for n=5n=5.

Analysis for n>5n > 5

For n>5n > 5, the terms nC110\frac{{}^n C_1}{10}, nC3103\frac{{}^n C_3}{10^3}, etc., will generally increase. Specifically, as nn increases, nCk{}^n C_k increases (for kn/2k \le n/2), and new positive terms will be added to the sum SnS_n. For example, the first term nC110=n10\frac{{}^n C_1}{10} = \frac{n}{10} clearly increases with nn. Since S5>1S_5 > 1, and all subsequent terms added to SnS_n for n>5n > 5 are positive, and existing terms like n10\frac{n}{10} increase, SnS_n will continue to be greater than 1 for all n>5n > 5. Thus, the inequality 11n>10n+9n11^n > 10^n + 9^n holds for all n5n \ge 5.

Determining the Set and Number of Elements

The set of integers nn for which the inequality holds is n{5,6,7,,100}n \in \{5, 6, 7, \dots, 100\}. To find the number of elements in this set, we use the formula: Last element - First element + 1. Number of elements =1005+1=96= 100 - 5 + 1 = 96.

Tips and Common Mistakes

  1. Interpretation of Notation: Always clarify ambiguous notation. Here, (X) n was assumed to be XnX^n based on the topic and context.
  2. Careful Binomial Expansion: Ensure all terms are correctly identified and powers are handled accurately. A common mistake is to miss terms or incorrectly apply the signs in (xy)n(x-y)^n.
  3. Dividing by Powers: When dividing an inequality by a variable term, ensure that the term's sign is known. If it can be negative, the inequality direction might flip. Here, 10n10^n is always positive.
  4. Checking Small Values: For inequalities involving nn, testing small integer values is a robust way to find the initial values for which the inequality holds. This helps establish a base case for further analysis or proof by induction.
  5. Growth Rates: For large nn, comparing growth rates of functions like (1.1)n(1.1)^n versus 1+(0.9)n1 + (0.9)^n can quickly determine the behavior of the inequality. In this case, (1.1)n(1.1)^n grows exponentially, while 1+(0.9)n1 + (0.9)^n approaches 11 as nn increases, making the inequality hold for larger nn.

Summary and Key Takeaway

By transforming the initial exponential inequality into a sum of binomial coefficients and evaluating it for small integer values of nn, we found that the inequality 11n>10n+9n11^n > 10^n + 9^n holds true for all integers n5n \ge 5. Given the domain n{1,2,,100}n \in \{1, 2, \dots, 100\}, the set of valid nn values is {5,6,,100}\{5, 6, \dots, 100\}. Therefore, the number of elements in this set is 96. This problem demonstrates the practical application of binomial expansions and the importance of checking boundary conditions for inequalities.

Practice More Binomial Theorem Questions

View All Questions