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
-
How long is the longest prime diagonal?
409 Solvers
-
Change the sign of even index entries of the reversed vector
635 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
711 Solvers
-
347 Solvers
-
835 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!