Akbar summoned Birbal out of anger.
He told him that he will have to face death.
He asked him to make a statement and if the statement is true he will be buried alive and if the statement is false, he will be thrown at lions.
After hearing Birbal’s statement, Akbar could do nothing but smile.
He gave him 5 gold bars and let him go.
I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:
First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.
See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.
A worker is to perform work for you for seven straight days. In return for his work, you will pay him 1/7th of a bar of gold per day. The worker requires a daily payment of 1/7th of the bar of gold. What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?
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