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 Solvers63
Suggested Problems
-
Remove the small words from a list of words.
1559 Solvers
-
How to find the position of an element in a vector without using the find function
2812 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2822 Solvers
-
535 Solvers
-
Convert to Binary Coded Decimal
151 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!