effient way to find prime no inpython

Solutions on MaxInterview for effient way to find prime no inpython by the best coders in the world

showing results for - "effient way to find prime no inpython"
Alan
11 Sep 2016
1num = 13
2if num > 1:
3for i in range(2, num//2):
4if (num % i) == 0:
5print(num, "is not a prime number")
6break
7else:
8print(num, "is a prime number")
9else:
10print(num, "is not a prime number")
11
similar questions
queries leading to this page
effient way to find prime no inpython