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 out the remainder when 3^300 is divided by 5?

Asked by Neha on 31 Oct 2023


A mathematician couple was having a Frappuccino in Starbucks sitting opposite to each other. Suddenly the guy noticed the text written on the paper in front of them and exclaimed that it was wrong. The girl denied it and said it is appropriate. Both are correct. What is written on the paper?

Asked by Neha on 11 Jul 2023

Using four sevens (7) and a one (1) create the number 100. Except for the five numerals, you can use the usual mathematical operations (+, -, x, :), root and brackets ()

Asked by Neha on 26 May 2023


What do you call a fish without an eye?

Asked by Neha on 21 Apr 2023

Can you decode the below cypher?

896983327332676578

Asked by Neha on 02 Oct 2026

In a certain country ½ of 5 = 3. If the same proportion holds, what is the value of 1/3 of 10?

Asked by Neha on 17 Aug 2026


A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?

Asked by Neha on 29 May 2024

What does the below rebus puzzle mean?

Funny House Riddle

Asked by Neha on 19 Mar 2026

Can you count the number of squares in the given picture?

How Many Squares you Find

Asked by Neha on 13 Feb 2024


Can you find out which triangle will have a bigger area among the following?
1. A triangle with sides 300, 400 and 500
2. A triangle with sides 300, 400 and 700

Asked by Neha on 13 Apr 2026

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