Check if a number is prime or not

def isprime(n):
	for i in range(2,int(n**0.5)):
		if n%i==0:
			# Not a prime
			return 0
			
	# It is a prime number
	return 1

1. Handling Base Cases:
   • If the number is less than or equal to 1, it's not prime.
   • If the number is 2 or 3, it's prime.
2. Divisibility Checks:
   • Check if the number is divisible by 2 or 3. If yes, it's not prime.
3. Reduced Search Space:
   • Iterate from 5 to the square root of the number in steps of 6.
   • Check for divisibility by i and i + 2. This skips multiples of 2 and 3, reducing the search space.

def is_prime(n):
    if n <= 1:
        return False
    elif n <= 3:
        return True
    elif n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True