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
-
Remove any row in which a NaN appears
8784 Solvers
-
17445 Solvers
-
Unique values without using UNIQUE function
451 Solvers
-
Convert to Binary Coded Decimal
154 Solvers
-
Van Eck's Sequence's nth member
333 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!