Logic Building
# Helper function
def is_prime(n):
if n < 2:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
# Find numbers
print("Numbers 1-100 with prime digit sum:")
for num in range(1, 101):
digit_sum = sum(int(d) for d in str(num))
if is_prime(digit_sum):
print(num, end=" ")
print()Output
Numbers 1-100 with prime digit sum: 2 3 5 7 11 12 14 16 20 21 ...
Calculate digit sum and check if prime.
Key Concepts:
- Calculate sum of digits
- Check if sum is prime
- Filter numbers