Update find_prime_numbers.py

solutions/find_prime_numbers.py

@@ -4,7 +4,7 @@
 This module defines the function `find_primes_up_to_n` to identify all prime numbers
 up to a given integer \( N \). A prime number is greater than 1 and divisible only by 1 and itself.
 
-Author:  Zeinab Shadabshoar
+Author: Zeinab Shadabshoar
 Date: 09 01 2025
 """
 
@@ -27,7 +27,7 @@ def is_prime(n: int) -> bool:
     """
     # Ensure n is an integer
     if not isinstance(n, int):
-        raise TypeError("Input must be an integer")
+        raise AssertionError("Input must be an integer")
 
     if n <= 1:
         return False
@@ -53,17 +53,12 @@ def find_primes_up_to_n(n: int) -> list:
     """
     # Ensure n is an integer and non-negative
     if not isinstance(n, int):
-        raise TypeError("Input must be an integer")
+        raise AssertionError("Input must be an integer")
     if n < 0:
-        raise ValueError("Input must be a non-negative integer")
+        raise AssertionError("Input must be a non-negative integer")
 
     primes = []
     for num in range(2, n + 1):
         if is_prime(num):
             primes.append(num)
     return primes
-
-
-# Example usage
-N = 20
-print("Prime numbers up to", N, ":", find_primes_up_to_n(N))