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
-
Find the index of n in magic(n)
273 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2201 Solvers
-
Given a square and a circle, please decide whether the square covers more area.
1822 Solvers
-
Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock.
959 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!