This takes about 14minutes to run. Way too long...but still, it does
eventually get the right answer :) It uses the Sieve class I built earlier
to reduce the number of integers it needs to run through (primes will
never be abundant). It also uses the divisor finder (with a slight
modification) from problem 21 to find divisors of non-primes. It's pretty
straight forward and fairly naive. I'll come back to these longer running
scripts when I have some time.