└── prime number finder.python


/prime number finder.python:
--------------------------------------------------------------------------------
 1 | import math
 2 | 
 3 | n = 11
 4 | if n <= 1:
 5 |     print(False)
 6 | else:
 7 |     is_prime = True
 8 |     for i in range(2, int(math.sqrt(n)) + 1):
 9 |         if n % i == 0:
10 |             is_prime = False
11 |             break
12 |     print(is_prime)
13 | 


--------------------------------------------------------------------------------