RankRizz
JEE MAIN 2019 · 08 APR S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2019 Mathematics question — Arrangements with restrictions

The number of four-digit numbers strictly greater than 4321 that can be formed using the digits 0, 1, 2, 3, 4, 5 (repetition of digits is allowed) is:

SOLUTION

We have six allowed digits: 0,  1,  2,  3,  4,  5.0,\;1,\;2,\;3,\;4,\;5. Repetition is allowed, so every position in the four-digit number may repeat a digit that has already appeared.

A four-digit number is of the form abcd,abcd, where aa is the thousand-place digit, bb the hundred-place digit, cc the ten-place digit and dd the unit-place digit. Because the number must be a genuine four-digit number, a≠0.a\neq 0.

By the fundamental principle of counting, the total number of four-digit numbers that can be written with these digits (without yet imposing the condition “>4321”) is

(choices for a)×(choices for b)×(choices for c)×(choices for d).\text{(choices for }a)\times\text{(choices for }b)\times\text{(choices for }c)\times\text{(choices for }d).

There are 55 possible non-zero choices for a  (1,2,3,4,5)a\;(1,2,3,4,5) and 66 choices for each of b,c,d.b,c,d. Hence the total possible four-digit numbers that can be formed is

5×6×6×6  =  5×216  =  1080.5\times6\times6\times6 \;=\;5\times216 \;=\;1080.

Now we must select only those numbers that are strictly greater than 4321.4321. We split the count according to the thousand-place digit a.a.

Case 1: a=5.\boldsymbol{a=5.}

Every number beginning with 5 is automatically greater than 4321.4321. For a=5a=5 we have

1 (choice for a)  ×  6  ×  6  ×  6  =  2161\text{ (choice for }a)\;\times\;6\;\times\;6\;\times\;6 \;=\;216 numbers.

Case 2: a=4.\boldsymbol{a=4.}

When a=4,a=4, the remaining three-digit block bcdbcd must exceed 321321 so that the entire number 4bcd4bcd exceeds 4321.4321. First we count all possibilities with a=4,a=4, then subtract those in which bcd≤321.bcd\le 321.

Total possibilities with a=4a=4 (no further restriction):

1×6×6×6=216.1\times6\times6\times6 = 216.

We now count the “bad” possibilities where bcd≤321bcd\le 321 using lexicographic comparison digit by digit.

• If b<3b<3 (i.e. b=0,1,2b=0,1,2), cc and dd can be anything:

3 choices for b×6×6=108.3\text{ choices for }b\times6\times6 = 108.

• If b=3,b=3, then cc must be ≤2.\le2. We examine cc in turn.

  - If c<2c<2 (i.e. c=0c=0 or 11), dd can still be any of the six digits:

2×6=12.2\times6 = 12.

  - If c=2,c=2, the final comparison goes to d≤1d\le1 (because 321321 ends with 11):

1×2=2.1\times2 = 2.

Adding these, the total number of “bad” triples bcd≤321bcd\le321 is

108+12+2=122.108 + 12 + 2 = 122.

Therefore, the required (“good”) numbers with a=4a=4 are

216−122=94.216 - 122 = 94.

Case 3: a≤3.\boldsymbol{a\le3.}

If aa is 1,2,1,2, or 3,3, the entire number is automatically less than or equal to 3_999,3\_999, and hence cannot exceed 4321.4321. So there are no admissible numbers in this case.

Combining the admissible cases:

Total numbers>4321=216  +  94  =  310.\text{Total numbers}>4321 = 216 \;+\; 94 \;=\; 310.

Hence, the correct answer is Option D.

Tagged Arrangements with restrictions. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicArrangements with restrictions
TypeMultiple choice