All you need to do here is submit your solution a prime number of seconds after the top of the hour. Any hour at all... Easy, right?
Count from 0 to N^M in base N.
Back to basics 2 - Function Path
Sum of diagonal of a square matrix
Reverse the elements of an array
Sum the numbers on the main diagonal
Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock.
Reindex a vector
I'm going to enjoy watching you calculate, Mr Anderson
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