- Source: Circle packing in a circle
circle" target="_blank">Circle packing in a circle" target="_blank">circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle" target="_blank">circle.
Table of solutions, 1 ≤ n ≤ 20
If more than one optimal solution exists, all are shown.
Special cases
Only 26 optimal packings are thought to be rigid (with no circles able to "rattle"). Numbers in bold are prime:
Proven for n = 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 19
Conjectured for n = 15, 16, 17, 18, 22, 23, 27, 30, 31, 33, 37, 61, 91
Of these, solutions for n = 2, 3, 4, 7, 19, and 37 achieve a packing density greater than any smaller number > 1. (Higher density records all have rattles.)
See also
Disk covering problem
Square packing in a circle" target="_blank">circle
References
External links
Mathematical analysis of 2D packing of circles (2022). H C Rajpoot from arXiv
"The best known packings of equal circles in a circle" target="_blank">circle (complete up to N = 2600)"
"Online calculator for "How many circles can you get in order to minimize the waste?"
Kata Kunci Pencarian:
- Daftar bentuk matematika
- Rambo: Last Blood
- Daftar julukan kota di Amerika Serikat
- Circle packing in a circle
- Circle packing
- Circle packing in a square
- Square packing
- Circle packing theorem
- Circles of Apollonius
- Ford circle
- Osculating circle
- Sphere packing in a sphere
- Circle packing in an equilateral triangle
