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 Solvers64
Suggested Problems
-
Project Euler: Problem 2, Sum of even Fibonacci
2830 Solvers
-
1349 Solvers
-
Back to basics 12 - Input Arguments
621 Solvers
-
130 Solvers
-
6022 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!