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?

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

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

Can you solve this amazing hard number series problem?
7, 8, 10, 12, 16, 18 ?

Which letter of the alphabet has the most water?

What has many keys but can’t open a single lock?

It has a long neck, A name of a bird, Feeds on cargo of ships, It's not alive,

What is it?

When we see 2 but call 10?

Find the mistake in the below maths equations

A = 2
A(A-1) = 2(A-1)
A2-A = 2A-2
A2-2A = A-2
A(A-2) = A-2
A = 1

I am a word of 12 alphabets.

* Alphabets 12, 4, 7, 2, 5 : Eastern beast of burden
* Alphabets 1, 8, 10, 9 are street made famous by Sinclair Lewis.
* Alphabets 11, 3, 6 are past.

On whole it means a person suffering from delusions of greatness.

What Is it ?

I have cities, but no houses. I have mountains, but no trees. I have water, but no fish. What am I?