Let N be the largest 9-digit number which consists of the digits 1 through 9 exactly once and N is divisible by 11. What is the last four digits of N ?
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.
I think there's a typo, it should be N = 987652413.
Let the number be a b c d e f g h i with a = b = c = d = e = f = g = h = i .
Then ( a + c + e + g + i ) − ( b + d + f + h ) must be divisible by 1 1 .
The two sums can't be equal, since the sum of the digits of the number is 4 5 which is odd.
For similar reason, they can't differ by 2 2 also.
Since all the digits of the number are distinct, therefore the difference can't be divisible by higher multiples of 1 1 than 2 .
So the only possibility is that the difference is 1 1 .
There are different groupings of the numbers 1 through 9 satisfying this condition, viz.
( a , c , e , g , i ) = ( 3 , 4 , 6 , 7 , 8 ) , ( b , d , f , h ) = ( 1 , 2 , 5 , 9 ) ; ( a , c , e , g , i ) = ( 2 , 5 , 6 , 7 , 8 ) , ( b , d , f , h ) = ( 1 , 3 , 4 , 9 ) and so on.
For the first group, there are several numbers again :
8 9 7 5 6 1 4 2 3 , 8 9 7 5 6 2 4 1 3 , 7 9 8 5 6 2 4 1 3 , 7 9 8 5 6 1 4 2 3 , 8 1 7 2 6 5 4 9 3 and so on.
The largest of them is 9 8 7 6 5 2 4 1 3 , whose last four digits are 2 4 1 3 .
Isn't 987652413 a larger number that fits the requirements?
Problem Loading...
Note Loading...
Set Loading...
Let x be the sum of digits in the odd places and y be the sum of digits in the even places. Note that
(i) x ≥ y as N is the largest such number.
(i) x − y is divisible by 11 as N is divisible by 11.
(ii) 1 0 = 1 + 2 + 3 + 4 ≤ y ≤ x ≤ 9 + 8 + 7 + 6 + 5 = 3 5 . This means that x − y ≤ 2 5
(iii) x + y is the sum of all integers from 1 to 9, which is 45, an odd number. This means that x − y = ( x + y ) − 2 y is an odd number too.
From (i) to (iv), we have x − y = 1 1 . This means that x = 2 8 , y = 1 7 .
As N is the largest, consider the first few digits of N = 9 8 7 6 5 ∗ ∗ ∗ ∗ . Since 9 + 7 + 5 = 2 1 , we need to choose 2 digits from { 1 , 2 , 3 , 4 } , whose sum is 7, so that x = 2 8 . Clearly, we need 3 and 4. (As 3 and 4 had been chosen, we left with 1 and 2 for y. Now y = 8 + 6 + 1 + 2 = 1 7 , yeah!!!)
Then N = 9 8 7 6 5 2 4 1 3 and the desired last 4 digit is 2 4 1 3 .