Equilateral Triangles

A computer program places N equilateral triangles of the same size randomly on the screen.
You observe that you can cover any of these triangles by moving the other triangles without rotating.
If this observation holds true for any configuration, what is the minimum possible value of N?
|