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
-
Find relatively common elements in matrix rows
2091 Solvers
-
The Goldbach Conjecture, Part 2
2372 Solvers
-
Rotate and display numbered tile
358 Solvers
-
Count letters occurence in text, specific to words with a given length.
170 Solvers
-
11292 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!