If we tell you that there is a relation between the numbers and letters in the given figure, can you analyze it and find the missing letter in the last box?
A thief is convicted in Mexico. He gets the death penalty. The judge allows him to say the last sentence to determine how the penalty will be carried out. If the thief lies, he will be hanged, if he speaks the truth he will be beheaded. The thief tells the last sentence and to everybody's surprise some minutes later he is set free because the judge cannot determine his penalty. What did the thief say?
Jessica is telling her friends this story and asks them to guess if it’s the truth or a lie: “There was a man sitting in a house at night that had no lights on at all. There was no lamp, no candle, and no other source of light. Yet, he sat in the house and read his book happily.†Her friends say she’s lying, but Jessica corrects them and says she’s telling the truth. Jessica’s story is true—but how?
Pronounced as one letter,
And written with three,
Two letters there are,
And two only in me.
I am double, I am single,
I am black blue and grey,
I am read from both ends,
And the same either way.
John and Jenni are a married couple. They have two kids, one of them is a girl. Assume safely that the probability of each gender is 1/2.
What is the probability that the other kid is also a girl?
In a guessing game, five friends had to guess the exact numbers of apples in a covered basket.
Friends guessed 22, 24, 29, 33, and 38, but none of the guesses was correct. The guesses were off by 1, 8, 6, 3, and 8 (in random order).
Can you determine the number of apples in a basket from this information?
John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.
The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.
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.
