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 7-digit numbers which are multiples of 11 and are formed using all the digits 1, 2, 3, 4, 5, 7 and 9 is _____________.
Step 1: The digit sum is 31. For divisibility by 11, the difference between the sum in the four odd positions and the sum in the three even positions must be a multiple of 11. Its absolute value is at most 19 and is odd, so it must be 11 or −11.
Step 2: The four odd-position digits therefore sum to 21 or 10. There are three 4-digit subsets of {1,2,3,4,5,7,9} summing to 21 and one summing to 10.
Step 3: For each subset, arrange its digits in the four odd positions and the remaining digits in the three even positions: 4!·3! ways. Total=(3+1)·4!·3!=576.
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.