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 Solvers65
Suggested Problems
-
16180 Solvers
-
Find the longest sequence of 1's in a binary sequence.
6726 Solvers
-
Find the stride of the longest skip sequence
184 Solvers
-
Back to basics 23 - Triangular matrix
1127 Solvers
-
Set some matrix elements to zero
628 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!
