A boy was at a carnival and went to a booth where a man said to the boy, "If I write your exact weight on this piece of paper then you have to give me $50, but if I cannot, I will pay you $50." The boy looked around and saw no scale so he agrees, thinking no matter what the carny writes he'll just say he weighs more or less. In the end the boy ended up paying the man $50. How did the man win the bet?
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.
What did Birbal say?
I am working in a bus company. The company recently went under expansion and therefore there was not enough room for all the buses. As a result, twelve buses had to be stored outside.
If the company decides to expand the garage space by forty percent, enough space to accommodate the current buses will be created leaving enough space for twelve more buses if the need arises in future.
Can you calculate the number of buses that the company owns at present?
Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.