More on the Perfect Shuffle (Riffle) using Wolfram-Cloud/Mathematica

Published: 04 August 2024
on channel: Thomas Blum

In this video we return to the "perfect shuffle" (riffle) problem, that is, looking at the sequence of the number of times it takes to shuffle a deck (list) of size 2N to return to the original order. First we see that we can take an approach of following the second element of the list (the first and last do not move) and makes it far easier to generate the sequence. We previously noticed some patterns among those deck sizes that returned the original order quite rapidly. Since the powers of two played a role, we used Mathematica's BaseForm to look at the numbers in binary. That helped to identify a few more patterns among the "smalls" -- the fast order-restoring deck sizes. This video follows up on • Using Wolfram-Cloud/Mathematica to ex... (Using Wolfram-Cloud/Mathematica to explore the Perfect Shuffle Problem)

Watch video More on the Perfect Shuffle (Riffle) using Wolfram-Cloud/Mathematica online without registration, duration hours minute second in high quality. This video was added by user Thomas Blum 04 August 2024, don't forget to share it with your friends and acquaintances, it has been viewed on our site once and liked it people.

140,89

8.3K