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.
Program an exclusive OR operation with logical operators
Project Euler: Problem 4, Palindromic numbers
Maximum value in a matrix
Find a Pythagorean triple
Three...is a magic number.
Circular Primes (based on Project Euler, problem 35)
If you prick us, do we not bleed?
What digit is it?
Muphry's Law of MATLAB
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