CON Assignment- Match Making
Satyam Kumar Modi
December 2020
1 Introduction
The magician has total 52 cards. So,there are total
52
= 2598960
5
possible combinations of 5 cards. In each combination, we are going to have
atleast two cards which belong to the same suit. Now, the assistant needs to
choose a sequence of 4 cards out of the chosen 5 cards. Number of all possible
4 cards sequences are
52 × 51 × 50 × 49 = 6497400
. Lets call the set of all such 5 cards combinations as A and all 4 cards combi-
nations as B. Clearly, we can have a unique mapping for each combination in A
to B.
By pigeonhole principle, there will always be two cards such that they belong
to the same suit. What the assistant can do is hide any of the two cards that
are of the same suit. So, he/she can place the other card of the same suit in the
first place in the sequence of the 4 cards, so that the magician can get the suit
of the hidden card. Now we need to chose which card is to be kept hidden for
the magician to guess and which to show.
1
For this, follow this circular order, whenever we have two cards of different
dominations, the one that could be reached from the other in atmost 6 hops or
less in the clockwise direction should be kept hidden from the magician and the
card from which the search is to start has to be shown. Now, the question comes
how the magician will come to know how many hops to go? For this we can
have 6 different orders which could be symbolised by the help of the remaining
three cards. As they can be arranged in order of their domination. In case of
a tie, we can adopt an order of priority of suits to detect the sequence. There
could be a maximum of 6 possible orders. So, now the magician can easily guess
the hidden card.
2 Why it is not possible with 4 cards?
Here there can be a total of
52
= 270725
4
possible combination of 4 cards. For this we have just
52 × 51 × 50 = 132600
possible combination of 3 cards. So, the unique mapping is not possible in this
case, hence this could n’t be done.