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 Solvers66
Suggested Problems
-
Find the sum of all the numbers of the input vector
54736 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2890 Solvers
-
6518 Solvers
-
322 Solvers
-
567 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!