Implement P33 as pointfree

asarkar · Jan 5, 2024 · 30b0e30 · 30b0e30
1 parent b6fe568
commit 30b0e30
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/src/Arithmetic.hs b/src/Arithmetic.hs
@@ -47,7 +47,7 @@ Problem 33: (*) Determine whether two positive integer numbers are coprime.
 Two numbers are coprime if their greatest common divisor equals 1.
 -}
 coprime :: Int -> Int -> Bool
-coprime x y = myGCD x y == 1
+coprime = ((1 ==) .) . myGCD
 
 {-
 Problem 34: (**) Calculate Euler's totient function phi(m).