Problem 50

I wish I could do these prime number searches in Haskell, but it's just
too slow. If Project Euler keeps asking for them (and I suspect they
will) I'll have to break down and figure out how to quickly enumerate
primes in Haskell....