Here is another math problem that I just can't do.
A convex pentagon is partitioned by its diagonals into $11$ regions, $1$ pentagon and $10$ triangles. What is the maximum number of those $10$ triangles that can have equal area?
I tried many different ways to do this. The standard regular pentagon has $5$ triangles with equal area. This is a reasonable answer, but many people on my forum claim to have found $6$ to $7$ triangles by Coordinate bashing. They assume the vertexes of the point to be $(0,0), (0,1), (a_1,a_2), (b_1,b_2), (c_1,c_2)$, and they hash out all of the coordinates of the diagonals, and figure out the area of each triangle.
Is there a simpler and less confusing way to solve the problem?
Any help will be greatly appreciated.



As mentioned in comments, six triangles of equal area is trivial. Such a pentagon can be constructed from any isosceles triangle. I also agree with Aretino in suggestion that a solution with seven triangles does not exist.