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 Solvers69
Suggested Problems
-
Get the area codes from a list of phone numbers
1076 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1297 Solvers
-
Back to basics 8 - Matrix Diagonals
972 Solvers
-
Return a list sorted by number of consecutive occurrences
438 Solvers
-
17013 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!
