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 1, Multiples of 3 and 5
Project Euler: Problem 4, Palindromic numbers
N-Dimensional Array Slice
Number of Horns on a unicorn!
Index of a Rational number
It's Happy! It's Fun! It's Happy Fun Hyperball!
Pandigital Factors (Based on Euler 491)
Accessing values in a cell
Kurchan 5x5 - Optimal Score
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