All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Penny Problem (Posted on 2003-10-14)
You are blindfolded before a table. On the table are a very large number of pennies. You are told 128 of the pennies are heads up and the rest are tails up.

How can you create two subgroups of pennies, each with the same number of heads facing up?

 See The Solution Submitted by Ravi Raja Rating: 3.7500 (16 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(3): solution | Comment 5 of 18 |
(In reply to re(2): solution by SilverKnight)

Am I missing something here? SilverKnight's original solution, while specifying that the pennies be turned over one by one, actually produces the desired state at the end of all the turnings over, not at some unspecified time when only some have been turned over. So, I'm not quite sure what DJ's objection is, but also SilverKnight hasn't seemed to respond to that misunderstanding. Perhaps SK hasn't noticed DJ's misconstrual of the solution.
 Posted by Charlie on 2003-10-14 14:13:59

 Search: Search body:
Forums (0)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: