Split 2018 Ⅲ

Find the value of n n such that the sum of positive odd integers a 1 , a 2 , , a n a_1,a_2,\cdots,a_n is 2018 and the product of these integers is maximized.


Bonus: Generalize this for the sum of integer N . N.


The answer is 672.

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.

3 solutions

Otto Bretscher
Dec 27, 2018

We make some obvious observations: (a) In the solution, there will be no summands m 7 m \geq 7 since "splitting" m = 1 + 3 + ( m 4 ) 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 1+5=3+3 ; (c) There will be at most one 5 since 5 + 5 = 3 + 3 + 3 + 1 5+5=3+3+3+1 ; (d) There will be at most two 1's since 1 + 1 + 1 = 3 1+1+1=3 .

In the case N = 2018 N=2018 , this leaves us with two options, 2018 = 671 × 3 + 5 = 672 × 3 + 2 × 1 2018=671\times 3 + 5= 672\times 3 + 2\times 1 , with the first being the "winner," 5:3. The answer is 672 \boxed{672}

Bonus: If N 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 N=2 , where we use two 1's.

Mark Hennings
Dec 30, 2018

Note that 1 × 5 < 3 2 1 \times 5 < 3^2 , 5 2 < 3 3 × 1 5^2 < 3^3\times1 , 1 3 < 3 1 1^3 < 3^1 , 3 × 1 2 < 5 3 \times 1^2 < 5 and also that n < 9 ( n 6 ) n < 9(n-6) for all n 7 n \ge 7 .

If N N is written as a sum of positive odd integers so as to maximise their product M M , none of the positive integers involved can be 7 7 or more (otherwise we could replace a 7 a \ge 7 in the decomposition by a 6 , 3 , 3 a-6,3,3 ). Thus the only odd numbers used are 1 , 3 , 5 1,3,5 . We also note that at most two of the numbers can be 1 1 , and at most one of the numbers can be 5 5 , and also that we cannot use both 1 1 and 5 5 at the same time. Moreover, provided that we use at least one 3 3 , we cannot use more than one 1 1 . Suppose now that N 6 N \ge 6 , so that we have to use at least one 3 3 .

  • If N = 3 m N = 3m then we must have no 1 1 s and no 5 5 s, and hence M = 3 m M = 3^m , making n = m n = m .
  • If N = 3 m + 1 N=3m+1 , then we must have one 1 1 and no 5 5 s, and hence M = 3 m × 1 M = 3^m \times 1 , making n = m + 1 n = m+1 .
  • If N = 3 m + 2 N = 3m+2 , then we must have no 1 1 s and one 5 5 , and hence M = 3 m 1 × 5 M = 3^{m-1} \times 5 , making n = m n = m .

In the case N = 2018 N = 2018 , we deduce that n = 672 n = \boxed{672} .

This is just an intuition. knowing the answer is 672 672 , for the case where a t t a_t \ \forall t can be any positive integer, and the fact that a t 3 t a_t \approx 3 \ \forall t for the mentioned case, it is easy to guess

3 × 672 + 2 = 2018 3 \times 672 + 2 = 2018

Now we need to get rid of the 2 2 in the summation. it can be added to one of the 3 3 s. so, there would be still 672 672 terms to maximise the product.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...