Module dsalgo::find_divisor_pollard_rho_with_floyd_cycle_detection

Functions

find_divisor_pollard_rho_floyd

n is not prime. if prime, check in advance with primality test like miller-rabin. return divisor of n. (1 < d < n)