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
-
Project Euler: Problem 2, Sum of even Fibonacci
2906 Solvers
-
2280 Solvers
-
Getting the indices from a vector
12326 Solvers
-
Check that number is whole number
5446 Solvers
-
Find out sum and carry of Binary adder
1808 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!