The Cutting Sticks Problem
Library Home || Full Table of Contents || Suggest a Link || Library Help
|A classic math puzzle: You are given k sticks with integer length of which the total length of sums up to n(n+1)/2. None of the sticks is shorter than n. Can you always cut them into sticks with length 1, 2, up to n, no matter the number of the sticks and their lengths? Discussion of approaches, solutions, and programs from personal mail and newsgroups. Includes contributions from Dave Rusin, Chris Hall, Dan Hoey, Mike Williams, Hugo Van der Sanden, Ian Hawthorn, Dave Ring, K.J.Saeger, Timothy Chow, Hauke Reddmann, and Ajit Diwan.|
|Levels:||High School (9-12), College|
|Resource Types:||Problems/Puzzles, Articles, Topic Tools Miscellaneous|
|Math Topics:||Operations Research, Computer Science|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.