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 Solvers64
Suggested Problems
-
69 Solvers
-
String substitution, sub problem to cryptoMath
243 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
182 Solvers
-
111 Solvers
-
1019 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!
