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.
Project Euler: Problem 9, Pythagorean numbers
Convert a numerical matrix into a cell array of strings
Are all the three given point in the same line?
Is it a number?
Rewrite setdiff to account for non-unique values
S-T-R-E-T-C-H I-T O-U-T
Should Mr McNugget even get out of bed today?
Converting numbers back from extended form
Diophantine Equations (Inspired by Project Euler, problem 66)
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