Create e14.java

This program computes the longest path length for the Collatz Conjecture where the starting number is below n.  This path is defined by the following: n = n/2 (if n is even) and n = 3*n + 1 (if n is odd) 
Create e17.java

This program determines the number of letters required to print out a series of numbers as words.
Create e20.java

This program computes the number of Sundays which fall on the first of the month between 1901 and 2000
Create e21.java

This program calculates the sum of all amicable pairs below a given n
Create p28.java

This program computes the sum of the values in a diagonal spiral (1001 by 1001)
Create e31.java

This program calculates the number of ways to make change for 2 pounds.  Coin values are 1, 2, 5, 10, 20, 50, 100, and 200 cents.  
Rename p28.java to e28.java
Merge pull request #1 from michaeltoth/Solutions

Solutions