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.
The number of 3-digit numbers, formed using the digits 2, 3, 4, 5 and 7, when the repetition of digits is not allowed, and which are not divisible by 3 , is equal to ________.
Step 1: There are 5·4·3=60 three-digit numbers using three distinct digits from {2,3,4,5,7}.
Step 2: The digits modulo 3 have residues 2:{2,5}, 0:{3}, and 1:{4,7}. A number is divisible by 3 exactly when its three chosen digits include one from each residue class.
Step 3: There are 2·1·2=4 such digit sets, each with 3!=6 orders, so 24 numbers are divisible by 3. The required count is 60−24=36.
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.