[Haskell-cafe] Prime numbers
daniel.carrera at zmsl.com
Tue Dec 20 11:47:48 EST 2005
Robert Dockins wrote:
> -divides a b = (mod a b == 0)
> +divides a b = (mod b a == 0)
Oh, thanks. My program assumed one way to define 'divides' and the
example assumed the other.
When I wrote it I was thinking of (divides a) being a function that
tells me if the input divides 'a'.
\/_/ I am not over-weight, I am under-tall.
More information about the Haskell-Cafe