# 99 questions/Solutions/33

From HaskellWiki

< 99 questions | Solutions

(*) 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.