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 Solvers68
Suggested Problems
-
The Hitchhiker's Guide to MATLAB
3415 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2898 Solvers
-
Find the stride of the longest skip sequence
192 Solvers
-
Longest run of consecutive numbers
6646 Solvers
-
Magic is simple (for beginners)
11588 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!