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 Solvers71
Suggested Problems
-
3900 Solvers
-
Replace NaNs with the number that appears to its left in the row.
3072 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2070 Solvers
-
384 Solvers
-
Remove the two elements next to NaN value
713 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!
