effient way to find prime no inpython

Innocent Ibex answered on September 13, 2021 Popularity 2/10 Helpfulness 1/10

answer effient way to find prime no inpython

related effient way to find prime no inpython

effient way to find prime no inpython

Comment

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")

Popularity 2/10 Helpfulness 1/10 Language python

Source: www.edureka.co

Tags: find python

Link to this answer
Share Copy Link

Contributed on Sep 13 2021

Innocent Ibex

0 Answers Avg Quality 2/10

Closely Related Answers

effient way to find prime no inpython

Comment

Python Code:

n = int(input("Enter a number: "))
isPrime = True
if n > 1:
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            isPrime = False
            break
    if isPrime:
        print("Prime")
    else:
        print("Not prime")
else:
    print("Not prime")
    
    
    
Sample input:

Number: 32261

Sample output:

Prime

Popularity 1/10 Helpfulness 1/10 Language python

Source: www.scaler.com

Tags: find python

Link to this answer
Share Copy Link

Contributed on Mar 31 2022

codelearner

0 Answers Avg Quality 2/10

effient way to find prime no inpython

Contents

More Related Answers

effient way to find prime no inpython

Closely Related Answers

effient way to find prime no inpython

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.