Re: Factoring problem, solved

From: Xcott Craver (caj_at_B-r-a-i-n-H-z.com)
Date: 01/21/05 

Date: Fri, 21 Jan 2005 00:46:23 GMT

John E. Hadstate <jh113355@hotmail.com> wrote:
>
>In 1969 I wrote a factoring program based on pure
>heuristics. It also worked about half of the time.
    
     Those of you who remember the net kook SOLLOG, may remember his
     claim to have solved the primality testing problem.
 
     His algorithm was: check for divisibility by 2, then 3, then 5,
     then 7, then 11; check if the number is a perfect square; then apply a
     secret rule he would not divulge.
 
     I was amused that he got all the way out to 11 before realizing that
     he would have to change tack.
                                                   --X