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.
Test for balanced parentheses
It dseon't mettar waht oedrr the lrettes in a wrod are.
Number of toolboxes?
Create a vector whose elements depend on the previous element
Switch matrix to a column vector
Two fractions, one sum
Sums of Multiple Pairs of Triangular Numbers
Fun with a compass
Matrix of Multiplication Facts
How Far Can You Throw Something?
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