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 Solvers58
Suggested Problems
-
1285 Solvers
-
Find state names that start with the letter N
1171 Solvers
-
188 Solvers
-
474 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
306 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!