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
-
Sum all integers from 1 to 2^n
17382 Solvers
-
Sum of first n terms of a harmonic progression
497 Solvers
-
346 Solvers
-
Write a function man that takes a row vector v and returns a matrix H as follows..
645 Solvers
-
2509 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!