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 Solvers69
Suggested Problems
-
6099 Solvers
-
10806 Solvers
-
Numbers with prime factors 2, 3 and 5.
683 Solvers
-
Basic electricity in a dry situation
598 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
190 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!