<p>基本解决方案是:</p>
<pre><code>def isprime(num):
if not (isinstance(num,int)): #checking number should be integer
return "Enter a valid number"
elif (num < 0): #checking number should be positive
return "Enter a positive number"
else:
for i in range(2,num): #start the loop from 2 upto number
if num % i == 0: #checking prime condition
return "Number is not Prime" #if found not prime return here
break #and exit from loop
else:
return "Number is Prime" #if found prime return here
print(isprime(7)) #calling the method here
</code></pre>
<p>当然有很多方法可以优化素数程序。下面是一些可以帮助你的链接。你知道吗</p>
<p><a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes</a></p>
<p><a href="https://en.m.wikipedia.org/wiki/Primality_test" rel="nofollow noreferrer">https://en.m.wikipedia.org/wiki/Primality_test</a></p>
<p><a href="https://web.archive.org/web/20080324064651/http://krenzel.info/?p=83" rel="nofollow noreferrer">https://web.archive.org/web/20080324064651/http://krenzel.info/?p=83</a></p>