/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

2 votes277 views1 answer
Check if message is in dm discord.py
Python
0 vote190 views1 answer
How to open cmd and run code using python
Python
-1 vote196 views1 answer
How to know if a string is valid file path python
Python
3 votes220 views1 answer
Send email hotmail using python
Python
10 votes238 views2 answers
Adding static file and its usage in Django
Python Django
0 vote205 views1 answer
Ball python
Python
3 votes205 views2 answers
Reciprocal python
Python
0 vote198 views1 answer
Python select from list by condition
Python
2 votes207 views2 answers
Numpy rolling average
Python
0 vote208 views1 answer
When was barracoon written
Python