Quote:
Originally Posted by carlosinho  We would like to pack as many circles of diameter d as possible into another large circle of diameter D. We denote by N(d;D) such number.
(a) Give the upper bound for N(d;D).
(b) Give in details how we can calculate a lower bound for N(d;D). Find an explicit value for N when d = 9 mm and D = 72 mm. ANY IDEAS?! | Parts a) and b) are so vaguely worded that we can give bounds as follows: Clearly if d<D: 1<floor(D/d)<N(d;D)< floor(D^2/d^2) but these are not tight. RonL
__________________
Truth does not change because it is, or is not, believed by a majority of the people.
Giordano Bruno |