math-exercises 3.0.216 → 3.0.218

package/lib/exercises/math/graphs/graphsCheckIsSameGraph.js

@@ -10,7 +10,6 @@ import { randint } from "../../../math/utils/random/randint.js";
 import { coinFlip } from "../../../utils/alea/coinFlip.js";
 import { probaLawFlip } from "../../../utils/alea/probaLawFlip.js";
 import { random, randomMany } from "../../../utils/alea/random.js";
-import { shuffle } from "../../../utils/alea/shuffle.js";
 const getHydrated = (identifiers) => {
     const { graphIds1, graphIds2, graphNodes1, graphEdges1, graphNodes2, graphEdges2, } = identifiers;
     const [graph1, graph2] = [graphIds1, graphIds2].map((graphIds) => GraphConstructor.fromIdentifiers(graphIds));
@@ -90,7 +89,7 @@ Ce sont donc des graphes différents.`;
 //   });
 // };
 const getGGBOptions = (identifiers) => {
-    const { graphNodes1, graphEdges1, scale1, graphNodes2, graphEdges2, scale2 } = identifiers;
+    const { graphNodes1, graphEdges1, graphNodes2, graphEdges2 } = identifiers;
     const { graph1, graph2 } = getHydrated(identifiers);
     function createDisplayObjForGraph(graph, graphNodes, graphEdges, scale, index, vecOffset = new Vector("offset", (0).toTree(), (0).toTree())) {
         const arrDictPoint = graphNodes
@@ -121,12 +120,12 @@ const getGGBOptions = (identifiers) => {
             arrGGBCommandForGraph,
         };
     }
-    const { arrPoint: arrPoint1, arrGGBCommandForGraph: arrGGBCommandForGraph1 } = createDisplayObjForGraph(graph1, graphNodes1, graphEdges1, scale1, 1);
+    const { arrPoint: arrPoint1, arrGGBCommandForGraph: arrGGBCommandForGraph1 } = createDisplayObjForGraph(graph1, graphNodes1, graphEdges1, 1, 1);
     const xMin1 = Math.min(...arrPoint1.map((point) => point.x.evaluate()));
     const xMax1 = Math.max(...arrPoint1.map((point) => point.x.evaluate()));
     const width1 = xMax1 - xMin1;
     const vecOffset = new Vector("offset", (xMax1 + 0.1 * width1).toTree(), (0).toTree());
-    const { arrPoint: arrPoint2, arrGGBCommandForGraph: arrGGBCommandForGraph2 } = createDisplayObjForGraph(graph2, graphNodes2, graphEdges2, scale2, 2, vecOffset);
+    const { arrPoint: arrPoint2, arrGGBCommandForGraph: arrGGBCommandForGraph2 } = createDisplayObjForGraph(graph2, graphNodes2, graphEdges2, 1, 2, vecOffset);
     const ggb = new GeogebraConstructor({
         commands: [...arrGGBCommandForGraph1, ...arrGGBCommandForGraph2],
         fontSize: 16,
@@ -230,23 +229,14 @@ const createRandomIdentifiers = (isDirected) => {
             }
         }
     })();
-    const [[layoutEngine1, scale1], [layoutEngine2, scale2]] = shuffle([
-        ["fdp", 1.5],
-        ["circo", 1.0],
-    ]);
-    const [{ nodes: graphNodes1, edges: graphEdges1 }, { nodes: graphNodes2, edges: graphEdges2 },] = [
-        { graph: graph1, layoutEngine: layoutEngine1 },
-        { graph: graph2, layoutEngine: layoutEngine2 },
-    ].map(({ graph, layoutEngine }) => GraphRenderer.renderToNodesAndEdges(graph, layoutEngine));
+    const [{ nodes: graphNodes1, edges: graphEdges1 }, { nodes: graphNodes2, edges: graphEdges2 },] = [{ graph: graph1 }, { graph: graph2 }].map(({ graph }) => GraphRenderer.renderToNodesAndEdges(graph));
     const identifiers = {
         graphIds1: graph1.toIdentifiers(),
         graphIds2: graph2.toIdentifiers(),
         graphNodes1,
         graphEdges1,
-        scale1,
         graphNodes2,
         graphEdges2,
-        scale2,
     };
     return identifiers;
 };

package/lib/exercises/math/graphs/graphsCheckIsVerticesAdjacent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graphsCheckIsVerticesAdjacent.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/graphs/graphsCheckIsVerticesAdjacent.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAAoB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAChF,OAAO,EACL,SAAS,EACT,SAAS,EAEV,MAAM,0CAA0C,CAAC;AAMlD,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IAGpB,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,UAAU,EAAE,SAAS,EAAE,CAAC;CACzB,CAAC;AAkOF,KAAK,OAAO,GAAG;IACb,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAsBF,eAAO,MAAM,6BAA6B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAkBxE,CAAC"}
+{"version":3,"file":"graphsCheckIsVerticesAdjacent.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/graphs/graphsCheckIsVerticesAdjacent.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAAoB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAChF,OAAO,EACL,SAAS,EACT,SAAS,EAEV,MAAM,0CAA0C,CAAC;AAMlD,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IAGpB,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,UAAU,EAAE,SAAS,EAAE,CAAC;CACzB,CAAC;AAoOF,KAAK,OAAO,GAAG;IACb,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAsBF,eAAO,MAAM,6BAA6B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAkBxE,CAAC"}

package/lib/exercises/math/graphs/graphsCheckIsVerticesAdjacent.js

@@ -24,7 +24,9 @@ const getHydrated = (identifiers) => {
 const getInstruction = (identifiers) => {
     const { nameVertex1, nameVertex2 } = identifiers;
     return `Un graphe est représenté ci-dessous.
-Les sommets $${nameVertex1}$ et $${nameVertex2}$ sont-ils adjacents ?`;
+Les sommets $${nameVertex1}$ et $${nameVertex2}$ sont-ils adjacents ?
+
+*On peut déplacer les points sur la figure.*`;
 };
 const getAnswer = (identifiers) => {
     const { isAdjacent } = getHydrated(identifiers);

package/lib/exercises/math/graphs/graphsDegreeOfVertex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graphsDegreeOfVertex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/graphs/graphsDegreeOfVertex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAoBT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAAoB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAChF,OAAO,EACL,SAAS,EACT,SAAS,EAEV,MAAM,0CAA0C,CAAC;AASlD,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IAGnB,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,UAAU,EAAE,SAAS,EAAE,CAAC;CACzB,CAAC;AAmQF,KAAK,OAAO,GAAG;IACb,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAsBF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAe/D,CAAC"}
+{"version":3,"file":"graphsDegreeOfVertex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/graphs/graphsDegreeOfVertex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAoBT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAAoB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAChF,OAAO,EACL,SAAS,EACT,SAAS,EAEV,MAAM,0CAA0C,CAAC;AASlD,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IAGnB,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,UAAU,EAAE,SAAS,EAAE,CAAC;CACzB,CAAC;AAqQF,KAAK,OAAO,GAAG;IACb,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAsBF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAe/D,CAAC"}

package/lib/exercises/math/graphs/graphsDegreeOfVertex.js

@@ -27,7 +27,9 @@ const getHydrated = (identifiers) => {
 const getInstruction = (identifiers) => {
     const { nameVertexAsked } = getHydrated(identifiers);
     return `Un graphe est représenté ci-dessous.
-Quel est le degré du sommet $${nameVertexAsked}$ ?`;
+Quel est le degré du sommet $${nameVertexAsked}$ ?
+
+*On peut déplacer les points sur la figure.*`;
 };
 const getAnswerNode = (identifiers) => {
     const { arrNameVertexAdjacent } = getHydrated(identifiers);

package/lib/exercises/math/graphs/graphsOrderOfGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graphsOrderOfGraph.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/graphs/graphsOrderOfGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAoBT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAAoB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAChF,OAAO,EACL,SAAS,EACT,SAAS,EAEV,MAAM,0CAA0C,CAAC;AAUlD,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAG3B,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,UAAU,EAAE,SAAS,EAAE,CAAC;CACzB,CAAC;AAoPF,KAAK,OAAO,GAAG;IACb,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAsBF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAe7D,CAAC"}
+{"version":3,"file":"graphsOrderOfGraph.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/graphs/graphsOrderOfGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAoBT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAAoB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAChF,OAAO,EACL,SAAS,EACT,SAAS,EAEV,MAAM,0CAA0C,CAAC;AAUlD,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAG3B,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,UAAU,EAAE,SAAS,EAAE,CAAC;CACzB,CAAC;AAsPF,KAAK,OAAO,GAAG;IACb,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAsBF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAe7D,CAAC"}

package/lib/exercises/math/graphs/graphsOrderOfGraph.js

@@ -23,7 +23,9 @@ const getHydrated = (identifiers) => {
 };
 const getInstruction = () => {
     return `Un graphe est représenté ci-dessous.
-Quel est son ordre ?`;
+Quel est son ordre ?
+
+*On peut déplacer les points sur la figure.*`;
 };
 const getAnswerNode = (identifiers) => {
     const { graph } = getHydrated(identifiers);

package/lib/exercises/math/graphs/index.d.ts

@@ -2,7 +2,7 @@ export * from "./graphsOrderOfGraph.js";
 export * from "./graphsDegreeOfVertex.js";
 export * from "./graphsCheckIsVerticesAdjacent.js";
 export * from "./graphsCheckIsSameGraph.js";
-export * from "./graphsCheckIsConnectedUndirectedGraph.js";
+export * from "./graphsCheckIsConnectedGraph.js";
 export * from "./graphsChainOrPathOfLengthN.js";
 export * from "./edgesNumberFromSummitsDegrees.js";
 export * from "./adjacentMatrixPath.js";

package/lib/exercises/math/graphs/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/graphs/index.ts"],"names":[],"mappings":"AAAA,cAAc,yBAAyB,CAAC;AACxC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,oCAAoC,CAAC;AACnD,cAAc,6BAA6B,CAAC;AAC5C,cAAc,4CAA4C,CAAC;AAC3D,cAAc,iCAAiC,CAAC;AAChD,cAAc,oCAAoC,CAAC;AACnD,cAAc,yBAAyB,CAAC;AACxC,cAAc,sCAAsC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/graphs/index.ts"],"names":[],"mappings":"AAAA,cAAc,yBAAyB,CAAC;AACxC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,oCAAoC,CAAC;AACnD,cAAc,6BAA6B,CAAC;AAC5C,cAAc,kCAAkC,CAAC;AACjD,cAAc,iCAAiC,CAAC;AAChD,cAAc,oCAAoC,CAAC;AACnD,cAAc,yBAAyB,CAAC;AACxC,cAAc,sCAAsC,CAAC"}

package/lib/exercises/math/graphs/index.js

@@ -2,7 +2,7 @@ export * from "./graphsOrderOfGraph.js";
 export * from "./graphsDegreeOfVertex.js";
 export * from "./graphsCheckIsVerticesAdjacent.js";
 export * from "./graphsCheckIsSameGraph.js";
-export * from "./graphsCheckIsConnectedUndirectedGraph.js";
+export * from "./graphsCheckIsConnectedGraph.js";
 export * from "./graphsChainOrPathOfLengthN.js";
 export * from "./edgesNumberFromSummitsDegrees.js";
 export * from "./adjacentMatrixPath.js";

package/lib/exercises/math/integration/fromExpr/integralFromExpr.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"integralFromExpr.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/integration/fromExpr/integralFromExpr.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAcrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAe7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,aAAa,EAAE,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;IAClD,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAqWF,KAAK,OAAO,GAAG;IACb,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB,CAAC;AA2CF,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAe3D,CAAC"}
+{"version":3,"file":"integralFromExpr.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/integration/fromExpr/integralFromExpr.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAcrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAe7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,aAAa,EAAE,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;IAClD,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAuWF,KAAK,OAAO,GAAG;IACb,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB,CAAC;AA2CF,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAe3D,CAAC"}

package/lib/exercises/math/integration/fromExpr/integralFromExpr.js

@@ -252,7 +252,9 @@ const isIdentifiersQCPassed = (identifiers) => {
     const isExploding = (identifiers) => {
         let isExploding = false;
         try {
+            //anything that contain exploding simplify()
             getAnswer(identifiers);
+            getCorrection(identifiers);
         }
         catch (_) {
             isExploding = true;

package/lib/exercises/math/limits/rationalFracLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/rationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAcrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,UAAU,GAAG,UAAU,CAAC;IACjC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAwHF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAanD,CAAC"}
+{"version":3,"file":"rationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/rationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAcrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,UAAU,GAAG,UAAU,CAAC;IACjC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAoGF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAanD,CAAC"}

package/lib/exercises/math/limits/rationalFracLimit.js

@@ -1,12 +1,13 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
+import { rationalVEA } from "../../../exercises/vea/rationalVEA.js";
 import { Rational } from "../../../math/numbers/rationals/rational.js";
 import { Monom } from "../../../math/polynomials/monom.js";
 import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
-import { NumberNode } from "../../../tree/nodes/numbers/numberNode.js";
 import { coinFlip } from "../../../utils/alea/coinFlip.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
+import { handleVEAError } from "../../../utils/errors/handleVEAError.js";
 const getInstruction = (identifiers) => {
     const { numCoeffs, denumCoeffs, limitTo: to } = identifiers;
     const polyNum = new Polynomial(numCoeffs);
@@ -79,27 +80,15 @@ const getPropositions = (n, { answer, denumCoeffs, numCoeffs }) => {
     });
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { denumCoeffs, numCoeffs, limitTo }) => {
-    const numDegree = numCoeffs.length - 1;
-    const denumDegree = denumCoeffs.length - 1;
-    const numLeadingCoeff = numCoeffs[numDegree];
-    const denumLeadingCoeff = denumCoeffs[denumDegree];
-    const leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
-        .simplify()
-        .toTree({ allowFractionToDecimal: true });
-    let answer;
-    if (denumDegree === numDegree) {
-        answer = leadingCoeffsRational;
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        if (answer.includes("infty"))
+            return ans === answer;
+        return rationalVEA(ans, answer);
     }
-    else if (denumDegree > numDegree) {
-        answer = new NumberNode(0);
-    }
-    else {
-        const tempPoly = new Monom(numDegree - denumDegree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
-        answer = tempPoly.getLimitNode(limitTo);
+    catch (err) {
+        return handleVEAError(err);
     }
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
 };
 export const rationalFracLimit = {
     id: "rationalFracLimit",

package/lib/exercises/math/limits/sequences/sequenceRationalFracLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/limits/sequences/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAgIF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/limits/sequences/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AA+GF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}

package/lib/exercises/math/limits/sequences/sequenceRationalFracLimit.js

@@ -1,11 +1,12 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { rationalVEA } from "../../../../exercises/vea/rationalVEA.js";
 import { Rational } from "../../../../math/numbers/rationals/rational.js";
 import { Monom } from "../../../../math/polynomials/monom.js";
 import { Polynomial, PolynomialConstructor, } from "../../../../math/polynomials/polynomial.js";
 import { randint } from "../../../../math/utils/random/randint.js";
-import { NumberNode } from "../../../../tree/nodes/numbers/numberNode.js";
 import { shuffle } from "../../../../utils/alea/shuffle.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
 const getInstruction = (identifiers) => {
     const { numCoeffs, denumCoeffs } = identifiers;
     const polyNum = new Polynomial(numCoeffs, "n");
@@ -77,27 +78,15 @@ const getPropositions = (n, { answer, numCoeffs, denumCoeffs }) => {
     });
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { denumCoeffs, numCoeffs }) => {
-    const numDegree = numCoeffs.length - 1;
-    const denumDegree = denumCoeffs.length - 1;
-    const numLeadingCoeff = numCoeffs[numDegree];
-    const denumLeadingCoeff = denumCoeffs[denumDegree];
-    const leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
-        .simplify()
-        .toTree({ allowFractionToDecimal: true });
-    let answer;
-    if (denumDegree === numDegree) {
-        answer = leadingCoeffsRational;
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        if (answer.includes("infty"))
+            return ans === answer;
+        return rationalVEA(ans, answer);
     }
-    else if (denumDegree > numDegree) {
-        answer = new NumberNode(0);
-    }
-    else {
-        const tempPoly = new Monom(numDegree - denumDegree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
-        answer = tempPoly.getLimitNode("+\\infty");
+    catch (err) {
+        return handleVEAError(err);
     }
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
 };
 export const sequenceRationalFracLimit = {
     id: "sequenceRationalFracLimit",

package/lib/exercises/math/sequences/geometric/geometricFindExplicitFormula.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"geometricFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/geometric/geometricFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAcrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AA+HF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAe9D,CAAC"}
+{"version":3,"file":"geometricFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/geometric/geometricFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AA4GF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAe9D,CAAC"}

package/lib/exercises/math/sequences/geometric/geometricFindExplicitFormula.js

@@ -2,13 +2,11 @@ import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../../exercis
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { randint } from "../../../../math/utils/random/randint.js";
 import { NumberNode } from "../../../../tree/nodes/numbers/numberNode.js";
-import { EqualNode, isEqualNode, } from "../../../../tree/nodes/equations/equalNode.js";
 import { MultiplyNode } from "../../../../tree/nodes/operators/multiplyNode.js";
 import { PowerNode } from "../../../../tree/nodes/operators/powerNode.js";
 import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
 import { shuffle } from "../../../../utils/alea/shuffle.js";
-import { parseLatex } from "../../../../tree/parsers/latexParser.js";
-import { substract } from "../../../../tree/nodes/operators/substractNode.js";
+import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
 const getInstruction = (identifiers) => {
     const { firstValue, reason } = identifiers;
     const firstRank = 0;
@@ -19,7 +17,7 @@ Donner l'expression de $u_n$ en fonction de $n$.`;
 const getAnswer = (identifiers) => {
     const { firstValue, reason } = identifiers;
     const formula = new MultiplyNode(new NumberNode(firstValue), new PowerNode(new NumberNode(reason), new VariableNode("n")));
-    const answer = "u_n=" + formula.toTex();
+    const answer = formula.toTex();
     return answer;
 };
 const getHint = () => {
@@ -45,14 +43,14 @@ où $u_0$ est le premier terme et $r$ la raison.
 Ici, puisque $u_0 = ${firstValue}$ et $r = ${reason}$, on a : 
 
 $$
-${answer}
+u_n = ${answer}
 $$`;
 };
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         instruction: getInstruction(identifiers),
         answer: getAnswer(identifiers),
-        keys: ["un", "equal", "n"],
+        keys: ["n"],
         answerFormat: "tex",
         identifiers,
         hint: getHint(identifiers),
@@ -62,39 +60,24 @@ const getQuestionFromIdentifiers = (identifiers) => {
 };
 const getGeometricFindExplicitFormula = () => {
     const firstValue = randint(1, 10);
-    const reason = randint(2, 10);
+    const reason = randint(2, 10, [firstValue]);
     const identifiers = { reason, firstValue };
     return getQuestionFromIdentifiers(identifiers);
 };
 const getPropositions = (n, { answer, reason, firstValue }) => {
     const propositions = [];
     addValidProp(propositions, answer);
-    tryToAddWrongProp(propositions, "u_n=" +
-        new MultiplyNode(new NumberNode(reason), new PowerNode(new NumberNode(firstValue), new VariableNode("n"))).toTex());
+    tryToAddWrongProp(propositions, new MultiplyNode(new NumberNode(reason), new PowerNode(new NumberNode(firstValue), new VariableNode("n"))).toTex());
     propWhile(propositions, n, () => {
         const wrongAnswer = new MultiplyNode(new NumberNode(firstValue + randint(-firstValue, 2 * firstValue + 1)), new PowerNode(new NumberNode(reason + +randint(-reason + 1, 2 * reason + 1)), new VariableNode("n")));
-        tryToAddWrongProp(propositions, "u_n=" + wrongAnswer.toTex());
+        tryToAddWrongProp(propositions, wrongAnswer.toTex());
     });
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { reason, firstValue }) => {
-    const formula = new MultiplyNode(new NumberNode(firstValue), new PowerNode(new NumberNode(reason), new VariableNode("n")));
-    const equal = new EqualNode(new VariableNode("u_n"), formula, {
-        allowRawRightChildAsSolution: true,
-    });
-    const texs = equal.toAllValidTexs();
-    return (texs.includes(ans) ||
-        (() => {
-            const refinedAns = ans.replace("u_n", "").replace("=", "");
-            let nodeAns = parseLatex(refinedAns);
-            if (isEqualNode(nodeAns)) {
-                nodeAns = nodeAns.rightChild;
-            }
-            const differenceNode = substract(nodeAns, formula);
-            return (differenceNode.evaluate({ n: 0 }) === 0 &&
-                differenceNode.evaluate({ n: 1 }) === 0 &&
-                differenceNode.evaluate({ n: 5 }) === 0);
-        })());
+const isAnswerValid = (ans, { answer }) => {
+    const trimed = ans.replace("u_n=", "").replace("u_{n}=", "");
+    return (parseAlgebraic(trimed).simplify({}).toTex() ===
+        parseAlgebraic(answer.replace("u_n=", "")).simplify().toTex());
 };
 export const geometricFindExplicitFormula = {
     id: "geometricFindExplicitFormula",

package/lib/exercises/math/sequences/geometric/geometricFindExplicitFormulaFirstRankOne.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"geometricFindExplicitFormulaFirstRankOne.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/geometric/geometricFindExplicitFormulaFirstRankOne.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAoIF,eAAO,MAAM,wCAAwC,EAAE,QAAQ,CAAC,WAAW,CAe1E,CAAC"}
+{"version":3,"file":"geometricFindExplicitFormulaFirstRankOne.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/geometric/geometricFindExplicitFormulaFirstRankOne.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAmHF,eAAO,MAAM,wCAAwC,EAAE,QAAQ,CAAC,WAAW,CAe1E,CAAC"}

package/lib/exercises/math/sequences/geometric/geometricFindExplicitFormulaFirstRankOne.js

@@ -2,12 +2,11 @@ import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../../exercis
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { randint } from "../../../../math/utils/random/randint.js";
 import { NumberNode } from "../../../../tree/nodes/numbers/numberNode.js";
-import { EqualNode } from "../../../../tree/nodes/equations/equalNode.js";
 import { MultiplyNode } from "../../../../tree/nodes/operators/multiplyNode.js";
 import { PowerNode } from "../../../../tree/nodes/operators/powerNode.js";
 import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
 import { shuffle } from "../../../../utils/alea/shuffle.js";
-import { parseLatex } from "../../../../tree/parsers/latexParser.js";
+import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
 import { substract } from "../../../../tree/nodes/operators/substractNode.js";
 const getInstruction = (identifiers) => {
     const { firstValue, reason } = identifiers;
@@ -19,7 +18,7 @@ Donner l'expression de $u_n$ en fonction de $n$.`;
 const getAnswer = (identifiers) => {
     const { firstValue, reason } = identifiers;
     const formula = new MultiplyNode(new NumberNode(firstValue), new PowerNode(new NumberNode(reason), substract("n", 1)));
-    const answer = "u_n=" + formula.toTex();
+    const answer = formula.toTex();
     return answer;
 };
 const getHint = () => {
@@ -45,14 +44,14 @@ où $u_1$ est le premier terme et $q$ la raison.
 Ici, puisque $u_1 = ${firstValue}$ et $q = ${reason}$, on a : 
 
 $$
-${answer}
+u_n = ${answer}
 $$`;
 };
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         instruction: getInstruction(identifiers),
         answer: getAnswer(identifiers),
-        keys: ["un", "equal", "n"],
+        keys: ["n"],
         answerFormat: "tex",
         identifiers,
         hint: getHint(identifiers),
@@ -62,39 +61,25 @@ const getQuestionFromIdentifiers = (identifiers) => {
 };
 const getGeometricFindExplicitFormula = () => {
     const firstValue = randint(1, 10);
-    const reason = randint(2, 10);
+    const reason = randint(2, 10, [firstValue]);
     const identifiers = { reason, firstValue };
     return getQuestionFromIdentifiers(identifiers);
 };
 const getPropositions = (n, { answer, reason, firstValue }) => {
     const propositions = [];
     addValidProp(propositions, answer);
-    tryToAddWrongProp(propositions, "u_n=" +
-        new MultiplyNode(new NumberNode(firstValue), new PowerNode(new NumberNode(reason), new VariableNode("n"))).toTex());
-    tryToAddWrongProp(propositions, "u_n=" +
-        new MultiplyNode(new NumberNode(reason), new PowerNode(new NumberNode(firstValue), substract("n", 1))).toTex());
+    tryToAddWrongProp(propositions, new MultiplyNode(new NumberNode(firstValue), new PowerNode(new NumberNode(reason), new VariableNode("n"))).toTex());
+    tryToAddWrongProp(propositions, new MultiplyNode(new NumberNode(reason), new PowerNode(new NumberNode(firstValue), substract("n", 1))).toTex());
     propWhile(propositions, n, () => {
         const wrongAnswer = new MultiplyNode(new NumberNode(firstValue + randint(-firstValue, 2 * firstValue + 1)), new PowerNode(new NumberNode(reason + +randint(-reason + 1, 2 * reason + 1)), substract("n", 1)));
-        tryToAddWrongProp(propositions, "u_n=" + wrongAnswer.toTex());
+        tryToAddWrongProp(propositions, wrongAnswer.toTex());
     });
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { reason, firstValue }) => {
-    const formula = new MultiplyNode(new NumberNode(firstValue), new PowerNode(new NumberNode(reason), substract("n", 1)));
-    const equal = new EqualNode(new VariableNode("u_n"), formula, {
-        allowRawRightChildAsSolution: true,
-    });
-    const texs = equal.toAllValidTexs();
-    return (texs.includes(ans) ||
-        (() => {
-            const splitted = ans.split("=");
-            const rightTerm = splitted[1] ?? splitted[0];
-            const nodeAns = parseLatex(rightTerm);
-            const differenceNode = substract(nodeAns, formula);
-            return (differenceNode.evaluate({ n: 0 }) === 0 &&
-                differenceNode.evaluate({ n: 1 }) === 0 &&
-                differenceNode.evaluate({ n: 5 }) === 0);
-        })());
+const isAnswerValid = (ans, { answer }) => {
+    const trimed = ans.replace("u_n=", "").replace("u_{n}=", "");
+    return (parseAlgebraic(trimed).simplify({}).toTex() ===
+        parseAlgebraic(answer.replace("u_n=", "")).simplify().toTex());
 };
 export const geometricFindExplicitFormulaFirstRankOne = {
     id: "geometricFindExplicitFormulaFirstRankOne",

package/lib/exercises/math/spaceGeometry/parametricLine/lineLineRelativePositionsFromParametricLines.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lineLineRelativePositionsFromParametricLines.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/parametricLine/lineLineRelativePositionsFromParametricLines.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAGL,sBAAsB,EACvB,MAAM,oCAAoC,CAAC;AAgH5C,KAAK,YAAY,GAAG;IAClB,aAAa,EAAE,qBAAqB,CAAC;IACrC,cAAc,EAAE,sBAAsB,CAAC;CACxC,CAAC;AAEF,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,qBAAqB,EAAE,CAAC;IACzC,YAAY,EAAE,YAAY,EAAE,CAAC;CAC9B,CAAC;AAyTF,eAAO,MAAM,4CAA4C,EAAE,QAAQ,CAAC,WAAW,CAoB5E,CAAC"}
+{"version":3,"file":"lineLineRelativePositionsFromParametricLines.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/parametricLine/lineLineRelativePositionsFromParametricLines.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAGL,sBAAsB,EACvB,MAAM,oCAAoC,CAAC;AAgH5C,KAAK,YAAY,GAAG;IAClB,aAAa,EAAE,qBAAqB,CAAC;IACrC,cAAc,EAAE,sBAAsB,CAAC;CACxC,CAAC;AAEF,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,qBAAqB,EAAE,CAAC;IACzC,YAAY,EAAE,YAAY,EAAE,CAAC;CAC9B,CAAC;AA6XF,eAAO,MAAM,4CAA4C,EAAE,QAAQ,CAAC,WAAW,CAoB5E,CAAC"}

package/lib/exercises/math/spaceGeometry/parametricLine/lineLineRelativePositionsFromParametricLines.js

@@ -1,8 +1,8 @@
 import { addValidProp, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { ParametricLine } from "../../../../math/geometry/parametricLine.js";
-import { SpacePointConstructor, } from "../../../../math/geometry/spacePoint.js";
-import { SpaceVectorConstructor, } from "../../../../math/geometry/spaceVector.js";
+import { SpacePoint, SpacePointConstructor, } from "../../../../math/geometry/spacePoint.js";
+import { SpaceVector, SpaceVectorConstructor, } from "../../../../math/geometry/spaceVector.js";
 import { nodeBySubstitutingVar } from "../../../../math/utils/functions/functionComposition.js";
 import { randint } from "../../../../math/utils/random/randint.js";
 import { frac } from "../../../../tree/nodes/operators/fractionNode.js";
@@ -293,8 +293,61 @@ const createRandomIdentifiers = () => {
     };
     return identifiers;
 };
+const isIdentifiersQCPassed = (identifiers) => {
+    const isExploding = (identifiers) => {
+        let isExploding = false;
+        try {
+            //ensure only one valid proposition
+            const n = 4;
+            const answer = getAnswer(identifiers);
+            const propositions = getPropositions(n, { answer, ...identifiers });
+            const nbRightAnswers = propositions.filter((proposition) => proposition.isRightAnswer).length;
+            if (nbRightAnswers !== 1) {
+                throw new Error("nbRightAnswers !== 1");
+            }
+        }
+        catch (_) {
+            isExploding = true;
+        }
+        return isExploding;
+    };
+    return !isExploding(identifiers);
+};
+const createQCPassedIdentifiers = () => {
+    let identifiers;
+    let counter = -1;
+    let isValid = false;
+    while (!isValid && counter < 100) {
+        counter++;
+        const identifiersCandidate = createRandomIdentifiers();
+        isValid = isIdentifiersQCPassed(identifiersCandidate);
+        if (isValid) {
+            identifiers = identifiersCandidate;
+        }
+    }
+    if (!isValid) {
+        const vec1 = new SpaceVector("v1", (1).toTree(), (0).toTree(), (0).toTree());
+        const vec2 = new SpaceVector("v2", (2).toTree(), (0).toTree(), (0).toTree());
+        const A = new SpacePoint("A", (0).toTree(), (1).toTree(), (0).toTree());
+        const B = new SpacePoint("B", (0).toTree(), (0).toTree(), (2).toTree());
+        const identifiersDefault = {
+            spacePointIdsAB: [A, B].map((spacePoint) => spacePoint.toIdentifiers()),
+            spaceLineIds: [
+                [A, vec1],
+                [B, vec2],
+            ].map(([spacePoint, spaceVector]) => {
+                return {
+                    spacePointIds: spacePoint.toIdentifiers(),
+                    spaceVectorIds: spaceVector.toIdentifiers(),
+                };
+            }),
+        };
+        identifiers = identifiersDefault;
+    }
+    return identifiers;
+};
 const getLineLineRelativePositionsFromParametricLinesQuestion = () => {
-    const identifiers = createRandomIdentifiers();
+    const identifiers = createQCPassedIdentifiers();
     return getQuestionFromIdentifiers(identifiers);
 };
 const getQuestionFromIdentifiers = (identifiers, _opts) => {

package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlaneEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"findNormalVectorFromPlaneEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/planes/findNormalVectorFromPlaneEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AASrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAsF7C,KAAK,WAAW,GAAG;IACjB,oBAAoB,EAAE,eAAe,CAAC;CACvC,CAAC;AA+QF,eAAO,MAAM,iCAAiC,EAAE,QAAQ,CAAC,WAAW,CAmBnE,CAAC"}
+{"version":3,"file":"findNormalVectorFromPlaneEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/planes/findNormalVectorFromPlaneEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AASrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAsF7C,KAAK,WAAW,GAAG;IACjB,oBAAoB,EAAE,eAAe,CAAC;CACvC,CAAC;AAuRF,eAAO,MAAM,iCAAiC,EAAE,QAAQ,CAAC,WAAW,CAmBnE,CAAC"}

package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlaneEquation.js

@@ -140,7 +140,9 @@ const getPropositions = (n, { answer, ...identifiers }) => {
             }
         }
     }
+    let counter = -1;
     propWhile(propositions, n, () => {
+        counter++;
         const nodeFactorW = randint(-4, 5, [0, 1]).toTree();
         const arr = [nodeA, nodeB, nodeC, nodeD].map((node) => multiply(nodeFactorW, node).simplify({ towardsDistribute: true }));
         {
@@ -160,6 +162,10 @@ const getPropositions = (n, { answer, ...identifiers }) => {
                 }
             }
         }
+        if (counter > 50) {
+            const identifiersWrong = createRandomIdentifiers();
+            tryToAddWrongProp(propositions, getAnswer(identifiersWrong));
+        }
     });
     return shuffleProps(propositions, n);
 };

package/lib/exercises/math/spaceGeometry/vectors/spaceVectorNormCalculation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"spaceVectorNormCalculation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/vectors/spaceVectorNormCalculation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqGF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAa5D,CAAC"}
+{"version":3,"file":"spaceVectorNormCalculation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/vectors/spaceVectorNormCalculation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkGF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAa5D,CAAC"}

package/lib/exercises/math/spaceGeometry/vectors/spaceVectorNormCalculation.js

@@ -1,5 +1,6 @@
 import { addValidProp, propWhile, shuffleProps, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { sqrtVEA } from "../../../../exercises/vea/sqrtVEA.js";
 import { SpaceVector, SpaceVectorConstructor, } from "../../../../math/geometry/spaceVector.js";
 import { SquareRootConstructor } from "../../../../math/numbers/reals/real.js";
 import { SqrtNode } from "../../../../tree/nodes/functions/sqrtNode.js";
@@ -70,11 +71,8 @@ const getPropositions = (n, { answer, x, y, z }) => {
     });
     return shuffleProps(propositions, n);
 };
-const isAnswerValid = (ans, { x, y, z }) => {
-    const correctAnswer = new SqrtNode((x ** 2 + y ** 2 + z ** 2).toTree());
-    return correctAnswer
-        .toAllValidTexs({ allowSimplifySqrt: true })
-        .includes(ans);
+const isAnswerValid = (ans, { answer }) => {
+    return sqrtVEA(ans, answer);
 };
 export const spaceVectorNormCalculation = {
     id: "spaceVectorNormCalculation",

package/lib/exercises/math/squareRoots/simpifySquareRoot.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"simpifySquareRoot.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/squareRoots/simpifySquareRoot.ts"],"names":[],"mappings":"AAQA,OAAO,EACL,QAAQ,EAeT,MAAM,mBAAmB,CAAC;AAE3B,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC;AAwGF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,CAcpD,CAAC"}
+{"version":3,"file":"simpifySquareRoot.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/squareRoots/simpifySquareRoot.ts"],"names":[],"mappings":"AASA,OAAO,EACL,QAAQ,EAeT,MAAM,mBAAmB,CAAC;AAE3B,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC;AAwGF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,CAcpD,CAAC"}

package/lib/exercises/math/squareRoots/simpifySquareRoot.js

@@ -1,3 +1,4 @@
+import { sqrtVEA } from "../../../exercises/vea/sqrtVEA.js";
 import { SquareRoot, SquareRootConstructor, } from "../../../math/numbers/reals/real.js";
 import { sqrt } from "../../../tree/nodes/functions/sqrtNode.js";
 import { multiply } from "../../../tree/nodes/operators/multiplyNode.js";
@@ -92,10 +93,10 @@ const getPropositions = (n, { answer }) => {
     });
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { sqrtOperand }) => {
-    const answer = new SquareRoot(sqrtOperand).simplify().toTree();
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
+const isAnswerValid = (ans, { answer }) => {
+    return sqrtVEA(ans, answer, {
+        allowNonIrreductible: false,
+    });
 };
 export const simplifySquareRoot = {
     id: "simplifySqrt",