Is there any formula to calculate how many circles of radius r fit in a single bigger circle of radius R?
$\begingroup$
$\endgroup$
4
-
1$\begingroup$ circle packing in a circle or in general circle packing is known to be a hard problem. Only a few solutions is known. You exercise must be asking something more specific or it will be impossible for high school to solve. $\endgroup$– achille huiCommented Sep 15, 2013 at 2:53
-
$\begingroup$ And with advanced math? Is it possible? $\endgroup$– Lucas CletoCommented Sep 15, 2013 at 21:55
-
$\begingroup$ As I have said, only few solutions are known. Even with advanced math, no one in the world know the full answer for arbitrary $r$ and $R$. What is the exact statement of your exercise? Does it just ask you for a qualitative description of the tightest arrangement? or to give an estimate/a lower bound/an upper bound for the numbers you can fit in the bigger circle? or simply something else. $\endgroup$– achille huiCommented Sep 16, 2013 at 0:20
-
$\begingroup$ There is the obvious upper bound of $\left(\frac{R}{r}\right)^2$ but even rounding that down to the nearest integer will rarely give you the correct maximum number. $\endgroup$– frettyCommented Sep 16, 2013 at 11:54
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
1
It is a very complicated and investigated problem, usually formulated in the form: given a natural number $n$, which is the smallest radius $R=R(n)$ of the disk containing $n$ non-overlapping unit disks (that is, disks of radius 1). You can see results for small $n$ ($\le 20$) at Packing Center by Erich Friedman. For large $n$ ($\gg 10$) it is practically impossible to obtain tight lower bounds for $R(n)$ and upper bounds are found by computers, trying to find tighter and more tighter packings. I can share with you some articles and a program Pack 1.0 related with this problem. I upload them when my file sharing website will work.
answered Sep 25, 2013 at 7:52
-
1