math-exercises 3.0.187 → 3.0.189

package/lib/exercises/math/derivation/problems/problemMaximizeProfitFindProduction.js

@@ -173,7 +173,9 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     addValidProp(propositions, answer);
     propWhile(propositions, n, () => {
         const identifierWrong = createRandomIdentifiers(typeF);
-        tryToAddWrongProp(propositions, getAnswer(identifierWrong));
+        if (isIdentifiersQCPassed(identifierWrong)) {
+            tryToAddWrongProp(propositions, getAnswer(identifierWrong));
+        }
     });
     return shuffle(propositions);
 };
@@ -279,10 +281,36 @@ const createRandomIdentifiers = (typeF) => {
     };
     return identifiers;
 };
+const isIdentifiersQCPassed = (identifiers) => {
+    const isExploding = (identifiers) => {
+        try {
+            getCorrection(identifiers);
+            return false;
+        }
+        catch (_) {
+            return true;
+        }
+    };
+    return !isExploding(identifiers);
+};
 const getProblemMaximizeProfitFindProductionQuestion = (optsIn) => {
     const arrayedOptions = optsIn ?? arrayedOptsDefault;
     const typeF = random(arrayedOptions.typeF);
-    const identifiers = createRandomIdentifiers(typeF);
+    let identifiers;
+    let counter = -1;
+    let isValid = false;
+    while (!isValid && counter < 100) {
+        counter++;
+        const identifiersCandidate = createRandomIdentifiers(typeF);
+        isValid = isIdentifiersQCPassed(identifiersCandidate);
+        if (isValid) {
+            identifiers = identifiersCandidate;
+        }
+    }
+    if (!isValid) {
+        const identifiersDefault = createRandomIdentifiers("polynôme (degré $2$)");
+        identifiers = identifiersDefault;
+    }
     return getQuestionFromIdentifiers(identifiers);
 };
 const getQuestionFromIdentifiers = (identifiers) => {

package/lib/exercises/math/derivation/problems/problemMovementOnLineFindSpeedAtPoint.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"problemMovementOnLineFindSpeedAtPoint.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/problems/problemMovementOnLineFindSpeedAtPoint.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AASrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AA0E7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,oBAAoB,EAAE,eAAe,CAAC;IACtC,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAwOF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAoCF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAC1D,WAAW,EACX,OAAO,CAqBR,CAAC"}
+{"version":3,"file":"problemMovementOnLineFindSpeedAtPoint.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/problems/problemMovementOnLineFindSpeedAtPoint.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AASrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AA0E7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,oBAAoB,EAAE,eAAe,CAAC;IACtC,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AA0RF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAoCF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAC1D,WAAW,EACX,OAAO,CAqBR,CAAC"}

package/lib/exercises/math/derivation/problems/problemMovementOnLineFindSpeedAtPoint.js

@@ -101,7 +101,8 @@ const getAnswerStuff = (identifiers) => {
         }
     })();
     const nodeDerivative = getPrettyDerivativeNode(nodeF);
-    const nodeValueDerivative = nodeBySubstitutingVar(nodeDerivative, nodeAbscissa, "x".toTree()).simplify();
+    const nodeValueDerivativeRaw = nodeBySubstitutingVar(nodeDerivative, nodeAbscissa, "x".toTree());
+    const nodeValueDerivative = nodeValueDerivativeRaw.simplify();
     return { nodeAbscissa, nodeDerivative, nodeValueDerivative };
 };
 const getAnswerNode = (identifiers) => {
@@ -111,19 +112,33 @@ const getAnswer = (identifiers) => {
     return round(getAnswerNode(identifiers).evaluate(), 2).frenchify();
 };
 const getHint = (identifiers) => {
-    const { typeF } = identifiers;
-    switch (typeF) {
-        case "polynôme (degré $1$)":
-            return `Soient $a$ et $b$ deux réels. La dérivée de $t \\mapsto at+b$ est $t \\mapsto a$.`;
-        case "$\\frac{k}{t}$":
-            return `Soit $n$ un entier. La dérivée de $t \\mapsto \\frac{k}{t}$ est $t \\mapsto -\\frac{k}{t^2}$.`;
-        case "$\\frac{at+b}{ct+d}$":
-            return `Soient $a$, $b$, $c$ et $d$ quatre réels. La dérivée de $t \\mapsto \\frac{at+b}{ct+d}$ est $t \\mapsto \\frac{a(ct+d)-(at+b)c}{(ct+d)^2}$.`;
-        case "$k\\sqrt{t}$":
-            return `La dérivée de $t \\mapsto k\\sqrt{t}$ est $t \\mapsto \\frac{k}{2\\sqrt{t}}$.`;
-        default:
-            throw new Error("Unsupported typeF: " + typeF);
-    }
+    const { nodeIdsValueFunction, nodeIdsF } = identifiers;
+    const [nodeValueFunction, nodeF] = [nodeIdsValueFunction, nodeIdsF].map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    return `Premièrement, il faut déterminer à quel instant $t_{cible}$ correspond $x=${nodeValueFunction.toTex()}$.
+Il faut donc résoudre : 
+
+$$
+x(t_{cible}) = ${nodeBySubstitutingVar(nodeF, "t_{cible}".toTree(), "x".toTree()).toTex()} = ${nodeValueFunction.toTex()}
+$$
+
+Ensuite, il ne reste plus qu'à calculer la vitesse instantanée au temps $t_{cible}$,
+c'est-à-dire $x'(t_{cible})$.
+
+Rappel : ${(() => {
+        const { typeF } = identifiers;
+        switch (typeF) {
+            case "polynôme (degré $1$)":
+                return `Soient $a$ et $b$ deux réels. La dérivée de $t \\mapsto at+b$ est $t \\mapsto a$.`;
+            case "$\\frac{k}{t}$":
+                return `Soit $n$ un entier. La dérivée de $t \\mapsto \\frac{k}{t}$ est $t \\mapsto -\\frac{k}{t^2}$.`;
+            case "$\\frac{at+b}{ct+d}$":
+                return `Soient $a$, $b$, $c$ et $d$ quatre réels. La dérivée de $t \\mapsto \\frac{at+b}{ct+d}$ est $t \\mapsto \\frac{a(ct+d)-(at+b)c}{(ct+d)^2}$.`;
+            case "$k\\sqrt{t}$":
+                return `La dérivée de $t \\mapsto k\\sqrt{t}$ est $t \\mapsto \\frac{k}{2\\sqrt{t}}$.`;
+            default:
+                throw new Error("Unsupported typeF: " + typeF);
+        }
+    })()}`;
 };
 const getCorrection = (identifiers) => {
     const { nodeIdsValueFunction, nodeIdsF } = identifiers;
@@ -179,7 +194,9 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     addValidProp(propositions, answer);
     propWhile(propositions, n, () => {
         const identifierWrong = createRandomIdentifiers(typeF);
-        tryToAddWrongProp(propositions, getAnswer(identifierWrong));
+        if (isIdentifiersQCPassed(identifierWrong)) {
+            tryToAddWrongProp(propositions, getAnswer(identifierWrong));
+        }
     });
     return shuffle(propositions);
 };
@@ -217,10 +234,36 @@ const createRandomIdentifiers = (typeF) => {
     };
     return identifiers;
 };
+const isIdentifiersQCPassed = (identifiers) => {
+    const isExploding = (identifiers) => {
+        try {
+            getAnswer(identifiers);
+            return false;
+        }
+        catch (_) {
+            return true;
+        }
+    };
+    return !isExploding(identifiers);
+};
 const getProblemMovementOnLineFindSpeedAtPointQuestion = (optsIn) => {
     const arrayedOptions = optsIn ?? arrayedOptsDefault;
     const typeF = random(arrayedOptions.typeF);
-    const identifiers = createRandomIdentifiers(typeF);
+    let identifiers;
+    let counter = -1;
+    let isValid = false;
+    while (!isValid && counter < 100) {
+        counter++;
+        const identifiersCandidate = createRandomIdentifiers(typeF);
+        isValid = isIdentifiersQCPassed(identifiersCandidate);
+        if (isValid) {
+            identifiers = identifiersCandidate;
+        }
+    }
+    if (!isValid) {
+        const identifiersDefault = createRandomIdentifiers("polynôme (degré $1$)");
+        identifiers = identifiersDefault;
+    }
     return getQuestionFromIdentifiers(identifiers);
 };
 const getQuestionFromIdentifiers = (identifiers) => {

package/lib/exercises/math/derivation/tangent/tangentEquationFromFunctionExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tangentEquationFromFunctionExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/tangent/tangentEquationFromFunctionExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAUrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAgF7C,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,eAAe,CAAC;IAC/B,QAAQ,EAAE,eAAe,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAsWF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAgDF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAC1D,WAAW,EACX,OAAO,CAqBR,CAAC"}
+{"version":3,"file":"tangentEquationFromFunctionExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/tangent/tangentEquationFromFunctionExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAUrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAgF7C,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,eAAe,CAAC;IAC/B,QAAQ,EAAE,eAAe,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAqXF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAgDF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAC1D,WAAW,EACX,OAAO,CAqBR,CAAC"}

package/lib/exercises/math/derivation/tangent/tangentEquationFromFunctionExpression.js

@@ -200,10 +200,15 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     {
         const nodeX = "x".toTree();
         const nodeTWrong = add(multiply(nodeValueDerivative, nodeX), nodeValueImage);
-        const texWrong = `y = ${nodeTWrong
-            .simplify({ towardsDistribute: true, forbidFactorize: true })
-            .toTex()}`;
-        tryToAddWrongProp(propositionsMandatory, texWrong);
+        try {
+            const texWrong = `y = ${nodeTWrong
+                .simplify({ towardsDistribute: true, forbidFactorize: true })
+                .toTex()}`;
+            tryToAddWrongProp(propositionsMandatory, texWrong);
+        }
+        catch (_) {
+            (() => { })();
+        }
     }
     //filler
     const propositionsFiller = [];
@@ -222,10 +227,15 @@ const getPropositions = (n, { answer, ...identifiers }) => {
         ].forEach(([nodeXAskedWrong, nodeValueImageWrong, nodeValueDerivativeWrong]) => {
             const nodeX = "x".toTree();
             const nodeTWrong = add(multiply(nodeValueDerivativeWrong, substract(nodeX, nodeXAskedWrong)), nodeValueImageWrong);
-            const texWrong = `y = ${nodeTWrong
-                .simplify({ towardsDistribute: true, forbidFactorize: true })
-                .toTex()}`;
-            tryToAddWrongProp(propositionsFiller, texWrong);
+            try {
+                const texWrong = `y = ${nodeTWrong
+                    .simplify({ towardsDistribute: true, forbidFactorize: true })
+                    .toTex()}`;
+                tryToAddWrongProp(propositionsFiller, texWrong);
+            }
+            catch (_) {
+                (() => { })();
+            }
         });
     }
     propWhile(propositionsFiller, n, () => {
@@ -288,7 +298,11 @@ const isIdentifiersQCPassed = (identifiers) => {
         }
         return isExploding;
     };
-    return !isExploding(identifiers);
+    const isVEAOk = (identifiers) => {
+        const answer = getAnswer(identifiers);
+        return isAnswerValid(answer, { answer, ...identifiers });
+    };
+    return !isExploding(identifiers) && isVEAOk(identifiers);
 };
 const getTangentEquationFromFunctionExpressionQuestion = (optsIn) => {
     const arrayedOptions = optsIn ?? arrayedOptsDefault;

package/lib/exercises/math/derivation/variations/findAbscissaOfExtremaFromFunctionExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"findAbscissaOfExtremaFromFunctionExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/variations/findAbscissaOfExtremaFromFunctionExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AA4R7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA2LF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAyCF,eAAO,MAAM,2CAA2C,EAAE,QAAQ,CAChE,WAAW,EACX,OAAO,CAqBR,CAAC"}
+{"version":3,"file":"findAbscissaOfExtremaFromFunctionExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/variations/findAbscissaOfExtremaFromFunctionExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AA4R7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA2LF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAoCF,eAAO,MAAM,2CAA2C,EAAE,QAAQ,CAChE,WAAW,EACX,OAAO,CAqBR,CAAC"}

package/lib/exercises/math/derivation/variations/findAbscissaOfExtremaFromFunctionExpression.js

@@ -371,13 +371,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
     };
 };
 const arrayedOptsDefault = {
-    typeF: [
-        "polynôme (degré $2$)",
-        "polynôme (degré $3$)",
-        "$\\frac{ax^2+bx+c}{dx+m}$",
-        "$\\frac{dx+m}{ax^2+bx+c}$",
-    ],
-    typeRoots: ["entières", "rationnelles"],
+    typeF: ["polynôme (degré $2$)", "polynôme (degré $3$)"],
+    typeRoots: ["entières"],
 };
 const options = [
     {

package/lib/exercises/math/derivation/variations/findExtremaFromFunctionExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"findExtremaFromFunctionExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/variations/findExtremaFromFunctionExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AA+R7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAwUF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAyCF,eAAO,MAAM,iCAAiC,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAqB1E,CAAC"}
+{"version":3,"file":"findExtremaFromFunctionExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/variations/findExtremaFromFunctionExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAkS7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAiSF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAoCF,eAAO,MAAM,iCAAiC,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAqB1E,CAAC"}

package/lib/exercises/math/derivation/variations/findExtremaFromFunctionExpression.js

@@ -14,7 +14,11 @@ import { SetVEA } from "../../../../exercises/vea/setVEA.js";
 import { dividersOf } from "../../../../math/utils/arithmetic/dividersOf.js";
 import { probaFlip } from "../../../../utils/alea/probaFlip.js";
 import { nodeBySubstitutingVar } from "../../../../math/utils/functions/functionComposition.js";
+import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
 import { NodeUtils } from "../../../../tree/utilities/nodeUtils.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
+import { power } from "../../../../tree/nodes/operators/powerNode.js";
 const tryToSimplify = (node, simplifyOptions) => {
     try {
         return node.simplify(simplifyOptions);
@@ -399,7 +403,16 @@ const isIdentifiersQCPassed = (identifiers) => {
             return false;
         }
     };
-    return isSolutionPrettyAndNotExploding(identifiers);
+    const isVEAOk = (identifiers) => {
+        try {
+            const answer = getAnswer(identifiers);
+            return isAnswerValid(answer, { answer, ...identifiers });
+        }
+        catch (_) {
+            return false;
+        }
+    };
+    return isSolutionPrettyAndNotExploding(identifiers) && isVEAOk(identifiers);
 };
 const getFindExtremaFromFunctionExpressionQuestion = (optsIn) => {
     const arrayedOptions = optsIn ?? arrayedOptsDefault;
@@ -418,67 +431,9 @@ const getFindExtremaFromFunctionExpressionQuestion = (optsIn) => {
     }
     if (!isValid) {
         // console.log("will use identifiersDefault");
+        const nodeF = frac(add(multiply(30, new VariableNode("x")), 10), add(add(multiply(6, power(new VariableNode("x"), 2)), multiply(3, new VariableNode("x"))), 1));
         const identifiersDefault = {
-            nodeIdsF: {
-                id: 3,
-                leftChild: {
-                    id: 0,
-                    leftChild: {
-                        id: 2,
-                        leftChild: {
-                            id: 7,
-                            value: 30,
-                        },
-                        rightChild: {
-                            id: 10,
-                            name: "x",
-                        },
-                    },
-                    rightChild: {
-                        id: 7,
-                        value: 10,
-                    },
-                },
-                rightChild: {
-                    id: 0,
-                    leftChild: {
-                        id: 0,
-                        leftChild: {
-                            id: 2,
-                            leftChild: {
-                                id: 7,
-                                value: 6,
-                            },
-                            rightChild: {
-                                id: 5,
-                                leftChild: {
-                                    id: 10,
-                                    name: "x",
-                                },
-                                rightChild: {
-                                    id: 7,
-                                    value: 2,
-                                },
-                            },
-                        },
-                        rightChild: {
-                            id: 2,
-                            leftChild: {
-                                id: 7,
-                                value: 3,
-                            },
-                            rightChild: {
-                                id: 10,
-                                name: "x",
-                            },
-                        },
-                    },
-                    rightChild: {
-                        id: 7,
-                        value: 1,
-                    },
-                },
-            },
+            nodeIdsF: nodeF.toIdentifiers(),
             typeF: "$\\frac{dx+m}{ax^2+bx+c}$",
             typeRoots: "entières",
         };
@@ -498,13 +453,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
     };
 };
 const arrayedOptsDefault = {
-    typeF: [
-        "polynôme (degré $2$)",
-        "polynôme (degré $3$)",
-        "$\\frac{ax^2+bx+c}{dx+m}$",
-        "$\\frac{dx+m}{ax^2+bx+c}$",
-    ],
-    typeRoots: ["entières", "rationnelles"],
+    typeF: ["polynôme (degré $2$)", "polynôme (degré $3$)"],
+    typeRoots: ["entières"],
 };
 const options = [
     {

package/lib/exercises/math/derivation/variations/signVarTableQuotientFExp.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"signVarTableQuotientFExp.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/variations/signVarTableQuotientFExp.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAsIrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,UAAU,EAAE,OAAO,CAAC;CACrB,CAAC;AAubF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAiBF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAmBnE,CAAC"}
+{"version":3,"file":"signVarTableQuotientFExp.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/variations/signVarTableQuotientFExp.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AA6HrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,UAAU,EAAE,OAAO,CAAC;CACrB,CAAC;AAqbF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAiBF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAmBnE,CAAC"}

package/lib/exercises/math/derivation/variations/signVarTableQuotientFExp.js

@@ -10,29 +10,27 @@ import { opposite } from "../../../../tree/nodes/functions/oppositeNode.js";
 import { InequationSolutionNode } from "../../../../tree/nodes/inequations/inequationSolutionNode.js";
 import { MinusInfinityNode, PlusInfinityNode, } from "../../../../tree/nodes/numbers/infiniteNode.js";
 import { frac, isFractionNode, } from "../../../../tree/nodes/operators/fractionNode.js";
-import { isMultiplyNode, multiply, } from "../../../../tree/nodes/operators/multiplyNode.js";
 import { substract } from "../../../../tree/nodes/operators/substractNode.js";
 import { ClosureType } from "../../../../tree/nodes/sets/closure.js";
 import { IntervalNode } from "../../../../tree/nodes/sets/intervalNode.js";
 import { isUnionIntervalNode, UnionIntervalNode, } from "../../../../tree/nodes/sets/unionIntervalNode.js";
+import { NodeSimplifier } from "../../../../tree/utilities/nodeSimplifier.js";
 import { coinFlip } from "../../../../utils/alea/coinFlip.js";
 import { zip } from "../../../../utils/arrays/arrayZip.js";
 import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
 import { alignTex } from "../../../../utils/latex/alignTex.js";
-const _simplifyMore = (node) => {
-    if (isMultiplyNode(node)) {
-        const nodeLeft = node.leftChild;
-        const nodeRight = node.rightChild;
+const tryToSimplify = (node) => {
+    try {
+        return NodeSimplifier.simplifyByVibrating(node, 5, true);
+    }
+    catch (_) {
         try {
-            return multiply(nodeLeft.simplify({ forbidFactorize: true, towardsDistribute: true }), nodeRight.simplify({ forbidFactorize: true, towardsDistribute: true }));
+            return NodeSimplifier.simplifyByVibrating(node, 5, false);
         }
         catch (_) {
             return node;
         }
     }
-    else {
-        return node;
-    }
 };
 const getInstructionNode = (a, b, c, isFOverExp) => {
     const nodeF = getNodeF(a, b, c);
@@ -42,10 +40,10 @@ const getInstructionNode = (a, b, c, isFOverExp) => {
 };
 const getNodeF = (a, b, c) => {
     if (a !== undefined) {
-        return TrinomConstructor.fromCoeffs([c, b, a]).toTree().simplify();
+        return tryToSimplify(TrinomConstructor.fromCoeffs([c, b, a]).toTree());
     }
     else if (b !== undefined) {
-        return AffineConstructor.fromCoeffs([c, b]).toTree().simplify();
+        return tryToSimplify(AffineConstructor.fromCoeffs([c, b]).toTree());
     }
     else {
         return c.toTree();
@@ -67,7 +65,7 @@ const getRootNodesOfDerivative = (a, b, c) => {
     }
     else {
         const [c, b] = coeffs;
-        return [frac(opposite(c), b).simplify()];
+        return [tryToSimplify(frac(opposite(c), b))];
     }
 };
 const getTrinomInequationSolutionNode = (coeffs, ineqType) => {
@@ -144,11 +142,9 @@ const getAnswerTable = (identifiers) => {
             x: rootNodeMinus1.evaluate(),
         });
         const [strSignHPrimeRootMinus1, strSignHPrimeRootPlus1] = hPrimeRootMinus1 > 0 ? ["+", "-"] : ["-", "+"];
-        const nodeHRoot = nodeH
-            .toDetailedEvaluation({
+        const nodeHRoot = tryToSimplify(nodeH.toDetailedEvaluation({
             x: rootNode,
-        })
-            .simplify();
+        }));
         return [
             ["$x$", "-\\infty", "\\ ", rootNode.toTex(), "\\ ", "+\\infty"],
             //sign
@@ -181,11 +177,9 @@ const getAnswerTable = (identifiers) => {
             x: root1Minus1.evaluate(),
         });
         const [strSignHPrimeRoot1Minus1, strSignHPrimeRootAvg, strSignHPrimeRoot2Plus1,] = hPrimeRoot1Minus1 > 0 ? ["+", "-", "+"] : ["-", "+", "-"];
-        const [nodeHRoot1, nodeHRoot2] = [rootNode1, rootNode2].map((nodeX) => nodeH
-            .toDetailedEvaluation({
+        const [nodeHRoot1, nodeHRoot2] = [rootNode1, rootNode2].map((nodeX) => tryToSimplify(nodeH.toDetailedEvaluation({
             x: nodeX,
-        })
-            .simplify());
+        })));
         return [
             [
                 "$x$",
@@ -301,32 +295,30 @@ const getCorrection = (identifiers) => {
         const signs = hPrimeRootMinus1 > 0 ? ["+", "-"] : ["-", "+"];
         const signWords = signs.map((strSign) => strSign === "+" ? "positive" : "négative");
         const words = signs.map((strSign) => strSign === "+" ? "croissante" : "décroissante");
-        const image = nodeH
-            .toDetailedEvaluation({
+        const image = tryToSimplify(nodeH.toDetailedEvaluation({
             x: rootNode,
-        })
-            .simplify();
+        }));
         return `On calcule $h'$ :
   
 $$
-h'(x) = ${nodeHPrime.simplify().toTex()}
+h'(x) = ${tryToSimplify(nodeHPrime).toTex()}
 $$
 
 On détermine ensuite le signe de $h'(x)$ : 
 
 ${alignTex([
             ["", "h'(x) \\geq 0"],
-            ["\\iff", nodeHPrime.simplify().toTex() + "\\geq 0"],
+            ["\\iff", tryToSimplify(nodeHPrime).toTex() + "\\geq 0"],
             [
                 "\\iff",
                 (() => {
                     if (isFOverExp) {
-                        return frac(nodeHPrime, exp(opposite("x".toTree()))).simplify();
+                        return tryToSimplify(frac(nodeHPrime, exp(opposite("x".toTree()))));
                     }
                     else {
-                        const nodeWithoutExp = frac(nodeHPrime, exp("x".toTree())).simplify();
+                        const nodeWithoutExp = tryToSimplify(frac(nodeHPrime, exp("x".toTree())));
                         if (isFractionNode(nodeWithoutExp)) {
-                            return nodeWithoutExp.leftChild.simplify({ towardsDistribute: true });
+                            return tryToSimplify(nodeWithoutExp.leftChild);
                         }
                         else {
                             return nodeWithoutExp;
@@ -344,7 +336,7 @@ On en conclut que $h$ est ${words[0]} sur $]-\\infty; ${rootTex}]$, puis ${words
 Pour compléter le tableau, il ne reste plus qu'à calculer l'image par $h$ de $${rootTex}$ : 
 
 $$
-h\\left(${rootTex}\\right) = ${image.toTex()} = ${image.simplify().toTex()}
+h\\left(${rootTex}\\right) = ${image.toTex()} = ${tryToSimplify(image).toTex()}
 $$`;
     }
     else {
@@ -361,24 +353,24 @@ $$`;
         return `On calcule $h'$ :
   
 $$
-h'(x) = ${nodeHPrime.simplify().toTex()}
+h'(x) = ${tryToSimplify(nodeHPrime).toTex()}
 $$
 
 On détermine ensuite le signe de $h'(x)$ : 
 
 ${alignTex([
             ["", "h'(x) \\geq 0"],
-            ["\\iff", nodeHPrime.simplify().toTex() + "\\geq 0"],
+            ["\\iff", tryToSimplify(nodeHPrime).toTex() + "\\geq 0"],
             [
                 "\\iff",
                 (() => {
                     if (isFOverExp) {
-                        return frac(nodeHPrime, exp(opposite("x".toTree()))).simplify();
+                        return tryToSimplify(frac(nodeHPrime, exp(opposite("x".toTree()))));
                     }
                     else {
-                        const nodeWithoutExp = frac(nodeHPrime, exp("x".toTree())).simplify();
+                        const nodeWithoutExp = tryToSimplify(frac(nodeHPrime, exp("x".toTree())));
                         if (isFractionNode(nodeWithoutExp)) {
-                            return nodeWithoutExp.leftChild.simplify({ towardsDistribute: true });
+                            return tryToSimplify(nodeWithoutExp.leftChild);
                         }
                         else {
                             return nodeWithoutExp;

package/lib/exercises/math/functions/affines/adjustment/affineAdjustment.d.ts

@@ -0,0 +1,8 @@
+import { Exercise } from "../../../../../exercises/exercise.js";
+type Identifiers = {
+    xValues: number[];
+    yValues: number[];
+};
+export declare const affineAdjustmentExercise: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=affineAdjustment.d.ts.map

package/lib/exercises/math/functions/affines/adjustment/affineAdjustment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"affineAdjustment.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/affines/adjustment/affineAdjustment.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAgBrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AA8KF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAa1D,CAAC"}