Add Haskell solution to Problem #67.

I'm pretty impressed with how fast the final version of this ended up
being. Hurray for arrays!
Add Haskell solution to Problem #65.

Super straight forward with Data.Ratio. I'm sure there's any even
"smarter" solution, but since this solution runs instantly, I hardly see
the point.
Clean up some warnings in EulerUtils.
Add integer square root function to EulerUtils.

This one was used in a lot of places. I guess it should have been done a
while ago. Also cleaned up some warnings while I was at it.
Include the given answer in eulerCheck.sh output.
Improve the heuler convenience script.

* Print all output to stdout as it's generated.
* Treat the final line of output as the solution, but only if it's an
integer.
* Pretty up the output a bit.
Copy heuler improvements to peuler and ppeuler.
Add Haskell solution to Problem #68.

I enjoyed this one quite a bit.

There are bunch of ways that this could be made to run faster,
especially doing smart pruning in the generation of permutations, but
all would complicate the solution considerably.
Add Haskell solution to Problem #69.

This one is a bit cheesy, since the best solution doesn't require
calculating a single totient. I'll admit to having tried a brute force
approach before realising it was going to be too slow.