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
-
6716 Solvers
-
392 Solvers
-
945 Solvers
-
Integer Sequence - II : New Fibonacci
690 Solvers
-
Sums of Multiple Pairs of Triangular Numbers
249 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!