pythagix 0.1.8__tar.gz → 0.1.9__tar.gz

{pythagix-0.1.8 → pythagix-0.1.9}/LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) [year] [fullname]
+Copyright (c) 2025 UltraQuantumScriptor
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

{pythagix-0.1.8/pythagix.egg-info → pythagix-0.1.9}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pythagix
-Version: 0.1.8
+Version: 0.1.9
 Summary: A mathy Python package with utilities like LCM, triangle numbers, etc.
 Author: UltraQuantumScriptor
 License: MIT

{pythagix-0.1.8 → pythagix-0.1.9}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "pythagix"
-version = "0.1.8"
+version = "0.1.9"
 description = "A mathy Python package with utilities like LCM, triangle numbers, etc."
 readme = "README.md"
 requires-python = ">=3.6"

{pythagix-0.1.8 → pythagix-0.1.9}/pythagix/core.py

@@ -1,7 +1,6 @@
-from math import isqrt
+import math as m
 from functools import reduce
 from typing import List
-import math
 
 __all__ = [
     "is_prime",
@@ -30,7 +29,7 @@ def is_prime(number: int) -> bool:
         return True
     if number % 2 == 0:
         return False
-    for i in range(3, isqrt(number) + 1, 2):
+    for i in range(3, m.isqrt(number) + 1, 2):
         if number % i == 0:
             return False
     return True
@@ -90,7 +89,7 @@ def gcd(values: List[int]) -> int:
     """
     if not values:
         raise ValueError("Input list must not be empty")
-    return reduce(math.gcd, values)
+    return reduce(m.gcd, values)
 
 
 def is_perfect_square(number: int) -> bool:
@@ -105,7 +104,7 @@ def is_perfect_square(number: int) -> bool:
     """
     if number < 0:
         return False
-    root = isqrt(number)
+    root = m.isqrt(number)
     return root * root == number
 
 
@@ -126,7 +125,7 @@ def count_factors(number: int) -> List[int]:
         raise ValueError("Number must be positive")
 
     factors = set()
-    for i in range(1, isqrt(number) + 1):
+    for i in range(1, m.isqrt(number) + 1):
         if number % i == 0:
             factors.add(i)
             factors.add(number // i)
@@ -151,9 +150,32 @@ def triangle_number(index: int) -> int:
     return index * (index + 1) // 2
 
 
+def lcm(values: List[int]) -> int:
+    """
+    Compute the least common multiple (LCM) of a list of integers.
+
+    Args:
+        values (List[int]): A list of integers.
+
+    Returns:
+        int: The LCM of the numbers.
+
+    Raises:
+        ValueError: If the list is empty.
+    """
+    if not values:
+        raise ValueError("Input list must not empty")
+
+    result = 0
+    i1, i2 = 0, 1
+    for v in values:
+        if v
+
+
+
 def main() -> None:
     """Tester Function."""
-    ...
+    print(lcm([2, 4, 6]))
 
 
 if __name__ == "__main__":

{pythagix-0.1.8 → pythagix-0.1.9/pythagix.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pythagix
-Version: 0.1.8
+Version: 0.1.9
 Summary: A mathy Python package with utilities like LCM, triangle numbers, etc.
 Author: UltraQuantumScriptor
 License: MIT

{pythagix-0.1.8 → pythagix-0.1.9}/setup.py

@@ -6,7 +6,7 @@ with open("README.md", encoding="utf-8") as f:
 
 setup(
     name="pythagix",
-    version="0.1.8",
+    version="0.1.9",
     author="UltraQuantumScriptor",
     description="A mathy Python package with utilities like LCM, triangle numbers, etc.",
     long_description=long_description,