Home > Science > Mathematics > Combinatorics
The cutting sticks problem The name of the problem comes from a populair by which the problem can be stated: You are given k sticks with integer length of which the total length of sums up to n(n+1)/2. Non of the sticks are shorter than n. Can you always cut them into sticks with length 1, 2, upto n, no matter the number of the sticks and their lenghts. Obvious assumptions are that you are not ...
home.wxs.nl/~faase009/cutsticks.html
Post a Review
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Please note, all comments are subject to review and can be removed at any time for any reason.
Disclaimer: eiNET is not affiliated in any way with the The cutting sticks problem (home.wxs.nl/~faase009/cutsticks.html) website.
Views and opinions expressed may not be representative of eiNET or its owners but all effort is made to keep the site free of obscenities, illegal or otherwise malicious activity.
Are you the owner of this site? You can manage your listing here.