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 Solvers71
Suggested Problems
-
22575 Solvers
-
Find the sum of the elements in the "second" diagonal
1208 Solvers
-
Calculate the Hamming distance between two strings
349 Solvers
-
Count letters occurence in text, specific to words with a given length.
206 Solvers
-
1139 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!