A281065 -id:A281065 - cp's OEIS frontend

A281115 Decimal expansion of the greatest minimal separation between ten points in a unit circle.

7, 1, 0, 9, 7, 8, 2, 3, 5, 5, 6, 1, 2, 4, 6, 5, 5, 0, 8, 3, 0, 7, 2, 5, 9, 7, 6, 9, 0, 2, 6, 8, 7, 2, 5, 3, 4, 9, 3, 9, 6, 8, 5, 9, 6, 3, 1, 3, 8, 0, 9, 4, 6, 9, 7, 9, 8, 3, 2, 4, 1, 8, 3, 4, 2, 5, 2, 7, 3, 7, 9, 5, 5, 1, 6, 5, 3, 4, 0, 4, 5, 5, 5, 1, 9, 9, 5, 5, 6, 1, 0, 6, 5, 3, 3, 4, 9, 5, 9, 1, 3, 3

Offset: 0

Jeremy Tan, Jan 14 2017

The corresponding values for two to nine points are all of the form 2*sin(Pi/k), where k is the number of points N for N <= 6 and N-1 for N > 6. The value for ten points is the first that cannot be expressed in this form with k an integer, although it is still algebraic of degree 24.

The smallest circle ten unit circles will fit into has radius r = 1 + 2/d = 3.81302563... and the maximum radius of ten non-overlapping circles in the unit circle is 1 / r = 0.26225892...

			0.71097823556124655083072597690268...

U. Pirl, Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten, Mathematische Nachrichten 40 (1969), 111-124.
Eckard Specht, The best known packings of equal circles in a circle
Jeremy Tan, Sympy (Python) program
Index entries for algebraic numbers, degree 24

Cf. A281065 (10 points in unit square).

p = Pol([1, 0, -32, 0, 463, 0, -3998, 0, 22899, 0, -91428, 0, 260179, 0, -529874, 0, 763206, 0, -754052, 0, 481476, 0, -176440, 0, 27556]); polrootsreal(p)[5]

d is the smallest positive root of d^24 - 32*d^22 + 463*d^20 - 3998*d^18 + 22899*d^16 - 91428*d^14 + 260179*d^12 - 529874*d^10 + 763206*d^8 - 754052*d^6 + 481476*d^4 - 176440*d^2 + 27556.

A381485 Decimal expansion of sqrt(13)/6.

Original entry on oeis.org

6, 0, 0, 9, 2, 5, 2, 1, 2, 5, 7, 7, 3, 3, 1, 5, 4, 8, 8, 5, 3, 2, 0, 3, 5, 4, 4, 5, 7, 8, 4, 1, 5, 9, 9, 1, 0, 4, 1, 8, 8, 2, 7, 6, 2, 3, 0, 7, 5, 4, 1, 0, 3, 5, 4, 5, 1, 7, 4, 2, 1, 7, 6, 0, 3, 7, 8, 6, 1, 1, 5, 8, 0, 4, 8, 8, 3, 5, 0, 7, 4, 2, 0, 0, 7, 6, 9, 8, 4, 7, 0, 0, 3, 0, 8, 1, 7, 8, 6, 2, 7, 8, 9, 1, 9

Offset: 0

Amiram Eldar, Feb 24 2025

The greatest possible minimum distance between 6 points in a unit square.

The solution was found by Ronald L. Graham and reported by Schaer (1965).

			0.60092521257733154885320354457841599104188276230754...

Hallard T. Croft, Kenneth J. Falconer, and Richard K. Guy, Unsolved Problems in Geometry, Springer, 1991, Section D1, p. 108.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, Vol. 94, Cambridge University Press, 2003, Section 8.2, p. 487.

J. Schaer, The densest packing of 9 circles in a square, Canadian Mathematical Bulletin, Vol. 8, No. 3 (1965), pp. 273-277.
D. Würtz, M. Monagan, and R. Peikert, The history of packing circles in a square, Maple Technical Newsletter, Vol. 1 (1994), pp. 35-42; ResearchGate link.
Index entries for algebraic numbers, degree 2.

Solutions for k points: A002193 (k = 2), A120683 (k = 3), 1 (k = 4), A010503 (k = 5), this constant (k = 6), A379338 (k = 7), A101263 (k = 8), A020761 (k = 9), A281065 (k = 10).

Cf. A010470, A142464, A176019, A295330, A344069.

Mathematica
```
RealDigits[Sqrt[13] / 6, 10, 120][[1]]
```

list(len) = digits(floor(10^len*quadgen(52)/6));

Equals A010470 / 6 = A295330 / 3 = A344069 / 2 = A176019 - 1/2 = sqrt(A142464).

Minimal polynomial: 36*x^2 - 13.

cp's OEIS Frontend

A281115 Decimal expansion of the greatest minimal separation between ten points in a unit circle.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula