Into how many regions can you partition the plane with m n-sided
regular polygons?
For example, with two squares you can achieve up to 10 regions by choosing the right size and position of your squares.
(In reply to
I agree. Full explanation. by Jer)
Well done, looks like you and Dej Mar have proven that at least nm(m-1)+2 regions are possible. But how can you be sure the polygons cannot be arranged in a clever way to come up with even more regions?
|
Posted by JLo
on 2006-09-07 13:24:35 |