Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Someone I know said "I wish no matter where I am, there is always a place near me so I can visit".

I started to wonder what is the minimum number of places required if he give me what he consider as "near".

I formalized it into a math problem:

Every point on the unit sphere has distance at most $d$ to some point in the set $S$, what is the lower bound for $|S|$?

I also wonder if there are any studies on the generalized version: replace unit sphere with any totally bounded spaces in the problem above.

share|cite|improve this question
up vote 4 down vote accepted

A subset $S$ of the unit sphere has covering radius $r$ if each point of the sphere lies at distance at most $r$ from some point in $S$. There is no known formula which gives the minimum number of points required in a subset with covering radius $r$. Nonetheless it is an important problem, and you will find a table at (which reports on results of Hardin, Sloane and Smith. Neil Sloane's web [age is a natural place to start if you want more information.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.