[Haskell-beginners] Primes calculation

[Ozgur Akgun]

Yes you're right.

I tried to implement sth to answer the original question. Not something I
came up with.


On 13 March 2010 12:47, Daniel Fischer <daniel.is.fischer at web.de> wrote:

> Am Samstag 13 März 2010 10:55:59 schrieb Ozgur Akgun:
> > Yes, the function fails for [10..30]. But do you ever read the
> > explanations?
> >
>
> You probably should have chosen another signature for primes,
>
> primes n = primesWRT [2 .. n] []
>
> , to avoid the misunderstandings.
>
>


-- 
Ozgur Akgun
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/beginners/attachments/20100313/cbcd14c2/attachment-0001.html