math-exercises 3.0.56 → 3.0.57

package/lib/math/systems/generalSystem.js

@@ -1,9 +1,12 @@
+import { equal, EqualNode } from "../../tree/nodes/equations/equalNode.js";
 import { reifyAlgebraic, } from "../../tree/nodes/nodeConstructor.js";
 import { AddNode, add } from "../../tree/nodes/operators/addNode.js";
 import { frac } from "../../tree/nodes/operators/fractionNode.js";
 import { multiply, } from "../../tree/nodes/operators/multiplyNode.js";
 import { substract, } from "../../tree/nodes/operators/substractNode.js";
 import { doWhile } from "../../utils/doWhile.js";
+import { alignTex } from "../../utils/latex/alignTex.js";
+import { lcm } from "../utils/arithmetic/lcm.js";
 import { randint } from "../utils/random/randint.js";
 export class GeneralSystemConstructor {
     static random() {
@@ -48,12 +51,34 @@ export class GeneralSystem {
             coeffsIds: this.coeffs.map((row) => row.map((e) => e.toIdentifiers())),
         };
     }
+    simplify(opts) {
+        const simpCoeffs = this.coeffs.map((row) => row.map((c) => c.simplify(opts)));
+        return new GeneralSystem(simpCoeffs);
+    }
+    getEqualNodes() {
+        const [a, b, c] = this.coeffs[0];
+        const [d, e, f] = this.coeffs[1];
+        return [
+            new EqualNode(add(multiply(a, "x"), multiply(b, "y")), c),
+            new EqualNode(add(multiply(d, "x"), multiply(e, "y")), f),
+        ];
+    }
     checkCouple(x, y) {
         const [a, b, c] = this.coeffs[0];
         const [d, e, f] = this.coeffs[1];
         return (add(multiply(a, x), multiply(b, y)).simplify().equals(c.simplify()) &&
             add(multiply(d, x), multiply(e, y)).simplify().equals(f.simplify()));
     }
+    multiplyEquation(nodes) {
+        return new GeneralSystem([
+            nodes[0].evaluate() !== 1
+                ? this.coeffs[0].map((c) => multiply(c, nodes[0]))
+                : this.coeffs[0],
+            nodes[1].evaluate() !== 1
+                ? this.coeffs[1].map((c) => multiply(c, nodes[1]))
+                : this.coeffs[1],
+        ]);
+    }
     solve() {
         if (this.coeffs.length !== 2)
             throw Error("General system resolution not implemented yet");
@@ -110,4 +135,116 @@ ${add(multiply(this.coeffs[0][0], "x"), multiply(this.coeffs[0][1], "y")).toTex(
 ${new AddNode(multiply(this.coeffs[1][0], "x"), multiply(this.coeffs[1][1], "y")).toTex()}=${this.coeffs[1][2].toTex()}
 \\end{matrix}\\right.`;
     }
+    toCorrectionTex() {
+        let [equa1, equa2] = this.getEqualNodes();
+        const coeffs1 = this.coeffs[0];
+        const coeffs2 = this.coeffs[1];
+        let corr = "";
+        const unitCoeffIndex = [
+            coeffs1[0],
+            coeffs1[1],
+            coeffs2[0],
+            coeffs2[1],
+        ].findIndex((e) => Math.abs(e.evaluate()) === 1);
+        //si une var est à coeff |1|, substitution
+        //sinon, cl :
+        const solveBySub = unitCoeffIndex > -1;
+        if (solveBySub) {
+            const isFirstEqua = unitCoeffIndex < 2;
+            const isX = unitCoeffIndex % 2 === 0;
+            const varName = isX ? "x" : "y";
+            const varName2 = isX ? "y" : "x";
+            const isolated = isFirstEqua
+                ? equa1.isolate(varName)
+                : equa2.isolate(varName);
+            corr += `
+    
+On peut isoler $${varName}$ dans la ${isFirstEqua ? "première" : "deuxième"} équation : 
+
+$$
+${isolated.toTex()}
+$$`;
+            const substituted = (isFirstEqua ? equa2 : equa1).toDetailedEvaluation({
+                [varName]: isolated.rightChild,
+            });
+            const subSimp = substituted.simplify({
+                towardsDistribute: true,
+                forbidFactorize: true,
+            });
+            const isolated2 = subSimp.isolate(isX ? "y" : "x");
+            const varFinal = isolated.toDetailedEvaluation({
+                [varName2]: isolated2.rightChild,
+            });
+            const varFinalSimp = varFinal.simplify();
+            corr += `
+    
+On peut alors remplacer $${varName}$ dans la ${isFirstEqua ? "deuxième" : "première"} équation, pour en déduire $${isX ? "y" : "x"}$ : 
+
+${alignTex([[substituted.toTex()], [subSimp.toTex()], [isolated2.toTex()]])}
+
+On a donc : 
+
+${alignTex([[isolated.toTex()], [varFinal.toTex()], [varFinalSimp.toTex()]])}
+`;
+        }
+        else {
+            const coeffsEv = [coeffs1[0], coeffs1[1], coeffs2[0], coeffs2[1]].map((e) => e.evaluate());
+            const ppcms = [
+                lcm(coeffsEv[0], coeffsEv[2]),
+                lcm(coeffsEv[1], coeffsEv[3]),
+            ];
+            const minPpcm = Math.min(...ppcms);
+            const isX = minPpcm === ppcms[0];
+            let firstEquaMultiple = minPpcm / Math.abs(coeffsEv[isX ? 0 : 1]);
+            let secondEquaMultiple = minPpcm / Math.abs(coeffsEv[isX ? 2 : 3]);
+            const areSameSign = coeffsEv[isX ? 0 : 1] * coeffsEv[isX ? 2 : 3] > 0;
+            if (areSameSign) {
+                firstEquaMultiple *= -1;
+            }
+            const shouldHandleFirst = firstEquaMultiple !== 1;
+            const shouldHandleSecond = secondEquaMultiple !== 1;
+            const sysMultiplied = this.multiplyEquation([
+                firstEquaMultiple.toTree(),
+                secondEquaMultiple.toTree(),
+            ]).simplify();
+            if (shouldHandleFirst || shouldHandleSecond) {
+                corr += `
+    
+On multiple la ${shouldHandleFirst
+                    ? `première équation par $${firstEquaMultiple}$`
+                    : `second équation par $${secondEquaMultiple}$`} ${shouldHandleFirst && shouldHandleSecond
+                    ? ` et la deuxième équation par $${secondEquaMultiple}$`
+                    : ""} :
+
+$$
+${sysMultiplied.toTex()}
+$$
+
+`;
+            }
+            const equaMul = sysMultiplied.getEqualNodes();
+            const added = equal(add(equaMul[0].leftChild, equaMul[1].leftChild), add(equaMul[0].rightChild, equaMul[1].rightChild)).simplify();
+            const varName = isX ? "y" : "x";
+            const isolated = added.isolate(varName);
+            const sub = equa1.toDetailedEvaluation({
+                [varName]: isolated.rightChild,
+            });
+            const subSimp = sub.simplify({
+                forbidFactorize: true,
+                forceDistributeFractions: true,
+                towardsDistribute: true,
+            });
+            const subSimpToIsolateButWeShouldnt = sub.simplify({});
+            const isolated2 = subSimpToIsolateButWeShouldnt.isolate(isX ? "x" : "y");
+            corr += `On peut alors additionner les deux équations pour éliminer une des variables et isoler l'autre : 
+
+${alignTex([[added.toTex()], [isolated.toTex()]])}
+
+On remplace maintenant dans la première équation : 
+
+${alignTex([[sub.toTex()], [subSimp.toTex()], [isolated2.toTex()]])}
+`;
+        }
+        return corr;
+    }
 }

package/lib/math/utils/arithmetic/lcm.js

@@ -1,5 +1,5 @@
 import { gcd } from "./gcd.js";
 export const lcm = (a, b) => {
     const pgcd = gcd(a, b);
-    return (a * b) / pgcd;
+    return Math.abs((a * b) / pgcd);
 };

package/lib/playground.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"playground.d.ts","sourceRoot":"","sources":["../src/playground.ts"],"names":[],"mappings":"AA6BA,eAAO,MAAM,UAAU,YAmCtB,CAAC"}
+{"version":3,"file":"playground.d.ts","sourceRoot":"","sources":["../src/playground.ts"],"names":[],"mappings":"AAiCA,eAAO,MAAM,UAAU,YAAW,CAAC"}

package/lib/playground.js

@@ -1,36 +1 @@
-export const playground = () => {
-    // console.log(frac(1.1526241304, 3.5199999999).simplify().toTex());
-    // const ans = "3\\times 4 + 5"
-    // const res = "13"
-    // const allowedNumbers = []
-    // const min = 0
-    // const max = 100
-    // const inAscendingOrder = coinFlip()
-    // try {
-    //   const parsed = parseAlgebraic(ans)
-    //   const parsedRes = valueParser(res)
-    //   if(parsedRes === false){
-    //     return "Résultat incompris"
-    //   }
-    //   const simp = parsed.simplify()
-    //   if(simp.evaluate() !== parsedRes){
-    // //assert résultat est bon
-    //     return "Mauvais calcul"
-    //   }
-    //   if(parsedRes>max || parsedRes < min){
-    //     return "Pas dans l'intervalle"
-    //   }
-    //   const usedNumbers = []
-    //   if(usedNumbers.some((e)=>)){
-    //     return "Vous ne pouvez utiliser chaque nombre qu'une fois"
-    //   }
-    //   if(usedNumbers.length !== allowedNumbers.length){
-    //     return "Vous devez utiliser tous ces nombres et uniquement ceux ci"
-    // }
-    //assert tous les nombres utilisés
-    //assert pas d'autre nombres utilisés
-    //assert utilisés dans l'ordre croissant
-    // } catch(err){
-    //   return "Erreur de syntaxe"
-    // }
-};
+export const playground = () => { };

package/lib/tree/nodes/algebraicNode.d.ts

@@ -9,6 +9,7 @@ export type SimplifyOptions = {
     decimalToFractionsPrecisionAllowed?: boolean;
     forbidAdditions?: boolean;
     forbidTrigo?: boolean;
+    calculatePowers?: boolean;
 };
 export type EvaluateOptions = {
     degreeMode?: boolean;

package/lib/tree/nodes/algebraicNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"algebraicNode.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/algebraicNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAE9C,MAAM,MAAM,eAAe,GAAG;IAC5B,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,kCAAkC,CAAC,EAAE,OAAO,CAAC;IAC7C,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAC5B,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB,CAAC;AACF,MAAM,WAAW,aAAc,SAAQ,IAAI;IACzC,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,eAAe,KAAK,MAAM,CAAC;IAC5E,oBAAoB,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,KAAK,aAAa,CAAC;IAC7E,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,aAAa,EAAE,CAAC;IAC3D,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,eAAe,KAAK,aAAa,CAAC;IACpD,MAAM,EAAE,CAAC,IAAI,EAAE,aAAa,KAAK,OAAO,CAAC;IACzC,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,CAAC,OAAO,CAAC,EAAE,MAAM,KAAK,aAAa,CAAC;CACjD;AACD,8BAAsB,cAAc;;IAElC,OAAO,CAAC,MAAM,CAAC,QAAQ;CAGxB;AACD,eAAO,MAAM,eAAe,SAAU,IAAI,KAAG,IAAI,IAAI,aACX,CAAC"}
+{"version":3,"file":"algebraicNode.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/algebraicNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAE9C,MAAM,MAAM,eAAe,GAAG;IAC5B,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,kCAAkC,CAAC,EAAE,OAAO,CAAC;IAC7C,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAC5B,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB,CAAC;AACF,MAAM,WAAW,aAAc,SAAQ,IAAI;IACzC,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,eAAe,KAAK,MAAM,CAAC;IAC5E,oBAAoB,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,KAAK,aAAa,CAAC;IAC7E,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,aAAa,EAAE,CAAC;IAC3D,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,eAAe,KAAK,aAAa,CAAC;IACpD,MAAM,EAAE,CAAC,IAAI,EAAE,aAAa,KAAK,OAAO,CAAC;IACzC,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,CAAC,OAAO,CAAC,EAAE,MAAM,KAAK,aAAa,CAAC;CACjD;AACD,8BAAsB,cAAc;;IAElC,OAAO,CAAC,MAAM,CAAC,QAAQ;CAGxB;AACD,eAAO,MAAM,eAAe,SAAU,IAAI,KAAG,IAAI,IAAI,aACX,CAAC"}

package/lib/tree/nodes/equations/equalNode.d.ts

@@ -12,6 +12,10 @@ export declare abstract class EqualNodeConstructor {
     static fromIdentifiers(identifiers: EqualNodeIdentifiers): EqualNode;
 }
 export declare const isEqualNode: (node: AlgebraicNode) => node is EqualNode;
+type IsolateOptions = {
+    simpOpts?: SimplifyOptions;
+    steps?: string[];
+};
 export declare class EqualNode implements AlgebraicNode {
     leftChild: AlgebraicNode;
     rightChild: AlgebraicNode;
@@ -27,11 +31,13 @@ export declare class EqualNode implements AlgebraicNode {
     simplify(opts?: SimplifyOptions): EqualNode;
     shuffle(): EqualNode;
     reverse(): EqualNode;
-    isolate(varName: string): EqualNode;
+    isolate(varName: string, opts?: IsolateOptions): EqualNode;
     derivative(varName?: string): AlgebraicNode;
     equals(node: AlgebraicNode): boolean;
     evaluate(vars?: Record<string, number>, opts?: EvaluateOptions): number;
     toDetailedEvaluation(vars: Record<string, AlgebraicNode>): EqualNode;
+    isVerified(): boolean;
 }
 export declare const equationResolutionTex: (a: AlgebraicNode, b: AlgebraicNode, c: AlgebraicNode, d: AlgebraicNode) => string | string[];
+export {};
 //# sourceMappingURL=equalNode.d.ts.map

package/lib/tree/nodes/equations/equalNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"equalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/equalNode.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,aAAa,EACb,eAAe,EACf,eAAe,EAChB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC5D,OAAO,EAEL,eAAe,EAEhB,MAAM,uBAAuB,CAAC;AAQ/B,eAAO,MAAM,KAAK,MACb,aAAa,GAAG,MAAM,GAAG,MAAM,KAC/B,aAAa,GAAG,MAAM,GAAG,MAAM,cAOnC,CAAC;AAEF,MAAM,MAAM,oBAAoB,GAAG;IACjC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC;IAClB,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,IAAI,CAAC,EAAE,WAAW,CAAC;CACpB,CAAC;AAEF,8BAAsB,oBAAoB;IACxC,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,oBAAoB,GAAG,SAAS;CAOrE;AAED,eAAO,MAAM,WAAW,SAAU,aAAa,KAAG,IAAI,IAAI,SACzB,CAAC;AAElC,qBAAa,SAAU,YAAW,aAAa;IAC7C,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,aAAa,IAAI,oBAAoB;IAQrC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAmBpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAM5C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAQ/B,OAAO;IAIP,OAAO;IAIP,OAAO,CAAC,OAAO,EAAE,MAAM;IAiGvB,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,aAAa;IAG3C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAGpC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,eAAe,GAAG,MAAM;IAGvE,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,GAAG,SAAS;CAMrE;AAED,eAAO,MAAM,qBAAqB,MAC7B,aAAa,KACb,aAAa,KACb,aAAa,KACb,aAAa,sBA2DjB,CAAC"}
+{"version":3,"file":"equalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/equalNode.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,aAAa,EACb,eAAe,EACf,eAAe,EAChB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC5D,OAAO,EAEL,eAAe,EAEhB,MAAM,uBAAuB,CAAC;AAQ/B,eAAO,MAAM,KAAK,MACb,aAAa,GAAG,MAAM,GAAG,MAAM,KAC/B,aAAa,GAAG,MAAM,GAAG,MAAM,cAOnC,CAAC;AAEF,MAAM,MAAM,oBAAoB,GAAG;IACjC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC;IAClB,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,IAAI,CAAC,EAAE,WAAW,CAAC;CACpB,CAAC;AAEF,8BAAsB,oBAAoB;IACxC,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,oBAAoB,GAAG,SAAS;CAOrE;AAED,eAAO,MAAM,WAAW,SAAU,aAAa,KAAG,IAAI,IAAI,SACzB,CAAC;AAElC,KAAK,cAAc,GAAG;IACpB,QAAQ,CAAC,EAAE,eAAe,CAAC;IAC3B,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AACF,qBAAa,SAAU,YAAW,aAAa;IAC7C,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,aAAa,IAAI,oBAAoB;IAQrC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAmBpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAM5C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAQ/B,OAAO;IAIP,OAAO;IAIP,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,cAAc;IAsG9C,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,aAAa;IAG3C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAGpC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,eAAe,GAAG,MAAM;IAGvE,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,GAAG,SAAS;IAMpE,UAAU;CAIX;AAED,eAAO,MAAM,qBAAqB,MAC7B,aAAa,KACb,aAAa,KACb,aAAa,KACb,aAAa,sBA2DjB,CAAC"}

package/lib/tree/nodes/equations/equalNode.js

@@ -77,7 +77,7 @@ export class EqualNode {
     reverse() {
         return new EqualNode(this.rightChild, this.leftChild, this.opts);
     }
-    isolate(varName) {
+    isolate(varName, opts) {
         //! bcp d'erreurs ne sont pas gérées, n'utiliser qu'en contexte sain
         //! ne gère que des équations de premier degré
         //!régler le pb des monomNode : faudrait les virer en fait
@@ -91,8 +91,9 @@ export class EqualNode {
         ///simp et recur
         /// si x est dénum, appliquer fct inverse
         ///simp et recur
+        const steps = opts?.steps;
         let right = (0).toTree();
-        const simpOpts = {
+        const simpOpts = opts?.simpOpts ?? {
             towardsDistribute: true,
             forbidFactorize: true,
             forceDistributeFractions: false,
@@ -101,6 +102,9 @@ export class EqualNode {
         // let simp = new EqualNode(left, right);
         let i = 0;
         const recur = () => {
+            if (steps) {
+                steps.push(equal(left, right).toTex());
+            }
             i++;
             if (i > 100)
                 throw new Error("too many iterations in isolate");
@@ -134,12 +138,12 @@ export class EqualNode {
             else if (isMultiplyNode(left)) {
                 const xIsLeft = hasVariableNode(left.leftChild, varName);
                 if (xIsLeft) {
-                    right = frac(right, left.rightChild).simplify();
-                    left = frac(left, left.rightChild).simplify();
+                    right = frac(right, left.rightChild).simplify(simpOpts);
+                    left = frac(left, left.rightChild).simplify(simpOpts);
                 }
                 else {
-                    right = frac(right, left.leftChild).simplify();
-                    left = frac(left, left.leftChild).simplify();
+                    right = frac(right, left.leftChild).simplify(simpOpts);
+                    left = frac(left, left.leftChild).simplify(simpOpts);
                 }
             }
             else if (isFractionNode(left)) {
@@ -161,11 +165,11 @@ export class EqualNode {
                 }
             }
             else if (isOppositeNode(left)) {
-                left = opposite(left).simplify();
-                right = opposite(right).simplify();
+                left = opposite(left).simplify(simpOpts);
+                right = opposite(right).simplify(simpOpts);
             }
             else {
-                throw new Error("Isolation only implemented for basic operations yet");
+                throw new Error(`Isolation only implemented for basic operations yet, var ${varName}, equa ${left.toTex()}=${right.toTex()}`);
             }
             recur();
         };
@@ -190,6 +194,10 @@ export class EqualNode {
     toDetailedEvaluation(vars) {
         return new EqualNode(this.leftChild.toDetailedEvaluation(vars), this.rightChild.toDetailedEvaluation(vars));
     }
+    isVerified() {
+        //!trèèèès basique, ca marhce pour mon cas en cours mais pas en général
+        return this.leftChild.simplify().equals(this.rightChild.simplify());
+    }
 }
 export const equationResolutionTex = (a, b, c, d) => {
     //(+-a)x(+-b) = (+-c)x(+-d)

package/lib/tree/nodes/operators/addNode.js

@@ -420,6 +420,6 @@ const addSimplifyMonoms = (a, b, opts) => {
             return new NumberNode(0);
         return new MonomNode(sum, aMonom.degree, {
             variable: aMonom.variable,
-        });
+        }).toTree();
     }
 };

package/lib/tree/nodes/operators/fractionNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/fractionNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,mBAAmB,CAAC;AAK9E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAKrE,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAKxD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,IAAI,MACZ,aAAa,GAAG,MAAM,GAAG,MAAM,KAC/B,aAAa,GAAG,MAAM,GAAG,MAAM,SAC3B,WAAW,iBAOnB,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG;IACpC,EAAE,EAAE,OAAO,CAAC,QAAQ,CAAC;IACrB,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;CAC7B,CAAC;AACF,qBAAa,YAAa,YAAW,YAAY;IAC/C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB;;;OAGG;IACH,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAiBpB,YAAY,IAAI,MAAM;IAItB,aAAa,IAAI,uBAAuB;IAQxC,UAAU;IAGV,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IA+BpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAG5C,SAAS;IAUT,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IA6BrC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMtC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IA2M/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAOpC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAOxD,mBAAmB;IAQnB,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;CAGxD"}
+{"version":3,"file":"fractionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/fractionNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,mBAAmB,CAAC;AAK9E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAKrE,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAKxD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,IAAI,MACZ,aAAa,GAAG,MAAM,GAAG,MAAM,KAC/B,aAAa,GAAG,MAAM,GAAG,MAAM,SAC3B,WAAW,iBAOnB,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG;IACpC,EAAE,EAAE,OAAO,CAAC,QAAQ,CAAC;IACrB,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;CAC7B,CAAC;AACF,qBAAa,YAAa,YAAW,YAAY;IAC/C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB;;;OAGG;IACH,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAiBpB,YAAY,IAAI,MAAM;IAItB,aAAa,IAAI,uBAAuB;IAQxC,UAAU;IAGV,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IA+BpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAG5C,SAAS;IAUT,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IA6BrC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMtC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAgM/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAOpC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAOxD,mBAAmB;IAQnB,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;CAGxD"}

package/lib/tree/nodes/operators/fractionNode.js

@@ -9,7 +9,7 @@ import { Rational } from "../../../math/numbers/rationals/rational.js";
 import { operatorComposition } from "../../../tree/utilities/operatorComposition.js";
 import { AddNode, isAddNode } from "./addNode.js";
 import { PowerNode, isPowerNode } from "./powerNode.js";
-import { SubstractNode, isSubstractNode } from "./substractNode.js";
+import { SubstractNode, isSubstractNode, substract } from "./substractNode.js";
 import { parseToMonomNode } from "../polynomials/monomNode.js";
 export function isFractionNode(a) {
     return isOperatorNode(a) && a.id === OperatorIds.fraction;
@@ -225,20 +225,14 @@ export class FractionNode {
             if (opts?.forceDistributeFractions &&
                 isNumberNode(denum) &&
                 parsedMonom) {
-                return new MultiplyNode(new FractionNode(parsedMonom.a, denum), parsedMonom.variable.toTree()).simplify(opts);
+                return new MultiplyNode(new FractionNode(parsedMonom.a, denum), parsedMonom.toTree()).simplify(opts);
             }
             if (isFractionNode(denum) && isFractionNode(num)) {
                 return new MultiplyNode(num, new FractionNode(denum.rightChild, denum.leftChild)).simplify(opts);
             }
-            //!ya mieux à faire pour gérer tous les cas d'un coup
-            //!s'insiprer de multiply
-            if (isPowerNode(num) &&
-                isPowerNode(denum) &&
-                num.rightChild.isNumeric &&
-                denum.rightChild.isNumeric &&
-                num.rightChild.evaluate() === denum.rightChild.evaluate()) {
-                return new PowerNode(new FractionNode(num.leftChild, denum.leftChild), num.rightChild).simplify(opts);
-            }
+            const powerSimp = powerSimplify(num, denum, opts);
+            if (powerSimp)
+                return powerSimp;
             if (num.equals(denum))
                 return new NumberNode(1);
             return null;
@@ -312,3 +306,29 @@ export class FractionNode {
         throw new Error("unimplemented derivative");
     }
 }
+const powerSimplify = (num, denum, opts) => {
+    //!ya mieux à faire pour gérer tous les cas d'un coup
+    //!s'insiprer de multiply
+    if (isPowerNode(num) &&
+        isPowerNode(denum) &&
+        num.leftChild.evaluate() === denum.leftChild.evaluate()) {
+        return new PowerNode(num.leftChild, substract(num.rightChild, denum.rightChild)).simplify(opts);
+    }
+    if (isPowerNode(num) &&
+        isNumberNode(denum) &&
+        num.leftChild.evaluate() === denum.evaluate()) {
+        return new PowerNode(num.leftChild, substract(num.rightChild, 1)).simplify(opts);
+    }
+    if (isPowerNode(denum) &&
+        isNumberNode(num) &&
+        num.evaluate() === denum.leftChild.evaluate()) {
+        return new PowerNode(num, substract(1, denum.rightChild)).simplify(opts);
+    }
+    if (isPowerNode(num) &&
+        isPowerNode(denum) &&
+        num.rightChild.isNumeric &&
+        denum.rightChild.isNumeric &&
+        num.rightChild.evaluate() === denum.rightChild.evaluate()) {
+        return new PowerNode(new FractionNode(num.leftChild, denum.leftChild), num.rightChild).simplify(opts);
+    }
+};

package/lib/tree/nodes/operators/powerNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"powerNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/powerNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,mBAAmB,CAAC;AAG9E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAGrE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAErD;AACD,eAAO,MAAM,MAAM,MAAO,aAAa,GAAG,MAAM,GAAG,MAAM,eAKxD,CAAC;AAEF,eAAO,MAAM,KAAK,MACb,aAAa,GAAG,MAAM,GAAG,MAAM,KAC/B,aAAa,GAAG,MAAM,GAAG,MAAM,SAC3B,WAAW,cAOnB,CAAC;AAEF,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAUpB,YAAY,IAAI,MAAM;IAGtB,aAAa;;;;;;;;;IAOb,iBAAiB;IAqBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,MAAM;IAuBlC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMtC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAOxD,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IA8C/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAOpC,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;CAcxD;AAED,qBAAa,UAAW,SAAQ,SAAS;gBAC3B,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;CAIrD"}
+{"version":3,"file":"powerNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/powerNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,mBAAmB,CAAC;AAG9E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAGrE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAErD;AACD,eAAO,MAAM,MAAM,MAAO,aAAa,GAAG,MAAM,GAAG,MAAM,eAKxD,CAAC;AAEF,eAAO,MAAM,KAAK,MACb,aAAa,GAAG,MAAM,GAAG,MAAM,KAC/B,aAAa,GAAG,MAAM,GAAG,MAAM,SAC3B,WAAW,cAOnB,CAAC;AAEF,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAUpB,YAAY,IAAI,MAAM;IAGtB,aAAa;;;;;;;;;IAOb,iBAAiB;IAqBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,MAAM;IAuBlC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMtC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAOxD,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAqD/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAOpC,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;CAcxD;AAED,qBAAa,UAAW,SAAQ,SAAS;gBAC3B,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;CAIrD"}

package/lib/tree/nodes/operators/powerNode.js

@@ -112,6 +112,11 @@ export class PowerNode {
         if (isNumberNode(rightSimplified) && rightSimplified.value === 1) {
             return leftSimplified;
         }
+        if (opts?.calculatePowers &&
+            isNumberNode(leftSimplified) &&
+            isNumberNode(rightSimplified)) {
+            return new NumberNode(leftSimplified.value ** rightSimplified.value);
+        }
         if (isPowerNode(leftSimplified)) {
             return new PowerNode(leftSimplified.leftChild, new MultiplyNode(rightSimplified, leftSimplified.rightChild).simplify(opts)).simplify(opts);
         }

package/lib/tree/nodes/sets/intervalNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/intervalNode.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,aAAa,EACb,eAAe,EACf,eAAe,EAChB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,eAAe,EAAkB,MAAM,uBAAuB,CAAC;AAOxE,OAAO,EAAW,WAAW,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EAAE,eAAe,EAAY,MAAM,sBAAsB,CAAC;AACjE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,cAAc,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAE3D,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,8BAAsB,uBAAuB;IAC3C,MAAM,CAAC,MAAM;IA2Cb,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,MAAM;IAYlC,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,uBAAuB;CAQpD;AAED,MAAM,MAAM,uBAAuB,GAAG;IACpC,EAAE,EAAE,OAAO,CAAC;IACZ,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,OAAO,EAAE,WAAW,CAAC;IACrB,IAAI,CAAC,EAAE,WAAW,CAAC;CACpB,CAAC;AACF,qBAAa,YAAa,YAAW,OAAO;IAC1C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,OAAO,EAAE,WAAW,CAAC;IACrB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,OAAO,CAAC;gBAGjB,CAAC,EAAE,aAAa,EAChB,CAAC,EAAE,aAAa,EAChB,OAAO,EAAE,WAAW,EACpB,IAAI,CAAC,EAAE,WAAW;IAYpB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW;IAMjC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAoBpC,YAAY,CAAC,WAAW,CAAC,EAAE,aAAa;IA4BxC,YAAY;IAIZ,MAAM,CAAC,CAAC,EAAE,aAAa;IASvB,iBAAiB;IAGjB,qBAAqB;IAGrB,sBAAsB;IAGtB,wBAAwB;IAYxB,YAAY;IAkCZ,KAAK;IAWL,SAAS,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAOvC,aAAa,IAAI,uBAAuB;IAUxC,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO;IAiB7C,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAQ/B,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,aAAa;IAG3C,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,eAAe;IAG9D,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IASxD,YAAY;IAGZ,aAAa;IAGb,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,OAAO;IAanC,UAAU,CAAC,QAAQ,EAAE,YAAY;IAEjC,YAAY,CAAC,QAAQ,EAAE,YAAY;IAwDnC,YAAY;IAIZ,KAAK,CAAC,QAAQ,EAAE,YAAY,GAAG,YAAY,GAAG,iBAAiB;CAkDhE"}
+{"version":3,"file":"intervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/intervalNode.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,aAAa,EACb,eAAe,EACf,eAAe,EAChB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,eAAe,EAAkB,MAAM,uBAAuB,CAAC;AAOxE,OAAO,EAAW,WAAW,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EAAE,eAAe,EAAY,MAAM,sBAAsB,CAAC;AACjE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,cAAc,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAE3D,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,8BAAsB,uBAAuB;IAC3C,MAAM,CAAC,MAAM;IA2Cb,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,MAAM;IAYlC,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,uBAAuB;CAQpD;AAED,MAAM,MAAM,uBAAuB,GAAG;IACpC,EAAE,EAAE,OAAO,CAAC;IACZ,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,OAAO,EAAE,WAAW,CAAC;IACrB,IAAI,CAAC,EAAE,WAAW,CAAC;CACpB,CAAC;AACF,qBAAa,YAAa,YAAW,OAAO;IAC1C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,OAAO,EAAE,WAAW,CAAC;IACrB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,OAAO,CAAC;gBAGjB,CAAC,EAAE,aAAa,EAChB,CAAC,EAAE,aAAa,EAChB,OAAO,EAAE,WAAW,EACpB,IAAI,CAAC,EAAE,WAAW;IAYpB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW;IAMjC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAoBpC,YAAY,CAAC,WAAW,CAAC,EAAE,aAAa;IA4BxC,YAAY;IAIZ,MAAM,CAAC,CAAC,EAAE,aAAa;IASvB,iBAAiB;IAGjB,qBAAqB;IAGrB,sBAAsB;IAGtB,wBAAwB;IAYxB,YAAY;IAkCZ,KAAK;IAWL,SAAS,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAOvC,aAAa,IAAI,uBAAuB;IAUxC,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO;IAiB7C,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAQ/B,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,aAAa;IAG3C,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,eAAe;IAG9D,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IASxD,YAAY;IAGZ,aAAa;IAGb,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,OAAO;IAanC,UAAU,CAAC,QAAQ,EAAE,YAAY;IAEjC,YAAY,CAAC,QAAQ,EAAE,YAAY;IA0DnC,YAAY;IAIZ,KAAK,CAAC,QAAQ,EAAE,YAAY,GAAG,YAAY,GAAG,iBAAiB;CAkDhE"}

package/lib/tree/nodes/sets/intervalNode.js

@@ -252,7 +252,9 @@ export class IntervalNode {
         if (ordered[0].includes(ordered[1].a) ||
             Math.abs(thisA - otherA) < 0.0000000001) {
             if (Math.abs(orderedEv[0][1] - orderedEv[1][0]) < 0.0000000001) {
-                return new DiscreteSetNode([ordered[1].a]);
+                if (ordered[0].isRightClosed() && ordered[1].isLeftClosed())
+                    return new DiscreteSetNode([ordered[1].a]);
+                return EmptySet;
             }
             let leftBracket = "[";
             if (Math.abs(thisA - otherA) < 0.0000000001) {

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "math-exercises",
   "type": "module",
-  "version": "3.0.56",
+  "version": "3.0.57",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [