title: Finding primes using Sieve of Eratosthenes not working - Haskell
body: <p>Here is the code I am trying to use: This should generate all primes up to 100</p>
  
  <pre><code>sieve_primes = [x | x&lt;-[2..100], y&lt;-[2..50], z &lt;-[2..25], (x*z) `mod` y /= 0]
  </code></pre>