Smallest Multiple

Project Euler 5: finds smallest integer divisible by the first 20
positive integers.
Project Euler 6

sum of square difference up to 100
10001 prime number

Solution uses Sieve of Eratosthenes to populate a list of prime numbers.