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 Solvers68
Suggested Problems
-
Calculate the Levenshtein distance between two strings
1512 Solvers
-
170 Solvers
-
How long is the longest prime diagonal?
412 Solvers
-
Unique values without using UNIQUE function
454 Solvers
-
Height of a right-angled triangle
2073 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!
