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 Solvers63
Suggested Problems
-
7460 Solvers
-
1470 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
181 Solvers
-
920 Solvers
-
Approximation of Pi (vector inputs)
269 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!