The broken chain
There are five segments of a broken chain, each segment having three links. Moses wants to repair the chain. What is the minimum number of links he needs to open and close again to join all these segments together?
Note: The chain is not circular!
Difficulty level (1 very easy - 10 very hard): 3
Topics:
Algebra
->
Word Problems
Logic
->
Reasoning / Logic
Proof and Example
->
Constructing an Example / Counterexample
Minimum and Maximum Problems / Optimization Problems
There are no comments yet.