Counting Canadian Pennies (Cont)

For all nodes in rank group g, the number of (Canadian) pennies deposited is no more than

F(g) n / 2 F(g - 1)

because there each vertex in rank group g can receive at most F(g) pennies while its parent remains in the same group.

Lemma 7: The total number of Canadian pennies paid is not greater than:

n ? F(g) / 2 F(g-1)

g = 1

G(n)

Previous slide

Next slide

Back to first slide

View graphic version