Three brothers Jacob, John, and James live in Mexico City. The product of the ages of these brothers is 175. Jacob and John are twins. How old is James?

A man plots the murder of his wife. His plan is full proof. Nobody saw them leaving their house. He stabbed her with a knife while driving. She died on the spot. He threw her body in a valley. He threw the knife carefully wiping his finger prints on a random garbage bin. Then he went back to his home and no one was watching him this time as well.

After an hour, he was called by the local police department who informed him that his wife was murdered. They asked him to reach the scene of crime immediately. But as soon as he arrived at the crime scene, he was arrested by them.

How did the police know that he himself is the murderer?

There are three Athletes (John, Tarun and Harish) and their individual Coaches (Jacob, Meenaxi and Priyanka) standing on the shore.
No Coach trusts their Athlete to be near any other Coach unless they are also with them.
There is a boat that can hold a maximum of two persons.
How can the six people get across the river?

Do you know of a place where the wind blows south and then suddenly shifts direction towards the north?

A Child was born in Lahore, Pakistan.

Still child is not a Pakistani citizen.why ?

John went to meet his friend Jacob, but when he was about to reach the main gate, John notices that Jacob had a mighty dog who was fastened to the tree. The chain is long enough that it allows the dog to reach the main gate.

How can the John reach the main gate?

Can you solve the below algebraic mathematical equation?

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

It's pretty hard to give up.
If you remove a part of it, you will be left with a bit.
Even if you remove another part, the bit still remains.
Remove one more and it still remains.

What is it?

How is the moon similar to a dollar?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?