<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def prime_ge(n):
 """ PRIME_GE returns the smallest prime greater than or equal to N. Example: +-----+--------- | N | PRIME_GE +-----+--------- | -10 | 2 | 1 | 2 | 2 | 2 | 3 | 3 | 4 | 5 | 5 | 5 | 6 | 7 | 7 | 7 | 8 | 11 | 9 | 11 | 10 | 11 Parameters: Input, integer N, the number to be bounded. Output, integer P, the smallest prime number that is greater than or equal to N. """

    p = max(np.ceil(n), 2)
    while not is_prime(p):
        p += 1

    return p