Trace:
wiki:donuts:spring2016
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
wiki:donuts:spring2016 [2016/04/20 14:31] mruzinda created |
wiki:donuts:spring2016 [2016/06/15 14:57] (current) mruzinda |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | ====== 1000 bottles ====== | ||
| + | |||
| + | You are the ruler of a kingdom and you throw a huge party. You are poisoned when you drink from one of the bottles in the party. There are 1000 bottles for you to choose from and you have 24 hours before you die. You get prisoners to try each one of the bottles to see which one had the poison. If the poison can kill any prisoner in 10 to 20 hours, what is the minimum number of prisoners that you can use? | ||
| + | |||
| + | [[wiki:donuts:spring2016:1000bottles|answer]] | ||
| + | |||
| + | |||
| + | ====== Matches ====== | ||
| + | |||
| + | Move one matchstick to get the correct equation. | ||
| + | |||
| + | {{:wiki:donuts:matches.png?200|}} | ||
| + | |||
| + | [[wiki:donuts:spring2016:Matches|answer]] | ||
| + | |||
| + | ====== Cubes ====== | ||
| + | |||
| + | Move 5 cubes so that 5 faces from each of the cubes is touching (Corners and edges don't count). | ||
| + | |||
| + | [[wiki:donuts:spring2016:Cubes|answer]] | ||
| + | |||
| + | ====== Passengers On A Plane ====== | ||
| + | |||
| + | There are 100 seats on a plane, and 100 passengers that correspond to each of those seats (The first passenger will have the first seat, the second will have the second and so on). If one of the passengers chooses to sit in a random seat, then the passenger that finds him/her in their seat goes to an empty seat. | ||
| + | What is the probability that the 100th passenger sits in his/her seat? | ||
| + | |||
| + | [[wiki:donuts:spring2016:PassengersOnAPlane|answer]] | ||
| + | |||
| + | ====== Inscribed Circle ====== | ||
| + | |||
| + | Find the radius of the circle. | ||
| + | |||
| + | {{:wiki:donuts:circle.jpg?200|}} | ||
| + | |||
| + | [[wiki:donuts:spring2016:InscribedCircle|answer]] | ||
| + | |||
| + | ====== Slips Of Paper ====== | ||
| + | |||
| + | There are 3 slips of paper with random numbers on each one. What is the best strategy of picking the largest number if the papers are face down, and you have two tries? If you pick the first one and you think it's the largest one, then you stick with it. If you don't then you can look at the second one, and pick either the first or second or third. | ||
| + | |||
| + | [[wiki:donuts:spring2016:SlipsOfPaper|answer]] | ||
| + | |||
| + | ====== Minimum Sum ====== | ||
| + | |||
| + | What is the minimum sum of numbers on a six sided die one can achieve when all the numbers on the faces adjacent to the top and bottom faces must be greater by at least 2? | ||
| + | |||
| + | [[wiki:donuts:spring2016:MinimumSum|answer]] | ||
| + | |||
| + | ====== 3 Dollar Candy Bar ====== | ||
| + | |||
| + | A boy has the opportunity to go to Willy Wonka's chocolate factory by buying as many bars as he can to get the golden ticket. He has $45 and each bar costs $3. He can also return 3 wrappers to get one free bar. How many bars is he able to get with that $45? | ||
| + | |||
| + | [[wiki:donuts:spring2016:3DollarCandyBar|answer]] | ||
| + | |||
| + | |||
| *Be sure to update the "Question Asked" table! | *Be sure to update the "Question Asked" table! | ||
| **/ | **/ | ||
| ===== Questions Asked ===== | ===== Questions Asked ===== | ||
| - | | Junming Diao | 0 | | + | | Junming Diao | 1 | |
| - | | Mark Ruzindana | 0 | | + | | Mark Ruzindana | 1 | |
| - | | Dr. Jeffs | 0 | | + | | Dr. Jeffs | 2 | |
| - | | Richard Black | 1 | | + | | Richard Black | 2 | |
| - | | Dr. Warnick | 0 | | + | | Dr. Warnick | 2 | |
| | Mitchell Burnett | 0 | | | Mitchell Burnett | 0 | | ||
wiki/donuts/spring2016.1461184265.txt.gz · Last modified: 2016/04/20 14:31 by mruzinda