Haskell | import Primes import Control. - Anonymous - m7b9b1663

import Primes
import Control.Arrow
import Data.List
import Data.Ord

naturals = [0, 1..]
quadratics a b = [x * x + a * x + b | x <- naturals]

quadraticPrimes a b = takeWhile isPrime $ quadratics a b

qps = [(quadraticPrimes a b, a*b) | a <- [-1000..1000], b <- [-1000..1000]]

a <* b = length a `compare`  length b

main = putStr . show . snd . last $ sortBy (\a b -> fst a <* fst b) qps