def prime_number_of_divisors(n):
n = abs(n)
numDivisors = 0
for i in range(1, n+1):
if n % i == 0:
numDivisors += 1
return is_prime(numDivisors)
def main():
suma = 0
for b in range(2, 2000000):
if is_prime(b):
suma += b
print(suma)
def main():
counter = 1
for i in range(3,1000000,2):
if is_prime(i):
counter = counter + 1
if counter == 10001:
break
print(i)
def prime_factorization(n):
number = n
# all primes between 2 and n inclusive
primes = list(filter(lambda x: is_prime(x), range(2, n + 1)))
lst = []
if primes[-1] == n or n == 1:
lst.append((n, 1))
else:
for prime in primes:
if (prime ** 2 > number and len(lst) == 0) or number == 1:
break
elif number % prime == 0:
power = power_of_prime(number, prime)
lst.append((prime, power))
number /= prime ** power
return lst
def prime_factorization(n):
number = n
# all primes between 2 and n inclusive
primes = list(filter(lambda x: is_prime(x), range(2, n + 1)))
lst = []
if primes[-1] == n or n == 1:
lst.append((n, 1))
else:
for prime in primes:
if (prime**2 > number and len(lst) == 0) or number == 1:
break
elif number % prime == 0:
power = power_of_prime(number, prime)
lst.append((prime, power))
number /= prime**power
return lst
def prime_number_of_divisors(n):
return is_prime(len(divisors(abs(n))))
from isPrime import is_prime
print(is_prime(13))
from extendEuclid import egcd
print(egcd(40, 100))
from modularPower import power
print(power(2, 5, 13))
from base26Cipher import enCrypt, deCrypt
print(deCrypt('HoangThiLinh'))
print(enCrypt(294))
def next_prime(current_prime):
counter = current_prime + 1
while not isPrime.is_prime(counter):
counter += 1
return counter
def calc_result(num, exp, mod):
while not (isPrime.is_prime(mod)):
mod = (int(input("Modulus must be a prime number - please enter a new value: \t")))
result = calc_exponent(num, exp)
result = calc_modulus(result, mod)
return result
def prime_number_of_divisors(n):
return is_prime(len(divisors(abs(n))))
from math import sqrt
from isPrime import is_prime
n = 600851475143
result = 1
if n % 2 == 0: result = 2
for divisor in range(3, int(sqrt(n)),2):
if n % divisor == 0:
if is_prime(divisor):
result = divisor
print(result)
def test_is_prime(self):
self.assertTrue(is_prime(5))
self.assertFalse(is_prime(1))
self.assertFalse(is_prime(128))
def goldbach(n):
ans = []
for i in range(2, n // 2 + 1):
if is_prime(i) and is_prime(n - i):
ans.append((i, n - i))
return ans
def test_5_is_prime(self):
self.assertTrue(is_prime(5))
