Hi, I am a newbie in Haskell and have a trivial question.<br><br>I am using Simon Thomson's textbook for learning Haskell with Hugs.<br>I am stack with exer 5.10, which asks to define isPrime function using divisors function previously defined.<br> <br>I have managed to define the divisor function like this:<br><br>divisors :: Int -> [Int]<br>divisors n = [x | x<-[1..n], n `mod` x == 0]<br><br>but when i am trying with isPrime function using divisors and list comprehension - i am lost because the type signature should be isPrime :: Int->Bool<br><br>But any list comprehension generates a list, which is not what i want.<br><br>Any suggestions please?<br><br>Thank you<p> 
<hr size=1>
Yahoo! Answers - Got a question? Someone out there knows the answer. <a
href="http://uk.answers.yahoo.com/;_ylc=X3oDMTEydmViNG02BF9TAzIxMTQ3MTcxOTAEc2VjA21haWwEc2xrA3RhZ2xpbmU">Try
it now</a>.