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
-
1541 Solvers
-
Find the maximum number of decimal places in a set of numbers
3572 Solvers
-
Split a string into chunks of specified length
2140 Solvers
-
Circular Primes (based on Project Euler, problem 35)
655 Solvers
-
951 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!