Cut the Chain

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?




Similar Riddles

Can you find the odd one out from the below words ?

First Second Third Forth Fifth Sixth Seventh, Eighth Nine Ten Eleven Twelve.

Asked by Neha on 14 Apr 2023


Astrology starts with the alphabet A, Biology starts with B, Psychology with P and Limnology with L.

Can you find an "ology" that begins with a P?

Asked by Neha on 12 Nov 2024

John buys rice at Rs.60/kg from Britain and then sells them at Rs.5/kg in India. As a result of this, he becomes a millionaire. How come?

Asked by Neha on 22 Jun 2023


Can you arrange four 9's and use at most 2 math symbols, to make the total 100?

Asked by Neha on 21 Nov 2023

After teaching his class all about Roman numerals (X = 10, IX=9 and so on) the teacher asked his class to draw a single continuous line and turn IX into 6. The teacher's only stipulation was that the pen could not be lifted from the paper until the line was complete.

Asked by Neha on 07 May 2025

Can you solve the below algebraic mathematical equation?

(J+O+I+N+T)3 = JOINT

Asked by Neha on 29 May 2021


I have an eye but still cannot see.

Who am I?

Asked by Neha on 28 Oct 2023

I’m orange, I wear a green hat and I sound like a parrot. What am I?

Asked by Neha on 26 Aug 2025

What is in seasons, seconds, centuries and minutes but not in decades, years or days?

Asked by Neha on 03 Nov 2025


A lion and its tamer are standing inside a cage that measures 1 unit in radius. Both of them can effortlessly run at the speed of 1 unit maximum.

1) Suppose the lion is hungry, will he be able to eat up the tamer?
2) If yes, how long can the tamer survive?

Asked by Neha on 13 Oct 2023

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki