[Haskell-cafe] Writing a function isPrime using recursion.

I'm supposed to write a function isPrime that checks whether or not a given integer is a prime number or not. The function has to use recursion. The only advice I was given, was to use a helper function. I still have no clue how to do it :confused: I'm new to Haskell by the way..please help.. -- View this message in context: http://www.nabble.com/Writing-a-function-isPrime-using-recursion.-tp20003309... Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.