mathai 0.2.1__tar.gz → 0.2.3__tar.gz

mathai-0.2.3/PKG-INFO

@@ -0,0 +1,231 @@
+Metadata-Version: 2.2
+Name: mathai
+Version: 0.2.3
+Summary: Mathematics solving Ai tailored to NCERT
+Home-page: https://github.com/infinity390/mathai4
+Author: educated indians are having a low iq and are good for nothing
+Requires-Python: >=3.7
+Description-Content-Type: text/markdown
+Requires-Dist: lark-parser
+Dynamic: author
+Dynamic: description
+Dynamic: description-content-type
+Dynamic: home-page
+Dynamic: requires-dist
+Dynamic: requires-python
+Dynamic: summary
+
+# Math AI Documentation
+
+## Philosophy
+I think it is a big realization in computer science and programming to realize that computers can solve mathematics.  
+This understanding should be made mainstream. It can help transform education, mathematical research, and computation of mathematical equations for work.
+
+## Societal Implications Of Such A Computer Program And The Author's Comment On Universities Of India
+I think mathematics is valued by society because of education. Schools and universities teach them.  
+So this kind of software, if made mainstream, could bring real change.
+
+### The Author's Comments On The Universities In His Country
+> Educated Indians are having a low IQ and are good for nothing.  
+> The Indian Institute of Technology (IITs) graduates are the leader of the fools.  
+> Every educated Indian is beneath me.  
+> Now learn how this Python library can solve the math questions of your exams.
+
+## The Summary Of How Computer "Solves" Math
+Math equations are a tree data structure (`TreeNode` class).  
+We can manipulate the math equations using various algorithms (functions provided by the `mathai` library).  
+We first parse the math equation strings to get the tree data structure (`parse` function in `mathai`).
+
+## The Library
+Import the library by doing:
+
+```python
+from mathai import *
+```
+
+### str_form
+It is the string representation of a `TreeNode` math equation.
+
+#### Example
+```text
+(cos(x)^2)+(sin(x)^2)
+```
+
+Is represented internally as:
+
+```text
+f_add
+ f_pow
+  f_cos
+   v_0
+  d_2
+ f_pow
+  f_sin
+   v_0
+  d_2
+```
+
+#### Leaf Nodes
+
+**Variables** (start with a `v_` prefix):
+
+- `v_0` → x
+- `v_1` → y
+- `v_2` → z
+- `v_3` → a
+
+**Numbers** (start with `d_` prefix; only integers):
+
+- `d_-1` → -1
+- `d_0` → 0
+- `d_1` → 1
+- `d_2` → 2
+
+#### Branch Nodes
+- `f_add` → addition
+- `f_mul` → multiplication
+- `f_pow` → power
+
+### parse
+Takes a math equation string and outputs a `TreeNode` object.
+
+```python
+from mathai import *
+
+equation = parse("sin(x)^2+cos(x)^2")
+print(equation)
+```
+
+#### Output
+```text
+(cos(x)^2)+(sin(x)^2)
+```
+
+### printeq, printeq_str, printeq_log
+Prints math equations in a more readable form than usual `print`.
+
+```python
+from mathai import *
+
+equation = simplify(parse("(x+1)/x"))
+print(equation)
+printeq(equation)
+```
+
+#### Output
+```text
+(1+x)*(x^-1)
+(1+x)/x
+```
+
+### solve, simplify
+`simplify` performs what `solve` does and more.  
+It simplifies and cleans up a given math equation.
+
+```python
+from mathai import *
+
+equation = simplify(parse("(x+x+x+x-1-1-1-1)*(4*x-4)*sin(sin(x+x+x)*sin(3*x))"))
+printeq(equation)
+```
+
+#### Output
+```text
+((-4+(4*x))^2)*sin((sin((3*x))^2))
+```
+
+### Incomplete Documentation, Will be updated and completed later on
+
+### Example Demonstration [limits questions can also be solved other than this these, try limit()]
+![pip-install-mathai-mathematics-solving-ai-system-in-python-v0-xcg3c22k51sf1](https://github.com/user-attachments/assets/799f576f-27d0-4d7c-86e9-ad55ff221bcc)
+```python
+import sys, os, time
+from mathai import *
+
+sys.setrecursionlimit(10000)
+
+def integration_byparts(item): return simplify(fraction(simplify(byparts(simplify(parse(item)))[0])))
+def integration_apart(item): return simplify(fraction(integrate(apart(factor2(simplify(parse(item)))))[0]))
+def integration_direct(item): return simplify(fraction(simplify(integrate(simplify(parse(item)))[0])))
+def integration_trig(item): return simplify(trig0(integrate(trig1(simplify(parse(item))))[0]))
+def algebra(item): return logic0(simplify(expand(simplify(parse(item)))))
+def trig_basic(item): return logic0(simplify(expand(trig3(simplify(parse(item))))))
+def trig_advanced(item): return logic0(simplify(trig0(trig1(trig4(simplify(fraction(trig0(simplify(parse(item))))))))))
+
+all_tasks = [
+    *[(item, trig_advanced) for item in [
+        "cos(x)/(1+sin(x)) + (1+sin(x))/cos(x) = 2*sec(x)",
+        "(1+sec(x))/sec(x) = sin(x)^2/(1-cos(x))"]],
+    *[(item, integration_byparts) for item in ["sin(x)*x","x*sin(3*x)","x*log(abs(x))","arctan(x)"]],
+    *[(item, integration_apart) for item in ["x/((x+1)*(x+2))","1/(x^2-9)"]],
+    *[(item, integration_direct) for item in [
+        "x*sqrt(x+2)","sin(cos(x))*sin(x)","2*x/(1+x^2)","sqrt(a*x+b)","cos(sqrt(x))/sqrt(x)","e^(arctan(x))/(1+x^2)","sqrt(sin(2*x))*cos(2*x"]], 
+    *[(item, integration_trig) for item in ["sin(2*x+5)^2","sin(x)^4","cos(2*x)^4"]],
+    *[(item, algebra) for item in ["(x+1)^2 = x^2+2*x+1","(x+1)*(x-1) = x^2-1"]],
+    *[(item, trig_basic) for item in ["2*sin(x)*cos(x)=sin(2*x)"]],
+]
+
+def run_task(task):
+    item, func = task
+    try: result = func(item)
+    except Exception as e: result = str(e)
+    return item, result
+
+if __name__=="__main__":
+    print(f"Solving {len(all_tasks)} math questions...\n")
+    start_time = time.time()
+    for task in all_tasks:
+        item, result = run_task(task)
+        print(f"{item}  =>  {result}\n")
+    print(f"All tasks completed in {time.time()-start_time:.2f} seconds")
+```
+### Output
+
+```
+Running 21 tasks asynchronously on 8 cores...
+
+x*log(abs(x))  =>  ((-2*(x^2))+(4*log(abs(x))*(x^2)))*(8^-1)
+
+arctan(x)  =>  (log((abs((1+(x^2)))^-1))+(2*arctan(x)*x))*(2^-1)
+
+sin(cos(x))*sin(x)  =>  cos(cos(x))
+
+1/(x^2-9)  =>  (log(abs((-3+x)))+log((abs((3+x))^-1)))*(6^-1)
+
+x/((x+1)*(x+2))  =>  log((abs((1+x))^-1))+log(((2+x)^2))
+
+x*sin(3*x)  =>  ((-9*cos((3*x))*x)+(3*sin((3*x))))*(27^-1)
+
+(1+sec(x))/sec(x) = sin(x)^2/(1-cos(x))  =>  true
+
+e^(arctan(x))/(1+x^2)  =>  e^arctan(x)
+
+cos(sqrt(x))/sqrt(x)  =>  2*sin((x^(2^-1)))
+
+sqrt(a*x+b)  =>  2*(3^-1)*(((x*a)+b)^(3*(2^-1)))*(a^-1)
+
+sin(x)*x  =>  (-1*cos(x)*x)+sin(x)
+
+(x+1)^2 = x^2+2*x+1  =>  true
+
+(x+1)*(x-1) = x^2-1  =>  true
+
+cos(x)/(1+sin(x)) + (1+sin(x))/cos(x) = 2*sec(x)  =>  true
+
+2*sin(x)*cos(x)=sin(2*x)  =>  true
+
+sqrt(sin(2*x))*cos(2*x)  =>  (3^-1)*(sin((2*x))^(3*(2^-1)))
+
+2*x/(1+x^2)  =>  log(abs((1+(x^2))))
+
+sin(2*x+5)^2  =>  ((-1*(4^-1)*sin((10+(4*x))))+x)*(2^-1)
+
+cos(2*x)^4  =>  ((4^-1)*x)+((64^-1)*sin((8*x)))+((8^-1)*sin((4*x)))+((8^-1)*x)
+
+x*sqrt(x+2)  =>  ((-1*(4^-1)*((2+x)^(2+(2^-1))))+(-2*((2+x)^(2+(2^-1))))+(5*((2+x)^(1+(2^-1)))*x)+((2^-1)*((2+x)^(1+(2^-1)))*x)+((8^-1)*((2+x)^(1+(2^-1)))*x))*((1+(2^-1))^-3)*((2+(2^-1))^-1)
+
+sin(x)^4  =>  (-1*(4^-1)*sin((2*x)))+((32^-1)*sin((4*x)))+((4^-1)*x)+((8^-1)*x)
+
+All tasks completed in 129.78 seconds
+```
+

mathai-0.2.3/README.md

@@ -0,0 +1,214 @@
+# Math AI Documentation
+
+## Philosophy
+I think it is a big realization in computer science and programming to realize that computers can solve mathematics.  
+This understanding should be made mainstream. It can help transform education, mathematical research, and computation of mathematical equations for work.
+
+## Societal Implications Of Such A Computer Program And The Author's Comment On Universities Of India
+I think mathematics is valued by society because of education. Schools and universities teach them.  
+So this kind of software, if made mainstream, could bring real change.
+
+### The Author's Comments On The Universities In His Country
+> Educated Indians are having a low IQ and are good for nothing.  
+> The Indian Institute of Technology (IITs) graduates are the leader of the fools.  
+> Every educated Indian is beneath me.  
+> Now learn how this Python library can solve the math questions of your exams.
+
+## The Summary Of How Computer "Solves" Math
+Math equations are a tree data structure (`TreeNode` class).  
+We can manipulate the math equations using various algorithms (functions provided by the `mathai` library).  
+We first parse the math equation strings to get the tree data structure (`parse` function in `mathai`).
+
+## The Library
+Import the library by doing:
+
+```python
+from mathai import *
+```
+
+### str_form
+It is the string representation of a `TreeNode` math equation.
+
+#### Example
+```text
+(cos(x)^2)+(sin(x)^2)
+```
+
+Is represented internally as:
+
+```text
+f_add
+ f_pow
+  f_cos
+   v_0
+  d_2
+ f_pow
+  f_sin
+   v_0
+  d_2
+```
+
+#### Leaf Nodes
+
+**Variables** (start with a `v_` prefix):
+
+- `v_0` → x
+- `v_1` → y
+- `v_2` → z
+- `v_3` → a
+
+**Numbers** (start with `d_` prefix; only integers):
+
+- `d_-1` → -1
+- `d_0` → 0
+- `d_1` → 1
+- `d_2` → 2
+
+#### Branch Nodes
+- `f_add` → addition
+- `f_mul` → multiplication
+- `f_pow` → power
+
+### parse
+Takes a math equation string and outputs a `TreeNode` object.
+
+```python
+from mathai import *
+
+equation = parse("sin(x)^2+cos(x)^2")
+print(equation)
+```
+
+#### Output
+```text
+(cos(x)^2)+(sin(x)^2)
+```
+
+### printeq, printeq_str, printeq_log
+Prints math equations in a more readable form than usual `print`.
+
+```python
+from mathai import *
+
+equation = simplify(parse("(x+1)/x"))
+print(equation)
+printeq(equation)
+```
+
+#### Output
+```text
+(1+x)*(x^-1)
+(1+x)/x
+```
+
+### solve, simplify
+`simplify` performs what `solve` does and more.  
+It simplifies and cleans up a given math equation.
+
+```python
+from mathai import *
+
+equation = simplify(parse("(x+x+x+x-1-1-1-1)*(4*x-4)*sin(sin(x+x+x)*sin(3*x))"))
+printeq(equation)
+```
+
+#### Output
+```text
+((-4+(4*x))^2)*sin((sin((3*x))^2))
+```
+
+### Incomplete Documentation, Will be updated and completed later on
+
+### Example Demonstration [limits questions can also be solved other than this these, try limit()]
+![pip-install-mathai-mathematics-solving-ai-system-in-python-v0-xcg3c22k51sf1](https://github.com/user-attachments/assets/799f576f-27d0-4d7c-86e9-ad55ff221bcc)
+```python
+import sys, os, time
+from mathai import *
+
+sys.setrecursionlimit(10000)
+
+def integration_byparts(item): return simplify(fraction(simplify(byparts(simplify(parse(item)))[0])))
+def integration_apart(item): return simplify(fraction(integrate(apart(factor2(simplify(parse(item)))))[0]))
+def integration_direct(item): return simplify(fraction(simplify(integrate(simplify(parse(item)))[0])))
+def integration_trig(item): return simplify(trig0(integrate(trig1(simplify(parse(item))))[0]))
+def algebra(item): return logic0(simplify(expand(simplify(parse(item)))))
+def trig_basic(item): return logic0(simplify(expand(trig3(simplify(parse(item))))))
+def trig_advanced(item): return logic0(simplify(trig0(trig1(trig4(simplify(fraction(trig0(simplify(parse(item))))))))))
+
+all_tasks = [
+    *[(item, trig_advanced) for item in [
+        "cos(x)/(1+sin(x)) + (1+sin(x))/cos(x) = 2*sec(x)",
+        "(1+sec(x))/sec(x) = sin(x)^2/(1-cos(x))"]],
+    *[(item, integration_byparts) for item in ["sin(x)*x","x*sin(3*x)","x*log(abs(x))","arctan(x)"]],
+    *[(item, integration_apart) for item in ["x/((x+1)*(x+2))","1/(x^2-9)"]],
+    *[(item, integration_direct) for item in [
+        "x*sqrt(x+2)","sin(cos(x))*sin(x)","2*x/(1+x^2)","sqrt(a*x+b)","cos(sqrt(x))/sqrt(x)","e^(arctan(x))/(1+x^2)","sqrt(sin(2*x))*cos(2*x"]], 
+    *[(item, integration_trig) for item in ["sin(2*x+5)^2","sin(x)^4","cos(2*x)^4"]],
+    *[(item, algebra) for item in ["(x+1)^2 = x^2+2*x+1","(x+1)*(x-1) = x^2-1"]],
+    *[(item, trig_basic) for item in ["2*sin(x)*cos(x)=sin(2*x)"]],
+]
+
+def run_task(task):
+    item, func = task
+    try: result = func(item)
+    except Exception as e: result = str(e)
+    return item, result
+
+if __name__=="__main__":
+    print(f"Solving {len(all_tasks)} math questions...\n")
+    start_time = time.time()
+    for task in all_tasks:
+        item, result = run_task(task)
+        print(f"{item}  =>  {result}\n")
+    print(f"All tasks completed in {time.time()-start_time:.2f} seconds")
+```
+### Output
+
+```
+Running 21 tasks asynchronously on 8 cores...
+
+x*log(abs(x))  =>  ((-2*(x^2))+(4*log(abs(x))*(x^2)))*(8^-1)
+
+arctan(x)  =>  (log((abs((1+(x^2)))^-1))+(2*arctan(x)*x))*(2^-1)
+
+sin(cos(x))*sin(x)  =>  cos(cos(x))
+
+1/(x^2-9)  =>  (log(abs((-3+x)))+log((abs((3+x))^-1)))*(6^-1)
+
+x/((x+1)*(x+2))  =>  log((abs((1+x))^-1))+log(((2+x)^2))
+
+x*sin(3*x)  =>  ((-9*cos((3*x))*x)+(3*sin((3*x))))*(27^-1)
+
+(1+sec(x))/sec(x) = sin(x)^2/(1-cos(x))  =>  true
+
+e^(arctan(x))/(1+x^2)  =>  e^arctan(x)
+
+cos(sqrt(x))/sqrt(x)  =>  2*sin((x^(2^-1)))
+
+sqrt(a*x+b)  =>  2*(3^-1)*(((x*a)+b)^(3*(2^-1)))*(a^-1)
+
+sin(x)*x  =>  (-1*cos(x)*x)+sin(x)
+
+(x+1)^2 = x^2+2*x+1  =>  true
+
+(x+1)*(x-1) = x^2-1  =>  true
+
+cos(x)/(1+sin(x)) + (1+sin(x))/cos(x) = 2*sec(x)  =>  true
+
+2*sin(x)*cos(x)=sin(2*x)  =>  true
+
+sqrt(sin(2*x))*cos(2*x)  =>  (3^-1)*(sin((2*x))^(3*(2^-1)))
+
+2*x/(1+x^2)  =>  log(abs((1+(x^2))))
+
+sin(2*x+5)^2  =>  ((-1*(4^-1)*sin((10+(4*x))))+x)*(2^-1)
+
+cos(2*x)^4  =>  ((4^-1)*x)+((64^-1)*sin((8*x)))+((8^-1)*sin((4*x)))+((8^-1)*x)
+
+x*sqrt(x+2)  =>  ((-1*(4^-1)*((2+x)^(2+(2^-1))))+(-2*((2+x)^(2+(2^-1))))+(5*((2+x)^(1+(2^-1)))*x)+((2^-1)*((2+x)^(1+(2^-1)))*x)+((8^-1)*((2+x)^(1+(2^-1)))*x))*((1+(2^-1))^-3)*((2+(2^-1))^-1)
+
+sin(x)^4  =>  (-1*(4^-1)*sin((2*x)))+((32^-1)*sin((4*x)))+((4^-1)*x)+((8^-1)*x)
+
+All tasks completed in 129.78 seconds
+```
+

{mathai-0.2.1 → mathai-0.2.3}/mathai/__init__.py

@@ -1,7 +1,7 @@
 from .expand import expand
 from .parser import parse
 from .printeq import printeq, printeq_log, printeq_str
-from .simplify import solve, simplify
+from .simplify import solve, simplify, solve2
 from .integrate import integrate, sqint, byparts
 from .diff import diff
 from .factor import factor, factor2
@@ -12,4 +12,5 @@ from .logic import logic0, logic1, logic2, logic3
 from .apart import apart
 from .console import console
 from .limit import limit
+from .univariate_inequality import wavycurvy, absolute, domain, handle_sqrt
 from .base import *

{mathai-0.2.1 → mathai-0.2.3}/mathai/base.py

@@ -193,7 +193,8 @@ def compute(eq):
 
     # Recursive case: compute child values
     values = [compute(child) for child in eq.children]
-
+    if None in values:
+        return None
     # Evaluate based on node type
     if eq.name == "f_add":
         return sum(values)

{mathai-0.2.1 → mathai-0.2.3}/mathai/expand.py

@@ -52,5 +52,7 @@ def expand(eq):
                 add = add + mul
                 add = simplify(add)
             eq = add
+        eq = simplify(eq)
+        
     return TreeNode(eq.name, [expand(child) for child in eq.children])
 

{mathai-0.2.1 → mathai-0.2.3}/mathai/inverse.py

@@ -1,10 +1,11 @@
 from .base import *
 from .simplify import solve
 from .expand import expand
-def inverse(rhs,term):
+def inverse(rhs,term, sign=None):
     term = tree_form(term)
     lhs = tree_form("d_0")
     count = 15
+    
     while not rhs==term:
         if rhs.name == "f_add":
             if all(term in factor_generation(child) for child in rhs.children):
@@ -20,6 +21,12 @@ def inverse(rhs,term):
             for i in range(len(rhs.children)-1,-1,-1):
                 if not contain(rhs.children[i], term):
                     lhs = lhs * rhs.children[i]**-1
+                    if sign is not None:
+                        if "v_" in str_form(rhs.children[i]):
+                            return None
+                        if compute(rhs.children[i]**-1) < 0:
+                            sign = not sign
+                    
                     rhs.children.pop(i)
         elif rhs.name == "f_pow" and contain(rhs.children[0], term):
             lhs = lhs ** (tree_form("d_1")/rhs.children[1])
@@ -53,5 +60,6 @@ def inverse(rhs,term):
         count -= 1
         if count == 0:
             return None
-    
-    return solve(lhs)
+    if sign is None:
+        return solve(lhs)
+    return solve(lhs), sign

{mathai-0.2.1 → mathai-0.2.3}/mathai/limit.py

@@ -27,13 +27,13 @@ def check(num, den, var):
     if n is None or d is None:
         return False
     if n == 0 and d == 0: return True
-    if d != 0: return simplify(n/d)
+    if d != 0: return simplify(num/den)
     return False
 def lhospital(num, den, steps,var):
     logs = []
     out = check(num, den, var)
     if isinstance(out, TreeNode):
-        return out
+        return out,[]
     for _ in range(steps):
         num2, den2 = map(lambda e: simplify(diff(e, var.name)), (num, den))
         out = check(num2, den2, var)

{mathai-0.2.1 → mathai-0.2.3}/mathai/simplify.py

@@ -144,25 +144,36 @@ def solve(eq, specialfx=False):
     eq = flatten_tree(eq)
     
     return dowhile(eq, _solve)
-
+def solve2(eq):
+    return solve(eq, True)    
 def clear_div(eq):
     lst = factor_generation(eq)
     if tree_form("d_0") in lst:
         return tree_form("d_0")
-    lst = [item for item in lst if not(item.name == "f_pow" and frac(item.children[1]) is not None and frac(item.children[1]) < 0)]
+    lst3 = [item for item in lst if "v_" not in str_form(item) and compute(item) < 0]
+    sign = True
+    if len(lst3) % 2 == 1:
+        sign = False
+    lst = [item for item in lst if not(item.name == "f_pow" and frac(item.children[1]) is not None and frac(item.children[1]) == -1)]
 
     lst2 = [item for item in lst if "v_" in str_form(item)]
     if lst2 == []:
-        return solve(product(lst))
-    return solve(product(lst2))
+        return solve(product(lst)),sign
+    return solve(product(lst2)),sign
 
 def simplify(eq):
     error = False
-    if eq.name == "f_eq":
-        if eq.children[1] != 0:
-            return TreeNode(eq.name, [clear_div(simplify(eq.children[0]-eq.children[1])), tree_form("d_0")])
-        else:
-            return TreeNode(eq.name, [clear_div(simplify(eq.children[0])), tree_form("d_0")])
+    eq = flatten_tree(eq)
+    if eq.name in ["f_and", "f_or", "f_not"]:
+        return TreeNode(eq.name, [simplify(child) for child in eq.children])
+        
+    if eq.name in ["f_lt", "f_gt", "f_le", "f_ge", "f_eq"]:
+        tmp, sign = clear_div(simplify(eq.children[0]-eq.children[1]))
+        name2 = eq.name
+        if not sign:
+            name2 = {"f_lt":"f_gt", "f_gt":"f_lt", "f_eq":"f_eq", "f_le":"f_ge", "f_ge":"f_le"}[name2]
+
+        return TreeNode(name2, [tmp, tree_form("d_0")])
 
     eq = solve(eq, True)
     def helper(eq):
@@ -219,6 +230,8 @@ def simplify(eq):
         return TreeNode(eq.name, [helper3(child) for child in eq.children])
     def helper4(eq):
         nonlocal error
+        if eq == tree_form("d_-1")**tree_form("d_-1"):
+            return tree_form("d_-1")
         def perfect_nth_root_value(x, n):
             """Return integer y if x is a perfect n-th power (y**n == x), else None."""
             if x < 0 and n % 2 == 0:
@@ -316,6 +329,8 @@ def simplify(eq):
             return eq.children[0].children[0]**eq.children[1]
         return TreeNode(eq.name, [helper5(child) for child in eq.children])
     def helper8(eq):
+        if eq.name == "f_pow" and eq.children[0].name == "f_abs" and frac(eq.children[1]) is not None and frac(eq.children[1]).numerator % 2==0:
+            return eq.children[0].children[0] ** eq.children[1]
         if eq.name == "f_abs" and eq.children[0].name == "f_abs":
             return eq.children[0]
         if eq.name == "f_cos" and eq.children[0].name == "f_abs":