Find the Nth pair of twin primes
Haskell 118
main=putStrLn.(!!)[show n++&quot;, &quot;++show(n+2)|n&lt;-[2..],all((&gt;0).rem n)[2..n-1],all((&gt;0).rem(n+2))[2..n]].(+)(-1)=&lt;&lt;readLn

Brute-force all twin primes and prints the nth pair.