1 Commits

Author SHA1 Message Date
735681d0ee fmt
Some checks failed
CI / Typos (pull_request) Successful in 8s
CI / Typst formatting (pull_request) Failing after 5s
CI / Build (pull_request) Has been skipped
2025-09-24 22:00:46 -07:00
2 changed files with 6 additions and 8 deletions

View File

@ -17,9 +17,7 @@ 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$. \ 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$. \ 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. \ Thus, we're left with sequences that only contain 2 and 3. \
#note( #note([Note that two twos are the same as one four, but we exclude fours for simplicity.])
[Note that two twos are the same as one four, but we exclude fours for simplicity.],
)
#v(2mm) #v(2mm)