The triangular table view is fascinating. It looks like the periodic table. I wonder if there are number-theoretic lemmas (or at least conjectures?) about what "family" the optimal packing for a given number falls into (like diamond, diagonal strip, two blobs, etc). I didn't see anything when skimming the survey paper linked at the bottom of the site, but I'm sure there's a lot more literature here.
if, like me, you're a non-native english and speaker don't immediately understand what this is about: the page shows for each `n` what's the minimum `s` such that `n` squares with side of length 1 fit in a square with side of length `s`.
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.
13 comments
[ 1.7 ms ] story [ 38.9 ms ] threadwhat 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.
https://thejenkinscomic.wordpress.com/2024/12/01/brady-bunch...
https://erich-friedman.github.io/packing/squincir/