Jayprecode
diff --git a/‎maths/euler_totient.ts‎
Lines changed: 20 additions & 0 deletions b/‎maths/euler_totient.ts‎
Lines changed: 20 additions & 0 deletions
diff --git a/‎maths/test/euler_totient.test.ts‎
Lines changed: 24 additions & 0 deletions b/‎maths/test/euler_totient.test.ts‎
Lines changed: 24 additions & 0 deletions
@@ -0,0 +1,20 @@
+/**
+ * @description counts the positive integers up to a given integer n that are relatively prime to n.
+ * @param {number} n - A natural number.
+ * @return {number} - euler's totient.
+ * @see https://en.wikipedia.org/wiki/Euler%27s_totient_function
+ * @example phi(4) = 2
+ * @example phi(5) = 4
+ */
+export const phi = (n: number): number => {
+    let result: number = n;
+    for (let i = 2; i * i <= n; i++) {
+        if (n % i == 0) {
+            while (n % i == 0) n = n / i;
+            result -= Math.floor(result / i);
+        }
+    }
+    if (n > 1) result -= Math.floor(result / n);
+
+    return result;
+};
@@ -0,0 +1,24 @@
+import { phi } from "../euler_totient";
+
+
+const cases: [number, number][] = [
+    [4, 2],
+    [5, 4],
+    [7, 6],
+    [10, 4],
+    [999, 648],
+    [1000, 400],
+    [1000000, 400000],
+    [999999, 466560],
+    [999999999999878, 473684210526240],
+];
+
+describe("phi", () => {
+
+    test.each(cases)(
+        "phi of %i should be %i",
+        (num, expected) => {
+            expect(phi(num)).toBe(expected);
+        },
+    );
+});