code: def solve(edge):
      prime_list = [
          2,
          3,
          5,
          7,
          11,
          13,
          17,
          19,
          23,
      ]  # Ensure that this is initialised with at least 1 prime
      prime_dict = dict.fromkeys(prime_list, 1)
  
      def _isprime(n):
          """Raw check to see if n is prime. Assumes that prime_list is already populated"""
          isprime = n >= 2 and 1 or 0
          for prime in prime_list:  # Check for factors with all primes
              if prime * prime > n:
                  break  # ... up to sqrt(n)
              if not n % prime:
                  isprime = 0
                  break
          if isprime:
              prime_dict[n] = 1  # Maintain a dictionary for fast lookup
          return isprime
  
      def _refresh(x):
          """Refreshes primes upto x"""
          lastn = prime_list[-1]
          while lastn <= x:  # Keep working until we've got up to x
              lastn = lastn + 1  # Check the next number
              if _isprime(lastn):
                  prime_list.append(
                      lastn
                  )  # Maintain a list for sequential access
  
      def prime(x):
          """Returns the xth prime"""
  
          lastn = prime_list[-1]
          while (
              len(prime_list) <= x
          ):  # Keep working until we've got the xth prime
              lastn = lastn + 1  # Check the next number
              if _isprime(lastn):
                  prime_list.append(
                      lastn
                  )  # Maintain a list for sequential access
          return prime_list[x]
  
      max_pair = (0, 0, 0)
      for a in range(-1 * edge + 1, edge):
          for b in range(max(2, 1 - a), edge):  # b >= 2, a + b + 1 >= 2
              n, count = 0, 0
              while True:
                  v = n * n + a * n + b
                  _refresh(v)
                  if _isprime(v):
                      count = count + 1
                  else:
                      break
                  n = n + 1
              if count > max_pair[2]:
                  max_pair = (a, b, count)
  
      return max_pair[0] * max_pair[1]
  
label_desc: Use image node_id 1 for calling a global function with example usage: solve(edge) and returns: unknown, isprime, prime_list