Question: The warden of a circular jail is extremely hyper one day so he begins running around opening cells. The jail has 100 cells numbered from 1 to 100. He runs in a circle and opens all of the cells. Next he runs around and closes every 2nd cell (starting with cell 2, 4, 6 , etc.). If a cell is open he closes it and if a cell is closed he opens it. When he finishes running by all 100 cells he opens/closes every 3rd cell (starting with 3, 6, 9, 12 etc.), then every 4th cell (starting with 4, 8, 12, etc.) and so on. He does this until he goes around and only changes the 100th cell.
When he is done what cells will be open?
Answer: The cells 1, 4, 9, 16, 25, 36, 49, 64, 81, and 100 will be open. Only the cells that have two of the same factors (4 = 2 * 2) will be open because they are opened and closed the same number of times (except 1 which is just opened). Since they have the same factor twice their number of factors is odd.
Question: A town only has one barber (he is male). The barber only shaves all of the people who do not shave themselves.
So who shaves the barber?
Answer: It's a paradox, if he shaves himself then the second sentence would be false because he only shaves those who do not shave themselves. If he does not shave himself, then according to the second statement he must shave himself.
Question: You have been given the task of transporting 3,000 apples 1,000 miles from Appleland to Bananaville. Your truck can carry 1,000 apples at a time. Every time you travel a mile towards Bananaville you must pay a tax of 1 apple but you pay nothing when going in the other direction (towards Appleland).
What is highest number of apples you can get to Bananaville?
Answer: 833 apples.
Step one: First you want to make 3 trips of 1,000 apples 333 miles. You will be left with 2,001 apples and 667 miles to go.
Step two: Next you want to take 2 trips of 1,000 apples 500 miles. You will be left with 1,000 apples and 167 miles to go (you have to leave an apple behind).
Step three: Finally, you travel the last 167 miles with one load of 1,000 apples and are left with 833 apples in Bananaville.
Question: Five pirates are parting ways after finding a treasure of 100 pieces of gold. The pirates decide to split it based on a vote. Each pirate, from oldest to youngest, gets to propose a plan on how to split the gold.
If at least 50 percent of the other remaining pirates agree on the plan, that is how they will split the gold. If less than 50 percent of the pirates agree, the pirate who came up with the plan will be thrown overboard. Each pirate is smart, greedy, and wants to throw as many others overboard as possible without reducing the amount of gold they get.
What plan can the first (oldest) pirate propose to live and get as much gold as possible?
Answer: He can propose a plan that he gets 98 pieces of gold, the 3rd pirate gets 1 piece, and the 5th pirate gets 1 as well.
If there were just 2 pirates the younger pirate would definitely deny the plan so he could get all of the gold.
If there were 3 pirates the first pirate can offer the second pirate 1 piece of gold and take the rest himself because the second pirate wouldn't get anything if he has to propose a plan himself.
If there were 4 pirates the first pirate could take 99 for himself and offer 1 to the youngest pirate. They would both agree. If the youngest disagrees then he won't get any gold in the next plan.
So when there are 5 pirates it is in the interest of the 3rd and 5th pirate to accept 1 piece, because if they don't they won't get anything in the next plan.
Question: A smooth dance, a ball sport, a place to stay, an Asian country, and a girl's name.
What's her name?
Hint: Think the NATO phonetic alphabet.
Answer: Juliet, all of the listed things describe a part of the NATO phonetic alphabet: Foxtrot, golf, hotel, India, and finally Juliet.
Follow us and get the Riddle of the Day, Joke of the Day, and interesting updates.