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 Solvers66
Suggested Problems
-
Calculate the Levenshtein distance between two strings
1510 Solvers
-
Sum of diagonal of a square matrix
1640 Solvers
-
895 Solvers
-
Return fibonacci sequence do not use loop and condition
868 Solvers
-
877 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!