num = int(input("Enter a number: "))
if num > 1:
for i in range(2,num):
if (num % i) == 0:
print(num,"is not a prime number")
print(i,"times",num//i,"is",num)
break
else:
print(num,"is a prime number")
else:
print(num,"is not a prime number")
def is_prime(n):
# If n is 0 or 1, it is not prime
if n <= 1:
return False
# Check every number between 2 and n-1
for i in range(2, n):
# If n is divisible by i, then the remainder will be zero
if n % i == 0:
return False
# Since n wasn't divisible by any other number, it must be prime
return True
测试一个数是否是素数的一个非常简单的方法(即计算速度慢)是简单地检查它是否可以被任何其他数除。你知道吗
要打印所有素数,只需检查每个数字。你知道吗
对于
num
的大值,此方法将非常慢。要查看一些更快的方法来检查一个数的素性,您可以查看this question。你知道吗相关问题 更多 >
编程相关推荐