Takes a long integer and returns the prime factors.  I'm pretty sure
it's possible to make it work without the isPrime method but it seems to
work pretty smoothly with it.
Solved problems 1-3.  I'm sure problem 3 can be done more efficiently
though I can't think how.