How many 7-digit numbers (without repetition) can be formed from digits such that each of them are divisible by but not by ? Whatever number you get add twelve square to it, and then find the square root of the number.
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.
SOLUTION
Check the divisibility of 9 first, You will get :-
Lets see what could be the largest and smallest sum of digits we can get from a seven digit number.
Largest number : 9 8 7 6 5 4 3 , giving sum of 9 + 8 + 7 + 6 + 5 + 4 + 3 = 4 2 .
Smallest number : 1 2 3 4 5 6 7 , giving a sum of 2 8 .
Thus we can only get 3 6 as a multiple of 9 without any other possibility,
so the combinations would be 1236789, 12 45 789 , 1 3 45 6 89, 2 3456 7 9. BOLD is showing how I altered the digits.
Now, Think of Seven places as positions where you need to place digits _ _ _ _ _ _ _ .
Last digit could not hold 2 , 4 , 6 , 8 and if you see carefully then there are exactly 3 even digits in all the numbers. Hence it's permutations that would not be divisible by 2 will be
6 × 5 × 4 × 3 × 2 × 1 × 4 = 6 ! × 4 . Hence at last postion only 4 digits could come.
Thus in all 4 × 6 ! × 4 = 1 1 5 2 0 .
But the story doesn't end here, 1 1 5 2 0 + 1 2 2 = 1 1 6 6 4 a n d 1 1 6 6 4 = 1 0 8 . This is the answer !