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
-
5966 Solvers
-
Return the 3n+1 sequence for n
8341 Solvers
-
711 Solvers
-
Return a list sorted by number of consecutive occurrences
372 Solvers
-
Fix the last element of a cell array
1541 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!