Making Light:  Open thread 24 ::: June 30, 2004, 07:35 AM

Kip W:

  Fibonacci forgeries!

This reminds me of another forgery.  Suppose you select n points on
a circle and draw all segments between pairs of points.  Be sure you
select the points so that no three segments cross in a point.  Then
count the number of regions that the disc is divided into.  This is a
suprisingly good forgery for 2^n, but there's a good reason for that.
I'll explain later if there's interest.