A number is formed using the digits exactly once, and using as many zeroes as required for adjustment.
Then be the set of remainders which can NOT be obtained on dividing the number by . Find the sum of all elements of
Details and assumptions :-
A set contains each element exactly once, no repetitions.
only contains some integers in the range , as remainder is , by definition, .
You are expected to find the sum of all elements in , that is the remainders which can't be obtained by dividing the number by .
The number is a a valid number for consideration, and so is and all others which contain only the digits and are exactly once. (Thus, is not a valid number)
This is a part of set 11≡ awesome (mod remainders)