Add alternate method for ex 1 of PE
Some unfinished problems
A few more completed Euler puzzles
A working but shoddy solution to the Largest Collatz sequence below 1 mil.
My current solution: remove candidates backwards, by using a branching tree. Then, once the candidate space is small enough, test the largest candidate one by one, removing all the values of its sequence from the future candiate list.