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 :-)
Are you in or are you out?
Back to basics 15 - classes
Split a string into chunks of specified length
Make a 1 hot vector
Say something funny
Generate this matrix
Signal Processing Basic - 1. Stretch a signal
I want eval
Graph Algorithms - 1 : Length of the largest closed path
Cat, Meowcat and Concatenation
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