/Python/Effient way to find prime no inpython

Effient way to find prime no inpython

num = 13
if num > 1:
for i in range(2, num//2):
if (num % i) == 0:
print(num, "is not a prime number")
break
else:
print(num, "is a prime number")
else:
print(num, "is not a prime number")

Source: edureka.co

Similar codes

0 vote111 views1 answer
Creating empty set and append python
Python
0 vote109 views1 answer
Remove item from list python grepper
Python
0 vote103 views1 answer
Assert with message python
Python
0 vote114 views1 answer
Random Average
Python
1 vote135 views1 answer
Python how to automatically restart flask sever
Python Flask
3 votes103 views1 answer
Selenium python activate new tab
Python
3 votes110 views2 answers
Python input lowercase
Python
23 votes97 views1 answer
Cv2.rectangle
Python
0 vote108 views1 answer
Sum values
Python
0 vote100 views1 answer
Radians in python turtle
Python