Edward Faulkner
12/8/2005 2:36:00 PM
On Thu, Dec 08, 2005 at 07:19:43PM +0900, Dan Diebolt wrote:
> I found this program msieve.exe that does Quadratic Seive Factoring
> of arbitrary integers and I wonder if there is time enough to put
> together a brute force solution to the Weird Number quiz before the
> summary comes out. The basic idea would be to find the prime factors
> of successive integers using the output msieve.exe and testing for
> abundance and weirdness based on these factors.
I'd be curious to see how it works out, but my guess is that it won't
speed things up much. My solution sieves for prime numbers too (using
the simpler Sieve of Eratosthenes), and that only takes a tiny
fraction of the running time. The computationally hard part is
proving non-semiperfect.
regards,
Ed