Given ai∈Z+∀1≤i≤na_i \in \mathbb{Z}^+ \forall 1\le i \le nai∈Z+∀1≤i≤n, and
a1+a2+⋯+an=ma_1 + a_2 + \cdots + a_n = ma1+a2+⋯+an=m, where mmm is given positive integer and
a1a2⋯ana_1 a_2 \cdots a_na1a2⋯an is maximum.
Find ai,na_i, nai,n for a given integer mmm.
Note by Kartik Sharma 4 years ago
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:
*italics*
_italics_
**bold**
__bold__
- bulleted- list
1. numbered2. list
paragraph 1paragraph 2
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> 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"
\(
\)
\[
\]
2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Note that 2(k−2)>k2(k-2) > k2(k−2)>k for k>4k > 4k>4, that k+1>k×1k+1 > k\times1k+1>k×1 for k≥1k \ge 1k≥1, and that 32>233^2 > 2^332>23.
Firstly, note that there are finitely many ways of writing mmm as a sum of positive integer (there are at most mmm integers in the sum, and each is no greater than mmm). Thus there certainly is a maximum possible product over all such sums (since there are only finitely many products to consider).
Thus the decomposition of mmm that yields the maximum product contains only the numbers 222 and 333. Since 23<322^3 < 3^223<32 and 2+2+2=3+32+2+2=3+32+2+2=3+3, any set of three 222s can be replaced by two 333s, resulting in a larger product. Thus the decomposition of mmm that yields the maximum product cannot have more than two 222s.
@Pi Han Goh @Mark Hennings
Problem Loading...
Note Loading...
Set Loading...
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:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Note that 2(k−2)>k for k>4, that k+1>k×1 for k≥1, and that 32>23.
Firstly, note that there are finitely many ways of writing m as a sum of positive integer (there are at most m integers in the sum, and each is no greater than m). Thus there certainly is a maximum possible product over all such sums (since there are only finitely many products to consider).
Thus the decomposition of m that yields the maximum product contains only the numbers 2 and 3. Since 23<32 and 2+2+2=3+3, any set of three 2s can be replaced by two 3s, resulting in a larger product. Thus the decomposition of m that yields the maximum product cannot have more than two 2s.
@Pi Han Goh @Mark Hennings