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
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15796 Solvers
-
21349 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
588 Solvers
-
Implement simple rotation cypher
1096 Solvers
-
940 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!