Question: A man wants to have a party in thirty-one days where he will be serving his 1000 barrels of wine. The only problem is that one of his enemies poisoned one of the barrels. The poison kills any man who drinks any of the wine in about 30 days, give or take a few hours. The man has 10 plants that are also killed by the poison in 30 days and can be used to test the wine. How can identify the single poisoned barrel of wine?
Answer: To do this the man must create 1000 unique groups from the 10 plants in which each group has between 1 and 10 plants, and give each plant wine from a different barrel. He can then throw away the barrel of wine that corresponds to the group that died from the wine.
Question: A natural state, I'm sought by all.
Go without me, and you shall fall.
You do me when you spend,
and use me when you eat to no end.
What am I?
You have a large number of friends coming over and they all get thirsty. Your first friend asks for 1/2 a cup of water. Your second friend asks for 1/4 a cup of water. Your third friend asks for 1/8 a cup of water, etc.
How many cups of water do you need to serve your friends?
Answer: Just one. If your friends kept asking for water like this forever one cup would be enough.
John has some chickens that have been laying him plenty of eggs. He wants to give away his eggs to several of his friends, but he wants to give them all the same number of eggs. He figures out that he needs to give 7 of his friends eggs for them to get the same amount, otherwise there is 1 extra egg left.
What is the least number of eggs he needs for this to be true?
Answer: 301 eggs. The number of eggs must be one more than a number that is divisible by 2, 3, 4, 5, and 6 since each of these numbers leave a remainder of 1. For this to be true one less than the number must be divisible by 5, 4, and 3 (6 is 2*3 and 2 is a factor of 4 so they will automatically be a factor). 5 * 4 * 3 = 60. Then you just must find a multiple of 60 such that 60 * n + 1 is divisible by 7. 61 / 7, 121 / 7, 181 / 7, 241 / 7 all leave remainders but 301 / 7 doesn't.
Question: Queens can move horizontally, vertically and diagonally any number of spaces as illustrated. One piece 'attacks' another if it moves to the same tile that the other piece is on. How can you arrange eight queens on the board so they cannot attack each other?
Hint: Four must go on black and four on white.
Answer: Here are the two solutions. This is usually solved with guess and check although using logic may be faster. We know that each queen must be in it's own row vertically and horizontally. We also know that 4 of the queens must be on white and 4 on black. This is true because with 4 queens on the same color all of the rest of that color is venerable to attack. (It could be done with math).
Follow us and get the Riddle of the Day, Joke of the Day, and interesting updates.