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.
Brute force :-)
Find all elements less than 0 or greater than 10 and replace them with NaN
Find the nearest integer
What number has this problem?
Divisible by 6
Beauty of Parentheses
Collaborative Fun : Nomination
Let's see how peculiar we can get
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office