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 Solvers63
Suggested Problems
-
27464 Solvers
-
2521 Solvers
-
Piecewise linear interpolation
606 Solvers
-
Count letters occurence in text, specific to words with a given length.
194 Solvers
-
Back to basics - mean of corner elements of a matrix
454 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!