11 Jun
2003
11 Jun
'03
10:56 p.m.
PUZZLE: Given a rhombus tiling of a 2n-gon (so that each polygon edge is a rhombus edge), show that the number of rhombi is determined by n.
As Michael Kleber and George Hart have (perhaps inadvertently) pointed out, I neglected to mention (except in the Subject line) that the 2n-gon is supposed to be regular.
For a straightforward generalization to parallelograms, one need only assume that the 2n-gon is convex and has n pairs of parallel sides.
i think you need to say "n pairs of parallel *and equal* sides". mike