# How many?

**Discrete Mathematics**Level 3

Consider an equilateral triangle in which each side has length 1 centimetre. What is the smallest number of points that must be chosen from the region enclosed by the triangle (including the boundary) so that at least two of these points have distance of at most \(\dfrac{1}{2}\) centimetre between them.