A discrete mathematics problem by Harshit Joshi
A diagonal of a regular 2006-gon is called odd if its endpoints divide the boundary into two parts, each composed of an odd number of sides. Sides are also regarded as odd diagonals. Suppose the 2006-gon has been dissected into triangles by 2003 non-intersecting diagonals. Find the maximum possible number of isosceles triangles with two odd sides.