Key Concept: Binomial Expansion
This problem leverages the Binomial Theorem, specifically the expansion of (x+y)n and (x−y)n. The Binomial Theorem states that for any non-negative integer n:
(x+y)n=∑k=0nnCkxn−kyk=nC0xny0+nC1xn−1y1+nC2xn−2y2+⋯+nCnx0yn
Similarly, for (x−y)n:
(x−y)n=∑k=0nnCkxn−k(−y)k=nC0xny0−nC1xn−1y1+nC2xn−2y2−⋯+(−1)nnCnx0yn
A useful identity derived from these is the difference:
(x+y)n−(x−y)n=2[nC1xn−1y1+nC3xn−3y3+nC5xn−5y5+…]
This identity includes only the terms with odd powers of y.
Problem Transformation
We are asked to find the number of elements n∈{1,2,3,…,100} such that the inequality (11)n>(10)n+(9)n holds. Assuming (X) n denotes Xn, the inequality is:
11n>10n+9n
To make this inequality suitable for binomial expansion, we first rearrange it:
11n−9n>10n
Now, we can apply the binomial expansion identity. Let x=10 and y=1.
Then, 11n=(10+1)n and 9n=(10−1)n.
Substituting these into the rearranged inequality:
(10+1)n−(10−1)n>10n
Using the identity for (x+y)n−(x−y)n with x=10 and y=1:
2[nC110n−1(1)1+nC310n−3(1)3+nC510n−5(1)5+…]>10n
2[nC110n−1+nC310n−3+nC510n−5+…]>10n
To simplify this expression and make the comparison easier, we divide both sides by 10n (which is always positive for n∈{1,…,100}, so the inequality direction remains unchanged):
2[10nnC110n−1+10nnC310n−3+10nnC510n−5+…]>1
2[10nC1+103nC3+105nC5+…]>1
This is the simplified inequality we need to evaluate for different values of n.
Step-by-Step Evaluation
Let Sn=2[10nC1+103nC3+105nC5+…]. We need to find n such that Sn>1.
-
For n=1:
The series terminates after the first term since 1Ck=0 for k>1.
S1=2[101C1]=2[101]=51=0.2
Since 0.2≯1, the inequality does not hold for n=1.
-
For n=2:
The series terminates after the first term since 2Ck=0 for k>2.
S2=2[102C1]=2[102]=104=0.4
Since 0.4≯1, the inequality does not hold for n=2.
-
For n=3:
The series includes terms for nC1 and nC3.
S3=2[103C1+1033C3]=2[103+10001]=2[0.3+0.001]=2×0.301=0.602
Since 0.602≯1, the inequality does not hold for n=3.
-
For n=4:
The series includes terms for nC1 and nC3.
S4=2[104C1+1034C3]=2[104+10004]=2[0.4+0.004]=2×0.404=0.808
Since 0.808≯1, the inequality does not hold for n=4.
-
For n=5:
The series includes terms for nC1, nC3, and nC5.
S5=2[105C1+1035C3+1055C5]
Recall: 5C1=5, 5C3=10, 5C5=1.
S5=2[105+100010+1000001]=2[0.5+0.01+0.00001]=2×0.51001=1.02002
Since 1.02002>1, the inequality holds for n=5.
Analysis for n>5
For n>5, the terms 10nC1, 103nC3, etc., will generally increase. Specifically, as n increases, nCk increases (for k≤n/2), and new positive terms will be added to the sum Sn. For example, the first term 10nC1=10n clearly increases with n.
Since S5>1, and all subsequent terms added to Sn for n>5 are positive, and existing terms like 10n increase, Sn will continue to be greater than 1 for all n>5.
Thus, the inequality 11n>10n+9n holds for all n≥5.
Determining the Set and Number of Elements
The set of integers n for which the inequality holds is n∈{5,6,7,…,100}.
To find the number of elements in this set, we use the formula: Last element - First element + 1.
Number of elements =100−5+1=96.
Tips and Common Mistakes
- Interpretation of Notation: Always clarify ambiguous notation. Here,
(X) n was assumed to be Xn based on the topic and context.
- 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 (x−y)n.
- 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, 10n is always positive.
- Checking Small Values: For inequalities involving n, 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.
- Growth Rates: For large n, comparing growth rates of functions like (1.1)n versus 1+(0.9)n can quickly determine the behavior of the inequality. In this case, (1.1)n grows exponentially, while 1+(0.9)n approaches 1 as n increases, making the inequality hold for larger n.
Summary and Key Takeaway
By transforming the initial exponential inequality into a sum of binomial coefficients and evaluating it for small integer values of n, we found that the inequality 11n>10n+9n holds true for all integers n≥5. Given the domain n∈{1,2,…,100}, the set of valid n values is {5,6,…,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.