MainScienceMathCombinatorics › The Cutting Sticks Problem

The Cutting Sticks Problem

Edit Page
Report
Scan day: 03 February 2014 UTC
-220
Virus safety - good
Description: An unsolved combinatorial problem by Frans Faase.
The name of the problem comes from a popular description by which the problem can be stated: sticks with integer length of which the total length of sums up to +1)/2. None of the sticks are shorter than
Size: 202 chars

Contact Information

Email:
Phone&Fax: 288 557 1111
Address:
Extended:

WEBSITE Info

Page title:The cutting sticks problem
Keywords:
Description:
IP-address:195.128.174.120