**Prime Number Checker Code** ```python def is_prime(n: int) -> bool: """ Checks if a number is prime. Args: n (int): The number to check. Returns: bool: True if the number is prime, False otherwise. """ if n <= 1: return False for i in range(2, int(n ** 0.5) + 1): if n % i == 0: return False return True # Example usage: def main(): num = 7 result = is_prime(num) print(f"Is {num} a prime number? {result}") if __name__ == "__main__": main() ``` **Explanation:** * The `is_prime` function takes an integer `n` as input and returns a boolean indicating whether it's prime. * It first checks if `n` is less than or equal to 1, in which case it's not prime. * Then, it iterates from 2 to the square root of `n` (inclusive) and checks if `n` is divisible by any of these numbers. If it finds a divisor, it returns False. * If no divisors are found, it returns True, indicating that `n` is prime. **Running this code will output:** ``` Is 7 a prime number? True ```