The densest packing of 19 congruent circles in a circle (Q1282296)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1270430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The densest packing of 19 congruent circles in a circle |
scientific article; zbMATH DE number 1270430 |
Statements
The densest packing of 19 congruent circles in a circle (English)
0 references
6 December 1999
0 references
It is proved that the densest packing of 19 congruent circles in a circle is the easy conjectured one: a circle in the center, six touching it around and twelve still around as vertices of a regular dodecagon. The proof uses a Bateman-Erdős approach (originally designed for finding the Besicovitch number \(\beta_2=19\)) and author's useful geometrical lemma together with the known optimality results for packing 7, 8, 9, and 10 circles.
0 references
disc
0 references
packing
0 references
density
0 references
densest circle packing
0 references
0.8900229334831238
0 references
0.8485521674156189
0 references
0.8485158085823059
0 references
