+ S T I E X N
What is the maximum value of the above sum if S , I , X , T , E , N represent distinct digits?
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.
Since 1 ≤ 1 ≤ 1 0 ≤ 1 0 ≤ 1 0 0 ≤ 1 0 0 and 4 ≤ 5 ≤ 6 ≤ 7 ≤ 8 ≤ 9 then by the rearrangement inequality, The maximum value will be 1 0 0 × 9 + 1 0 0 × 8 + 1 0 × 7 + 1 0 × 6 + 5 + 4 = 1 8 3 9 Assigning S = 9 , T = 8 , I = 7 , E = 6 , X = 5 , N = 4 gives this value.
Its simple, for this number to be greatest hundreds digits should have the maximum values. Assign highest possible values to the hundreds digits, S and T , i.e. 9 and 8 , then go on decreasing the values assign 7 and 6 to I and E , and 5 and 4 to X and N . Put the values and get the answer i.e. 1 8 3 9 .
Each letter has to be another number. The 100's have the highest value, so you use the highest value numbers for those. 975+864=1834 --> highest value.
Since each variable is a different letter, we must assume they r all different. Using the highest possible combination of numbers we place the highest valued numbers in the hundreds place, (S)=9 and (T)=8 . The next highest go in the tens place, (I)=7 and (E)=6, then (X)=5 and (N)=4 go in the ones place. Then it's simple addition, 5+4=9, 7+6=13, carry the one which makes 10+8=18. The answer becomes 1,839.
Starting from 9 start distributing the numbers in the hundreds, tens and the units.
A possible distribution is 976 + 864 = 1 0 3 0
I'm afraid you have a couple errors.
976 + 864 = 1840
but 976 + 864 doesn't satisfy the requirement of unique digits. It has to be 975 + 864 = 1839
Problem Loading...
Note Loading...
Set Loading...
We can write the given summation as 1 0 0 ( S + T ) + 1 0 ( I + E ) + X + N .
In order to make the above summation larger , we must maximize ( S + T ) first. So we have ( S , T ) = ( 8 , 9 ) , ( 9 , 8 ) . Now we must maximize ( I + E ) and we can do it by choosing the largest numbers before 8 , 9 that are 6 , 7 . Hence we have ( I , E ) = ( 6 , 7 ) , ( 7 , 6 ) . Now for maximizing ( X + N ) we have ( X , N ) = ( 4 , 5 ) , ( 5 , 4 ) .
So the maximum summation possible is :
9 7 5 + 8 6 4 = 8 7 4 + 9 6 5 = 9 7 4 + 8 6 5 = 9 6 4 + 8 7 5 = 1 8 3 9