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
-
Remove the small words from a list of words.
1566 Solvers
-
Create a vector whose elements depend on the previous element
807 Solvers
-
5939 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
428 Solvers
-
8723 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!
