MCQMediumJEE 2023Applications of P&C

JEE Mathematics 2023 Question with Solution

The total number of three-digit numbers, divisible by 33, which can be formed using the digits 1,3,5,81, 3, 5, 8, if repetition of digits is allowed, is

  • A

    1818

  • B

    2020

  • C

    2121

  • D

    2222

Answer

Correct answer:D

Step-by-step solution

Standard Method

Given: Three-digit numbers are to be formed using the digits 1,3,5,81, 3, 5, 8 with repetition allowed, and the number must be divisible by 33.

Find: The total number of such three-digit numbers.

Use the divisibility rule of 33: a number is divisible by 33 if the sum of its digits is divisible by 33.

The given digits have remainders modulo 33 as follows:

11(mod3)30(mod3)52(mod3)82(mod3)\begin{aligned} 1 &\equiv 1 \pmod{3} \\ 3 &\equiv 0 \pmod{3} \\ 5 &\equiv 2 \pmod{3} \\ 8 &\equiv 2 \pmod{3} \end{aligned}

So the available remainder classes are:

  • remainder 00: {3}\{3\}
  • remainder 11: {1}\{1\}
  • remainder 22: {5,8}\{5,8\}

For a three-digit number, the sum of the three remainders must be 0(mod3)0 \pmod{3}.

Possible remainder combinations are:

(0,0,0), (1,1,1), (2,2,2), (0,1,2)(0,0,0), \ (1,1,1), \ (2,2,2), \ (0,1,2)

Now count each case.

Case I: (0,0,0)(0,0,0) Only the digit 33 is available.

1 number\Rightarrow 1 \text{ number}

Case II: (1,1,1)(1,1,1) Only the digit 11 is available.

1 number\Rightarrow 1 \text{ number}

Case III: (2,2,2)(2,2,2) Each place can be filled by either 55 or 88.

23=82^3 = 8

So this case gives 88 numbers.

Case IV: (0,1,2)(0,1,2) Digits can be chosen in

1×1×2=21 \times 1 \times 2 = 2

ways, and these can be arranged in

3!=63! = 6

ways. Hence the total number in this case is

2×6=122 \times 6 = 12

Adding all valid cases:

1+1+8+12=221 + 1 + 8 + 12 = 22

Therefore, the total number of three-digit numbers is 2222, so the correct option is D.

Remainder Classification Trick

Given: Digits are 1,3,5,81, 3, 5, 8 and repetition is allowed.

Find: How many three-digit numbers formed are divisible by 33.

A quick way is to classify digits by their remainders modulo 33:

  • 33 gives remainder 00
  • 11 gives remainder 11
  • 5,85, 8 give remainder 22

Then count only those three-position remainder patterns whose sum is divisible by 33:

(0,0,0), (1,1,1), (2,2,2), (0,1,2)(0,0,0), \ (1,1,1), \ (2,2,2), \ (0,1,2)

Their counts are:

  • 11 for (0,0,0)(0,0,0)
  • 11 for (1,1,1)(1,1,1)
  • 23=82^3 = 8 for (2,2,2)(2,2,2)
  • 1×1×2×3!=121 \times 1 \times 2 \times 3! = 12 for (0,1,2)(0,1,2)

So the total is

1+1+8+12=221 + 1 + 8 + 12 = 22

This works because divisibility by 33 depends only on the sum of remainders, not on the exact digits themselves. Therefore, the correct option is D.

Common mistakes

  • Counting all three-digit arrangements from 44 digits as 434^3 and then guessing divisibility. This is wrong because divisibility by 33 depends on the digit-sum condition. Instead, classify the digits by their remainders modulo 33 and count only valid remainder patterns.

  • Forgetting that repetition is allowed. This is wrong because cases like 111111, 333333, 555555, or 888888-type constructions are permitted whenever the remainder condition is satisfied. Instead, allow the same digit to appear in multiple places.

  • Missing the mixed remainder case (0,1,2)(0,1,2). This is wrong because the sum 0+1+2=30+1+2=3 is divisible by 33, so all such arrangements are valid. Instead, include this case and multiply by 3!3! for the arrangements.

Practice more Applications of P&C questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions