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
-
Remove all the words that end with "ain"
2552 Solvers
-
Find state names that start with the letter N
1392 Solvers
-
Given two arrays, find the maximum overlap
1672 Solvers
-
Check if number exists in vector
13287 Solvers
-
204 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!