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.
The Goldbach Conjecture, Part 2
Project Euler: Problem 3, Largest prime factor
Project Euler: Problem 7, Nth prime
Stuff the Board
I've got the power! (Inspired by Project Euler problem 29)
Sums of Multiple Pairs of Triangular Numbers
Some Assembly Required
Don't be mean. Be nice!
Breaking Out of the Matrix
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