2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/163414The number of ``carries'' when $n$ random integers are added forms a Markov chain [23]. We show that this Markov chain has the same transition matrix as the descent process when a deck of $n$ cards is repeatedly riffle shuffled. This gives new results for the statistics of carries and shuffling.16 pagesCombinatoricsProbabilitytext