Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Step 1: For a three-digit number formed from {1,3,5,8} with repetition, divisibility by 3 requires the digit sum to be 0 mod 3. The digit residues are 1,0,2,2.
Step 2: Count ordered triples by residue; the valid digit multisets are 111, the six permutations of 135, 333, the six permutations of 138, 555, the three permutations each of 558 and 588, and 888.
Step 3: The total is 1+6+1+6+1+3+3+1=22, option B.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.