Two magicians A and B perform the following trick:

A leaves the room and B chooses 4 members from the audience at random. Each member chooses a card numbered from 1 to 100 (each chooses a different card) and after B has seen their cards he chooses a card from the remaining deck of cards. The 5 chosen cards are shuffled by an audience member and handed to A who just returned to the room. Prove that A is able to figure out which cards each member picked. Consider that the chosen members form a row and e.g. the leftmost member picks the first card and the rightmost member (B) picks the last card.

(In reply to re: the magician A coaches partner B by atheron)

I INTEND TO DO IT:

(improved version)

One of the "neutral" participants in my party  will phone my remote associate and read out my name and names of other 4 people in a random order and then 5 numbers (one of them added by me to the distinct 4 selected by them) in any order.

My associate arranges the 4 names in alphabetical order thus creating the CDEF baseline. Then  he identifies my  number,consults the table- and calls back: Ady selected 17, Betty 11, Rick 44 etc  Then my associate "explains" that there are 120 ways to order those 5 numbers and it is virtually impossible to define one of the 120 permutations by adding a single number out of 96 available choices.

Ergo- some ESP is needed (Hi,Uri Geller)....

We call it a "neat trick" !!

Posted by Ady TZIDON on 2007-05-12 18:42:43