Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: Prime factorization
Replies: 17   Last Post: Nov 16, 2013 9:40 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Kermit Rose

Posts: 89
Registered: 12/3/04
Re: Prime factorization
Posted: Nov 11, 2013 11:03 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Monday, November 4, 2013 12:49:47 PM UTC-5, 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.


Kermit




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.