Follow

Square packing: adamponting.com/square-packing

Adam Ponting found a way to cover arbitrarily large (e.g. as measured by inradius) contiguous patches of the plane by distinct squares of sizes from \(1\) to \((2n+1)^2\), for any \(n\). Via demonstrations.wolfram.com/Pon and mathpuzzle.com/

Sign in to participate in the conversation
Mathstodon

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!