本文中所用的的方法在一个pdf中,我会在文末将其上传
第一种方法寻找指数
import math
def isPrime(num):
if num < 2:
print("该数不是素数")
# see if num is divisible by any number up to the square root of num
else:
for i in range (2, int(math . sqrt(num) ) +1):
if num % i == 0:
print("该数不是素数")
else:
print("该数是素数")
num = int(input("请输入第一个数: "))
isPrime(num)
第二种方法寻找指数
import math
# all numbers less than 2 are not prime
def primeSieve(sieveSize) :
# Returns a list of prime numbers calculated using
# the Sieve of Eratosthenes algorithm .
sieve = [True] * sieveSize
sieve[0] = False # zero and one are not prime numbers
sieve[1] = False
# create the sieve
for i in range(2, int(math . sqrt (sieveSize )) +1):
pointer = i * 2
while pointer < sieveSize:
sieve[pointer] = False
pointer += i
# compile the list of primes
# compile the list of p