Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Primes finding algorithm
def prime(x): i = 3 if(x % 2 == 0): return False else: while i <= x // 2: if(x % i == 0): return False i += 2 return True print(prime(149))
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
PyBoolNone
Points
Chtkav
abracadabra
Hai
Insertion Sort
Saurabh
Faiha - Lesson 8
Exception.py
Email_Python
Please log in to post a comment.