Share Pastebin
Guest
Public paste!

Untitled

By: a guest | Feb 2nd, 2010 | Syntax: Haskell | Size: 0.39 KB | Hits: 68 | Expires: Never
Copy text to clipboard
  1. import Primes
  2. import Control.Arrow
  3. import Data.List
  4. import Data.Ord
  5.  
  6. naturals = [0, 1..]
  7. quadratics a b = [x * x + a * x + b | x <- naturals]
  8.  
  9. quadraticPrimes a b = takeWhile isPrime $ quadratics a b
  10.  
  11. qps = [(quadraticPrimes a b, a*b) | a <- [-1000..1000], b <- [-1000..1000]]
  12.  
  13. a <* b = length a `compare`  length b
  14.  
  15. main = putStr . show . snd . last $ sortBy (\a b -> fst a <* fst b) qps