MCPcopy Create free account
hub / github.com/TheAlgorithms/Rust / pollard_rho_get_one_factor

Function pollard_rho_get_one_factor

src/math/pollard_rho.rs:104–135  ·  view source on GitHub ↗

Note: using this function with `check_is_prime` = false and a prime number will result in an infinite loop. RNG's internal state is represented as `seed`. It is advisable (but not mandatory) to reuse the saved seed value In subsequent calls to this function. */

(number: u64, seed: &mut u32, check_is_prime: bool)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 2

pollard_rho_factorizeFunction · 0.85
one_factorFunction · 0.85

Calls 3

miller_rabinFunction · 0.85
pollard_rho_customizableFunction · 0.85
get_64bitsMethod · 0.80

Tested by 1

one_factorFunction · 0.68