Ormiston pairs: Difference between revisions
→{{header|Haskell}}: Fractionally more efficient
(→{{header| Haskell}}: Added a Haskell draft) |
(→{{header|Haskell}}: Fractionally more efficient) |
||
Line 805:
<syntaxhighlight lang=haskell>import Data.List (sort)
import Data.Numbers.Primes (primes)
---------------------- ORMISTON PAIRS --------------------
ormistonPairs :: [(Int, Int)]
ormistonPairs =
[ (fst a, fst b)
| (a, b) <- zip primeDigits (tail primeDigits),
snd a == snd b
]
primeDigits :: [(Int, String)]
primeDigits = (,) <*> (sort . show) <$> primes
--------------------------- TEST -------------------------
| |||