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
8796 Solvers
-
4520 Solvers
-
Create a vector whose elements depend on the previous element
808 Solvers
-
1750 Solvers
-
Return fibonacci sequence do not use loop and condition
880 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!
