Extension to problem 2479:
Determine the number of complete set of Mongean shuffles required to get the original status of a deck of cards of length n.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers70
Suggested Problems
-
2020 Solvers
-
17096 Solvers
-
Find the stride of the longest skip sequence
194 Solvers
-
475 Solvers
-
490 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!