Daily Math Puzzle 2026/10/28
English
Let \(n\) be a positive integer. Color the vertices of a regular \(6n\)-gon alternately red and blue. Divide it into triangles by diagonals that do not cross in the interior, so that an even number of diagonals meet at every vertex. Find the minimum possible number of resulting triangles whose three vertices all have the same color.
日本語
\(n\) を正の整数とする. 正 \(6n\) 角形の頂点を,赤と青で交互に塗る. 内部で交差しない対角線を引いて三角形に分割し,各頂点から出る対角線の本数がすべて偶数になるようにする. 分割でできた三角形のうち,3頂点が同じ色のものの個数の最小値を求めよ.