explain largestDivisible code from the Learn You A Haskell for Great Good tutorial
- by Delirium tremens
largestDivisible :: (Integral a) => a
largestDivisible = head (filter p [100000,99999..])
where p x = x `mod` 3829 == 0
If p x equals True, head (filter True)? Filtering for True what list?
What values are in p and x?