def goldbach(n): if n % 2 == 0 or common.prime(n): return True for i in itertools.count(1): k = n - 2 * i * i if k <= 0: return False elif common.prime(k): return True
def truncated_prime_check(n): i = 10 while i <= n: if not common.prime(n % i): return False i *= 10 while n > 0: if not common.prime(n): return False n //= 10 return True
def is_prime(n): if n < 0: return False elif n < len(isprimeprev): return isprimeprev[n] else: return common.prime(n)
def goldbach(n): assert n%2 == 1 for i in itertools.count(): if common.prime(n - 2*i*i): return True if 2*i*i > n: return False
def goldbach(n): assert n % 2 == 1 for i in itertools.count(): if common.prime(n - 2 * i * i): return True if 2 * i * i > n: return False
def prime_factorization(number: int): """Return set of prime factors.""" p = number // 2 s = set() for n in range(1, p + 1): if number % n == 0 and prime(n): s = s | {n} return s
def find_prime(num): p = 0 n = 1 while(p < 10001): while True: n += 1 if(prime(n)): break p += 1 return n;
def solution(): for n in reversed(range(2, 10)): arr = list(reversed(range(1, n + 1))) while True: if arr[-1] not in notPrime: n = int("".join(str(x) for x in arr)) if common.prime(n): return str(n) if not last_call(arr): break raise AssertionError()
def circular(n): s = str(n) if len(s) > 1: for c in s: if c not in ['1', '3', '7', '9']: return False for i in range(len(s)): if not common.prime(int(s[i:] + s[:i])): return False return True
def right_truncatable(n): if n > 10 and not right_truncatable(n / 10): return False if not common.prime(n): return False return True
def truncatable(n): return n >= 10 and left_truncatable(int(str(n)[1:])) and right_truncatable( n / 10) and common.prime(n)
from common import prime if __name__ == "__main__": num = int(input("enter a number :")) if prime(num): print(f"{num} is prime :") else: print(f"{num} is not prime")
def right_truncatable(n): if n > 10 and not right_truncatable(n/10): return False if not common.prime(n): return False return True
def left_truncatable(n): if n > 10 and not left_truncatable(int(str(n)[1:])): return False if not common.prime(n): return False return True
def consecutive_primes(a, b): for n in itertools.count(): if not common.prime(n * n + a * n + b): return n
def consecutive_primes(a, b): for n in itertools.count(): if not common.prime(n*n + a*n + b): return n
def truncatable(n): return n >= 10 and left_truncatable(int(str(n)[1:])) and right_truncatable(n/10) and common.prime(n)