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
def is_palindrome(n):
return str(n) == str(n)[::-1]
# Find prime palindromes
print("Prime palindromes 1-1000:")
for num in range(1, 1001):
if is_prime(num) and is_palindrome(num):
print(num, end=" ")
print()Output
Prime palindromes 1-1000: 2 3 5 7 11 101 131 151 181 191 313 353 373 383 727 757 787 797 919 929
Check both prime and palindrome properties.
Key Concepts:
- Use helper functions
- Check prime property
- Check palindrome property
- Both must be true