Let N be any four-digit integer x 1 x 2 x 3 x 4 , where x 1 , x 2 , x 3 , and x 4 are single-digit positive integers and x 1 = 0 .
Find the maximum value of ⌊ x 1 + x 2 + x 3 + x 4 N ⌋ , where ⌊ ⋅ ⌋ denotes the floor function .
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.
Problem Loading...
Note Loading...
Set Loading...
In order to get the maximun value we must divide a large number by a small one. We calculate the minimun value (4) for the sum of the 4 digits and then compare it to the maximun (36). We calculate their geometric mean 4 × 3 6 = 1 2 . Now we choose from all the posible partitions of 12 the one whose digits concatenated form the largest number. Then we evaluate ⌊ 9 1 1 1 / 1 2 ⌋ = 7 5 9