7.52 Let \( n \) be the minimum number of circles with radius 1 that can completely cover the given polygon \( M \), and let \( m \) be the maximum number of non-overlapping circles with radius 1 whose centers are inside the polygon \( M \). Which is larger, \( n \) or \( m \)?
［Solution］Since the radii of the two types of circles are the same, there is at most one center of a second type circle inside each first type circle. On the other hand, each center of a second type circle is inside the polygon \( M \), and thus also inside some first type circle. Therefore, we have \( n \geqslant m \).

Consider an equilateral triangle with a circumcircle radius of 1.1. Clearly, one circle with a radius of 1 cannot cover it. However, the two circles with a radius of 1, \( D \) and \( E \), as shown in the figure, can cover it, so we know \( n=2 \). Moreover, the distance between any two points in \( \triangle ABC \) does not exceed the side length of the triangle, and the side length \( AB = 1.1 \times \sqrt{3} < 1.1 \times 1.8 = 1.98 < 2 \). Therefore, any two circles with a radius of 1 centered at any two points in \( \triangle ABC \) must intersect, so we have \( m=1 < n \). On the other hand, when \( M \) is a square with a side length of 1, \( m=n=1 \).
In summary, \( n \geqslant m \) and both the equality and the inequality can hold.