isprime function in python
def isPrime(n):
if n > 1:
for i in range(2,n):
if (n % i) == 0:
return False
return True
else:
return Falseisprime function in python
def isPrime(n):
if n > 1:
for i in range(2,n):
if (n % i) == 0:
return False
return True
else:
return Falseprime checker in python
#make the function
#to do this all hte vairibles go in side the function
def CheckIfPrime ():
a1 = input("which number do you want to check")
a = int(a1)#you need the checking number as an int not an str
b = 2 #the number to check againts
c = ("yes")
while b < a:#run the loop
if a%b == 0:#check if the division has a remainder
c = ("no")#set the answer
b = b+1
print(c)#print the output
CheckIfPrime ()#call the functionisprime python
# math.isqrt() for Python version 3.8
def isPrime(n):
if n < 2: return False
for i in range(2, isqrt(n) + 1):
if n % 2 == 0:
return False
return TrueCopyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
