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 :-)
Find the peak 3n+1 sequence value
Convert a numerical matrix into a cell array of strings
Fill a zeros matrix
Create a Multiplication table matrix...
row-th maximum row elements
Calculate the h-index
Let's see how peculiar we can get
Text Processing - New
Determine connected components of a graph
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