Partition a square into a set of acute triangles. (Here are some
blanks for a few tries.)
The problem asks for doing the partitioning with some number
of triangles. If you are successful, is your solution with a minimum
number of acute triangles?
What is the minimum number of acute triangles needed to partition
a square? Proof?
