10.52 A circle contains 6000 points, no three of which are collinear.
（1）Is it possible to divide this circle into 2000 regions, each containing exactly three points? How can this be done?
(2) If the three points in each region satisfy: the distance between any two points is an integer and does not exceed 9, then using the three points in each region as vertices to form triangles, how many of these triangles are of the same size at minimum?