title: Iterating through a list to detect prime numbers
body: <p>i was given a homework in Haskell in which i should program a module, which helps detect prime numbers from a list, say :</p>
  
  <pre><code>[2,3,4,5,6,7,8,9,10]
  </code></pre>
  
  <p>For the homework, I should iterate through every elements of this list, and eliminate all of it's multiples. Example, I go at number 2, I should eliminate 4,6,8,10. Then go to number 3 and delete 6 and 9, and so on until the end, return the list with prime numbers only.</p>
  
  <p>I have an idea of using function <code>map</code>, but I'm stuck at this place (I'm pretty new to Haskell, though)</p>
  
  <p>Yes, it is my homework, but no, i don't <em>have</em> to do it, it's just practicing. So I'm thankful for any help.</p>