FAQFAQ SearchSearch All Topics At A GlanceAll Topics At A Glance newpostsNew Posts UnansweredUnanswered Posts   RegisterRegister   ProfileProfile Log in to check your private messagesLog in to check your private messages Log inLog in
FeedBurner FeedFeedBurner RSS 2.0 Feed Request a New ForumRequest a New Forum


   ¤ Riddles ¤

Author Message
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

Everyone show me your riddles!!!  Here's one which I am not sure if I'm telling right.  I think the proper way is harder than this but anyway...    A lily pad sits in a pond and doubles in size each day.  On the thirtieth day, it occupies 50% of the pond.  On what day does it first fill the entire pond?     
   
   
   
   
   
   
   
   
   
 31st day - I think I told it wrong though...
Back to top
 
Riddles Posted: Sat Mar 17, 2007 11:39 am     Riddles Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

An evil king has 1000 bottles of wine. A neighboring queen plots to kill the bad king, and sends a servant to poison the wine. The king's guards catch the servant after he has only poisoned one bottle. The guards don't know which bottle was poisoned, but they do know that the poison is so potent that even if it was diluted 1,000,000 times, it would still be fatal. Furthermore, the effects of the poison take one month to surface. The king decides he will get some of his prisoners in his vast dungeons to drink the wine. Rather than using 1000 prisoners each assigned to a particular bottle, this king knows that he needs to murder no more than 10 prisoners to figure out what bottle is poisoned, and will still be able to drink the rest of the wine in 5 weeks time. How does he pull this off?  
   
   
 P.S.  How do you make a spoiler section so I can tell the answer?
Back to top
 
Posted: Sat Mar 17, 2007 11:45 am     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

          
Quote:
An evil king has 1000 bottles of wine. A neighboring queen plots to kill the bad king, and sends a servant to poison the wine. The king's guards catch the servant after he has only poisoned one bottle. The guards don't know which bottle was poisoned, but they do know that the poison is so potent that even if it was diluted 1,000,000 times, it would still be fatal. Furthermore, the effects of the poison take one month to surface. The king decides he will get some of his prisoners in his vast dungeons to drink the wine. Rather than using 1000 prisoners each assigned to a particular bottle, this king knows that he needs to murder no more than 10 prisoners to figure out what bottle is poisoned, and will still be able to drink the rest of the wine in 5 weeks time. How does he pull this off?       P.S. How do you make a spoiler section so I can tell the answer?
    I've just realised that theres no point to this riddle... the part that says "Rather than using 1000 prisoners each assigned to a particular bottle" is stupid, because he could just do that, only one would die and he'd find out in 4 weeks rather than five.  
   
   
 EDIT*  Actually I realise now, that the king would do this because he is evil as stated at the beginning.
Back to top
 
Posted: Sat Mar 17, 2007 11:49 am     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

Sheila and He-Man are twins; Sheila is the OLDER twin. Assume they were born immediately after each other, an infinitesimally small - but nonzero - amount of time apart. During one year in the course of their lives, Sheila celebrates her birthday two days AFTER He-Man does. How is this possible?   
   
   
 Note: For both Sheila and He-Man, these birthday celebrations happen on the actual birthday date -- it cannot be a celebration that occurs at a date earlier or later than the actual birthday date for whatever reasons of convenience. Also, the solution has nothing to do with the theory of relativity or any other over complicated nonsense like that.
Back to top
 
Posted: Sat Mar 17, 2007 11:52 am     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

There is a circular jail with 100 cells numbered 1-100. Each cell has an inmate and the door is locked. One night the jailor gets drunk and starts running around the jail in circles. In his first round he opens each door. In his second round he visits every 2nd door (2,4,6---) and shuts the door. In the 3rd round he visits every 3rd door (3,6,9---) and if the door is shut he opens it, if it is open he shuts it. This continues for 100 rounds (i.e. 4,8,12 ---; 5,10,15 ---; ---; 49,98 etc.) and exhausted the jailor falls down. How many prisoners found their doors open after 100 rounds?
Back to top
 
Posted: Sat Mar 17, 2007 11:54 am     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

you're a cyborg in a pistol duel with two other cyborgs. you have been programmed to fire pistols with an accuracy of 33%. the other two cyborgs shoot with accuracies of 100% and 50%, respectively. the rules of the duel are one shot per-cyborg per-round. the shooting order is from worst shooter to best shooter. thus, you go first, the 50% guy goes second, and the 100% guy goes third; repeat. if a cyborg dies, we just skip his or her turn, obviously. what should you shoot at in round 1 to maximize your chances of survival over time?
Back to top
 
Posted: Sat Mar 17, 2007 11:56 am     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

a corporate business man has two cubes on his office desk. every day he arranges both cubes so that the front faces show the current day of the month. what numbers are on the faces of the cubes to allow this?   
   
 Note: You can't represent the day "7" with a single cube with a side that says 7 on it. You have to use both cubes all the time. So the 7th day would be "07". I also should note that this is a really sly problem. Almost unfair.
Back to top
 
Posted: Sat Mar 17, 2007 11:58 am     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

At a fork in the road between two cities, you see 2 people. One always tells the truth, and comes from the city of safety. The other person always lies and comes from the city of cannibals, where they will eat you. They both look exactly the same. You must choose one of the persons, and ask him one and only one question (no compound questions either, such as "is this shirt red and which way to safety?"). What question could you ask to find out which path leads to the city of safety?
Back to top
 
Posted: Sat Mar 17, 2007 11:59 am     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

A pirate ship captures a treasure of 1000 golden coins. The treasure has to be split among the 5 pirates: 1, 2, 3, 4, and 5 in order of rank. The pirates have the following important characteristics: infinitely smart, bloodthirsty, greedy. Starting with pirate 5 they can make a proposal how to split up the treasure. This proposal can either be accepted or the pirate is thrown overboard. A proposal is accepted if and only if a majority of the pirates agrees on it. What proposal should pirate 5 make?
Back to top
 
Posted: Sat Mar 17, 2007 12:02 pm     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

Local Berkeley professors Dr. Demmel and Dr. Shewchuk bump into each other on Telegraph Ave. They haven't seen each other since Vietnam.  
   
 Shewchuk hey! how have you been?   
 Demmel great! i got married and i have three daughters now   
 Shewchuk really? how old are they?   
 Demmel well, the product of their ages is 72, and the sum of their ages is the same as the number on that building over there..   
 Shewchuk right, ok ... oh wait ... hmm, i still don't know   
 Demmel oh sorry, the oldest one just started to play the piano   
 Shewchuk wonderful! my oldest is the same age!    
   
 How old are the daughters?
Back to top
 
Posted: Sat Mar 17, 2007 12:03 pm     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

10 straight-jacketed prisoners are on death row. Tomorrow they will be arranged in single file, all facing one direction. The guy in the front of the line (he can't see anything in front of him) will be called the 1st guy, and the guy in the back of the line (he can see the heads of the other nine people) will be called the 10th guy. An executioner will then put a hat on everyone's head; the hat will either be black or white, totally random. Prisoners cannot see the color of their own hat. The executioner then goes to the 10th guy and asks him what color hat he is wearing; the prisoner can respond with either "black" or "white". If what he says matches the color of the hat he's wearing, he will live. Else, he dies. The executioner then proceeds to the 9th guy, and asks the same question, then asks the 8th guy ... this continues until all of the prisoners have been queried.   
   
 This is the night before the execution. The prisoners are allowed to get together to discuss a plan for maximizing the number of lives saved tomorrow. What is the optimal plan?  
   
 After you have solved the above problem, generalize. There are N prisoners and K different colors of hats. What's the optimal plan?  
   
 The best strategy can save all but one life...
Back to top
 
Posted: Sat Mar 17, 2007 12:08 pm     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

Trianglia is a jacked-up island where no road has a dead end, and all the crossroads are "Y" shaped. The young prince of Trianglia mounts his horse, and is about to go on a quest to explore the land of Trianglia. He gets to the road by his palace, when the mother queen comes out and shouts: "But Charles, how will you find your way back?". "Don't worry Elizabeth", the prince replies, "I will turn right in every second crossroad to which I arrive, and left otherwise. Thus I shall surely return to the palace sooner or later." Is the prince right?
Back to top
 
Posted: Sat Mar 17, 2007 12:10 pm     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

Three men go to a cheap motel, and the desk clerk charges them a sum of $30.00 for the night. The three of them split the cost ten dollars each. Later the manager comes over and tells the desk clerk that he overcharged the men, since the actual cost should have been $25.00. The manager gives the bellboy $5.00 and tells him to give it to the men. The bellboy, however, decides to cheat the men and pockets $2.00, giving each of the men only one dollar.  
   
 Now each man has paid $9.00 to stay for the night, and 3 x $9.00 = $27.00. The bellboy has pocketed $2.00. But $27.00 + $2.00 = $29.00. Where is the missing $1.00? WTF?
Back to top
 
Posted: Sat Mar 17, 2007 12:18 pm     Reply with quote
SallyDP
Active Poster
Active Poster


Joined: 16 Mar 2007
Posts: 100

I guess that the cubes will have these numbers on them:  
 Cube #1: 1,2,4,5,6,0  
 Cube #2: 1,2,3,7,8,0  
   
 That way he can arrange them and always be able to have the day of the month.    
 Am I right?
Back to top
 
Posted: Mon Mar 19, 2007 7:26 am     Reply with quote
kfgmaster
Happy Camper
Happy Camper


Joined: 16 Mar 2007
Posts: 38

na sorry, you are close i suppose, but unfortunately you can't make 09, 19, and 29 the way you have chosen to do it.
Back to top
 
Posted: Wed Mar 21, 2007 11:21 am     Reply with quote
Post new topic   Reply to topic    Back to the Jokes and Humor Chat Forum <--
Google
 

 


Powered by phpBB © 2001, 2005 phpBB Group