initial commit

Simple, probably inefficient, code to find the difference of the square
of the sum (1-100) and the sum of squares.

(1+2+3+…+100)^2 - (1^2 + 2^2+3^2+…+100^2)
initial commit

Find the 10,001st prime number. Used the primality test used in an
earlier project euler question. Simply test all numbers for primality
starting at one and going up until 10,001 prime numbers have been
identified. At that point, return the value of the most recent prime
number found.

It solved pretty quick, but I could increase efficiency by incrementing
in 2s (2 is the only even prime number I believe).