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 :-)
Distance walked 3D
Return the first and last character of a string
Ripping numbers apart!
Collaborative Fun : Nomination
longest common semi-substring
all possible subsets of set
Yet Another Path Finder
Graph Algorithms - 2 : Chromatic Number
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