code: def prime_ge(n):
      # *****************************************************************************80
      #
      ## 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
      #
      # 	Licensing:
      #
      # 		This code is distributed under the GNU LGPL license.
      #
      # 	Modified:
      #
      #    		22 February 2011
      #
      # 	Author:
      #
      # 		Original MATLAB version by John Burkardt.
      # 		PYTHON version by Corrado Chisari
      #
      # 	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(math.ceil(n), 2)
      while not isprime(p):
          p = p + 1
  
      return p
  
file_path: auptimizer/src/aup/Proposer/spearmint/sobol_lib.py
imports: from __future__ import print_function
  import math
  from numpy import *
label_desc: Use image node_id 6 for calling a global function with example usage: prime_ge(n) and returns: p