|
| |
|
|
A110000
|
|
Minimal number of polygonal pieces in a dissection of a regular n-gon to an equilateral triangle (conjectured).
|
|
2
| | |
|
|
|
OFFSET
| 3,2
|
|
|
COMMENTS
| I do not know which of these values have been proved to be minimal.
Turning over is allowed. The pieces must be bounded by simple curves to avoid difficulties with non-measurable sets.
|
|
|
REFERENCES
| G. N. Frederickson, Dissections: Plane and Fancy, Cambridge, 1997.
H. Lundgren, Geometric Dissections, Van Nostrand, Princeton, 1964.
H. Lundgren (revised by G. N. Frederickson), Recreational Problems in Geometric Dissections and How to Solve Them, Dover, NY, 1972.
|
|
|
LINKS
| Stewart T. Coffin, Dudeney's 1902 4-piece dissection of a triangle to a square, from The Puzzling World of Polyhedral Dissections.
Stewart T. Coffin, The Puzzling World of Polyhedral Dissections, link to part of Chapter 1.
Geometry Junkyard, Dissection
Gavin Theobald, Triangle dissections
Vinay Vaishampayan, Dudeney's 1902 4-piece dissection of a triangle to a square
|
|
|
EXAMPLE
| a(3) = 1 trivially.
a(4) <= 4 because there is a 4-piece dissection of an equilateral triangle into a square, due probably to H. Dudeney, 1902 (or possible C. W. McElroy - see Fredricksen, 1997, pp. 136-137). Surely it is known that this is minimal? See illustrations.
Coffin gives a nice description of this dissection. He notes that the points marked * are the mid-points of their respective edges and that ABC is an equilateral triangle. Suppose the square has side 1, so the triangle has side 2/3^(1/4). Locate B on the square by measuring 1/3^(1/4) from A, after which the rest is obvious.
For n >= 5 see the Theobald web site.
|
|
|
CROSSREFS
| Cf. A110312, A110356.
Sequence in context: A023825 A199289 A114602 * A073922 A201945 A012891
Adjacent sequences: A109997 A109998 A109999 * A110001 A110002 A110003
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Sep 11 2005
|
| |
|
|
