Let the letters be the numbers from to , but not necessarily in this order.
What is the minimum value of ?
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.
To minimize the function, we must be careful with where we put the "big" values. In this problem it is very simple: we can eliminate them by letting G H I J = 0 × 9 × 8 × 7 = 0 .
This leaves us with minimizing A + B C + D E F , with numbers 1 → 6 .
Because 6 taking part in D E F would make it really big, we'll allow A = 6 . To minimize the three-digit product, D E F , let F = 1 . We are left now with B C + D E and the numbers 2 → 5 .
The minimum value for B C + D E is held when the "edge" numbers (first with last, second with penult, third with antepenult, etc...) are combined. The order of the numbers will thus be ( 2 , 5 , 3 , 4 ) .
We finally get that the minimum value of A + B C + D E F + G H I J is 2 8 .
PS: Go check a very similar problem , submitted by Chung Kevin .