pythagix 0.1.8__tar.gz → 0.2.0__tar.gz

{pythagix-0.1.8 → pythagix-0.2.0}/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.2.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pythagix
-Version: 0.1.8
+Version: 0.2.0
 Summary: A mathy Python package with utilities like LCM, triangle numbers, etc.
 Author: UltraQuantumScriptor
 License: MIT
@@ -17,7 +17,7 @@ Dynamic: requires-python
 
 # Pythagix
 
-**Pythagix** is a lightweight and dependency-free Python library designed for number theory operations.
+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.
 
 ---
@@ -34,26 +34,35 @@ pip install pythagix
 
 ## Features
 
-* `is_prime(number: int) -> bool`
-  Determine whether a number is a prime number.
+count_factors(number: int) -> List[int]
+Return a sorted list of all positive factors of the given number.
 
-* `filter_primes(numbers: List[int]) -> List[int]`
-  Return all prime numbers from a list of integers.
+digit_sum(number: int) -> int
+Return the sum of all digit in the given number.
 
-* `nth_prime(position: int) -> int`
-  Retrieve the *n*-th prime number (1-based indexing).
+filter_primes(numbers: List[int]) -> List[int]
+Return all prime numbers from a list of integers.
 
-* `gcd(values: List[int]) -> int`
-  Compute the greatest common divisor (GCD) of a list of integers.
+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.
+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.
+is_prime(number: int) -> bool
+Determine whether a number is prime.
 
-* `triangle_number(index: int) -> int`
-  Compute the *n*-th triangular number.
+lcm(values: List[int]) -> int
+Compute the least common multiple (LCM) of a list of integers.
+
+middle(a: int | float, b: int | float) -> float
+Return the midpoint of two numbers.
+
+nth_prime(position: int) -> int
+Retrieve the n-th prime number (1-based index).
+
+triangle_number(index: int) -> int
+Compute the n-th triangular number.
 
 ---
 
@@ -77,13 +86,13 @@ print(triangle_number(7))   # Output: 28
 
 Pythagix is ideal for:
 
-* Educational platforms and math-related tools
+Educational platforms and math-related tools
 
-* Prototyping algorithms and number-theoretic computations
+Prototyping algorithms and number-theoretic computations
 
-* Teaching foundational concepts in discrete mathematics and number theory
+Teaching foundational concepts in discrete mathematics and number theory
 
-* Lightweight CLI utilities and academic scripting
+Lightweight CLI utilities and academic scripting
 
 ---
 

pythagix-0.2.0/README.md

@@ -0,0 +1,97 @@
+---
+
+# 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
+
+count_factors(number: int) -> List[int]
+Return a sorted list of all positive factors of the given number.
+
+digit_sum(number: int) -> int
+Return the sum of all digit in the given number.
+
+filter_primes(numbers: List[int]) -> List[int]
+Return all prime numbers from a list of integers.
+
+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.
+
+is_prime(number: int) -> bool
+Determine whether a number is prime.
+
+lcm(values: List[int]) -> int
+Compute the least common multiple (LCM) of a list of integers.
+
+middle(a: int | float, b: int | float) -> float
+Return the midpoint of two numbers.
+
+nth_prime(position: int) -> int
+Retrieve the n-th prime number (1-based index).
+
+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.8 → pythagix-0.2.0}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "pythagix"
-version = "0.1.8"
+version = "0.2.0"
 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.2.0}/pythagix/__init__.py

@@ -1,10 +1,14 @@
 # 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,
+    middle,
+    nth_prime,
     triangle_number,
 )

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

@@ -1,15 +1,18 @@
-from math import isqrt
+import math as m
 from functools import reduce
 from typing import List
-import math
 
 __all__ = [
-    "is_prime",
+    "count_factors",
+    "digit_sum",
     "filter_primes",
-    "nth_prime",
     "gcd",
     "is_perfect_square",
-    "count_factors",
+    "is_prime",
+    "is_multiple",
+    "lcm",
+    "middle",
+    "nth_prime",
     "triangle_number",
 ]
 
@@ -30,7 +33,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 +93,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 +108,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 +129,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 +154,72 @@ 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")
+
+    return reduce(m.lcm, values)
+
+
+def digit_sum(number: int) -> int:
+    """
+    Sum all digits that are in 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:
+        n (int): The number to test.
+        base (int): The base to check against.
+
+    Returns:
+        bool: True if n is a multiple of base, False otherwise.
+    """
+
+    return number % base == 0
+
+
+def middle(a: int | float, b: int | float) -> float:
+    """
+    Return the midpoint between two numbers.
+
+    Args:
+        a (float): The first number.
+        b (float): The second number.
+
+    Returns:
+        float: The average of the two numbers.
+    """
+
+    return (a + b) / 2
+
+
 def main() -> None:
     """Tester Function."""
-    ...
+    print(middle(246, 2))
 
 
 if __name__ == "__main__":

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pythagix
-Version: 0.1.8
+Version: 0.2.0
 Summary: A mathy Python package with utilities like LCM, triangle numbers, etc.
 Author: UltraQuantumScriptor
 License: MIT
@@ -17,7 +17,7 @@ Dynamic: requires-python
 
 # Pythagix
 
-**Pythagix** is a lightweight and dependency-free Python library designed for number theory operations.
+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.
 
 ---
@@ -34,26 +34,35 @@ pip install pythagix
 
 ## Features
 
-* `is_prime(number: int) -> bool`
-  Determine whether a number is a prime number.
+count_factors(number: int) -> List[int]
+Return a sorted list of all positive factors of the given number.
 
-* `filter_primes(numbers: List[int]) -> List[int]`
-  Return all prime numbers from a list of integers.
+digit_sum(number: int) -> int
+Return the sum of all digit in the given number.
 
-* `nth_prime(position: int) -> int`
-  Retrieve the *n*-th prime number (1-based indexing).
+filter_primes(numbers: List[int]) -> List[int]
+Return all prime numbers from a list of integers.
 
-* `gcd(values: List[int]) -> int`
-  Compute the greatest common divisor (GCD) of a list of integers.
+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.
+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.
+is_prime(number: int) -> bool
+Determine whether a number is prime.
 
-* `triangle_number(index: int) -> int`
-  Compute the *n*-th triangular number.
+lcm(values: List[int]) -> int
+Compute the least common multiple (LCM) of a list of integers.
+
+middle(a: int | float, b: int | float) -> float
+Return the midpoint of two numbers.
+
+nth_prime(position: int) -> int
+Retrieve the n-th prime number (1-based index).
+
+triangle_number(index: int) -> int
+Compute the n-th triangular number.
 
 ---
 
@@ -77,13 +86,13 @@ print(triangle_number(7))   # Output: 28
 
 Pythagix is ideal for:
 
-* Educational platforms and math-related tools
+Educational platforms and math-related tools
 
-* Prototyping algorithms and number-theoretic computations
+Prototyping algorithms and number-theoretic computations
 
-* Teaching foundational concepts in discrete mathematics and number theory
+Teaching foundational concepts in discrete mathematics and number theory
 
-* Lightweight CLI utilities and academic scripting
+Lightweight CLI utilities and academic scripting
 
 ---
 

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

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

pythagix-0.1.8/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.