RankRizz
JEE MAIN 2020 · 03 SEP S2+4MEDIUMTRANSCRIBED

JEE Main 2020 Mathematics question — Permutations of letters and words, rank in dictionary

The total number of 3-digit numbers whose sum of digits is 10, is ..........

SOLUTION

We are looking for all three-digit natural numbers. Such a number can be written in decimal form as abc‾\overline{abc} where aa is the hundreds digit, bb is the tens digit and cc is the units digit.

Because the number is a three-digit number, the leading digit aa cannot be zero, so we must have 1≤a≤91 \le a \le 9. The other two digits can be anything from 00 to 99, so 0≤b≤90 \le b \le 9 and 0≤c≤90 \le c \le 9.

We are told that the sum of the three digits equals 1010. Hence we need every integer solution of the linear equation

a+b+c=10,a + b + c = 10,

subject to

1≤a≤9,0≤b≤9,0≤c≤9.1 \le a \le 9,\quad 0 \le b \le 9,\quad 0 \le c \le 9.

To remove the lower bound on aa, we make the substitution a′=a−1a' = a - 1. Because aa ranges from 11 to 99, the new variable a′a' ranges from 00 to 88. In terms of a′a', the equation becomes

(a′+1)+b+c=10.\bigl(a' + 1\bigr) + b + c = 10.

Simplifying, we obtain

a′+b+c=9,a' + b + c = 9,

with the simpler bounds

0≤a′≤8,0≤b≤9,0≤c≤9.0 \le a' \le 8,\quad 0 \le b \le 9,\quad 0 \le c \le 9.

Now we must count the number of non-negative integer solutions of a′+b+c=9a' + b + c = 9 that also obey the upper limits a′≤8,  b≤9,  c≤9a' \le 8,\; b \le 9,\; c \le 9. Observe that the total we seek is small enough that the natural upper limits b≤9b \le 9 and c≤9c \le 9 are automatically respected once the sum is only 99, so the only possible overflow is a′=9a' = 9. Therefore we first count all non-negative solutions and then subtract the ones in which a′=9a' = 9 (because in that case a′a' would exceed 88).

The standard stars-and-bars result says: “The number of non-negative integer solutions of x1+x2+x3=nx_1 + x_2 + x_3 = n is (n+22)\binom{n+2}{2}.” We state it explicitly here before using it.

Applying the formula with n=9n = 9 gives

Total unrestricted solutions  =  (9+22)=(112)=11×102=55.\text{Total unrestricted solutions} \;=\; \binom{9+2}{2} = \binom{11}{2} = \frac{11 \times 10}{2} = 55.

Now we exclude the disallowed case a′=9a' = 9. Fixing a′=9a' = 9 forces b+c=0,b + c = 0, so we must have b=0b = 0 and c=0c = 0. That is exactly one solution. No other violation is possible because if a′a' were 1010 or more, the sum would exceed 99.

Therefore the number of admissible solutions is

55−1=54.55 - 1 = 54.

Each admissible triple (a′,b,c)(a', b, c) corresponds uniquely to a=a′+1a = a' + 1, so we have counted every valid three-digit number whose digits add to 1010.

So, the answer is 5454.

Tagged Permutations of letters and words, rank in dictionary. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicPermutations of letters and words, rank in dictionary
TypeNumerical answer