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 Solvers71
Suggested Problems
-
2534 Solvers
-
3976 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1331 Solvers
-
How many trades represent all the profit?
619 Solvers
-
778 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!