def max_prime_num(x):
# 从大到小遍历整数
for n in range(x,0,-1):
# print(n)
# 默认为质数
flag = 1
for i in range(2,int(n**0.5) + 1):
# 能被整除,则不为质数,flag置为0,退出循环
if n%i == 0:
flag = 0
break
# 每遍历一个数,看下退出循环后flag是否依然为1,若为1,则退出
if flag == 1:
return n
print('最大质数为:',max_prime_num(100))
07-24
961
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)