Answers for "efficient way of cosing of prime numbers python"

0

python program to find n prime numbers

num = 10
for i in range(2,num+1):
    for j in range(2,i):
        if(i%j == 0):
            break
    else:
        print(i)
Posted by: Guest on March-10-2021
-2

what is the most efficient way to find prime in python

isaacobAns
Posted by: Guest on January-01-2021

Code answers related to "efficient way of cosing of prime numbers python"

Python Answers by Framework

Browse Popular Code Answers by Language