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 Solvers71
Suggested Problems
-
398 Solvers
-
Create an index-powered vector
968 Solvers
-
170 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
430 Solvers
-
11301 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!