Find the smallest positive number , such that for any points on the plane (can overlap), if the distance between any two of them does not exceed , then .
Solution
We are tasked with finding the smallest positive number such that for any 12 points on the plane (which can overlap), if the distance between any two of them does not exceed 1, then .
Let be an arbitrary point, and let . We have:
By the Universal Covering Problem, we can cover the set with a circle of radius . Choosing to be the center of this circle gives . Therefore,
Hence, the smallest positive number is:
The answer is: \boxed{48}.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.