/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 votes297 views1 answer
Daphne heroku
Python
0 vote287 views1 answer
Annot identify image file '/home/ellis/CB/Django-Ecommerce/media_root/default.jpg'
Python Django
0 vote255 views1 answer
Django get form data from post
Python Django
4 votes201 views2 answers
Sum group by pandas and create new column
Python
0 vote155 views1 answer
How do I know which animation is playing animation player
Python
0 vote209 views1 answer
Ffmpeg python get total frames
Python
1 vote194 views1 answer
Append in a for loop python
Python
0 vote195 views1 answer
1036 solution python
Python
0 vote155 views1 answer
Nrf24l01 arduino raspberry pi
Python
26 votes192 views6 answers
Square root in python
Python