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
-
Project Euler: Problem 7, Nth prime
1405 Solvers
-
Flag largest magnitude swings as they occur
676 Solvers
-
Convert a Cell Array into an Array
1640 Solvers
-
170 Solvers
-
Number of Even Elements in Fibonacci Sequence
1261 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!