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 Solvers66
Suggested Problems
-
Return a list sorted by number of occurrences
2895 Solvers
-
Back to basics 6 - Column Vector
1111 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
274 Solvers
-
Reverse the elements of an array
1127 Solvers
-
502 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!
