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: Count three-digit arrangements with distinct digits from 1–5. Divisibility by 3 requires the digit sum divisible by 3; the qualifying digit sets are {1,2,3}, {1,3,5}, {2,3,4}, and {3,4,5}, giving 4·3!=24.
Step 2: For divisibility by 5, the last digit must be 5. Choose the other two digits from {1,2,3,4} and order them: C(4,2)·2!=12.
Step 3: The overlap has digit sets {1,3,5} and {3,4,5}; with 5 fixed last there are 2·2!=4. Inclusion-exclusion gives 24+12−4=32.
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.