12
$\begingroup$

You are given a long enough stick. Your task is to create a new type of foldable ruler something like shown below with it by cutting the stick into pieces and folding them at one point:

enter image description here

You need to have something like above but no mark on it and all sticks are attached at one point and they do not have to have same lengths. You may think each stick as a line and they are sticked at one point for simplicity but it is still foldable so you can measure lengths by folding the rulers. Then By folding the ruler, you are supposed to measure every cm from 1 to 40.

What is the shortest stick length originally you need to have to measure every cm from $1$ to $40$ for this foldable ruler?

For example: if this question was asked for 1 to 8 cm, the answer would be $9$ cm with 1,2,6 cm sticks. So you can measure every cm from 1 to 8 by folding the ruler, such as to measure $8$, fold 2 cm stick to the one side while 6 cm stick to the other side, or to measure $4$ you can fold 2 and 6 in the same side, etc...

$\endgroup$

3 Answers 3

5
$\begingroup$

I think

.5, 1.5, 2.5, 3.5, 4.5, 5.5, 6.5, 19.5, 33.5

This gives a total of

77.5

As far as I can tell, this seems to yield all the integers between 1 and 40.

Thanks to Jonathan Allan for

stopping me from trying to shave off the .5 :)

$\endgroup$
5
  • 1
    $\begingroup$ Ahha of course (I kept trying adjusting by too much :p) $\endgroup$ Commented Aug 27, 2018 at 21:42
  • 1
    $\begingroup$ @JonathanAllan Haha I was pretty sure that your solution was the best, but then this suddenly hit me. $\endgroup$
    – 1848
    Commented Aug 27, 2018 at 21:45
  • 2
    $\begingroup$ FWIW according to an integer linear program for the problem, this solution seems to be best possible (of the form considered). $\endgroup$
    – Neal Young
    Commented Aug 28, 2018 at 2:27
  • 1
    $\begingroup$ great! you got it, i hope you like its trickiness. $\endgroup$
    – Oray
    Commented Aug 28, 2018 at 4:05
  • $\begingroup$ @Oray really fun problem; keep it up! $\endgroup$
    – 1848
    Commented Aug 28, 2018 at 5:56
4
$\begingroup$

Continuing with a similar pattern as above,

We can include $n$ stick lengths from 1 to $n$, and then select one stick length of length $40-n$. At the very least, this will provide an upper bound.

You can create

1-10 using exactly those sticks; 11-19 using 10 + (1 through 9); 20-29 using 30 - (1 through 10); 30 using exactly that stick; and 31-40 using 30 + (1 through 10).

This means we need a total stick length of

1+2+3+4+5+6+7+8+9+10+30 = 85 cm.

$\endgroup$
3
$\begingroup$

This may not yet be isn't quite the best...

But it does it in 79cm:
1, 2, 3, 4, 5, 6, 7, 18, 33

$\endgroup$
2
  • $\begingroup$ getting close :) $\endgroup$
    – Oray
    Commented Aug 27, 2018 at 21:05
  • $\begingroup$ FWIW this seems to be best possible with integer lengths. $\endgroup$
    – Neal Young
    Commented Aug 28, 2018 at 2:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.