The total number of three-digit numbers, divisible by , which can be formed using the digits , if repetition of digits is allowed, is
- A
- B
- C
- D
The total number of three-digit numbers, divisible by , which can be formed using the digits , if repetition of digits is allowed, is
Correct answer:D
Standard Method
Given: Three-digit numbers are to be formed using the digits with repetition allowed, and the number must be divisible by .
Find: The total number of such three-digit numbers.
Use the divisibility rule of : a number is divisible by if the sum of its digits is divisible by .
The given digits have remainders modulo as follows:
So the available remainder classes are:
For a three-digit number, the sum of the three remainders must be .
Possible remainder combinations are:
Now count each case.
Case I: Only the digit is available.
Case II: Only the digit is available.
Case III: Each place can be filled by either or .
So this case gives numbers.
Case IV: Digits can be chosen in
ways, and these can be arranged in
ways. Hence the total number in this case is
Adding all valid cases:
Therefore, the total number of three-digit numbers is , so the correct option is D.
Remainder Classification Trick
Given: Digits are and repetition is allowed.
Find: How many three-digit numbers formed are divisible by .
A quick way is to classify digits by their remainders modulo :
Then count only those three-position remainder patterns whose sum is divisible by :
Their counts are:
So the total is
This works because divisibility by depends only on the sum of remainders, not on the exact digits themselves. Therefore, the correct option is D.
Counting all three-digit arrangements from digits as and then guessing divisibility. This is wrong because divisibility by depends on the digit-sum condition. Instead, classify the digits by their remainders modulo and count only valid remainder patterns.
Forgetting that repetition is allowed. This is wrong because cases like , , , or -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 . This is wrong because the sum is divisible by , so all such arrangements are valid. Instead, include this case and multiply by for the arrangements.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.