Department of Business & Computer Technologies Division
Pennsylvania College of Technology
Williamsport, PA 17701-5799
Department of Mathematics
University of California, San Diego
9500 Gilman Drive dept 0112
La Jolla, CA 92093-0112
Keywords Markov Processes
We analyze the infamous card trick known as the ``Kruskal Count'' and find that it is a Markov Process. We derive the $m$ by $m$ transition matrix for this process in the general case of a deck of cards with $m$ face values. In particular, we derive the exponentially decaying probability of the correct guess after $n$ cards have been dealt for the deck with $10$ face values.
Please Click Here to access the beginning of the paper.