99 questions/Solutions/33
< 99 questions | Solutions
Jump to navigation
Jump to search
Revision as of 19:43, 18 January 2014 by Henk-Jan van Tuyl (talk | contribs) (Added Category:Programming exercise spoilers)
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
(*) 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.