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
-
Select every other element of a vector
36858 Solvers
-
Project Euler: Problem 5, Smallest multiple
1671 Solvers
-
Convert a numerical matrix into a cell array of strings
2514 Solvers
-
Number of 1s in a binary string
11405 Solvers
-
Rounding off numbers to n decimals
5739 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!