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

(In reply to re(7): Part I - notation by Richard)

The question does not ask for proof of the converse but since Richard asks...

If  n is even, then it is easy to see that a square can be divided into n/2 equal rectangular stripes and each of these can be halved by a diagonal to give n triangles of equal area.

Posted by goFish on 2006-02-05 15:09:57