Visual SolutionPYQ 2023 · Apr 15 Shift 1Standard
Question
The total number of three-digit numbers, divisible by 3, which can be formed using the digits 1, 3, 5, 8, if repetition of digits is allowed, is
(A)
(B)
(C)
(D)
Solution Path
Classify digits mod 3, enumerate valid residue triples: .
01Question Setup
1/4Three-digit numbers from with repetition, divisible by 3.
02Mod 3 Residues
2/4Residue 0: , Residue 1: , Residue 2: . Need digit sum .
Classify by residue mod 3
03Count CasesKEY INSIGHT
3/4, , , . Total .
04Final Answer
4/4Total .
Want more practice?
Try more PYQs from this chapter →