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 :-)
Create logical matrix with a specific row and column sums
Fibonacci-Sum of Squares
Side of an equilateral triangle
Check that number is whole number
Determine connected components of a graph
longest common semi-substring
Integer sequence - 2 : Kolakoski sequence
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