def find_big_prime(digits): #tries random numbers until it finds a prime #fast enough to deal with primes up to about 100 digits #larger than that, depends how long you're willing to wait rand_min = 10**(digits - 1) rand_max = 10**(digits) guess = random.randint(rand_min, rand_max) while not prime_test.is_it_prime(guess, 20): guess = random.randint(rand_min, rand_max) return guess
def find_big_prime(digits): #tries random numbers until it finds a prime #fast enough to deal with primes up to about 100 digits #larger than that, depends how long you're willing to wait rand_min = 10**(digits-1) rand_max = 10**(digits) guess = random.randint(rand_min, rand_max) while not prime_test.is_it_prime(guess, 20): guess = random.randint(rand_min, rand_max) return guess
def test_prime_tester(self): self.assertFalse(pt.is_it_prime(-1)) self.assertFalse(pt.is_it_prime(0)) self.assertFalse(pt.is_it_prime(1)) self.assertTrue(pt.is_it_prime(2)) self.assertFalse(pt.is_it_prime(4)) self.assertFalse(pt.is_it_prime(8)) self.assertFalse(pt.is_it_prime(9)) self.assertFalse(pt.is_it_prime(51)) self.assertFalse(pt.is_it_prime(321)) self.assertTrue(pt.is_it_prime(7)) self.assertTrue(pt.is_it_prime(31)) self.assertTrue(pt.is_it_prime(1999)) self.assertTrue(pt.is_it_prime(8675309))