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 :-)
Determine whether a vector is monotonically increasing
Remove the two elements next to NaN value
Polite numbers. Politeness.
Beauty of Parentheses
Neither minima nor maxima
birthday on same day of week
Construct a precedence graph from a code segment
Graph Algorithms - 1 : Length of the largest closed path
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