Compare commits
1 Commits
735681d0ee
...
main
Author | SHA1 | Date | |
---|---|---|---|
0b7acaf5ae |
@ -17,7 +17,9 @@ Maximize the product $a_1 #sym.times a_2 #sym.times ... #sym.times a_k$
|
||||
Of course, all $a_i$ should be greater than $1$. \
|
||||
Also, all $a_i$ should be smaller than four, since $x <= x(x-2)$ if $x >= 4$. \
|
||||
Thus, we're left with sequences that only contain 2 and 3. \
|
||||
#note([Note that two twos are the same as one four, but we exclude fours for simplicity.])
|
||||
#note(
|
||||
[Note that two twos are the same as one four, but we exclude fours for simplicity.],
|
||||
)
|
||||
|
||||
#v(2mm)
|
||||
|
||||
|
Reference in New Issue
Block a user