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
-
3770 Solvers
-
2720 Solvers
-
394 Solvers
-
Return fibonacci sequence do not use loop and condition
855 Solvers
-
1125 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!