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 Solvers64
Suggested Problems
-
10716 Solvers
-
Get the length of a given vector
13104 Solvers
-
341 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
414 Solvers
-
Predicting life and death of a memory-less light bulb
336 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!