# 99 questions/Solutions/33

### From HaskellWiki

< 99 questions | Solutions(Difference between revisions)

Line 6: | Line 6: | ||

Here we use the prelude function for computing gcd's along with a test of the result's equality to one. |
Here we use the prelude function for computing gcd's along with a test of the result's equality to one. |
||

+ | |||

+ | |||

+ | [[Category:Programming exercise spoilers]] |

## Latest revision as of 19:43, 18 January 2014

(*) Determine whether two positive integer numbers are coprime. Two numbers are coprime if their greatest common divisor equals 1.

coprime a b = gcd a b == 1

Here we use the prelude function for computing gcd's along with a test of the result's equality to one.