title: Making a list of divisors in Haskell
body: <p>I am doing problem 21 in eulerproject.
  One part requires finding the list of proper divisors of a number. i.e. where there is remainder of <code>n</code> and some number of less than <code>n</code>. So I made this Haskell, but GHCI gets angry at me.</p>
  
  <pre><code>divisors n =[ n | n &lt;- [1..(n-1)], n `rem` [1..(n-1)] ==0 ]
  </code></pre>
  
  <p>The problem is that I don't know how to make:</p>
  
  <pre><code>n `rem` [1..(n-1)]
  </code></pre>
  
  <p>so that it only returns the number less than <code>n</code> that divide evenly into <code>n</code>.</p>