Let
be a regular
-gon. A diagonal is called good if its endpoints divide the boundary of
into two parts, each composed of an odd number of sides of
. The sides of
are also called good.
Suppose
has been dissected into triangles by
diagonals, no two of which have a common point in the interior of
. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.
![P](/media/m/9/6/8/968d210d037e7e95372de185e8fb8759.png)
![2006](/media/m/6/f/c/6fcdb45c8d6f7c740407f60d385414c0.png)
![P](/media/m/9/6/8/968d210d037e7e95372de185e8fb8759.png)
![P](/media/m/9/6/8/968d210d037e7e95372de185e8fb8759.png)
![P](/media/m/9/6/8/968d210d037e7e95372de185e8fb8759.png)
Suppose
![P](/media/m/9/6/8/968d210d037e7e95372de185e8fb8759.png)
![2003](/media/m/b/1/2/b12e42bc0cb8847464f1eabd933daa3a.png)
![P](/media/m/9/6/8/968d210d037e7e95372de185e8fb8759.png)