title: explain largestDivisible code from the Learn You A Haskell for Great Good tutorial
body: <pre><code>largestDivisible :: (Integral a) =&gt; a
  largestDivisible = head (filter p [100000,99999..])
      where p x = x `mod` 3829 == 0
  </code></pre>
  
  <p>If p x equals True, </p>
  
  <p>does</p>
  
  <pre><code>head (filter p [100000,99999..])
  </code></pre>
  
  <p>become</p>
  
  <pre><code>head (filter True)
  </code></pre>
  
  <p>?</p>
  
  <p>What list is being filtered for True?</p>
  
  <p>While this code is being run, what are p and x's values?</p>