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 :-)
vectorization in N
Number of 1s in a binary string
Operate on matrices of unequal, yet similar, size
Is this triangle right-angled?
Yet Another Path Finder
Determine connected components of a graph
all possible subsets of set
remove single elements
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