/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 vote357 views1 answer
Python django model range validation
Python Django
0 vote323 views1 answer
Python read excel sheet name
Python
21 votes305 views6 answers
Pygame install
Python
0 vote324 views1 answer
Python nearly equal
Python
10 votes322 views6 answers
Progress bar python
Python
0 vote271 views1 answer
Python find cursor position
Python
1 vote313 views1 answer
If a number times a number is true python
Python
2 votes285 views3 answers
Depth first search
Python
0 vote323 views1 answer
Sqlalchemy datetime default now create table
Python
1 vote310 views1 answer
Function as parameter tpye hinting python
Python