Update app.py

app.py

@@ -1,55 +1,57 @@
 import streamlit as st
 import sympy as sp
 import re
-from sympy.ntheory.modular import solve_linear_congruence
 
 # 1. SETUP
 st.set_page_config(page_title="SAAD AI ACADEMY", layout="centered")
 
-# 2. THE UNIVERSAL SOLVER FUNCTION
+# 2. THE STABLE SOLVER
 def universal_solver(query):
     try:
-        # A. Check for Modular Congruence first (special case)
+        x = sp.Symbol('x')
+        
+        # A. MODULAR CONGRUENCE (The 14x = 30 mod 44 logic)
         if "mod" in query.lower():
             nums = re.findall(r'\d+', query)
             if len(nums) >= 3:
                 a, b, n = map(int, nums[:3])
-                sol = solve_linear_congruence(a, b, n)
-                return f"Number Theory Result: x ≡ {sol[0]} (mod {sol[1]})" if sol else "No Solution."
-
-        # B. For everything else (Calculus, Algebra, Limits)
-        # We clean the query to remove words like "solve" or "find"
-        clean_query = query.lower().replace("solve", "").replace("find", "").replace("the", "").strip()
-        
-        # SymPy turns your text into a math expression
-        obj = sp.sympify(clean_query)
-        
-        # If it's an equation (has an '='), solve it
-        if "=" in query:
-            parts = query.split("=")
-            equation = sp.Eq(sp.sympify(parts[0]), sp.sympify(parts[1]))
-            return sp.solve(equation)
-        
-        # Otherwise, just simplify or "do" the math (like derivatives)
-        return sp.simplify(obj)
+                # Using solveset on a modular equation is the most stable way
+                equation = sp.Eq(sp.Mod(a*x, n), b % n)
+                sol = sp.solveset(equation, x, domain=sp.S.Integers)
+                return f"Result: ${sp.latex(sol)}$"
+
+        # B. CALCULUS (Derivatives/Integrals)
+        if "diff" in query.lower() or "derivative" in query.lower():
+            expr = sp.sympify(query.split("of")[-1].strip())
+            return sp.diff(expr, x)
+            
+        if "integrate" in query.lower():
+            expr = sp.sympify(query.split("integrate")[-1].strip())
+            return sp.integrate(expr, x)
+
+        # C. GENERAL ALGEBRA
+        clean_query = query.replace("solve", "").replace("find", "").strip()
+        if "=" in clean_query:
+            parts = clean_query.split("=")
+            eq = sp.Eq(sp.sympify(parts[0]), sp.sympify(parts[1]))
+            return sp.solve(eq, x)
+            
+        return sp.simplify(sp.sympify(clean_query))
 
     except Exception as e:
-        return f"Enter a valid math expression (e.g., x**2 + 5*x or 14x=30 mod 44). Error: {e}"
+        return f"Please check syntax. Use x**2 for powers. Error: {e}"
 
 # 3. UI
 st.title("📐 SAAD AI ACADEMY")
-st.write("Enter any B.Sc. Level problem (Algebra, Calculus, Number Theory)")
-
-user_input = st.text_input("Input:", placeholder="e.g. diff(sin(x)*exp(x), x) or x**2 - 5*x + 6 = 0")
+user_input = st.text_input("Enter problem:", placeholder="e.g. 14x = 30 mod 44")
 
 if user_input:
     result = universal_solver(user_input)
     st.divider()
-    st.subheader("Result:")
-    if isinstance(result, (list, tuple, sp.Basic)):
-        st.latex(sp.latex(result))
+    if isinstance(result, str) and "Result" in result:
+        st.markdown(result)
     else:
-        st.write(result)
+        st.latex(sp.latex(result))
 
 # 4. SIDEBAR
-st.sidebar.info("Universal Mode: Uses SymPy Symbolic Parsing.")
+st.sidebar.info("v6.1: Stable Solver (Python 3.13 Ready)")