Problem #PRU-111360

Problems Set theory and logic Algorithm Theory Algorithm Theory

Problem

A magician with a blindfold gives a spectator five cards with the numbers from 1 to 5 written on them. The spectator hides two cards, and gives the other three to the assistant magician. The assistant indicates to the spectator two of them, and the spectator then calls out the numbers of these cards to the magician (in the order in which he wants). After that, the magician guesses the numbers of the cards hidden by the spectator. How can the magician and the assistant make sure that the trick always works?