isprime python

1def isPrime(n):
2    if n > 1:  
3        for i in range(2,n):  
4            if (n % i) == 0:  
5                return False
6        return True
7    else:
8        return False

1#make the function
2#to do this all hte vairibles go in side the function
3
4def CheckIfPrime ():
5    a1 = input("which number do you want to check")
6    a = int(a1)#you need the checking number as an int not an str
7    b = 2 #the number to check againts
8    c = ("yes")
9    while b < a:#run the loop
10        if a%b == 0:#check if the division has a remainder
11            c = ("no")#set the answer
12        b = b+1
13    print(c)#print the output
14CheckIfPrime ()#call the function  
15

1# math.isqrt() for Python version 3.8 
2def isPrime(n):
3    if n < 2: return False
4    for i in range(2, isqrt(n) + 1):
5        if n % 2 == 0:
6            return False
7    return True