Prime Palindrome Pursuit

By: fyvo August 3, 2025 Python

Description

This program identifies the largest prime palindrome number below a specified limit. It efficiently checks for primality and palindromic properties.

Code Snippet

def is_prime(n):
    if n <= 1:
        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]

def largest_prime_palindrome(limit):
    largest = 0
    for i in range(limit - 1, 1, -1):
        if is_prime(i) and is_palindrome(i):
            largest = i
            break
    return largest

limit = 1000
result = largest_prime_palindrome(limit)
print(f"The largest prime palindrome below {limit} is: {result}")

Discussion (0)