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 Solvers63
Suggested Problems
-
14066 Solvers
-
Project Euler: Problem 5, Smallest multiple
1648 Solvers
-
Set the array elements whose value is 13 to 0
1435 Solvers
-
305 Solvers
-
169 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!