Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


Math Forum
»
Discussions
»
sci.math.*
»
sci.math
Notice: We are no longer accepting new posts, but the forums will continue to be readable.
Topic:
Factoring problem, solved
Replies:
89
Last Post:
Jan 26, 2005 4:30 PM




Re: Factoring problem, solved
Posted:
Jan 20, 2005 7:43 PM


Christian Bau wrote: > In article <BE145E63.4767E%plasticnitlion@wrappermindspring.com>, > Bob Harris <plasticnitlion@wrappermindspring.com> wrote: > >> jstevh@msn.com wrote: >>>> I am increasingly certain that I've solved the factoring problem. >> >> to which Peter Trei replied: >>> Feel free to demonstrate your system on the RSA Factoring >>> Challenge numbers. There are prizes ranging from $20,000 >>> (for factoring the 640 bit challenge), up to $200,000 >>> (2048 bits). >> >> I wonder if I just tried random factors if my odds of finding a solution in, >> say, a year, would be better or worse than my odds of winning a state >> lottery. > > To guess a 1024 bit factor of a 2048 bit product, your chances are about > the same as winning the lottery (six numbers out of 49) 43 times in a > row.
Yep. 2^1022 is about the same as (49 choose 6)^43. That's only for a single guess of course. How much do I improve things by trying a billion factors a second for a year?



