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 Solvers63
Suggested Problems
-
6970 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
263 Solvers
-
Count letters occurence in text, specific to words with a given length.
196 Solvers
-
48 Solvers
-
Numbers spiral diagonals (Part 1)
295 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!