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
-
Sum all integers from 1 to 2^n
17455 Solvers
-
Back to basics 8 - Matrix Diagonals
966 Solvers
-
Matrix multiplication across rows
397 Solvers
-
243 Solvers
-
6033 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!