ADd bruteForce solution to Problem 12 and notes about making it faster
Refactor number::divisors and number::divisorsUnsorted to number::divisorList and number::divisorListUnsorted
Add number::divisors which just returns the number of divisors
Implement a much faster version of Problem 12. Takes the time from ~650ms to ~10ms
Add another fast solution for Problem 12. Runs in just about the same time as the other. Needs further investigation to see if it is really faster or not.
Add another few tests to number::isPrime to make sure we are catching powers of primes correctly
Speed up number::divisors by using a prime factorization instead of just trial division
Add individual problem timing to the pe app when running all problems.
Add solution to Problem 13
Add unit test for Problem 13
Add solution with optimized version for Problem 14