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 Solvers71
Suggested Problems
-
5167 Solvers
-
7587 Solvers
-
Find state names that end with the letter A
1198 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2918 Solvers
-
6364 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!