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

What will be the best approach to finding all the prime numbers less than 75 that leave an odd reminder when we divide them with 5?

Asked by Neha on 12 Jul 2021


A patient was diagnosed with some ailment. He was given five different tablets to take at night at an interval of 15 minutes.

How long will it take the patient to consume all the five tablets?

Asked by Neha on 02 Jul 2024

Once while in his court, King Akbar asked Birbal to write something on a wall that makes one sad when read in good times and makes one happy when read in sad times.

He took only a few moment and wrote something that fit the requirements. What did he write?

Asked by Neha on 10 May 2021


Which Travels Faster? Solve below famous picture riddle:

Which Travels Faster

Asked by Neha on 11 Dec 2024

What word is identified by the below rebus?

Your Your Your Your Your
Your Your Your Your Your

Asked by Neha on 27 Jul 2023

Replace the question mark with the correct number.

2 + 2= 4
3 + 3= 18
4 + 4= 48
5 + 5= ?

Asked by Neha on 15 Aug 2023


Do You See It?

Do You See It?

Asked by Neha on 17 Feb 2022

I am 5 letters long.
My first two tell you who I am
My first 3 could be a medicine
My last three reversed could be a young boy.
My 4th, 3rd and 2nd in that order could be a fruit drink.
If you have me you may hang me round your neck
WHAT AM I ?

Asked by Neha on 14 May 2021

Can you solve the below algebraic mathematical equation?

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

Asked by Neha on 29 May 2021


Replace each alphabet with the number (1-9) to make the below equation correct.

AB * C = DE - F = GH / I

Asked by Neha on 29 Aug 2024

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