
Re: Prime factorization
Posted:
Nov 16, 2013 9:40 AM


On 11/11/2013 10:03 PM, Kermit Rose wrote: > On Monday, November 4, 2013 12:49:47 PM UTC5, Michael F. Stemper wrote: >> On 11/04/2013 11:35 AM, me wrote:
>>> tell me what you think? >> >>> http://www.davesinvoice.com/papers/factorization2.pdf
>> Interesting idea. How about using it to factor 130642890110987?
>>>> Factor(130642890110987) > [58789, 2222233583, 134, 'Pollard Rho, x^2 + 1, First factor check'] > > Pollard Rho is a very efficient means to factor numbers of this size. > > It factored 130642890110987 almost instantly in 134 steps > into 58789 * 2222233583. It iterated on the polynomial x^2+1.
Yeah, and I could have done it on the command line, too:
mstemper@coelurosaur$ time factor 130642890110987 130642890110987: 58789 2222233583
real 0m0.027s user 0m0.000s sys 0m0.008s mstemper@coelurosaur$
I was hoping that that the OP would apply the method described in his/her socalled "paper" to this number. Since the method is stated to be guessing, it might have taken a while.
 Michael F. Stemper The name of the story is "A Sound of Thunder". It was written by Ray Bradbury. You're welcome.

