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 six-digit number, divisibility by 11 requires the sum of digits in odd positions minus the sum in even positions to be a multiple of 11. The total digit sum is 24, so the odd-position sum $S$ must satisfy $2S-24\equiv0\pmod{11}$.
Step 2: With three distinct digits in each group, the possible values are $S=1,12,23$; only 12 can be formed, using the partition $\{1,2,9\}$ and $\{0,5,7\}$. There are two assignments of these sets to odd/even positions. Each gives $3!3!=36$ arrangements, but when zero is in the odd positions, $2!3!=12$ start with zero and are invalid.
Step 3: There are $36+(36-12)=60$ valid six-digit numbers, option 2.
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.