Optimized Code: import math n = int (input ("Enter a number: ")) if n < 2: print (f" {n} is not a prime number") else: is_prime = True for i in range (2, int (math.sqrt (n)) + 1): if n % i == 0: ...

Method 2: Using Loop Algorithm Start by Passing value of n Iterate from 2 to half of n For each iteration check if i completely divides n then return False After completion of loop return True If True ...