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)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Remainder modulo 1 1 is obtained by the following,
Sum of digits having odd power 10 - Sum of digits having even power of 10
(This is because 1 0 2 k ≡ 1 ( m o d 1 1 ) , and 1 0 2 k + 1 ≡ − 1 ( m o d 1 1 )
There are 3 ways of splitting the digits in sets of 2 and 1 , which are ( i ) ( 2 , 4 ) , 7 ⟹ remainders (1,10) possible ( i i ) ( 4 , 7 ) , 2 ⟹ remainders (2,9) possible ( i i i ) ( 7 , 2 ) , 4 ⟹ remainders (5,6) possible
Putting all of them at same places, like in 2 0 4 0 7 , remainder is 2 which has been counted.
(In these, the negative of a remainder can be obtained ust by putting a 0 at end of number, for example 2 4 7 has remainder 5 and 2 4 7 0 has remainder − 5 ≡ 6 ( m o d 1 1 )
Thus, we see that ( 3 , 8 4 , 7 ) can NOT be obtained. Their sum is 2 2