pythagix 0.1.9__tar.gz → 0.2.2__tar.gz

pythagix-0.2.2/PKG-INFO

@@ -0,0 +1,100 @@
+Metadata-Version: 2.4
+Name: pythagix
+Version: 0.2.2
+Summary: A mathy Python package with utilities like LCM, triangle numbers, etc.
+Author: UltraQuantumScriptor
+License: MIT
+Keywords: math,prime,LCM,triangle numbers,gcd,utilities
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Requires-Python: >=3.6
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+Dynamic: requires-python
+
+# Pythagix
+
+Pythagix is a lightweight, dependency-free Python library for number theory operations.
+It provides a clean and efficient interface for common mathematical utilities such as prime checking, greatest common divisor, triangular numbers, and more.
+
+---
+
+
+Installation
+
+You can install Pythagix using pip:
+
+```bash
+pip install pythagix
+```
+
+
+Features
+
+count_factors(number: int) -> List[int]
+Returns a sorted list of all positive factors of the given number.
+
+digit_sum(number: int) -> int
+Returns the sum of all digits in the given number.
+
+filter_primes(values: List[int]) -> List[int]
+Filters and returns prime numbers from a list of integers.
+
+gcd(values: List[int]) -> int
+Computes the greatest common divisor (GCD) of a list of integers.
+
+is_perfect_square(number: int) -> bool
+Determines whether a number is a perfect square.
+
+is_prime(number: int) -> bool
+Checks whether a number is prime.
+
+is_multiple(number: int, base: int) -> bool
+Checks if one number is a multiple of another.
+
+lcm(values: List[int]) -> int
+Computes the least common multiple (LCM) of a list of integers.
+
+mean(values: List[int | float]) -> float
+Calculates the arithmetic mean (average) of a list of numbers.
+
+median(values: List[int | float]) -> float
+Computes the median value of a list.
+
+middle(a: int | float, b: int | float) -> float
+Returns the midpoint of two numeric values.
+
+mode(values: List[int | float]) -> int | float | List[int | float]
+Computes the mode(s) of a list. Returns a single value or a list of modes.
+
+nth_prime(position: int) -> int
+Retrieves the n-th prime number (1-based index).
+
+triangle_number(index: int) -> int
+Computes the n-th triangular number.
+
+
+Use Cases
+
+Pythagix is suitable for:
+
+Educational platforms and math-related applications
+
+Prototyping number-theoretic algorithms
+
+Teaching foundational concepts in discrete mathematics
+
+Lightweight command-line tools and academic scripting
+
+
+License
+
+This project is licensed under the MIT License.
+You are free to use, modify, and distribute the software as permitted under the license terms.
+
+Contributing
+
+Contributions are welcome.
+
+To report bugs, suggest enhancements, or submit code improvements, please open an issue or create a pull request via the GitHub repository.

pythagix-0.2.2/README.md

@@ -0,0 +1,85 @@
+# Pythagix
+
+Pythagix is a lightweight, dependency-free Python library for number theory operations.
+It provides a clean and efficient interface for common mathematical utilities such as prime checking, greatest common divisor, triangular numbers, and more.
+
+---
+
+
+Installation
+
+You can install Pythagix using pip:
+
+```bash
+pip install pythagix
+```
+
+
+Features
+
+count_factors(number: int) -> List[int]
+Returns a sorted list of all positive factors of the given number.
+
+digit_sum(number: int) -> int
+Returns the sum of all digits in the given number.
+
+filter_primes(values: List[int]) -> List[int]
+Filters and returns prime numbers from a list of integers.
+
+gcd(values: List[int]) -> int
+Computes the greatest common divisor (GCD) of a list of integers.
+
+is_perfect_square(number: int) -> bool
+Determines whether a number is a perfect square.
+
+is_prime(number: int) -> bool
+Checks whether a number is prime.
+
+is_multiple(number: int, base: int) -> bool
+Checks if one number is a multiple of another.
+
+lcm(values: List[int]) -> int
+Computes the least common multiple (LCM) of a list of integers.
+
+mean(values: List[int | float]) -> float
+Calculates the arithmetic mean (average) of a list of numbers.
+
+median(values: List[int | float]) -> float
+Computes the median value of a list.
+
+middle(a: int | float, b: int | float) -> float
+Returns the midpoint of two numeric values.
+
+mode(values: List[int | float]) -> int | float | List[int | float]
+Computes the mode(s) of a list. Returns a single value or a list of modes.
+
+nth_prime(position: int) -> int
+Retrieves the n-th prime number (1-based index).
+
+triangle_number(index: int) -> int
+Computes the n-th triangular number.
+
+
+Use Cases
+
+Pythagix is suitable for:
+
+Educational platforms and math-related applications
+
+Prototyping number-theoretic algorithms
+
+Teaching foundational concepts in discrete mathematics
+
+Lightweight command-line tools and academic scripting
+
+
+License
+
+This project is licensed under the MIT License.
+You are free to use, modify, and distribute the software as permitted under the license terms.
+
+Contributing
+
+Contributions are welcome.
+
+To report bugs, suggest enhancements, or submit code improvements, please open an issue or create a pull request via the GitHub repository.

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

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

{pythagix-0.1.9 → pythagix-0.2.2}/pythagix/__init__.py

@@ -1,10 +1,17 @@
 # pythagix/__init__.py
 from .core import (
+    count_factors,
+    digit_sum,
     filter_primes,
-    is_prime,
-    nth_prime,
     gcd,
     is_perfect_square,
-    count_factors,
+    is_prime,
+    is_multiple,
+    lcm,
+    mean,
+    median,
+    middle,
+    mode,
+    nth_prime,
     triangle_number,
 )

pythagix-0.2.2/pythagix/core.py

@@ -0,0 +1,306 @@
+import math as m
+from functools import reduce
+from typing import List, Union
+from collections import Counter
+
+Numeric = Union[int, float]
+
+__all__ = [
+    "count_factors",
+    "digit_sum",
+    "filter_primes",
+    "gcd",
+    "is_perfect_square",
+    "is_prime",
+    "is_multiple",
+    "lcm",
+    "mean",
+    "median",
+    "middle",
+    "mode",
+    "nth_prime",
+    "triangle_number",
+]
+
+
+def is_prime(number: int) -> bool:
+    """
+    Check whether a given integer is a prime number.
+
+    Args:
+        number (int): The number to check.
+
+    Returns:
+        bool: True if the number is prime, False otherwise.
+    """
+    if number <= 1:
+        return False
+    if number == 2:
+        return True
+    if number % 2 == 0:
+        return False
+    for i in range(3, m.isqrt(number) + 1, 2):
+        if number % i == 0:
+            return False
+    return True
+
+
+def filter_primes(values: List[int]) -> List[int]:
+    """
+    Filter and return the prime numbers from a list.
+
+    Args:
+        values (List[int]): A list of integers.
+
+    Returns:
+        List[int]: A list containing only the prime numbers.
+    """
+    return [num for num in values if is_prime(num)]
+
+
+def nth_prime(position: int) -> int:
+    """
+    Get the N-th prime number (1-based index).
+
+    Args:
+        position (int): The index (1-based) of the prime number to find.
+
+    Returns:
+        int: The N-th prime number.
+
+    Raises:
+        ValueError: If position < 1.
+    """
+    if position < 1:
+        raise ValueError("Position must be >= 1")
+
+    count = 0
+    candidate = 2
+    while True:
+        if is_prime(candidate):
+            count += 1
+            if count == position:
+                return candidate
+        candidate += 1
+
+
+def gcd(values: List[int]) -> int:
+    """
+    Compute the greatest common divisor (GCD) of a list of integers.
+
+    Args:
+        values (List[int]): A list of integers.
+
+    Returns:
+        int: The GCD of the numbers.
+
+    Raises:
+        ValueError: If the list is empty.
+    """
+    if not values:
+        raise ValueError("Input list must not be empty")
+    return reduce(m.gcd, values)
+
+
+def is_perfect_square(number: int) -> bool:
+    """
+    Check whether a number is a perfect square.
+
+    Args:
+        number (int): The number to check.
+
+    Returns:
+        bool: True if the number is a perfect square, False otherwise.
+    """
+    if number < 0:
+        return False
+    root = m.isqrt(number)
+    return root * root == number
+
+
+def count_factors(number: int) -> List[int]:
+    """
+    Return all positive factors of a number.
+
+    Args:
+        number (int): The number whose factors are to be found.
+
+    Returns:
+        List[int]: A sorted list of factors.
+
+    Raises:
+        ValueError: If the number is not positive.
+    """
+    if number <= 0:
+        raise ValueError("Number must be positive")
+
+    factors = set()
+    for i in range(1, m.isqrt(number) + 1):
+        if number % i == 0:
+            factors.add(i)
+            factors.add(number // i)
+    return sorted(factors)
+
+
+def triangle_number(index: int) -> int:
+    """
+    Calculate the N-th triangular number.
+
+    Args:
+        index (int): The position (starting from 0) in the triangular number sequence.
+
+    Returns:
+        int: The N-th triangular number.
+
+    Raises:
+        ValueError: If the index is negative.
+    """
+    if index < 0:
+        raise ValueError("Index must be >= 0")
+    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 be empty")
+
+    return reduce(m.lcm, values)
+
+
+def digit_sum(number: int) -> int:
+    """
+    Sum all digits of the given number.
+
+    Args:
+        number (int): The number whose digits are to be summed.
+
+    Returns:
+        int: The sum of the digits in the number.
+    """
+    return sum(int(digit) for digit in str(number))
+
+
+def is_multiple(number: int, base: int) -> bool:
+    """
+    Check if a number is a multiple of another number.
+
+    Args:
+        number (int): The number to test.
+        base (int): The base to check against.
+
+    Returns:
+        bool: True if number is a multiple of base, False otherwise.
+    """
+    return number % base == 0
+
+
+def middle(a: Numeric, b: Numeric) -> float:
+    """
+    Return the midpoint between two numbers.
+
+    Args:
+        a (int | float): The first number.
+        b (int | float): The second number.
+
+    Returns:
+        float: The average of the two numbers.
+    """
+    return (a + b) / 2
+
+
+def mean(values: List[Numeric]) -> float:
+    """
+    Calculate the mean (average) of a list of numbers.
+
+    Args:
+        values (List[int | float]): A list of integers or floats.
+
+    Returns:
+        float: The mean of the list.
+
+    Raises:
+        ValueError: If the input list is empty.
+    """
+    if not values:
+        raise ValueError("Must contain at least one data point")
+
+    total = 0
+    for number in values:
+        total += number
+
+    return total / len(values)
+
+
+def median(values: List[Numeric]) -> float:
+    """
+    Calculate the median of a list of numbers.
+
+    Args:
+        values (List[int | float]): A list of integers or floats.
+
+    Returns:
+        float: The median of the list.
+
+    Raises:
+        ValueError: If the input list is empty.
+    """
+    if not values:
+        raise ValueError("Must contain at least one data point")
+
+    values = sorted(values)
+    length = len(values)
+    mid = length // 2
+
+    if length % 2 == 1:
+        return float(values[mid])
+    else:
+        return middle(values[mid - 1], values[mid])
+
+
+def mode(values: List[Numeric]) -> Union[Numeric, List[Numeric]]:
+    """
+    Compute the mode(s) of a list of numeric values.
+
+    The mode is the number that appears most frequently in the list.
+    If multiple numbers have the same highest frequency, all such numbers are returned as a list.
+    If only one number has the highest frequency, that single value is returned.
+
+    Args:
+        values (List[int | float]): A list of integers or floats.
+
+    Returns:
+        int | float | List[int | float]:
+            The mode of the list. Returns a single value if there's one mode,
+            or a list of values if multiple modes exist.
+
+    Raises:
+        ValueError: If the input list is empty.
+    """
+    if not values:
+        raise ValueError("Input list must not be empty")
+
+    frequency = Counter(values)
+    highest = max(frequency.values())
+    modes = [number for number, count in frequency.items() if count == highest]
+
+    return modes[0] if len(modes) == 1 else modes
+
+
+if __name__ == "__main__":
+
+    def main() -> None:
+        """Tester Function."""
+
+    main()

pythagix-0.2.2/pythagix.egg-info/PKG-INFO

@@ -0,0 +1,100 @@
+Metadata-Version: 2.4
+Name: pythagix
+Version: 0.2.2
+Summary: A mathy Python package with utilities like LCM, triangle numbers, etc.
+Author: UltraQuantumScriptor
+License: MIT
+Keywords: math,prime,LCM,triangle numbers,gcd,utilities
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: MIT License
+Requires-Python: >=3.6
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+Dynamic: requires-python
+
+# Pythagix
+
+Pythagix is a lightweight, dependency-free Python library for number theory operations.
+It provides a clean and efficient interface for common mathematical utilities such as prime checking, greatest common divisor, triangular numbers, and more.
+
+---
+
+
+Installation
+
+You can install Pythagix using pip:
+
+```bash
+pip install pythagix
+```
+
+
+Features
+
+count_factors(number: int) -> List[int]
+Returns a sorted list of all positive factors of the given number.
+
+digit_sum(number: int) -> int
+Returns the sum of all digits in the given number.
+
+filter_primes(values: List[int]) -> List[int]
+Filters and returns prime numbers from a list of integers.
+
+gcd(values: List[int]) -> int
+Computes the greatest common divisor (GCD) of a list of integers.
+
+is_perfect_square(number: int) -> bool
+Determines whether a number is a perfect square.
+
+is_prime(number: int) -> bool
+Checks whether a number is prime.
+
+is_multiple(number: int, base: int) -> bool
+Checks if one number is a multiple of another.
+
+lcm(values: List[int]) -> int
+Computes the least common multiple (LCM) of a list of integers.
+
+mean(values: List[int | float]) -> float
+Calculates the arithmetic mean (average) of a list of numbers.
+
+median(values: List[int | float]) -> float
+Computes the median value of a list.
+
+middle(a: int | float, b: int | float) -> float
+Returns the midpoint of two numeric values.
+
+mode(values: List[int | float]) -> int | float | List[int | float]
+Computes the mode(s) of a list. Returns a single value or a list of modes.
+
+nth_prime(position: int) -> int
+Retrieves the n-th prime number (1-based index).
+
+triangle_number(index: int) -> int
+Computes the n-th triangular number.
+
+
+Use Cases
+
+Pythagix is suitable for:
+
+Educational platforms and math-related applications
+
+Prototyping number-theoretic algorithms
+
+Teaching foundational concepts in discrete mathematics
+
+Lightweight command-line tools and academic scripting
+
+
+License
+
+This project is licensed under the MIT License.
+You are free to use, modify, and distribute the software as permitted under the license terms.
+
+Contributing
+
+Contributions are welcome.
+
+To report bugs, suggest enhancements, or submit code improvements, please open an issue or create a pull request via the GitHub repository.

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

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

pythagix-0.1.9/PKG-INFO

@@ -1,103 +0,0 @@
-Metadata-Version: 2.4
-Name: pythagix
-Version: 0.1.9
-Summary: A mathy Python package with utilities like LCM, triangle numbers, etc.
-Author: UltraQuantumScriptor
-License: MIT
-Keywords: math,prime,LCM,triangle numbers,gcd,utilities
-Classifier: Programming Language :: Python :: 3
-Classifier: License :: OSI Approved :: MIT License
-Requires-Python: >=3.6
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Dynamic: license-file
-Dynamic: requires-python
-
----
-
-# Pythagix
-
-**Pythagix** is a lightweight and dependency-free Python library designed for number theory operations.
-It provides a clean, efficient interface to common mathematical utilities such as prime number checks, greatest common divisor computation, triangular numbers, and more.
-
----
-
-## Installation
-
-Install Pythagix using pip:
-
-```bash
-pip install pythagix
-```
-
----
-
-## Features
-
-* `is_prime(number: int) -> bool`
-  Determine whether a number is a prime number.
-
-* `filter_primes(numbers: List[int]) -> List[int]`
-  Return all prime numbers from a list of integers.
-
-* `nth_prime(position: int) -> int`
-  Retrieve the *n*-th prime number (1-based indexing).
-
-* `gcd(values: List[int]) -> int`
-  Compute the greatest common divisor (GCD) of a list of integers.
-
-* `is_perfect_square(number: int) -> bool`
-  Check whether a number is a perfect square.
-
-* `count_factors(number: int) -> List[int]`
-  Return a sorted list of all positive factors of a number.
-
-* `triangle_number(index: int) -> int`
-  Compute the *n*-th triangular number.
-
----
-
-## Example Usage
-
-```python
-from pythagix import is_prime, nth_prime, gcd, triangle_number
-
-print(is_prime(13))         # Output: True
-
-print(nth_prime(10))        # Output: 29
-
-print(gcd([12, 18, 24]))    # Output: 6
-
-print(triangle_number(7))   # Output: 28
-```
-
----
-
-## Use Cases
-
-Pythagix is ideal for:
-
-* Educational platforms and math-related tools
-
-* Prototyping algorithms and number-theoretic computations
-
-* Teaching foundational concepts in discrete mathematics and number theory
-
-* Lightweight CLI utilities and academic scripting
-
----
-
-## License
-
-Pythagix is released under the [MIT License](LICENSE), making it free to use, modify, and distribute.
-
----
-
-## Contributing
-
-Contributions are welcome!
-If you'd like to add features, report bugs, or improve documentation, please open an issue or submit a pull request on the [GitHub repository](https://github.com/your-username/pythagix).
-
----
-
-If you want me to tailor this even more (e.g. add badges, GitHub Actions, versioning, or PyPI metadata snippets), I can assist with that too.

pythagix-0.1.9/README.md

@@ -1,88 +0,0 @@
----
-
-# Pythagix
-
-**Pythagix** is a lightweight and dependency-free Python library designed for number theory operations.
-It provides a clean, efficient interface to common mathematical utilities such as prime number checks, greatest common divisor computation, triangular numbers, and more.
-
----
-
-## Installation
-
-Install Pythagix using pip:
-
-```bash
-pip install pythagix
-```
-
----
-
-## Features
-
-* `is_prime(number: int) -> bool`
-  Determine whether a number is a prime number.
-
-* `filter_primes(numbers: List[int]) -> List[int]`
-  Return all prime numbers from a list of integers.
-
-* `nth_prime(position: int) -> int`
-  Retrieve the *n*-th prime number (1-based indexing).
-
-* `gcd(values: List[int]) -> int`
-  Compute the greatest common divisor (GCD) of a list of integers.
-
-* `is_perfect_square(number: int) -> bool`
-  Check whether a number is a perfect square.
-
-* `count_factors(number: int) -> List[int]`
-  Return a sorted list of all positive factors of a number.
-
-* `triangle_number(index: int) -> int`
-  Compute the *n*-th triangular number.
-
----
-
-## Example Usage
-
-```python
-from pythagix import is_prime, nth_prime, gcd, triangle_number
-
-print(is_prime(13))         # Output: True
-
-print(nth_prime(10))        # Output: 29
-
-print(gcd([12, 18, 24]))    # Output: 6
-
-print(triangle_number(7))   # Output: 28
-```
-
----
-
-## Use Cases
-
-Pythagix is ideal for:
-
-* Educational platforms and math-related tools
-
-* Prototyping algorithms and number-theoretic computations
-
-* Teaching foundational concepts in discrete mathematics and number theory
-
-* Lightweight CLI utilities and academic scripting
-
----
-
-## License
-
-Pythagix is released under the [MIT License](LICENSE), making it free to use, modify, and distribute.
-
----
-
-## Contributing
-
-Contributions are welcome!
-If you'd like to add features, report bugs, or improve documentation, please open an issue or submit a pull request on the [GitHub repository](https://github.com/your-username/pythagix).
-
----
-
-If you want me to tailor this even more (e.g. add badges, GitHub Actions, versioning, or PyPI metadata snippets), I can assist with that too.

pythagix-0.1.9/pythagix/core.py

@@ -1,182 +0,0 @@
-import math as m
-from functools import reduce
-from typing import List
-
-__all__ = [
-    "is_prime",
-    "filter_primes",
-    "nth_prime",
-    "gcd",
-    "is_perfect_square",
-    "count_factors",
-    "triangle_number",
-]
-
-
-def is_prime(number: int) -> bool:
-    """
-    Check whether a given integer is a prime number.
-
-    Args:
-        number (int): The number to check.
-
-    Returns:
-        bool: True if number is prime, False otherwise.
-    """
-    if number <= 1:
-        return False
-    if number == 2:
-        return True
-    if number % 2 == 0:
-        return False
-    for i in range(3, m.isqrt(number) + 1, 2):
-        if number % i == 0:
-            return False
-    return True
-
-
-def filter_primes(values: List[int]) -> List[int]:
-    """
-    Filter and return the prime numbers from a list.
-
-    Args:
-        values (List[int]): A list of integers.
-
-    Returns:
-        List[int]: A list containing only the prime numbers.
-    """
-    return [num for num in values if is_prime(num)]
-
-
-def nth_prime(position: int) -> int:
-    """
-    Get the N-th prime number (1-based index).
-
-    Args:
-        position (int): The index (1-based) of the prime number to find.
-
-    Returns:
-        int: The N-th prime number.
-
-    Raises:
-        ValueError: If position < 1.
-    """
-    if position < 1:
-        raise ValueError("Position must be >= 1")
-
-    count = 0
-    candidate = 2
-    while True:
-        if is_prime(candidate):
-            count += 1
-            if count == position:
-                return candidate
-        candidate += 1
-
-
-def gcd(values: List[int]) -> int:
-    """
-    Compute the greatest common divisor (GCD) of a list of integers.
-
-    Args:
-        values (List[int]): A list of integers.
-
-    Returns:
-        int: The GCD of the numbers.
-
-    Raises:
-        ValueError: If the list is empty.
-    """
-    if not values:
-        raise ValueError("Input list must not be empty")
-    return reduce(m.gcd, values)
-
-
-def is_perfect_square(number: int) -> bool:
-    """
-    Check whether a number is a perfect square.
-
-    Args:
-        number (int): The number to check.
-
-    Returns:
-        bool: True if the number is a perfect square, False otherwise.
-    """
-    if number < 0:
-        return False
-    root = m.isqrt(number)
-    return root * root == number
-
-
-def count_factors(number: int) -> List[int]:
-    """
-    Return all positive factors of a number.
-
-    Args:
-        number (int): The number whose factors are to be found.
-
-    Returns:
-        List[int]: A sorted list of factors.
-
-    Raises:
-        ValueError: If number is not positive.
-    """
-    if number <= 0:
-        raise ValueError("Number must be positive")
-
-    factors = set()
-    for i in range(1, m.isqrt(number) + 1):
-        if number % i == 0:
-            factors.add(i)
-            factors.add(number // i)
-    return sorted(factors)
-
-
-def triangle_number(index: int) -> int:
-    """
-    Calculate the N-th triangular number.
-
-    Args:
-        index (int): The position (starting from 0) in the triangular number sequence.
-
-    Returns:
-        int: The N-th triangular number.
-
-    Raises:
-        ValueError: If index is negative.
-    """
-    if index < 0:
-        raise ValueError("Index must be >= 0")
-    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__":
-    main()

pythagix-0.1.9/pythagix.egg-info/PKG-INFO

@@ -1,103 +0,0 @@
-Metadata-Version: 2.4
-Name: pythagix
-Version: 0.1.9
-Summary: A mathy Python package with utilities like LCM, triangle numbers, etc.
-Author: UltraQuantumScriptor
-License: MIT
-Keywords: math,prime,LCM,triangle numbers,gcd,utilities
-Classifier: Programming Language :: Python :: 3
-Classifier: License :: OSI Approved :: MIT License
-Requires-Python: >=3.6
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Dynamic: license-file
-Dynamic: requires-python
-
----
-
-# Pythagix
-
-**Pythagix** is a lightweight and dependency-free Python library designed for number theory operations.
-It provides a clean, efficient interface to common mathematical utilities such as prime number checks, greatest common divisor computation, triangular numbers, and more.
-
----
-
-## Installation
-
-Install Pythagix using pip:
-
-```bash
-pip install pythagix
-```
-
----
-
-## Features
-
-* `is_prime(number: int) -> bool`
-  Determine whether a number is a prime number.
-
-* `filter_primes(numbers: List[int]) -> List[int]`
-  Return all prime numbers from a list of integers.
-
-* `nth_prime(position: int) -> int`
-  Retrieve the *n*-th prime number (1-based indexing).
-
-* `gcd(values: List[int]) -> int`
-  Compute the greatest common divisor (GCD) of a list of integers.
-
-* `is_perfect_square(number: int) -> bool`
-  Check whether a number is a perfect square.
-
-* `count_factors(number: int) -> List[int]`
-  Return a sorted list of all positive factors of a number.
-
-* `triangle_number(index: int) -> int`
-  Compute the *n*-th triangular number.
-
----
-
-## Example Usage
-
-```python
-from pythagix import is_prime, nth_prime, gcd, triangle_number
-
-print(is_prime(13))         # Output: True
-
-print(nth_prime(10))        # Output: 29
-
-print(gcd([12, 18, 24]))    # Output: 6
-
-print(triangle_number(7))   # Output: 28
-```
-
----
-
-## Use Cases
-
-Pythagix is ideal for:
-
-* Educational platforms and math-related tools
-
-* Prototyping algorithms and number-theoretic computations
-
-* Teaching foundational concepts in discrete mathematics and number theory
-
-* Lightweight CLI utilities and academic scripting
-
----
-
-## License
-
-Pythagix is released under the [MIT License](LICENSE), making it free to use, modify, and distribute.
-
----
-
-## Contributing
-
-Contributions are welcome!
-If you'd like to add features, report bugs, or improve documentation, please open an issue or submit a pull request on the [GitHub repository](https://github.com/your-username/pythagix).
-
----
-
-If you want me to tailor this even more (e.g. add badges, GitHub Actions, versioning, or PyPI metadata snippets), I can assist with that too.