Initial commit. My solutions for the Euler problems.
Solved question four with, I think, a fairly targeted brute force. There are some nice, much mathier solutions that factor the palindrome into products of sums.
Solved a few more. Did five by inspection on the subway. Seven benchmarks two methods for prime testing -- using 6i +/- 1 is 100x faster than storing know primes
Merge branch 'master' of https://github.com/Lkoren/Euler