My lastest posts can be found here:
Previous blog posts:
Additionally, some earlier writings:
Dissecting a Square (Part 2) - 2011/08/08
So it can be done, but in how many ways?
I rapidly got 5 (or 6, depending on a technicality), and I started to wonder about a proof that 5 (or 6) was all of them. I posted a badly worded question on an internet forum, and rightly got flamed for it, but in the answers was a shock.
There was an infinite family of solutions.
In fact there were two infinite families.
Oh crap. I really, really don't know anything at all.
But the infinite families were (and are) quite well behaved, so I started to wonder if it wasn't so bad after all. I mean, I had three easily described infinite families , maybe I could prove that I had them all now!
The families have two, four or eight pieces, all of which divide the number of symmetries of a square. There are clues there, maybe I can work on that.
Then someone produced a "dissection" into 16 pieces.
Then someone else produced a dissection into 32 pieces, and wondered openly about 128.
And there it stands. I haven't told you everything yet, as you might expect, but I hope I've made you at least a little curious.
So here's your puzzle for next time. Dissect a square into identical (size and shape) pieces so that all of them touch the centre point. This can be done in infinitely many ways, but your challenge is to find some and describe them.
blog comments powered by Disqus
Links on this page