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
-
Find the peak 3n+1 sequence value
2571 Solvers
-
1764 Solvers
-
Count consecutive 0's in between values of 1
529 Solvers
-
Matrix multiplication across rows
399 Solvers
-
10575 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!