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
-
Remove all the words that end with "ain"
2644 Solvers
-
2371 Solvers
-
Project Euler: Problem 3, Largest prime factor
1790 Solvers
-
Back to basics 12 - Input Arguments
622 Solvers
-
182 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!