Question

Method to find factors of number using pollard rho algorithm

Answer 1

Concepts used in Pollard's Rho Algorithm:

Two numbers x and y are said to be congruent modulo n (x = y modulo n) if. ...

The Greatest Common Divisor is the largest number which divides evenly into each of the original numbers.

thank you ☺️