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
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2571 Solvers
-
Numbers with prime factors 2, 3 and 5.
683 Solvers
-
757 Solvers
-
Change the sign of even index entries of the reversed vector
652 Solvers
-
Generate a random matrix A of (1,-1)
429 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!
