Match Sticks in the Summer
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Ivars Peterson (MathLand)|
|One of the presenters at the Strens conference was mathematician Heiko Harborth of the Braunschweig Technical University in Germany. "Match sticks are [among] the cheapest and simplest objects for puzzles which can be both challenging and mathematical," he insisted. He handed out a box of matches to anyone who preferred working on match-stick puzzles instead of listening to his lecture. One group of matchstick problems that he described involves constructing patterns in which a given number of sticks meet end to end, without crossing each other, at every point in a geometric figure on a flat surface. For example, a figure made up of three sticks laid out as an equilateral triangle has two sticks meeting at each corner. Three sticks is the smallest number that can be used to create a pattern in which two sticks meet at every vertex. The problem is tougher when three sticks must meet at every corner...|
|Levels:||Middle School (6-8), High School (9-12), College|
|Resource Types:||Manipulatives, Problems/Puzzles, Articles|
|Math Topics:||Polyhedra, Triangles and Other Polygons|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.