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 Solvers71
Suggested Problems
-
Project Euler: Problem 10, Sum of Primes
2131 Solvers
-
Split a string into chunks of specified length
2159 Solvers
-
Convert given decimal number to binary number.
2390 Solvers
-
Find out the Gray Code for a Given Binary Number
121 Solvers
-
11300 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!