(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Let S be a bounded set in n -space. Fix a d>0. Then it is possible to choose a finite set of points {pi....pm} in S such that every point p in S is within a distance d of at least one of the points p1, p2,....pm.

2. Relevant equations

None really.

3. The attempt at a solution

I've tried some methods but I have been stuck at some point of every attempt. A nudge (or two) in the right direction would be greatly appreciated.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Proof on boundedness of sets in n space

**Physics Forums | Science Articles, Homework Help, Discussion**