> I approached this problem a few different ways: my own solution, a Ruby
> standard library solution and my improved solution after studying more math,
> etc. What I ran into was surprising. If the limit at which the program stops
> finding and computing the primes is greater than 100,000, the Prime class
> takes up to 7 times as long as my first crack at the problem (using trial
> division) and 30 times as long using an improved solution (Sieve of
> Eratosthenes).

So you're suggesting that the Prime class be optimized is that right?
=r