Prove that for every n, every polygon (even if it has holes) can be partitioned into n connected pieces of the same area

Mathstodon

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