Problem 2481. Mongean Shuffle : 2
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 commentsProblem Recent Solvers61
Suggested Problems
-
697 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3385 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1200 Solvers
-
Similar Triangles - find the height of the tree
448 Solvers
-
Sums of Multiple Pairs of Triangular Numbers
237 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!