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 Solvers61
Suggested Problems
-
4117 Solvers
-
Remove all the words that end with "ain"
2405 Solvers
-
508 Solvers
-
Sum of first n terms of a harmonic progression
443 Solvers
-
Implement a bubble sort technique and output the number of swaps required
321 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!