def is_prime(n, divisor=2):
    """Check if number is prime recursively."""
    if n <= 1:
        return False
    if divisor > int(n ** 0.5):
        return True
    if n % divisor == 0:
        return False
    return is_prime(n, divisor + 1)

print(is_prime(29))

import math

def is_prime_recursive(n, divisor=2):
    """
    Recursively checks if a number 'n' is prime.

    Args:
        n (int): The number to check for primality.
        divisor (int): The current divisor to test 'n' against. 
                       Starts at 2 by default.

    Returns:
        bool: True if 'n' is prime, False otherwise.
    """
    # Base cases
    if n <= 1:
        return False  # Numbers less than or equal to 1 are not prime
    if divisor > math.sqrt(n):
        return True  # If no divisors found up to sqrt(n), it's prime
    
    # Check divisibility
    if n % divisor == 0:
        return False  # Found a divisor, so it's not prime
    
    # Recursive call with the next divisor
    return is_prime_recursive(n, divisor + 1)

# Example Usage
print("--- Prime Number Check ---")
number1 = 29
if is_prime_recursive(number1):
    print(f"{number1} is a prime number.")
else:
    print(f"{number1} is not a prime number.")

number2 = 15
if is_prime_recursive(number2):
    print(f"{number2} is a prime number.")
else:
    print(f"{number2} is not a prime number.")

number3 = 2
if is_prime_recursive(number3):
    print(f"{number3} is a prime number.")
else:
    print(f"{number3} is not a prime number.")

number4 = 1
if is_prime_recursive(number4):
    print(f"{number4} is a prime number.")
else:
    print(f"{number4} is not a prime number.")