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
-
16160 Solvers
-
Find the largest value in the 3D matrix
1664 Solvers
-
Count letters occurence in text, specific to words with a given length.
196 Solvers
-
5768 Solvers
-
2077 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!
