Skip to main content

Unraveling a Card Trick

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6200))

Abstract

In one version of Gilbreath’s card trick, a deck of cards is arranged as a series of quartets, where each quartet contains a card from each suit and all the quartets feature the same ordering of the suits. For example, the deck could be a repeating sequence of spades, hearts, clubs, and diamonds, in that order, as in the deck below.

$${\langle 5\spadesuit\rangle}, {\langle 3\heartsuit\rangle}, {\langle Q\clubsuit\rangle}, {\langle 8\diamondsuit\rangle},$$
$${\langle K\spadesuit\rangle}, {\langle 2\heartsuit\rangle}, {\langle 7\clubsuit\rangle}, {\langle 4\diamondsuit\rangle},$$
$${\langle 8\spadesuit\rangle}, {\langle J\heartsuit\rangle}, {\langle 9\clubsuit\rangle}, {\langle A\diamondsuit\rangle}$$

The deck is then cut into two (not necessarily equal) half-decks, possibly as \({\langle 5\spadesuit\rangle}, {\langle 3\heartsuit\rangle}, {\langle Q\clubsuit\rangle}, {\langle 8\diamondsuit\rangle}, {\langle K\spadesuit\rangle}\) and \({\langle 2\heartsuit\rangle}, {\langle 7\clubsuit\rangle}, {\langle 4\diamondsuit\rangle}, {\langle 8\spadesuit\rangle}, {\langle J\heartsuit\rangle}, {\langle 9\clubsuit\rangle}, {\langle A\diamondsuit\rangle}\).

The order of one of the half-decks is then reversed. Either half-deck could be reversed. We can pick the smaller one, i.e., the first one, and reverse it to obtain \({\langle K\spadesuit\rangle}, {\langle 8\diamondsuit\rangle}, {\langle Q\clubsuit\rangle}, {\langle 3\heartsuit\rangle}, {\langle 5\spadesuit\rangle}\). The two half-decks are then shuffled in a (not necessarily perfect) riffle-shuffle. One such shuffle is shown below, where the underlined cards are drawn from the second half-deck.

$${\langle 2\heartsuit\rangle}, {\langle 7\clubsuit\rangle}, \underline{\langle K\spadesuit\rangle}, \underline{\langle 8\diamondsuit\rangle}, $$
$$ {\langle 4\diamondsuit\rangle}, {\langle 8\spadesuit\rangle}, \underline{\langle Q\clubsuit\rangle}, {\langle J\heartsuit\rangle},$$
$${\underline{\langle 3\heartsuit\rangle}}, {\langle 9\clubsuit\rangle}, \underline{\langle 5\spadesuit\rangle}, {\langle A\diamondsuit\rangle} $$

The quartets in the shuffled deck are displayed to demonstrate that each quartet contains a card from each suit. This turns out to be inevitable no matter how the original deck is cut and the order in which the two decks are shuffled. The principle underlying the card trick can be proved in a number of ways. We present the argument as a series of transformations that demystify the trick and describe its formalization.

The second author was supported by NSF Grants CSR-EHCS(CPS)-0834810 and CNS-0917375. Sam Owre commented on earlier drafts of the paper.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boyer, R.S.: A mechanical checking of a theorem about a card trick. ACL2 formalization (May 22, 1991)

    Google Scholar 

  2. Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. Journal of Automated Reasoning 14(2), 189–235 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. de Bruijn, N.G.: A riffle shuffle card trick and its relation to quasi-crystal theory. Nieuw Archief voor Wiskunde 5(3), 285–301 (1987)

    MathSciNet  MATH  Google Scholar 

  4. Gardner, M.: New Mathematical Diversions from Scientific American. Simon & Schuster, New York (1966); Republished by the Mathematical Association of America (June 1995)

    Google Scholar 

  5. Gardner, M.: aha! Gotcha. W. H. Freeman & Co., New York (1982); Republished as part of a two-volume collection with aha! Insight by the Mathematical Association of America (2006)

    Google Scholar 

  6. Gilbreath, N.: Magnetic colors. The Linking Ring 38(5), 60 (1958)

    Google Scholar 

  7. Huet, G.: The Gilbreath trick: A case study in axiomatisation and proof development in the Coq proof assistant. Technical Report RR-1511, INRIA, Institut National de Recherche en Informatique et en Automatique (September 1991)

    Google Scholar 

  8. Owre, S., Rushby, J., Shankar, N., von Henke, F.: Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering 21(2), 107–125 (1995); PVS home page: http://pvs.csl.sri.com

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hoare, T., Shankar, N. (2010). Unraveling a Card Trick. In: Manna, Z., Peled, D.A. (eds) Time for Verification. Lecture Notes in Computer Science, vol 6200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13754-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13754-9_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13753-2

  • Online ISBN: 978-3-642-13754-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics