I do not understand how this code passes the test.
The Tower of Hanoi
Project Euler: Problem 8, Find largest product in a large string of numbers
02 - Vector Variables 5
03 - Matrix Variables 3
Encode Roman Numerals
Return the 3n+1 sequence for n
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