Now showing items 1-2 of 2

    • The order of a perfect k-shuffle 

      Packard, Erik Sargent (Texas Tech University, 1990-12)
      Not available
    • The order of a perfect k-shuffle on a moded-out deck 

      Packard, Erik Sargent (Texas Tech University, 1995-05)
      When a deck of n cards is shuffled so that the shuffle is some fixed permutation on n objects, i.e., an element of 5, it is natural to ask how many times this shuffle must be performed before the deck will return to its ...