This is a sub problem related to this problem:
If vector, v, has only whole numbers [0 1 2 ... 9], then it can be turned into a base ten number as follows:
[3 4 2 9] ---> 3429
[1 3 5] ---> 135
Make this conversion.
Return the largest number that is adjacent to a zero
Return the Fibonacci Sequence
The sum of the numbers in the vector
Implement simple rotation cypher
Siblings of a graphics object
Is this a valid Tic Tac Toe State?
Project Euler: Problem 8, Find largest product in a large string of numbers
Project Euler: Problem 5, Smallest multiple
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