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
Unique values without using UNIQUE function
Side of an equilateral triangle
Split bread like the Pharaohs - Egyptian fractions and greedy algorithm
Generate a Parasitic Number
"Find out the best cricket"
Crunch that matrix!
If you prick us, do we not bleed?
Fun with a compass
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