Problem 2481. Mongean Shuffle : 2
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 commentsProblem Recent Solvers60
Suggested Problems
-
Sum all integers from 1 to 2^n
15307 Solvers
-
Create a Multiplication table matrix...
492 Solvers
-
14722 Solvers
-
589 Solvers
-
Approximation of Pi (vector inputs)
219 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!