Find the value of n such that the sum of positive odd integers a 1 , a 2 , ⋯ , a n is 2018 and the product of these integers is maximized.
Bonus: Generalize this for the sum of integer N .
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.
Note that 1 × 5 < 3 2 , 5 2 < 3 3 × 1 , 1 3 < 3 1 , 3 × 1 2 < 5 and also that n < 9 ( n − 6 ) for all n ≥ 7 .
If N is written as a sum of positive odd integers so as to maximise their product M , none of the positive integers involved can be 7 or more (otherwise we could replace a ≥ 7 in the decomposition by a − 6 , 3 , 3 ). Thus the only odd numbers used are 1 , 3 , 5 . We also note that at most two of the numbers can be 1 , and at most one of the numbers can be 5 , and also that we cannot use both 1 and 5 at the same time. Moreover, provided that we use at least one 3 , we cannot use more than one 1 . Suppose now that N ≥ 6 , so that we have to use at least one 3 .
In the case N = 2 0 1 8 , we deduce that n = 6 7 2 .
This is just an intuition. knowing the answer is 6 7 2 , for the case where a t ∀ t can be any positive integer, and the fact that a t ≈ 3 ∀ t for the mentioned case, it is easy to guess
3 × 6 7 2 + 2 = 2 0 1 8
Now we need to get rid of the 2 in the summation. it can be added to one of the 3 s. so, there would be still 6 7 2 terms to maximise the product.
Problem Loading...
Note Loading...
Set Loading...
We make some obvious observations: (a) In the solution, there will be no summands m ≥ 7 since "splitting" m = 1 + 3 + ( m − 4 ) will increase the product; (b) There may be some 1's or 5's but not both since 1 + 5 = 3 + 3 ; (c) There will be at most one 5 since 5 + 5 = 3 + 3 + 3 + 1 ; (d) There will be at most two 1's since 1 + 1 + 1 = 3 .
In the case N = 2 0 1 8 , this leaves us with two options, 2 0 1 8 = 6 7 1 × 3 + 5 = 6 7 2 × 3 + 2 × 1 , with the first being the "winner," 5:3. The answer is 6 7 2
Bonus: If N is divisible by 3 (as will happen in a few days' time , in 2019), we use all 3's; if the remainder is 1 we use one 1 and the rest 3's; and if the remainder is 2 (as in 2018) we use one 5 and the rest 3's except for N = 2 , where we use two 1's.