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 Solvers64
Suggested Problems
-
Find the peak 3n+1 sequence value
2568 Solvers
-
Given two arrays, find the maximum overlap
1728 Solvers
-
Determine if input is a Narcissistic number
218 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
183 Solvers
-
Predicting life and death of a memory-less light bulb
336 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!