what I'm curious about though is what a proof for something like this looks like. and why does it need a proof? not to mention the randomness of some of the `n`s. Math is most of the time beatiful and whenever I see something like `n=11` I think "it looks wrong so it must be wrong" yet it has a proof.
Yet, in each example the inner squares shrink. Uh?
It know it was a convention to better show the arrangement, normalizing, yadda yadda.
Yet, Uh?
but the text also says "For the $n ≤ 324$ not pictured, the trivial packing (with no tilted squares) is the best known packing." applying 'trivial' to numbers that aren't perfect squares so iunno
One is trivial proofs, which are where 100% is covered. This doesn't really leave much to prove in terms of whether or not more area can be covered by a different layout.
The other is trivial packings, the very simple type without any tilting or need of gaps between squares. Trivial packings are only sometimes optimal. Of optimal trivial packings, only some can be shown optimal with an aforementioned trivial proof.
https://thejenkinscomic.wordpress.com/2024/12/01/brady-bunch...