Problem 2481. Mongean Shuffle : 2
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 commentsProblem Recent Solvers60
Suggested Problems
-
Maximum running product for a string of numbers
2142 Solvers
-
Remove the small words from a list of words.
1479 Solvers
-
274 Solvers
-
Matrix with different incremental runs
487 Solvers
-
497 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!