Large numbers often give Alice headaches. Today she receives the number
8 9 2 4 6 5 8 3 7 1 .
Alice wants to split the number into 3 parts such that their sum is the smallest. What will the sum be?
Details and Assumptions:
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.
The claim of "4 digit number will always be bigger than any three digit number so it makes sense to minimize it first" isn't always true. This is a very common misconception that to minimize f + g , we have to minimize f and g .
For example, if we had to split the 7 digit number 1 3 3 1 4 2 2 into 2, then 1 4 2 2 + 1 3 3 < 1 3 3 1 + 4 2 2 .
Log in to reply
Hi Calvin. You are as always correct. However, is there any way to avoid this scenario, or do you just have to test them?
Log in to reply
In this problem, you generally would have to test them. There isn't a "mathematical reasoning" for why "starting with the smallest possible value of the largest term will lead to the smallest total".
How can the answer be 5921? It should be 2105 . Take the example 1279+368+458=2105
Log in to reply
You are not allowed to rearrange the digits.
@Christopher Boo I think the problem could be clarified to make this condition explicit, specifically what "split into 3 parts" means.
I also got 2105
1278+368+459=2105
892 + 4658 + 371 = 5921 Other combinations have larger sums. If we select 89 + 2465 + 8371 its big. If we select 8924 then the number itself i bigger than our answer. If we select 892 + 465 + 8371 we again have 8371 as a bigger number. Hence, the answer.
@Christopher Boo I edited the title to "Make it small" instead of "Make it bigger", since the question wants the smallest sum.
Problem Loading...
Note Loading...
Set Loading...
To minimize the sum it would make sense to spread the digits evenly. There are ten digits total, and we need to make 3 numbers and therefore an optimal selection would have two 3 digit numbers and one 4 digit number. Next we can see that the 4 digit number will always be bigger than any three digit number so it makes sense to minimize it first. This leads us with three choices. We can split the number up to be 4-3-3, 3-4-3, 3-3-4. The second combination yields the smallest 4 digit number and therefore will be the smallest sum 5921 :)