Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.
|
|
|
|
Re: Fermat factorization running time
Posted:
Dec 27, 2012 7:42 PM
|
|
On Dec 23, 6:22 pm, kadhir thillai <yourskad...@gmail.com> wrote:
> Hi,
> The logic that odd composite with least difference will be factored easily and large difference would factored hardly is wrong. Please follow the link to know more.http://kadinumberprops.blogspot.in
I'll take a large random prime number p. Then I'll take a large prime
number q randomly chosen randomly between 20p and 50p. Then I give you
the product p*q. How are you going to factor this?
|
|
|
|
