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 :-)
Back to basics 14 - Keywords
Specific Element Count
Angle between two vectors
Calculate the Hamming distance between two strings
Cell Counting: How Many Draws?
Fermat's last theorem - again
Generate this matrix
Neither minima nor maxima
Integer Sequence - II : New Fibonacci
Latest Question On Cody
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