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
-
Replace NaNs with the number that appears to its left in the row.
3065 Solvers
-
Remove the small words from a list of words.
1560 Solvers
-
1507 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
414 Solvers
-
10364 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!