Mathematics for Computer Science

(avery) #1
Chapter 14 Cardinality Rules572


  1. The suit of the extra card, which can be selected in 4 ways.

  2. The rank of the extra card, which can be selected in 12 ways.


For example, the hand above is described by the sequence:

.7;K;A;2;};3/$f 7 }; K|; A~; 2; 3}g:

Are there other sequences that correspond to the same hand? There is one more!
We could equally well regard either the 3 }or the 7 }as the extra card, so this
is actually a 2-to-1 mapping. Here are the two sequences corresponding to the
example hand:

.7;K;A;2;};3/ &
f 7 }; K|; A~; 2; 3}g
.3;K;A;2;};7/ %

Therefore, the number of hands with every suit is:

134  4  12
2

:


14.8 The Pigeonhole Principle


Here is an old puzzle:

A drawer in a dark room contains red socks, green socks, and blue
socks. How many socks must you withdraw to be sure that you have a
matching pair?

For example, picking out three socks is not enough; you might end up with one
red, one green, and one blue. The solution relies on the

Pigeonhole Principle
If there are more pigeons than holes they occupy, then at least two
pigeons must be in the same hole.
Free download pdf