CristianAmbrosini · CristianAmbrosini · Apr 27, 2026 · sonar-review-dev18 · Apr 27, 2026 · sonar-review-dev18
diff --git a/math_utils.py b/math_utils.py
@@ -0,0 +1,36 @@
+"""Math utility functions."""
+import math
+
+
+def fibonacci(n: int) -> list[int]:
-def fibonacci(n: int) -> list[int]:
+def fibonacci(n: int) -> list[int]:
+    """Return the first n numbers in the Fibonacci sequence.
+
+    Args:
+        n: How many numbers to generate. Returns [] for n <= 0.
+
+    Returns:
+        A list of n Fibonacci numbers starting from 0.
+    """
-def fibonacci(n: int) -> list[int]:
+def fibonacci(n: int) -> list[int]:
+    """Return the first n numbers in the Fibonacci sequence.
+
+    Args:
+        n: How many numbers to generate. Returns [] for n <= 0.
+
+    Returns:
+        A list of n Fibonacci numbers starting from 0.
+    """
+    if n <= 0:
+        return []
+    if n == 1:
+        return [0]
+    seq = [0, 1]
+    for _ in range(2, n):
+        seq.append(seq[-1] + seq[-2])
+    return seq
+
+
+def is_prime(n: int) -> bool:
-def is_prime(n: int) -> bool:
+def is_prime(n: int) -> bool:
+    """Return True if n is a prime number, False otherwise.
+
+    Args:
+        n: The integer to test. Values less than 2 return False.
+
+    Returns:
+        True if n is prime, False otherwise.
+    """
-def is_prime(n: int) -> bool:
+def is_prime(n: int) -> bool:
+    """Return True if n is a prime number, False otherwise.
+
+    Args:
+        n: The integer to test. Values less than 2 return False.
+
+    Returns:
+        True if n is prime, False otherwise.
+    """
+    if n < 2:
+        return False
+    for i in range(2, int(math.sqrt(n)) + 1):
+        if n % i == 0:
+            return False
+    return True
+
+
-
+def gcd(a: int, b: int) -> int:
+    """Return the greatest common divisor of a and b using the Euclidean algorithm.
+
+    Args:
+        a: First integer.
+        b: Second integer.
+
+    Returns:
+        The GCD of a and b.
+    """
-
+def gcd(a: int, b: int) -> int:
+    """Return the greatest common divisor of a and b using the Euclidean algorithm.
+
+    Args:
+        a: First integer.
+        b: Second integer.
+
+    Returns:
+        The GCD of a and b.
+    """
+def gcd(a: int, b: int) -> int:
+    while b:
+        a, b = b, a % b
+    return a
-    return a
+def lcm(a: int, b: int) -> int:
+    """Return the least common multiple of a and b.
+
+    Args:
+        a: First integer.
+        b: Second integer.
+
+    Returns:
+        The LCM of a and b. Returns 0 if either argument is 0.
+    """
-    return a
+def lcm(a: int, b: int) -> int:
+    """Return the least common multiple of a and b.
+
+    Args:
+        a: First integer.
+        b: Second integer.
+
+    Returns:
+        The LCM of a and b. Returns 0 if either argument is 0.
+    """
+
-
+    if a == 0 or b == 0:
+        return 0
+    return abs(a) // gcd(a, b) * abs(b)
-
+    if a == 0 or b == 0:
+        return 0
+    return abs(a) // gcd(a, b) * abs(b)
+
+def lcm(a: int, b: int) -> int:
+    return abs(a * b) // gcd(a, b)
+
+
+def clamp(value: float, min_val: float, max_val: float) -> float:
-def clamp(value: float, min_val: float, max_val: float) -> float:
+def clamp(value: float, min_val: float, max_val: float) -> float:
+    """Clamp value to the range [min_val, max_val].
+
+    Args:
+        value: The value to clamp.
+        min_val: Lower bound (inclusive).
+        max_val: Upper bound (inclusive).
+
+    Returns:
+        value constrained to [min_val, max_val].
+    """
-def clamp(value: float, min_val: float, max_val: float) -> float:
+def clamp(value: float, min_val: float, max_val: float) -> float:
+    """Clamp value to the range [min_val, max_val].
+
+    Args:
+        value: The value to clamp.
+        min_val: Lower bound (inclusive).
+        max_val: Upper bound (inclusive).
+
+    Returns:
+        value constrained to [min_val, max_val].
+    """
+    return max(min_val, min(value, max_val))