search

Kumar-laxmi / Algorithms

A Repository for algorithms in C, C++, Python and Java
Apache License 2.0
319 stars 365 forks source link

Pollard’s Rho Algorithm for Prime Factorization #1269

Closed Aarsh30 closed 1 year ago

Aarsh30 commented 1 year ago

Pollard’s Rho is a prime factorization algorithm, particularly fast for a large composite number with small prime factors. The Rho algorithm’s most remarkable success was the factorization of eighth Fermat number: 1238926361552897 * 93461639715357977769163558199606896584051237541638188580280321. The Rho algorithm was a good choice because the first prime factor is much smaller than the other one.

I will be solving this algorithm

@Kumar-laxmi can you please assign me this issue for SSOC 2.0 so that I can send a PR request?

Kumar-laxmi commented 1 year ago

Assigned! @Aarsh30 : C, C++, Python and Java