def test_is_prime(self): self.assertIs(is_prime(3), True) self.assertIs(is_prime(15), False) self.assertIs(is_prime(20), False) self.assertIs(is_prime(37), True) self.assertIs(is_prime(63), False) self.assertIs(is_prime(87), False) self.assertIs(is_prime(103), True)
def pollard_rho_rec(x, factors): if x == 1: return if is_prime(x): factors.append(x) return divisor = rho(int(x), random.randint(1, 10), random.randint(1, 10)) pollard_rho_rec(int(divisor), factors) pollard_rho_rec(int(x/divisor), factors)
def pollard_rho_rec(x, factors): if x == 1: return if is_prime(x): factors.append(x) return divisor = rho(int(x), random.randint(1, 10), random.randint(1, 10)) pollard_rho_rec(int(divisor), factors) pollard_rho_rec(int(x / divisor), factors)
def mth_operations_1_input(f_code, v): if f_code == 1: res = approx_cdf.cdf(v) return res elif f_code == 4: res = primality_test.is_prime(v) return res elif f_code == 5: res = sieve_atkin.atkin(v) return res elif f_code == 6: res = sieve_eratosthenes.eratosthenes(v) return res elif f_code == 7: res = std_normal_pdf.pdf(v) return res