I think that with this kind of problem, you can process in two steps.
A first easy problem with small N (to test perms for example). And a harder problem with big N, which
oblige to find another algorithm.
vectorization in N
Choose the best fitting dominoes
Find number of days
Find the hypotenuse
Two fractions, one sum
Muphry's Law of MATLAB
Go to the head of the class!
Golomb's self-describing sequence (based on Euler 341)
Find the treasures in MATLAB Central and discover how the community can help you!
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