Return the 3n+1 sequence for n
Least common multiple of many numbers
Inner product of two vectors
Find the "ordinary" or Euclidean distance between A and Z
Triangle Numbers Below N
dir with recursive subdirectory search
Travelling Salesman Problem (TSP)
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