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 Solvers70
Suggested Problems
-
Increment a number, given its digits
689 Solvers
-
297 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2914 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2141 Solvers
-
168 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!