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 Solvers64
Suggested Problems
-
Find the peak 3n+1 sequence value
2567 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
583 Solvers
-
Sum of odd numbers in a matrix
617 Solvers
-
191 Solvers
-
275 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!