/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 votes323 views1 answer
Dataframe get row by name
Python
0 vote335 views1 answer
Pyspark dataframe to parquet
Python
0 vote352 views1 answer
Make y axis start at 0 python
Python
4 votes379 views2 answers
Primary key django model
Python Django
1 vote332 views1 answer
What does [::-1] mean in python
Python
0 vote276 views1 answer
Parallel run of a function with multiple arguments partial
Python
4 votes364 views2 answers
Django composite primary key
Python Django
0 vote397 views1 answer
Get current worker id multiprocessing
Python
0 vote372 views1 answer
Python randomly chose user agent
Python
2 votes327 views1 answer
How to find the text inside button in tkinter
Python