Given a partition of a square into n triangles of equal area, prove that n is even.

(In reply to re(4): Part I - notation by Mindrod)

I knew that. While we were reviewing this problem in the queue, I argued for changing the problem to only proving that n=3 was impossible, but my viewpoint did not prevail, perhaps wisely. It still seems unlikely to me that we will get a detailed proof even for the impossibilty of n=3.  Instead we will probably just get some vague statements. And forget about an official solution for the general case.  Nevertheless,  I think you should not post vague nonsense -- when you have something you want to say, I think it is much better to just say it, so then people won't  think you are being arbitrarily disruptive with your comments.

Posted by Richard on 2006-02-04 22:51:18