Mark/handouts
Mark/handouts
1
0
Fork 0
Code Pull Requests 2 Actions Packages Releases Activity

Minor edit

Browse Source
This commit is contained in:
Mark 2023-12-18 08:59:10 -08:00
parent a5e6aca0a9
commit 0319c52248
Signed by: Mark
GPG Key ID: C6D63995FE72FD80
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Misc/Warm-Ups/partitions.tex
View File

@ -15,8 +15,8 @@
\problem{} \problem{}
Take any positive integer $n$. \par Take any positive integer $n$. \par
Now, write it as sum of smaller positive integers: $n = a_1 + a_2 + ... + a_k$. \par Now, write it as sum of smaller positive integers: $n = a_1 + a_2 + ... + a_k$ \par
Maximize the product $a_1 \times a_2 \times ... \times a_k$. Maximize the product $a_1 \times a_2 \times ... \times a_k$