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?

A king sentenced a man to the death sentence for some crime he had committed. Known for his kindness, the king told the culprit that he had a choice to die in a way he decides.

The culprit was clever and said something that saved him from death. What method do you think he must have chosen for his death?

Here is a mathematical expression that also secretly tells a movie name. What movie is that?

Transform the word THINK into BRAIN while changing only one letter at a time in a manner that each of the word in the process is a real word!!!

A number with an interesting property:

When I divide it by 2, the remainder is 1.
When I divide it by 3, the remainder is 2.
When I divide it by 4, the remainder is 3.
When I divide it by 5, the remainder is 4.
When I divide it by 6, the remainder is 5.
When I divide it by 7, the remainder is 6.
When I divide it by 8, the remainder is 7.
When I divide it by 9, the remainder is 8.
When I divide it by 10, the remainder is 9.

It's not a small number, but it's not really big, either.
When I looked for a smaller number with this property I couldn't find one.

Can you find it?

In a mathematical quiz, you are asked the following question:

Use three 9s in a mathematical expression without dividing or multiplying to form the number one.

Can you answer the question?

When Jack was six years old he hammered a nail into his favourite tree to mark his height. Ten years later at age sixteen, Jack returned to see how much higher the nail was. If the tree grew by five centimetres each year, how much higher would the nail be?

Can you solve this tricky maths equation problem by replacing it? mark with the correct symbol?

19834 -----: 187
15921 -----: 153
17561 -----: 139
13734 -----: ???

Can you place three balls such that the equation shown in the picture holds true?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?