Remember Me
Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Lagarias, Jeffrey C.; Rains, Eric; Vanderbei, Robert J. (2001)
Languages: English
Types: Preprint
Subjects: Mathematics - Optimization and Control, Mathematics - Probability, 60J10
The Kruskal Count is a card trick invented by Martin J. Kruskal in which a magician "guesses" a card selected by a subject according to a certain counting procedure. With high probability the magician can correctly "guess" the card. The success of the trick is based on a mathematical principle related to coupling methods for Markov chains. This paper analyzes in detail two simplified variants of the trick and estimates the probability of success. The model predictions are compared with simulation data for several variants of the actual trick.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] D. Aldons and P. Diaconis, Shuffling Cards and Stopping Times, Amer. Math. Monthly 93 (1986), 333-348.
    • [2] P. Diaconis, Group Representations in Probability and Statistics, IMS Lecture Notes - Monograph Series No. 11, Institute of Math. Statistics, Hayward, Calif. 1988.
    • [3] W. Doeblin, Expos´e de la theorie des chaines simple constantes de Markov ´a un nombre fini d'etats, Rev. Math Union Interbalkanique 2 (1938), 77-105.
    • [4] M. D. Donsker and S. R. S. Varadhan, Asymptotic Evaluation of Certain Markov Process Expectations for Large Time I, Comm. Pure. Appl. Math. 28 (1975), 1-47.
    • [5] C. Fulves and M. Gardner, The Kruskal Principle, The Pallbearers Review, June 1975.
    • [6] M. Gardner, Mathematical Games, Sci. Amer. 238 (1978) No. 2 (February), 19-32.
    • [7] M. Gardner, From Penrose Tiles to Trapdoor Ciphers, W. H. Freeman Co., New York, 1988. (Chapter 19)
    • [8] D. Griffeath, Coupling Methods for Markov Processes, in: Studies in Probability and Ergodic Theory (G. C. Rota, Ed.), Academic Press, New York, 1978, pp. 1-43.
    • [9] W. Haga and S. Robins, On Kruskal's Principle, in Organic Mathematics, (J. Borwein, P. Borwein, L Jorgenson, and R. Corless, Eds.), Canadian Math. Society Conference Proceedings, vol. 20, AMS: Providence, RI, 1997, pp. 407-412.
    • [10] A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.
    • [11] C. L. Mallows, On a probability problem suggested by M. D. Kruskal's card trick, Bell Laboratories memorandum, April 18, 1975, unpublished.
    • [12] J. Pitman, On coupling of Markov Chains, Z. Wahrscheinlichkeitheorie 35 (1976), 315- 322. email:
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article

Collected from

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok