A young craftsman is deep in thought. He has 5 short pieces of chain that must be joined into a long chain. Opening ring 3 (first operation) and linking it to ring 4 (second operation), then unfastening ring 6 and linking it to ring 7, and so on... bring him to 8 operations in total. The clever craftsman wants to reach the goal in less than 8 operations.
What is the least number of operations he can target as a feasible number for this job?
Explanations
6 operations would be enough for such a job.
The clever craftsman can open just the rings 1, 2, 3 in the first pieces - 3 operations. And then with those unfastened rings connect the four remaining small chains into the long one - another 3 operations.
[After Boris A. Kordemsky. The Moscow Puzzles: 359 mathematical recreations. 1972]