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 find_primes_in_range(start, end): if not (isinstance(start, int) and isinstance(end, int)) or (start < 0 or end < 0): prime_numbers = [] for num in range(start, end + 1): if is_prime(num): prime_numbers.append(num) return prime_numbers # Example usage start_num = 10 end_num = 50 result = find_primes_in_range(start_num, end_num)