Maximize the integral product

Given aiZ+1ina_i \in \mathbb{Z}^+ \forall 1\le i \le n, and

a1+a2++an=ma_1 + a_2 + \cdots + a_n = m, where mm is given positive integer and

a1a2ana_1 a_2 \cdots a_n is maximum.

Find ai,na_i, n for a given integer mm.

Note by Kartik Sharma
4 years ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Note that 2(k2)>k2(k-2) > k for k>4k > 4, that k+1>k×1k+1 > k\times1 for k1k \ge 1, and that 32>233^2 > 2^3.

Firstly, note that there are finitely many ways of writing mm as a sum of positive integer (there are at most mm integers in the sum, and each is no greater than mm). Thus there certainly is a maximum possible product over all such sums (since there are only finitely many products to consider).

  • If one of the numbers aa in a decomposition of mm is greater than 44, then we can replace aa by 22 and a2a-2, obtaining a new decomposition of mm with a larger product. Thus there are no integers greater than 44 in the decomposition of mm that yields the maximum product.
  • If one of the numbers aa in a decomposition of mm is equal to 11, another number in the decomposition is equal to bb, replacing the pair of numbers a=1,ba=1,b by the single number b+1b+1 yields a new decomposition of mm with a larger product. Thus there are no integers equal to 11 in the decomposition of mm that yields the maximum product.
  • Since 4=2+2=2×24 = 2+2=2\times2, any copy of the integer 44 can be replaced with two copies of 22, so there is no need for any decomposition of mm to contain the number 44.

Thus the decomposition of mm that yields the maximum product contains only the numbers 22 and 33. Since 23<322^3 < 3^2 and 2+2+2=3+32+2+2=3+3, any set of three 22s can be replaced by two 33s, resulting in a larger product. Thus the decomposition of mm that yields the maximum product cannot have more than two 22s.

  • If m=3km = 3k, the only way we can satisfy all the above requirements for a decomposition (only 22s and 33s, and at most two 22s) is to have kk copies of 33, making the maximum product 3k3^k.
  • If m=3k+1m = 3k+1, the only way to satisfy these rules is to have two 22s and k1k-1 copies of 33, making the maximum product 22×3k12^2 \times 3^{k-1}.
  • If m=3k+2m = 3k+2 we are forced to have just one 22 and kk copies of 33, making the maximum product 2×3k2\times3^k.

Mark Hennings - 4 years ago
×

Problem Loading...

Note Loading...

Set Loading...