If circles are drawn in and around an equilateral triangle (a regular trigon), the ratio of the radii is . More generally, for an N-gon the ratio is easily shown to be . Johannes Kepler, in developing his amazing polyhedral model of the solar system, started by considering circular orbits separated by regular polygons (see earlier post on the *Mysterium Cosmographicum* here).

Kepler was unable to construct an accurate model using polygons, but he noted that, if successive polygons with an increasing number of sides were inscribed within circles, the ratio did not diminish indefinitely but appeared to tend towards some limiting value. Likewise, if the polygons are circumscribed, forming successively larger circles (see Figure below), the ratio tends towards the inverse of this limit. It is only relatively recently that the limit, now known as the Kepler-Bouwkamp constant, has been established.

Let us start with the unit circle, and draw a nested sequence of regular polygons, of increasing order and size, each with its circumcircle (see Figure). Thus, we have a trigon (triangle), a tetragon (square), a pentagon, a hexagon, and so on to the N-gon. The outermost circle, surrounding the N-gon, has radius

In their popular book *Mathematics and the Imagination*, Edward Kasner and James Newman described this problem and stated that the limit of is approximately equal to 12. They gave no indication of the source of this estimate. In 1965, C J Bouwkamp showed that the true value is much smaller:

Moving inwards instead of outwards, the ratio of the inscribed and circumscribed circles for an N-gon is again , so the radius of the innermost circle is

The infinite product

is very slowly converging. Bouwkamp gave the following estimate for this constant:

Bouwkamp remarked that there was no known closed expression for , and that he did not expect that any such expression existed. He developed two methods for evaluating the constant. They involved the Riemann zeta function, for which tables of values were available.

Today, it is a simple matter to evaluate and using a mathematical computing system like **Mathematica**. In the Figure above, we show the value of the finite approximants to the product (3) for a range of up to 10,000. For , we get with only one correct digit. When , we get with two accurate digits. The values produced for the extreme value are

From these results, we see the painfully slow rate of convergence. Comparing with (2) and (4), even with 10,000 terms, we have only a few digits accuracy. Bouwkamp’s formula yields far more accurate estimates.

**Sources**

Bouwkamp, C. J., 1965: An infinite product. *Indagationes Mathematic\ae*, **68**, 40–46.

Kasner, Edward and James Newman, 1940: *Mathematics and the Imagination*. Reprinted by Dover Books, 2000.

Wikipedia article: Kepler-Bouwkamp constant. http://www.wikipedia.org/