The Solutions to Elmsley ’ s Problem

@inproceedings{Diaconis2006TheST,
  title={The Solutions to Elmsley ’ s Problem},
  author={Persi Diaconis and R V Hughes Graham},
  year={2006}
}
We give a formula for the optimal sequence of perfect shuffles to bring a card at position p to the top (or indeed, to any position). This solves a fifty-year-old problem of Elmsley. The argument illustrates elementary group theory and shows how a simple card trick can lead to the edge of what is known. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
1 Extracted Citations
8 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-8 of 8 references

The collected works of Alex Elmsley

  • Stephen Minch
  • L & L Pub.,
  • 1994
Highly Influential
3 Excerpts

Magic tricks

  • S. Brent Morris
  • card shuffling and dynamic computer memories, MAA…
  • 1998
2 Excerpts

Groups of perfect shuffles

  • S. Medvedoff, K. Morrison
  • Math. Mag. 60
  • 1987
1 Excerpt

The mathematics of perfect shuffles

  • P. Diaconis, R. L. Graham, W. Kantor
  • Adv. in Appl. Math 4
  • 1983
2 Excerpts

The mathematics of perfect shuffles , Adv

  • R. L. Graham P. Diaconis, W. Kantor
  • Appl . Math
  • 1983

Density quesitons in algebraic number theory

  • L. Goldstein
  • Amer. Math. Monthly 78
  • 1971
1 Excerpt

On Artin’s conjecture

  • C. Hooley
  • J. Reine Angew. Math. 226
  • 1967
1 Excerpt

Magic tricks , card shuffling and dynamic computer memories

  • S. Brent Morris
  • J . Reine Angew . Math .

Similar Papers

Loading similar papers…