IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v45y2016i3p612-620.html
   My bibliography  Save this article

A discrete probability problem in card shuffling

Author

Listed:
  • M. Bhaskara Rao
  • Haimeng Zhang
  • Chunfeng Huang
  • Fu-Chih Cheng

Abstract

There are n cards serially numbered from 1 to n. The cards are shuffled and placed in a line one after the other on top of a table with faces up. The numbers on the faces are read from left to right. If there are consecutive numbers in increasing order of magnitude the corresponding cards are merged into one. After the merger, the cards are numbered serially from one to whatever the number of cards we now have. The cards are shuffled and placed in a line one after another on top of the table with faces up. The process continues until we have only one card left. In this paper, we develop a probabilistic recurrence relation approach to obtain the mean, variance, and distribution of the number of shuffles needed. A Markov chain formulation and its properties are discussed in the paper as well.

Suggested Citation

  • M. Bhaskara Rao & Haimeng Zhang & Chunfeng Huang & Fu-Chih Cheng, 2016. "A discrete probability problem in card shuffling," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 45(3), pages 612-620, February.
    • Handle: RePEc:taf:lstaxx:v:45:y:2016:i:3:p:612-620
    DOI: 10.1080/03610926.2013.834451
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2013.834451
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2013.834451?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:45:y:2016:i:3:p:612-620. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.