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 Solvers66
Suggested Problems
-
182 Solvers
-
Cell Counting: How Many Draws?
2490 Solvers
-
Count letters occurence in text, specific to words with a given length.
202 Solvers
-
355 Solvers
-
2279 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!