We need to find how many n∈{1,2,3,…,100} satisfy 11n>10n+9n.
Dividing both sides by 10n, the inequality becomes (1011)n>1+(109)n.
Let a=1011=1.1 and b=109=0.9. We need (1.1)n>1+(0.9)n.
Let us define f(n)=(1.1)n−(0.9)n−1 and check small values of n.
For n=1: f(1)=1.1−0.9−1=−0.8<0. The inequality does not hold.
For n=2: f(2)=1.21−0.81−1=−0.6<0. The inequality does not hold.
For n=3: f(3)=1.331−0.729−1=−0.398<0. The inequality does not hold.
For n=4: f(4)=1.4641−0.6561−1=−0.192<0. The inequality does not hold.
For n=5: f(5)=1.61051−0.59049−1=0.02002>0. The inequality holds.
Now we show that once f(n)>0, it remains positive for all larger n. Consider: if 11n>10n+9n, then 11n+1=11⋅11n>11(10n+9n)=11⋅10n+11⋅9n.
We need this to be at least 10n+1+9n+1=10⋅10n+9⋅9n. Since 11⋅10n>10⋅10n and 11⋅9n>9⋅9n, we get 11n+1>10n+1+9n+1.
So the inequality holds for all n≥5 and fails for n=1,2,3,4.
The number of valid values is 100−4=96.