The number of 7-digit numbers which are multiples of 11 and are formed using all the digits and is ______.
We need to find the number of 7-digit numbers formed using all the digits (each used exactly once) that are multiples of 11.
Divisibility rule for 11: A number is divisible by 11 if the alternating sum (sum of digits at odd positions minus sum of digits at even positions) is divisible by 11.
The total sum of all seven digits:
For a 7-digit number :
Positions 1, 3, 5, 7 (odd positions): 4 digits with sum
Positions 2, 4, 6 (even positions): 3 digits with sum
We need: and
Adding these: for some integer . Since must be an integer, must be even, so must be odd.
Case : ,
Case : ,
Case : . The maximum possible with 4 digits from our set is . Not possible.
Case : . Not possible.
So only are valid.
Finding 4-element subsets of with sum 21:
We systematically check all combinations including 9:
:
:
:
: Need sum 0 from remaining - not possible.
: Already counted above.
Combinations without 9:
:
: . No.
Maximum without 9: . None work.
So there are exactly 3 subsets with .
Finding 3-element subsets of with sum 21:
:
: . No.
: . No.
Maximum of any other triple: , and is the only one.
So there is exactly 1 subset with .
Counting arrangements:
For each valid partition of digits into odd and even positions:
The 4 digits at odd positions can be arranged in ways.
The 3 digits at even positions can be arranged in ways.
Each subset contributes numbers.
Case 1 (): 3 subsets 144 = 432
Case 2 (): The 3-element subset goes to even positions, and the remaining 4 digits (sum = 10) go to odd positions. This gives 1 subset 144 = 144.
Total:
The correct answer is .
Tagged Arrangements with restrictions. Machine-assigned, so read it as a strong shortlist rather than a verdict.