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 :-)
N-Dimensional Array Slice
Calculate the Hamming distance between two strings
Create a vector whose elements depend on the previous element
Find nearest prime number less than input number
Television Screen Dimensions
BLOCK x3 (Version 2)
Graph Algorithms - 2 : Chromatic Number
Generate this matrix
Collaborative Fun : Nomination
Construct a precedence graph from a code segment
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