Abstract
We have noticed a certain kind of n-gon dissection into triangles that has a wonderful property of interest to most puzzlists. Namely that any two triangles have at least one edge in common yet no two triangles need be congruent. In an informal poll of specialists at a recent convention, none of them saw immediately how this could be accomplished. But in fact it is very straightforward.
Original language | American English |
---|---|
Journal | Scholarship and Professional Work - LAS |
Volume | 1 |
State | Published - Jan 1 2009 |
Keywords
- curious cutups
- g4g9
- gathering for gardner
- geometry
- puzzles
- puzzlists
- trigonometry
Disciplines
- Geometry and Topology
- Mathematics
- Other Mathematics