AxiomX 0.1.0.dev8__tar.gz → 0.1.1__tar.gz

axiomx-0.1.1/AxiomX/calculus.py

@@ -0,0 +1,95 @@
+# integrating integrals
+def integrate(function, lowlim, uplim, n=10000):
+    h = (uplim - lowlim) / n
+    s = function(lowlim) + function(uplim)
+
+    for i in range(1, n):
+        x = lowlim + i * h
+        if i % 2 == 0:
+            s += 2 * function(x)
+        else:
+            s += 4 * function(x)
+
+    return s * h / 3
+    
+def summation(lowlim, uplim, function, max_terms=10**6):
+    total = 0
+    count = 0
+    
+    if uplim == float("inf"):
+        n = lowlim
+        while count < max_terms:
+            try:
+                term = function(n)
+            except ZeroDivisionError:
+                n += 1
+                continue
+            
+            total += term
+            
+            # Stop if terms are negligible
+            if abs(term) < 1e-10:
+                break
+                
+            n += 1
+            count += 1
+        
+        return total
+    
+    else:
+        for n in range(int(lowlim), int(uplim) + 1):
+            total += function(n)
+        return total
+        
+def converges(f, tolerance=1e-6, max_terms=10**6):
+    total = 0
+    prev = 0
+    
+    for n in range(1, max_terms):
+        try:
+            total += f(n)
+        except ZeroDivisionError:
+            continue
+        
+        # Check if partial sum stabilizes
+        if abs(total - prev) < tolerance:
+            return True
+        
+        prev = total
+    
+    return False
+    
+def lim(f, xlim, tol=1e-5):
+    # Try direct substitution
+    try:
+        return f(xlim)
+    except ZeroDivisionError:
+        pass  # expected for limits
+    except Exception as e:
+        return None  # or raise e if you want strict behavior
+
+    hs = [1e-1, 1e-2, 1e-3, 1e-4, 1e-5]
+    left_vals = []
+    right_vals = []
+
+    for h in hs:
+        try:
+            left_vals.append(f(xlim - h))
+        except ZeroDivisionError:
+            continue
+
+        try:
+            right_vals.append(f(xlim + h))
+        except ZeroDivisionError:
+            continue
+
+    if not left_vals or not right_vals:
+        return None
+
+    left = left_vals[-1]
+    right = right_vals[-1]
+
+    if abs(left - right) < tol:
+        return (left + right) / 2
+
+    return None

{axiomx-0.1.0.dev8 → axiomx-0.1.1}/AxiomX/constants.py

@@ -1,6 +1,7 @@
 pi = 3.141592653589793
 e = 2.718281828459045
-lemniscate = 2.22057554292119
+tau = 2*pi
+lemniscate = 2.622057554292119
 gauss = lemniscate / pi
 euler_mascheroni = 0.577215664901533
 sqrt_2 = 2**0.5
@@ -10,6 +11,7 @@ golden_ratio = (1 + sqrt_5) / 2
 silver_ratio = 1 + sqrt_2
 gelfond = e**pi
 gelfond_schneider = 2**sqrt_2
+infinity = float("inf")
 
 def metallic_ratio(n):
     return (n + (n**2 + 4)**0.5) / 2

{axiomx-0.1.0.dev8 → axiomx-0.1.1}/AxiomX/exp.py

@@ -16,7 +16,7 @@ def ln(x):
     s = 0.0
     term = y
     n = 1
-    while absolute(term) > 1e-17:
+    while abs(term) > 1e-17:
         s += term / n
         term *= y2
         n += 2

{axiomx-0.1.0.dev8 → axiomx-0.1.1}/AxiomX/functions.py

@@ -85,4 +85,22 @@ def beta(n):
     total = 0.0
     for i in range(100000):
         total += ((-1)**i) / ((2*i + 1)**n)
-    return total
+    return total
+    
+def bc(n, k):
+    if k < 0 or k > n:
+        raise ValueError("Binomial coefficient (n k) doesn't work for negative n or k, or if n < k")
+    
+    k = min(k, n - k)  # symmetry optimization
+    result = 1
+    
+    for i in range(1, k + 1):
+        result = result * (n - i + 1) // i
+    
+    return result
+        
+def pascal(row):
+    pr = []
+    for i in range(0, row+1):
+        pr.append(int(bc(row, i)))
+    return pr

{axiomx-0.1.0.dev8 → axiomx-0.1.1}/AxiomX/trig.py

@@ -1,3 +1,6 @@
+from AxiomX.constants import *
+from AxiomX.functions import *
+
 def radians(deg):
     return (pi/180)*deg
     
@@ -18,7 +21,6 @@ def sin(x, terms=20):
     for n in range(terms):
         term = ((-1)**n) * (x**(2*n + 1)) / factorial(2*n + 1)
         sine_value += term
-    return sine_value
     if quarter == 1:
         return sine_value
     elif quarter == 2:
@@ -32,15 +34,23 @@ def cos(x):
     return sin((pi/2)-x)
     
 def tan(x):
+    if cos(x) == 0:
+        return float("inf")
     return sin(x) / cos(x)
 
 def cot(x):
+    if tan(x) == 0:
+        return float("inf")
     return 1 / tan(x)
 
 def sec(x):
+    if cos(x) == 0:
+        return float("inf")
     return 1 / cos(x)
     
 def cosec(x):
+    if sin(x) == 0:
+        return float("inf")
     return 1 / sin(x)
 
 def arcsin(x, iterations=10):
@@ -48,6 +58,8 @@ def arcsin(x, iterations=10):
         raise ValueError("x must be in [-1, 1]")
     y = x
     for _ in range(iterations):
+        if cos(y) == 0:
+            break
         y -= (sin(y) - x) / cos(y)
     return y
     
@@ -61,7 +73,11 @@ def arccot(x):
     return (pi/2) - arctan(x)
 
 def arcsec(x):
+    if x < 1:
+        raise ValueError("x < 1")
     return arccos(1/x)
     
 def arccosec(x):
+    if x < 1:
+        raise ValueError("x < 1")
     return arcsin(1/x)

axiomx-0.1.1/AxiomX.egg-info/PKG-INFO

@@ -0,0 +1,118 @@
+Metadata-Version: 2.4
+Name: AxiomX
+Version: 0.1.1
+Summary: A dynamic Python math library containing numerous mathematical functions implemented from scratch.
+Author: Eric Joseph
+License: MIT
+Requires-Python: >=2.7
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+Dynamic: requires-python
+
+# AxiomX
+
+**AxiomX** is a lightweight Python scientific math library focused on numerical computation, series-based evaluation, and foundational mathematical functions.
+It is designed to be simple, fast and extensible—ideal for learning, experimentation, and building advanced math systems.
+* * *
+## 🚀 Features
+
+### 📚 Constants (included in `AxiomX.constants`)
+* `pi`
+* `e`
+* lemniscate constant (`lemniscate`)
+* gauss constant (`gauss`)
+* `infinity`
+* square roots of 2, 3 and 5 (`sqrt_2`, `sqrt_3`, `sqrt_5`)
+* golden ratio (`golden_ratio`)
+* silver ratio (`silver_ratio`)
+* `metallic_ratio(n)` - Returns the metallic ratio of the order n.
+* euler-mascheroni constant (`euler_mascheroni`)
+
+
+### 🔢 Mathematical Functions (included in `AxiomX.functions`)
+
+* `absolute(x)`
+* `sqrt(n)` - using Halley's Method
+* `cbrt(n)` - using Newton-Raphson Method
+* `gamma(x)`
+* `factorial(n)` - using gamma function
+* `zeta(n)` - returns the Riemann Zeta function evaluated at n
+* `beta(n)` - returns the Dirichlet Beta function evaluated at n
+* `bc(n, k)` - returns the binomial coefficient evaluated at n and k
+* `pascal(row)` - returns a list containing all the numbers at the *row*th row in the Pascal Triangle.
+
+### 📈 Exponential Functions (included in `AxiomX.exp`)
+
+* `exp(n)` - returns e^n, where e is Euler's number.
+* `ln(x)` - returns the natural logarithm of *x*.
+* `log10(x)` - returns the common logarithm of *x*.
+* `log2(x)` - returns the binary logarithm of *x*.
+* `log(arg, base)` - returns the logarithm of *arg* to the base *base*.
+
+### 📐 Trigonometric Functions (included in `AxiomX.trig`)
+
+- `sin(x)` — Calculated from Taylor series expansion
+- `cos(x)` — derived from sine
+- `tan(x)`, `cot(x)`, `sec(x)`, `cosec(x)`
+- `radians(deg)` — degrees → radians  
+- `degrees(rad)` — radians → degrees  
+
+### 🔄 Inverse Trigonometric Functions (also included in `AxiomX.trig`)
+
+- `arcsin(x)` — Newton's method
+- `arccos(x)`
+- `arctan(x)`
+- `arccot(x)`
+- `arcsec(x)`
+- `arccosec(x)`
+
+### 🔥 Hyperbolic Functions and Inverse Functions (included in `AxiomX.hyperbolic`)
+
+* `sinh(x)` - calculated using formula
+* `cosh(x)`, `tanh(x)`, `sech(x)`, `cosech(x)`, `coth(x)`
+* `arcsinh(x)`, `arccosh(x)`, `arctanh(x)`, `arccoth(x)`, `arcsech(x)`, `arccosech(x)`
+* * *
+## 🧠 Usage
+
+```
+from AxiomX import trig, constants, calculus
+
+print(trig.sin(constants.pi)) # prints 0
+print(calculus.converges(lambda x: 1 / x)) # prints False
+```
+* * *
+## 🛣️ Roadmap
+
+Upcoming improvements:
+* Limit evaluation engine
+* Convergence detection for series
+* Combinatorics utilities, Pascal's Triangle
+* Performance optimizations.
+* * *
+## 🤝 Contributing
+
+Contributions are welcome!\You can help by:
+* Reporting bugs in our [Discord](https://discord.com/channels/1484861326324138016/1484861327209140366)
+* Adding suggestions
+* Improving performance.
+* * *
+## 📦 Installation
+
+You can install AxiomX by going into the terminal and typing *pip install AxiomX*.
+* * *
+## 📄 License
+
+This software is licensed under MIT and no one is supposed to copy code from AxiomX.
+* * *
+## 🌐 Links
+
+Website: [https://axiomxpy.wordpress.com](https://axiomxpy.wordpress.com)\
+Discord Invite: [https://discord.gg/CrEf8mDB](https://discord.gg/CrEf8mDB)
+* * *
+
+## ⭐ Support
+If you like AxiomX, consider:
+* Sharing it with other friends
+* Using it in your projects
+* * *

axiomx-0.1.1/PKG-INFO

@@ -0,0 +1,118 @@
+Metadata-Version: 2.4
+Name: AxiomX
+Version: 0.1.1
+Summary: A dynamic Python math library containing numerous mathematical functions implemented from scratch.
+Author: Eric Joseph
+License: MIT
+Requires-Python: >=2.7
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+Dynamic: requires-python
+
+# AxiomX
+
+**AxiomX** is a lightweight Python scientific math library focused on numerical computation, series-based evaluation, and foundational mathematical functions.
+It is designed to be simple, fast and extensible—ideal for learning, experimentation, and building advanced math systems.
+* * *
+## 🚀 Features
+
+### 📚 Constants (included in `AxiomX.constants`)
+* `pi`
+* `e`
+* lemniscate constant (`lemniscate`)
+* gauss constant (`gauss`)
+* `infinity`
+* square roots of 2, 3 and 5 (`sqrt_2`, `sqrt_3`, `sqrt_5`)
+* golden ratio (`golden_ratio`)
+* silver ratio (`silver_ratio`)
+* `metallic_ratio(n)` - Returns the metallic ratio of the order n.
+* euler-mascheroni constant (`euler_mascheroni`)
+
+
+### 🔢 Mathematical Functions (included in `AxiomX.functions`)
+
+* `absolute(x)`
+* `sqrt(n)` - using Halley's Method
+* `cbrt(n)` - using Newton-Raphson Method
+* `gamma(x)`
+* `factorial(n)` - using gamma function
+* `zeta(n)` - returns the Riemann Zeta function evaluated at n
+* `beta(n)` - returns the Dirichlet Beta function evaluated at n
+* `bc(n, k)` - returns the binomial coefficient evaluated at n and k
+* `pascal(row)` - returns a list containing all the numbers at the *row*th row in the Pascal Triangle.
+
+### 📈 Exponential Functions (included in `AxiomX.exp`)
+
+* `exp(n)` - returns e^n, where e is Euler's number.
+* `ln(x)` - returns the natural logarithm of *x*.
+* `log10(x)` - returns the common logarithm of *x*.
+* `log2(x)` - returns the binary logarithm of *x*.
+* `log(arg, base)` - returns the logarithm of *arg* to the base *base*.
+
+### 📐 Trigonometric Functions (included in `AxiomX.trig`)
+
+- `sin(x)` — Calculated from Taylor series expansion
+- `cos(x)` — derived from sine
+- `tan(x)`, `cot(x)`, `sec(x)`, `cosec(x)`
+- `radians(deg)` — degrees → radians  
+- `degrees(rad)` — radians → degrees  
+
+### 🔄 Inverse Trigonometric Functions (also included in `AxiomX.trig`)
+
+- `arcsin(x)` — Newton's method
+- `arccos(x)`
+- `arctan(x)`
+- `arccot(x)`
+- `arcsec(x)`
+- `arccosec(x)`
+
+### 🔥 Hyperbolic Functions and Inverse Functions (included in `AxiomX.hyperbolic`)
+
+* `sinh(x)` - calculated using formula
+* `cosh(x)`, `tanh(x)`, `sech(x)`, `cosech(x)`, `coth(x)`
+* `arcsinh(x)`, `arccosh(x)`, `arctanh(x)`, `arccoth(x)`, `arcsech(x)`, `arccosech(x)`
+* * *
+## 🧠 Usage
+
+```
+from AxiomX import trig, constants, calculus
+
+print(trig.sin(constants.pi)) # prints 0
+print(calculus.converges(lambda x: 1 / x)) # prints False
+```
+* * *
+## 🛣️ Roadmap
+
+Upcoming improvements:
+* Limit evaluation engine
+* Convergence detection for series
+* Combinatorics utilities, Pascal's Triangle
+* Performance optimizations.
+* * *
+## 🤝 Contributing
+
+Contributions are welcome!\You can help by:
+* Reporting bugs in our [Discord](https://discord.com/channels/1484861326324138016/1484861327209140366)
+* Adding suggestions
+* Improving performance.
+* * *
+## 📦 Installation
+
+You can install AxiomX by going into the terminal and typing *pip install AxiomX*.
+* * *
+## 📄 License
+
+This software is licensed under MIT and no one is supposed to copy code from AxiomX.
+* * *
+## 🌐 Links
+
+Website: [https://axiomxpy.wordpress.com](https://axiomxpy.wordpress.com)\
+Discord Invite: [https://discord.gg/CrEf8mDB](https://discord.gg/CrEf8mDB)
+* * *
+
+## ⭐ Support
+If you like AxiomX, consider:
+* Sharing it with other friends
+* Using it in your projects
+* * *

axiomx-0.1.1/README.md

@@ -0,0 +1,106 @@
+# AxiomX
+
+**AxiomX** is a lightweight Python scientific math library focused on numerical computation, series-based evaluation, and foundational mathematical functions.
+It is designed to be simple, fast and extensible—ideal for learning, experimentation, and building advanced math systems.
+* * *
+## 🚀 Features
+
+### 📚 Constants (included in `AxiomX.constants`)
+* `pi`
+* `e`
+* lemniscate constant (`lemniscate`)
+* gauss constant (`gauss`)
+* `infinity`
+* square roots of 2, 3 and 5 (`sqrt_2`, `sqrt_3`, `sqrt_5`)
+* golden ratio (`golden_ratio`)
+* silver ratio (`silver_ratio`)
+* `metallic_ratio(n)` - Returns the metallic ratio of the order n.
+* euler-mascheroni constant (`euler_mascheroni`)
+
+
+### 🔢 Mathematical Functions (included in `AxiomX.functions`)
+
+* `absolute(x)`
+* `sqrt(n)` - using Halley's Method
+* `cbrt(n)` - using Newton-Raphson Method
+* `gamma(x)`
+* `factorial(n)` - using gamma function
+* `zeta(n)` - returns the Riemann Zeta function evaluated at n
+* `beta(n)` - returns the Dirichlet Beta function evaluated at n
+* `bc(n, k)` - returns the binomial coefficient evaluated at n and k
+* `pascal(row)` - returns a list containing all the numbers at the *row*th row in the Pascal Triangle.
+
+### 📈 Exponential Functions (included in `AxiomX.exp`)
+
+* `exp(n)` - returns e^n, where e is Euler's number.
+* `ln(x)` - returns the natural logarithm of *x*.
+* `log10(x)` - returns the common logarithm of *x*.
+* `log2(x)` - returns the binary logarithm of *x*.
+* `log(arg, base)` - returns the logarithm of *arg* to the base *base*.
+
+### 📐 Trigonometric Functions (included in `AxiomX.trig`)
+
+- `sin(x)` — Calculated from Taylor series expansion
+- `cos(x)` — derived from sine
+- `tan(x)`, `cot(x)`, `sec(x)`, `cosec(x)`
+- `radians(deg)` — degrees → radians  
+- `degrees(rad)` — radians → degrees  
+
+### 🔄 Inverse Trigonometric Functions (also included in `AxiomX.trig`)
+
+- `arcsin(x)` — Newton's method
+- `arccos(x)`
+- `arctan(x)`
+- `arccot(x)`
+- `arcsec(x)`
+- `arccosec(x)`
+
+### 🔥 Hyperbolic Functions and Inverse Functions (included in `AxiomX.hyperbolic`)
+
+* `sinh(x)` - calculated using formula
+* `cosh(x)`, `tanh(x)`, `sech(x)`, `cosech(x)`, `coth(x)`
+* `arcsinh(x)`, `arccosh(x)`, `arctanh(x)`, `arccoth(x)`, `arcsech(x)`, `arccosech(x)`
+* * *
+## 🧠 Usage
+
+```
+from AxiomX import trig, constants, calculus
+
+print(trig.sin(constants.pi)) # prints 0
+print(calculus.converges(lambda x: 1 / x)) # prints False
+```
+* * *
+## 🛣️ Roadmap
+
+Upcoming improvements:
+* Limit evaluation engine
+* Convergence detection for series
+* Combinatorics utilities, Pascal's Triangle
+* Performance optimizations.
+* * *
+## 🤝 Contributing
+
+Contributions are welcome!\You can help by:
+* Reporting bugs in our [Discord](https://discord.com/channels/1484861326324138016/1484861327209140366)
+* Adding suggestions
+* Improving performance.
+* * *
+## 📦 Installation
+
+You can install AxiomX by going into the terminal and typing *pip install AxiomX*.
+* * *
+## 📄 License
+
+This software is licensed under MIT and no one is supposed to copy code from AxiomX.
+* * *
+## 🌐 Links
+
+Website: [https://axiomxpy.wordpress.com](https://axiomxpy.wordpress.com)\
+Discord Invite: [https://discord.gg/CrEf8mDB](https://discord.gg/CrEf8mDB)
+* * *
+
+## ⭐ Support
+If you like AxiomX, consider:
+* Sharing it with other friends
+* Using it in your projects
+* * *

{axiomx-0.1.0.dev8 → axiomx-0.1.1}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "AxiomX"
-version = "0.1.0.dev8"
+version = "0.1.1"
 authors = [
     { name = "Eric Joseph" }
 ]

{axiomx-0.1.0.dev8 → axiomx-0.1.1}/setup.py

@@ -2,7 +2,7 @@ from setuptools import setup, find_packages
 
 setup(
     name="AxiomX",  # rename to your project name
-    version="0.1.0.dev8",
+    version="0.1.1",
     description="A custom Python math library with special functions.",
     author="Eric Joseph",  # change if needed
     packages=find_packages(),

axiomx-0.1.0.dev8/AxiomX/calculus.py

@@ -1,60 +0,0 @@
-# integrating integrals
-def integrate(function, lowlim, uplim, n=10000):
-    h = (uplim - lowlim) / n
-    s = function(lowlim) + function(uplim)
-
-    for i in range(1, n):
-        x = lowlim + i * h
-        if i % 2 == 0:
-            s += 2 * function(x)
-        else:
-            s += 4 * function(x)
-
-    return s * h / 3
-    
-def summation(lowlim, uplim, function):
-    sum = 0
-    for _ in range(lowlim, uplim + 1):
-        sum += function(_)
-    return sum
-
-def converges(f):
-    if (f(2) == 0.5):
-        return False
-    try:
-        n1 = 10**5
-        n2 = 10**6
-
-        a1 = abs(f(n1))
-        a2 = abs(f(n2))
-
-        # 1) nth-term test (stronger)
-        if a2 > 1e-3:
-            return False
-
-        # 2) Ratio test
-        if a1 != 0:
-            L = abs(a2 / a1)
-            if L < 0.9:
-                return True
-            if L > 1.1:
-                return False
-
-        # 3) Alternating test
-        if f(1000) * f(1001) < 0 and a2 < a1:
-            return "Conditional"
-
-        # 4) Partial sum growth test
-        S1 = sum(f(n) for n in range(1,2000))
-        S2 = sum(f(n) for n in range(1,4000))
-
-        if abs(S2) > abs(S1) * 1.2:
-            return False
-
-        if abs(S2 - S1) < 1e-3:
-            return True
-
-    except:
-        return "Inconclusive"
-
-    return "Inconclusive"

axiomx-0.1.0.dev8/AxiomX.egg-info/PKG-INFO

@@ -1,18 +0,0 @@
-Metadata-Version: 2.4
-Name: AxiomX
-Version: 0.1.0.dev8
-Summary: A dynamic Python math library containing numerous mathematical functions implemented from scratch.
-Author: Eric Joseph
-License: MIT
-Requires-Python: >=2.7
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Dynamic: license-file
-Dynamic: requires-python
-
-# AxiomX 0.1.0.dev8
-
-AxiomX is proud to release the 0.1.0.dev8 bugfix release. We're extremely sorry for the inconvenience we have caused. We had realized about a bug running in our module. We have fixed it and as this is a bugfix release, we have not added anything new.
-\
-\
-This module is licensed under MIT. No one is allowed to copy code from AxiomX. Hope you all enjoy AxiomX.

axiomx-0.1.0.dev8/PKG-INFO

@@ -1,18 +0,0 @@
-Metadata-Version: 2.4
-Name: AxiomX
-Version: 0.1.0.dev8
-Summary: A dynamic Python math library containing numerous mathematical functions implemented from scratch.
-Author: Eric Joseph
-License: MIT
-Requires-Python: >=2.7
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Dynamic: license-file
-Dynamic: requires-python
-
-# AxiomX 0.1.0.dev8
-
-AxiomX is proud to release the 0.1.0.dev8 bugfix release. We're extremely sorry for the inconvenience we have caused. We had realized about a bug running in our module. We have fixed it and as this is a bugfix release, we have not added anything new.
-\
-\
-This module is licensed under MIT. No one is allowed to copy code from AxiomX. Hope you all enjoy AxiomX.

axiomx-0.1.0.dev8/README.md

@@ -1,6 +0,0 @@
-# AxiomX 0.1.0.dev8
-
-AxiomX is proud to release the 0.1.0.dev8 bugfix release. We're extremely sorry for the inconvenience we have caused. We had realized about a bug running in our module. We have fixed it and as this is a bugfix release, we have not added anything new.
-\
-\
-This module is licensed under MIT. No one is allowed to copy code from AxiomX. Hope you all enjoy AxiomX.