使用Python求N以内的素数以及判断N是否为素数

import math
def Evidence(number):
    list1 = []
    i = 2
    for i in range(2,number):
        j = 2
        for j in range (2,i):
            if i%j == 0:
                break
        else:
            list1.append(i)
    return list1
#************End***************
if __name__ == "__main__":
    number = input()
    print(Evidence(int(number)))

在这里插入代码片import math
def is_prime(num):
#***********Begin**************
    a = 'Yes'
    b = 'No'
    if num == 1:
        return b
    for i in range (2,int(math.sqrt(num))):
        if num %i ==0:
           return b
    return a
#************End***************
if __name__ == "__main__":
    number = input()
    print(is_prime(int(number)))