code: def primes(primelist):
      for n in primelist:
          yield n
  
      n = primelist[-1]
      while True:
          n += 2
          for x in primelist:
              if not n % x:
                  break
              if x * x > n:
                  primelist.append(n)
                  yield n
                  break
  
imports: import math
label_desc: Use image node_id 3 for calling a global function with example usage: primes(primelist) without return types