Unshuffled 

by Gabe, Sam, and Zineb
We examine the number of perfect riffle shuffles needed to return a deck to its starting point. We support claims about the patterns in these numbers using modular arithmetic. We reflect on the mathematical inquiry involved.