Can a rectangle be divided into n=3 congruent non-rectangular parts.Can the same be done for n=4?
Asked
Active
Viewed 1,461 times
4
-
For $n=4$ you can take a subdivision into four rectangles and put a "wiggle" in the two horizontal boundaries. (i.e. a bump downward followed by a bump upward.) Then the top tiles are rotations of the bottom tiles. – Cheerful Parsnip Apr 24 '13 at 13:02
-
3Just saw this: http://math.stackexchange.com/questions/50085/can-a-rectangle-be-cut-into-5-equal-non-rectangular-pieces?rq=1 – Cheerful Parsnip Apr 24 '13 at 13:24
-
2@GrumpyParsnip: Following that to this answer on MathOverflow, I came upon Polyominoes of order 3 do not exist. The way I read it, this does not cover the case of rotations by angles which are not multiples of 90°. For $n=4$ there are many examples, including this one. – MvG Apr 25 '13 at 15:32