PY
py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
# Howling Prime Asserter (by HonFu)
start = 2
end = 14000
def howling(n):
for number in n, \
sum(int(d) for d in str(n)):
for i in range(2, number//2+1):
if number % i == 0:
return False
return True
print('Howling primes:\n')
print(*filter(howling, range(start, end+1)))
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run