A blind man is handed a deck of 52 cards and told that exactly 10 of these cards are facing up. How can he divide the cards into two piles, not necessarily of equal size, with each pile having the same number of cards facing up?
If the original pile has c cards with f cards facing up, then the blind man divides them into piles of size f and c – f. Then he flips all cards in the pile with f cards. Let’s see why it works for c = 52 and f = 10. The blind man would divide the cards into two piles with 10 and 42 cards each. If there are k face-up cards in the 10-card pile, then there must be 10 – k face-up cards in the 42-card pile (because the total number of face-up cards is 10). So by flipping all cards in the 10-card pile, the number of face-up cards in both piles would become equal to 10 – k.
This puzzle is contributed by Praveer Satyam. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Puzzle 1 | (How to Measure 45 minutes using two identical wires?)
- Puzzle 2 | (Find ages of daughters)
- Puzzle 3 | (Calculate total distance travelled by bee)
- Puzzle 4 | (Pay an employee using a 7 units gold rod?)
- Puzzle 13 | (100 Prisoners with Red/Black Hats)
- Puzzle 5 | (Finding the poisoned wine)
- Puzzle 6 | (Monty Hall problem)
- Puzzle 7 | (3 Bulbs and 3 Switches)
- Puzzle 8 | (Find the Jar with contaminated pills)
- Puzzle 9 | (Find the fastest 3 horses)
- Puzzle 10 | (A Man with Medical Condition and 2 Pills)
- Puzzle 11 | (1000 Coins and 10 Bags)
- Puzzle 12 | (Maximize probability of White Ball)
- Puzzle 14 | (Strategy for a 2 Player Coin Game)
- Puzzle 15 | (Camel and Banana Puzzle)