Create an infinite prime number list

prime.hs

@@ -9,5 +9,5 @@ primerf n = filter (\i -> null (dividersf i)) [2..(n-1)]
 square n = n * n
 
 -- Exercice from slide 50
+primeinf = [i | i <- [2..], null (dividers i)]