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 Solvers61
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
50167 Solvers
-
369 Solvers
-
Project Euler: Problem 5, Smallest multiple
1503 Solvers
-
781 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
351 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!