This is simple problem based on problems 555, 801, 1118, etc.
Create an index vector from two input vectors.
input: [1 8 12] [4 5 9]
output: [1 2 3 4 8 7 6 5 12 11 10 9]
Count from 0 to N^M in base N.
Make an awesome ramp for a tiny motorcycle stuntman
middleAsColumn: Return all but first and last element as a column vector
Number of Horns on a unicorn!
Connect blocks in a model
Optimum Egyptian Fractions
Pernicious Anniversary Problem
expand intervals vol.2
Polite numbers. Politeness.
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