def prime_checker(number): is_prime = True #use a bool to flag prime number for i in range(2, number):# starts at 2 and loops until the range of number if number % i == 0:# if is divisible not a prime is_prime = False if is_prime == True: print(f"{number} is a prime number") else: print(f"{number} is a not a prime number.")
n = int(input("Check this number: "))#check a number for prime
prime_checker(number=n)#call the function

#prime number verification program
a=int(input('print number:'))
for i in range(2,a): if a%i !=0: continue else: print("Its not a prime number") break # here break is exicuted then it means else would not be exicuted.
else: print("Its a prime number")#this is out of the for loop suite. 

# Python program to check Co-Prime Number
# Function to check Co-prime
def are_coprime(a,b): gcd = 1 for i in range(1, a+1): # We use a+1 because python will run for loop before a+1. That means the last number is a. if a%i==0 and b%i==0: gcd = i return gcd == 1
# Reading two numbers
first = int(input('Enter first number: '))
second = int(input('Enter second number: '))
if are_coprime(first, second): print(first,'&',second,'are co-prime')
else: print(first,'&',second,'are NOT co-prime')

def is_prime(n: int) -> bool: """Primality test using 6k+-1 optimization.""" import math if n <= 3: return n > 1 if n % 2 == 0 or n % 3 == 0: return False i = 5 while i <= math.sqrt(n): if n % i == 0 or n % (i + 2) == 0: return False i += 6 return True

#Good way to check if a number is prime or not
"""Number_Check is the number that you want to see if it is prime or not
For example 3 would return true because it is prime while 10 would return false
because it isn't prime"""
def check_prime(Number_Check): isprime = True for i in range(2, Number_Check - 1): if int(Number_Check / i) == Number_Check / i: isprime = False return isprime