# s39 - Another favorite came from past Problem of the Week...

This preview shows pages 1–2. Sign up to view the full content.

Solution to Problem 39 Congratulations to this week’s winners Ray Kremer and Paul Leisher Correct solutions were also received from Nathan Pauli, Bradley alumnus Kevin Bourrillion, Ben (no last name given), Ronan Cummins, Jan Siwanowicz, Philippe Fondanaiche. One anonymous correct solution was submitted and three incorrect or incomplete solutions were submitted. The cleanest solution has the priest flip one coin and the pirate flip one coin. If their coins match, the priest goes, if not the pirate goes. It’s straightforward to check that each outcome occurs exactly 50% of the time.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Another favorite came from past Problem of the Week Champ Kevin Bourrillion who offered the following: Each flips both the coins. Whoever gets more heads wins. If they tie, they flip again. Neither coin needs to be fair. One other "solution" deserve to be mentioned, for its entertainment value if for no other reason. Have the priest put both coins in one hand and put both hands behind his back. If the pirate guesses which hand holds the coins, she goes. this page....
View Full Document

## This note was uploaded on 03/01/2010 for the course MATH 301 taught by Professor Albertodelgado during the Spring '10 term at Bradley.

### Page1 / 2

s39 - Another favorite came from past Problem of the Week...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online