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
2160 Solvers
-
293 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
652 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
605 Solvers
-
Create logical matrix with a specific row and column sums
303 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!