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 Solvers71
Suggested Problems
-
Remove any row in which a NaN appears
8794 Solvers
-
269 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2145 Solvers
-
Reverse the elements of an array
1146 Solvers
-
281 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!