me
Posts:
71
Registered:
7/24/08


Re: Prime factorization
Posted:
Nov 4, 2013 8:04 PM


for that case, there must be polynomial system algorithms that can guess 99% of the digits of the number in just O(log N^5) time. Look for posts regarding c2.m.txt
suresh On Monday, November 4, 2013 8:02:56 PM UTC5, me wrote: > then, in that case, you are dealing with a special case. > > > > Anyways, the problem should then be, factor a prime * a prime, not factor any number? > > > > prime factoring is easy. Just not prime * prime? > > > > On Monday, November 4, 2013 1:04:13 PM UTC5, scattered wrote: > > > On Monday, November 4, 2013 12:35:01 PM UTC5, me wrote: > > > > > > > tell me what you think? > > > > > > > > > > > > > > http://www.davesinvoice.com/papers/factorization2.pdf > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > suresh > > > > > > > > > > > > 1) How could a probability be greater than 1? (Something you *seem* to claim) > > > > > > > > > > > > 2) Most numbers have small prime factors (in a way that can be made precise in terms of asymptotic densities) so in some sense most numbers have the property that it is relatively easy to find one of their prime factors simply by guessing. For example, guessing 2 nails it 50% of the time. How does that help you factor any specific number, especially one which is the product of two large primes? Answer: it doesn't. > > > > > > > > > > > > 3) If you think that your approach actually has any merit, why not use it to factor one of the RSA challenge numbers? If you think that factors are easy to guess then this should be a pretty easy challenge for you.

