0

let circle C with radius r,and there are enough much unit circles ,now put these unit circle into the large circle C such that these circles cannot intersect in the large ,ask what is the maximum number of the unit circles which is putted into the large circle .let this maximum number is M(r),we can prove the M(1)=1,M(2)=2,M(3)=7,but the r belong to positive real numbers,so we define R(n)=the minimize radius of the large circle which load n unit circles,so we have if R(n)

flag
3 
See en.wikipedia.org/wiki/Circle_packing_in_a_circle – Koen S Nov 21 2011 at 12:01
I'm voting to close: there is no hope for "an answer" aside from the obvious information on Wikipedia. Mathoverflow is for "questions with answers". – André Henriques Nov 21 2011 at 15:26
Strictly speaking @Koen gave the best answer the OP could have hoped for. – Igor Rivin Nov 21 2011 at 15:43

closed as not a real question by Mark Sapir, André Henriques, Igor Rivin, Martin Brandenburg, Will Jagy Nov 21 2011 at 20:53

Browse other questions tagged or ask your own question.