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 Solvers58
Suggested Problems
-
222 Solvers
-
Cell Counting: How Many Draws?
1698 Solvers
-
Count letters occurence in text, specific to words with a given length.
151 Solvers
-
8710 Solvers
-
Sums of Multiple Pairs of Triangular Numbers
234 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!