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 :-)
Extract leading non-zero digit
Triangle Numbers Below N
letter yes yes & letter no no
Sum of odd numbers in a matrix
Signal Processing Basic - 1. Stretch a signal
Collaborative Fun : Nomination
Graph Algorithms - 1 : Length of the largest closed path
Beauty of Parentheses
longest common semi-substring
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