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 comments
Loading...
Problem Recent Solvers70
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6830 Solvers
-
Get the area codes from a list of phone numbers
1076 Solvers
-
Return the first and last characters of a character array
12368 Solvers
-
185 Solvers
-
175 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!