A discrete probability problem in card shuffling

M. Bhaskara Rao, Haimeng Zhang, Chunfeng Huang and Fu-Chih Cheng

Communications in Statistics - Theory and Methods, 2016, vol. 45, issue 3, 612-620

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.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2013.834451 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:45:y:2016:i:3:p:612-620

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2013.834451

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().