Math
posted by Mark .
Brilli the ant has a block of cheese that is in the shape of an equilateral triangle. She is hosting a party, and has invited her twolegged house mates. She insists that all of her guests get a piece of cheese that is in the shape of an isosceles triangle. What is the maximal number N such that she cannot split the equilateral triangle block of cheese into N nondegenerate isosceles triangles?

Please comment on the previous answer before reposting:
http://www.jiskha.com/display.cgi?id=1373921871