by rearranging the digits of the integer 1288 , we get a total of 12 different integers including 1288. the sum of all these 12 integers is
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.
At unit digits place ... 8 will come 6 times out of 12. 1 will come 3 times out of 12 2 will come times out of 12. So sum of all the digits at unit digits place = 8.6 + 1.3 +2.3 =57 So unit digit in the sum will be 7 . And I will consider 5 as an add value for the ten's digits place numbers's sum.
And Same case will occur at the ten's digit place . i.e. 8 will come 6 times out of 12. 1 will come 3 times out of 12 2 will come times out of 12. so 57 + 5 =62 ....In the sum ten's digit will be 2 . and 6 will be carried as add value..
In the next step , 57 + 6 = 63 . So in the sum hunderd's digit place number will be 3 and again 6 will be carried for the add value for the next step. And at last , it will be 57 +6 = 6 3 .
So the sum of all the given 12 numbers = 6 3 3 2 7
did the same way...
making "legal" multiple choice cheat: the sum is less than 9000*12 so we cut off 50%; then we use the fact that all elements in the sum are 1 mod 3 therefore the result must be divided by 3 which give us the only choice left
Using Python its really simple to do. Just wrote this script on Python 2.7
1 2 3 |
|
So it prints all Possible Integers, now all I had to do was adding them.
Problem Loading...
Note Loading...
Set Loading...
1+2+8+8 =19 Each number appears 3 times in the 1000 100 10 and 1 place 19 x 1111 x 3 = 63327