Numbers with prime digits whose sum is 13: Difference between revisions

m
Line 192:
| otherwise = Just (step xs)
step xs =
let fharvest nv =
[ unDigits $ fst nv
| 13 == snd nv ]
gprune nv =
[ fst nv
| 12 > snd nv ]
in ((,) . concatMap fharvest <*> concatMap gprune)
(((,) <*> sum) <$> ((<$> xs) . (<>) . return =<< primeDigits))
 
9,659

edits