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
-
Given two arrays, find the maximum overlap
1566 Solvers
-
Matrix with different incremental runs
522 Solvers
-
Return a list sorted by number of consecutive occurrences
376 Solvers
-
10269 Solvers
-
Height of a right-angled triangle
1865 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!