用python编写一个函数,输出500内的所有质数,并统计它们的数量
时间: 2024-04-30 09:17:15 浏览: 74
算法领域-输出n以内的所有的素数-python实现
好的,以下是Python函数,用于输出500内所有的质数并统计它们的数量:
```python
def prime_numbers(max_num):
primes = []
count = 0
for num in range(2, max_num+1):
if all(num % i != 0 for i in range(2, int(num**0.5)+1)):
primes.append(num)
count += 1
print("500内的质数有:", primes)
print("500内的质数数量为:", count)
prime_numbers(500)
```
输出结果:
```
500内的质数有: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499]
500内的质数数量为: 95
```
阅读全文