Coins in a fountain

Short description: Math problem

Coins in a fountain is a problem in combinatorial mathematics that involves a generating function. In this problem, a fountain is an arrangement of non-overlapping unit circles into horizontal rows in the plane so that consecutive circles in the bottom row are tangent to each other, and such that each circle in a higher row is tangent to two coins from the next row below it. Above the bottom row, consecutive coins are not required to touch. The problem asks for the number of different fountains of n coins with k coins in the bottom row.[1]

## Solution

First few terms of the sequence[2][3] 0  | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | 10  | 11  | 12  | 13

|
|
|
|
|
|
|
|
|
|
|
|
|

1 | 1 | 1 | 2 | 3 | 5 | 9 | 15 | 26 | 45 | 78 | 135 | 234 | ...

The above sequence show the number of ways in which n coins can be stacked. So, for example for 9 coins we have 45 different ways of stacking them in a fountain. The number f(n,k) which is the solution for the above stated problem is then given by the coefficients of the polynomial of the following generating function:

Template:NumBlk2 Such generating function are extensively studied in[4]

Specifically, the number of such fountains that can be created using n coins is given by the coefficients of:

Template:NumBlk2 This is easily seen by substituting the value of y to be 1. This is because, suppose the generating function for (1) is of the form:

∑n∑kCn,kxnyk

then, if we want to get the total number of fountains we need to do summation over k. So, the number of fountains with n total coins can be given by:

∑kCn,kxnyk

which can be obtained by substituting the value of y to be 1 and observing the coefficient of xn.

Proof of generating function (1). Consider the number of ways of forming a fountain of n coins with k coins at base to be given by f(n,k). Now, consider the number of ways of forming the same but with the restriction that the second most bottom layer (above the base layer) contains no gaps, i.e. it contains exactly k − 1 coins. Let this be called primitive fountain and denote it by g(n,k). The two functions are related by the following equation:

Template:NumBlk2

This is because, we can view the primitive fountain as a normal fountain of n − k' coins with k − 1 coins in the base layer staked on top of a single layer of k coins without any gaps. Also, consider a normal fountain with a supposed gap in the second last layer (w.r.t. the base layer) in the r position. So, the normal fountain can be viewed as a set of two fountains:

1. A primitive fountain with n' coins in it and base layer having r coins.
2. A normal fountain with n − n' coins in it and the base layer having k − r coins.

So, we get the following relation: Template:NumBlk2

Now, we can easily observe the generating function relation for (4) to be: Template:NumBlk2

and for (3) to be: Template:NumBlk2

Substituting (6) in (5) and re-arranging, we get the relation:

F(x,y)=11−xyF(x,xy)=11−xy1−x2yF(x,x2y)=⋯=11−xy1−x2y1−x3y⋯

## References

1. ↑ Odlyzko, A. M. and Wilf, H. S. (1988) The editor’s corner: n coins in a fountain. Amer. Math. Monthly 95 840–843.[1]
2. ↑ Sloane, N. J. A. (2000) The On-Line Encyclopedia of Integer Sequences. Published electronically at "Sloane's encyclopedia of sequences"
3. ↑ Phillipe Duchon, Phillipe Flajolet, Guy Louchard and Gilles Schaeffer (2003)"Boltzmann Samplers for the Random Generation of Combinatorial Structures"
4. ↑ Flajolet, P. (1980) Combinatorial aspects of continued fractions. Discrete Math. 32 125–161.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Coins in a fountain. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Coins_in_a_fountain&oldid=3984186"