返回题库

HMMT 二月 2003 · GEN1 赛 · 第 9 题

HMMT February 2003 — GEN1 Round — Problem 9

专题
Discrete Math / 离散数学
难度
L3
来源
HMMT

题目详情

  1. Consider a 2003-gon inscribed in a circle and a triangulation of it with diagonals intersecting only at vertices. What is the smallest possible number of obtuse triangles in the triangulation?
解析
  1. Consider a 2003-gon inscribed in a circle and a triangulation of it with diagonals intersecting only at vertices. What is the smallest possible number of obtuse triangles in the triangulation? Solution: 1999 By induction, it follows easily that any triangulation of an n -gon inscribed in a circle has n − 2 triangles. A triangle is obtuse unless it contains the center of the circle in its interior (in which case it is acute) or on one of its edges (in which case it is right). It is then clear that there are at most 2 non-obtuse triangles, and 2 is achieved when the center of the circle is on one of the diagonals of the triangulation. So the minimum number of obtuse triangles is 2001 − 2 = 1999. 2