[英]What is the problem with this Prime checker code?
n=int(input("Enter required number: "))
for a in range(2,n):
if n%a==0:
print("Your number is not prime")
break
else:
print("Your number is prime")
break
It displays composite numbers as primes too.它也将合数显示为素数。
your code just checks if your number n is divisible with 2, otherwise will consider that n is prime, with small changes your code will work:您的代码只是检查您的数字 n 是否可以被 2 整除,否则会认为 n 是素数,稍加改动您的代码就可以工作:
n=int(input("Enter required number: "))
prime = True
for a in range(2, n // 2):
if n%a==0:
print("Your number is not prime")
prime = False
break
if prime:
print("Your number is prime")
For what you're trying to do:对于您要执行的操作:
from math import sqrt
n=int(input("Enter required number: "))
for j in range(2, int(sqrt(n))+1):
if n % j == 0:
print("Not prime")
exit()
print("Number is prime")
Would be better, why I am using sqrt会更好, 为什么我使用 sqrt
Enter required number: 10
Not prime
Enter required number: 20
Not prime
Enter required number: 17
Number is prime
You can use any
here.你可以在这里使用any
。
if any( n%i==0 for i in range(2,int(n**0.5)+1) ):
print("Not a prime number")
else:
print("prime number")
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.