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 Solvers62
Suggested Problems
-
4143 Solvers
-
Replace NaNs with the number that appears to its left in the row.
3035 Solvers
-
Project Euler: Problem 3, Largest prime factor
1639 Solvers
-
783 Solvers
-
737 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!