math-exercises 2.1.25 → 2.1.26

package/lib/exercises/calculLitteral/distributivity/thirdIdentity.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.thirdIdentity = exports.isThirdIdentityAnswerValid = exports.getThirdIdentityPropositions = exports.getThirdIdentityQuestion = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const affine_1 = require("../../../math/polynomials/affine");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getThirdIdentityQuestion = () => {
+    const affine = affine_1.AffineConstructor.random(undefined, { excludes: [0] });
+    const affine2 = new affine_1.Affine(affine.a, -affine.b);
+    const statementTree = new multiplyNode_1.MultiplyNode(affine.toTree(), affine2.toTree());
+    const answer = affine.multiply(affine2).toTree().toTex();
+    const question = {
+        instruction: `Développer et réduire : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: {
+            affine1Coeffs: affine.coefficients,
+            affine2Coeffs: affine2.coefficients,
+        },
+    };
+    return question;
+};
+exports.getThirdIdentityQuestion = getThirdIdentityQuestion;
+const getThirdIdentityPropositions = (n, { answer, affine1Coeffs, affine2Coeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const affine = new affine_1.Affine(affine1Coeffs[1], affine1Coeffs[0]);
+    const affine2 = new affine_1.Affine(affine2Coeffs[1], affine2Coeffs[0]);
+    (0, exercise_1.tryToAddWrongProp)(propositions, affine.multiply(affine2.opposite()).toTree().toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, affine.multiply(affine).toTree().toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, affine2.multiply(affine2.opposite()).toTree().toTex());
+    while (propositions.length < n) {
+        const affineTemp = affine_1.AffineConstructor.random(undefined, {
+            excludes: [0],
+        });
+        const affineTemp2 = new affine_1.Affine(affineTemp.a, -affineTemp.b);
+        const wrongAnswer = affineTemp.multiply(affineTemp2).toTree();
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.getThirdIdentityPropositions = getThirdIdentityPropositions;
+const isThirdIdentityAnswerValid = (ans, { affine1Coeffs, affine2Coeffs }) => {
+    const affine = new affine_1.Affine(affine1Coeffs[1], affine1Coeffs[0]);
+    const affine2 = new affine_1.Affine(affine2Coeffs[1], affine2Coeffs[0]);
+    const answer = affine.multiply(affine2).toTree();
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.isThirdIdentityAnswerValid = isThirdIdentityAnswerValid;
+exports.thirdIdentity = {
+    id: "idRmq3",
+    connector: "=",
+    label: "Identité remarquable $(a+b)(a-b)$",
+    levels: ["3ème", "2nde"],
+    sections: ["Calcul littéral"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(exports.getThirdIdentityQuestion, nb),
+    getPropositions: exports.getThirdIdentityPropositions,
+    isAnswerValid: exports.isThirdIdentityAnswerValid,
+    qcmTimer: 60,
+    freeTimer: 60,
+};

package/lib/exercises/calculLitteral/equation/equationSimpleSquare.d.ts

@@ -0,0 +1,7 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    randNbr: number;
+};
+export declare const equationSimpleSquare: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=equationSimpleSquare.d.ts.map

package/lib/exercises/calculLitteral/equation/equationSimpleSquare.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equationSimpleSquare.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationSimpleSquare.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AA0BlC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AA4IF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,WAAW,CAY1D,CAAC"}

package/lib/exercises/calculLitteral/equation/equationSimpleSquare.js

@@ -0,0 +1,140 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.equationSimpleSquare = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const real_1 = require("../../../math/numbers/reals/real");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const oppositeNode_1 = require("../../../tree/nodes/functions/oppositeNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const diceFlip_1 = require("../../../utils/diceFlip");
+const isInt_1 = require("../../../utils/isInt");
+const random_1 = require("../../../utils/random");
+const squares = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12].map((el) => el ** 2);
+const higherFactor = (n) => {
+    for (let i = Math.floor(Math.sqrt(n)); i > 0; i--)
+        if (n % i ** 2 === 0)
+            return i;
+    return 1;
+};
+const getEquationSimpleSquare = () => {
+    let randNbr = (0, randint_1.randint)(-20, 101);
+    const rand = (0, diceFlip_1.diceFlip)(3);
+    if (rand === 0)
+        randNbr = (0, randint_1.randint)(-20, 0);
+    else if (rand === 1)
+        randNbr = (0, random_1.random)(squares);
+    else
+        randNbr = (0, randint_1.randint)(2, 100);
+    const instruction = `Résoudre l'équation : $x^2 = ${randNbr}$`;
+    const sqrt = Math.sqrt(randNbr);
+    let solutionsSet;
+    if (randNbr < 0) {
+        solutionsSet = new discreteSetNode_1.DiscreteSetNode([]);
+    }
+    else if (sqrt === Math.floor(sqrt)) {
+        if (sqrt === 0)
+            solutionsSet = new discreteSetNode_1.DiscreteSetNode([new numberNode_1.NumberNode(0)]);
+        else
+            solutionsSet = new discreteSetNode_1.DiscreteSetNode([
+                new numberNode_1.NumberNode(-sqrt),
+                new numberNode_1.NumberNode(+sqrt),
+            ]);
+    }
+    else {
+        const tree = new real_1.SquareRoot(randNbr).simplify().toTree();
+        solutionsSet = new discreteSetNode_1.DiscreteSetNode([new oppositeNode_1.OppositeNode(tree), tree]);
+    }
+    const answer = new equationSolutionNode_1.EquationSolutionNode(solutionsSet).toTex();
+    const question = {
+        instruction,
+        answer,
+        keys: equationKeys_1.equationKeys,
+        answerFormat: "tex",
+        identifiers: { randNbr },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, randNbr }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const half = new rational_1.Rational(randNbr, 2).simplify().toTree();
+    if (randNbr < 0) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{-\\sqrt{${-randNbr}}\\right\\}`);
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{\\sqrt{-${-randNbr}}\\right\\}`);
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([half])).toTex());
+    }
+    else if ((0, isInt_1.isInt)(Math.sqrt(randNbr))) {
+        const sqrt = Math.sqrt(randNbr);
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{${sqrt}\\right\\}`);
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([half])).toTex());
+        while (propositions.length < n) {
+            const tempAns = sqrt + (0, randint_1.randint)(-sqrt + 1, 7, [0]);
+            (0, exercise_1.tryToAddWrongProp)(propositions, (0, coinFlip_1.coinFlip)()
+                ? `S=\\left\\{-${tempAns};${tempAns}\\right\\}`
+                : `S=\\varnothing`);
+        }
+    }
+    else {
+        const sqrtTree = new real_1.SquareRoot(randNbr).simplify().toTree();
+        const sqrt = Math.sqrt(randNbr);
+        const factor = higherFactor(randNbr);
+        const radicand = randNbr / factor ** 2;
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([sqrtTree])).toTex());
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([half])).toTex());
+        while (propositions.length < n) {
+            const tempFactor = factor + (0, randint_1.randint)(-factor + 1, 7, [0]);
+            const tempRadicand = radicand + (0, randint_1.randint)(-radicand + 1, 7, [0]);
+            (0, exercise_1.tryToAddWrongProp)(propositions, (0, coinFlip_1.coinFlip)()
+                ? `S=\\left\\{-${tempFactor}\\sqrt{${tempRadicand}};${tempFactor}\\sqrt{${tempRadicand}}\\right\\}`
+                : `S=\\varnothing`);
+        }
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { randNbr }) => {
+    let answerTrees = [];
+    if (randNbr < 0) {
+        answerTrees = [new equationSolutionNode_1.EquationSolutionNode(discreteSetNode_1.EmptySet)];
+    }
+    else if (randNbr === 0) {
+        answerTrees = [
+            new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new numberNode_1.NumberNode(0)])),
+        ];
+    }
+    // else if (randNbr === 1) {
+    //   answerTrees = [
+    //     new EquationSolutionNode(new DiscreteSetNode([new NumberNode(1)])),
+    //   ];
+    // }
+    else {
+        const sqrt = new real_1.SquareRoot(randNbr);
+        const sqrtTree = sqrt.toTree();
+        answerTrees.push(new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new oppositeNode_1.OppositeNode(sqrtTree), sqrtTree])));
+        if (sqrt.isSimplifiable()) {
+            const simplified = sqrt.simplify().toTree();
+            answerTrees.push(new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new oppositeNode_1.OppositeNode(simplified), simplified])));
+        }
+    }
+    const texs = answerTrees.flatMap((tree) => tree.toAllValidTexs());
+    console.log(ans, texs);
+    return texs.includes(ans);
+};
+exports.equationSimpleSquare = {
+    id: "equationSimpleSquare",
+    connector: "=",
+    label: "Résoudre une équation du second degré du type $x^2 = a$",
+    levels: ["2nde", "1reESM", "1reSpé", "1reTech"],
+    sections: ["Équations"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEquationSimpleSquare, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/equation/equationType1Exercise.d.ts

@@ -0,0 +1,11 @@
+import { MathExercise } from "../../../exercises/exercise";
+/**
+ *  type x+a=b
+ */
+type Identifiers = {
+    a: number;
+    b: number;
+};
+export declare const equationType1Exercise: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=equationType1Exercise.d.ts.map

package/lib/exercises/calculLitteral/equation/equationType1Exercise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equationType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType1Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAWlC;;GAEG;AACH,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA4CF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAa3D,CAAC"}

package/lib/exercises/calculLitteral/equation/equationType1Exercise.js

@@ -0,0 +1,60 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.equationType1Exercise = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const getEquationType1ExerciseQuestion = () => {
+    const b = (0, randint_1.randint)(-10, 11);
+    const a = (0, randint_1.randint)(-10, 11, [0]);
+    const solution = b - a;
+    const affine = new affine_1.Affine(1, a).toTree();
+    const tree = new equalNode_1.EqualNode(affine, new numberNode_1.NumberNode(b));
+    const answer = `x=${solution}`;
+    const question = {
+        instruction: `Résoudre : $${tree.toTex()}$`,
+        startStatement: tree.toTex(),
+        answer,
+        keys: equationKeys_1.equationKeys,
+        answerFormat: "tex",
+        identifiers: { a, b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const solution = b - a;
+    (0, exercise_1.tryToAddWrongProp)(propositions, `x = ${b + a}`);
+    while (propositions.length < n) {
+        const wrongAnswer = solution + (0, randint_1.randint)(-3, 4, [0]);
+        (0, exercise_1.tryToAddWrongProp)(propositions, `x = ${wrongAnswer}`);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b }) => {
+    const solution = b - a;
+    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new numberNode_1.NumberNode(solution)]));
+    const validLatexs = answerTree.toAllValidTexs();
+    return validLatexs.includes(ans);
+};
+exports.equationType1Exercise = {
+    id: "equa1",
+    connector: "\\iff",
+    label: "Équations $x+a = b$",
+    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
+    sections: ["Équations"],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEquationType1ExerciseQuestion, nb),
+    getPropositions,
+    qcmTimer: 60,
+    freeTimer: 60,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/equation/equationType2Exercise.d.ts

@@ -0,0 +1,11 @@
+import { MathExercise } from "../../../exercises/exercise";
+/**
+ *  type ax=b
+ */
+type Identifiers = {
+    a: number;
+    b: number;
+};
+export declare const equationType2Exercise: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=equationType2Exercise.d.ts.map

package/lib/exercises/calculLitteral/equation/equationType2Exercise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equationType2Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType2Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAgBlC;;GAEG;AACH,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqDF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAa3D,CAAC"}

package/lib/exercises/calculLitteral/equation/equationType2Exercise.js

@@ -0,0 +1,62 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.equationType2Exercise = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getEquationType2ExerciseQuestion = () => {
+    const b = (0, randint_1.randint)(-10, 11);
+    const a = (0, randint_1.randint)(-9, 10, [0, 1]);
+    const solution = new rational_1.Rational(b, a).simplify();
+    const affine = new affine_1.Affine(a, 0).toTree();
+    const tree = new equalNode_1.EqualNode(affine, b.toTree());
+    const answer = new equalNode_1.EqualNode(new variableNode_1.VariableNode("x"), solution.toTree()).toTex();
+    const question = {
+        instruction: `Résoudre : $${tree.toTex()}$`,
+        startStatement: tree.toTex(),
+        answer,
+        keys: equationKeys_1.equationKeys,
+        answerFormat: "tex",
+        identifiers: { a, b: b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = new rational_1.Rational(b + (0, randint_1.randint)(-7, 8, [0, -b]), a + (0, randint_1.randint)(-7, 8, [-a, 0])).simplify();
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(new variableNode_1.VariableNode("x"), wrongAnswer.toTree()).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b }) => {
+    const solution = new rational_1.Rational(b, a).simplify().toTree();
+    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([solution]), {
+        opts: { allowFractionToDecimal: true, allowRawRightChildAsSolution: true },
+    });
+    const validLatexs = answerTree.toAllValidTexs();
+    console.log(validLatexs);
+    return validLatexs.includes(ans);
+};
+exports.equationType2Exercise = {
+    id: "equa2",
+    connector: "\\iff",
+    label: "Équations $ax=b$",
+    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
+    sections: ["Équations"],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEquationType2ExerciseQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/equation/equationType3Exercise.d.ts

@@ -0,0 +1,12 @@
+import { MathExercise } from "../../../exercises/exercise";
+/**
+ *  type ax+b=c
+ */
+type Identifiers = {
+    a: number;
+    b: number;
+    c: number;
+};
+export declare const equationType3Exercise: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=equationType3Exercise.d.ts.map

package/lib/exercises/calculLitteral/equation/equationType3Exercise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equationType3Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType3Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAiBlC;;GAEG;AACH,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkDF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAc3D,CAAC"}

package/lib/exercises/calculLitteral/equation/equationType3Exercise.js

@@ -0,0 +1,64 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.equationType3Exercise = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const getEquationType3ExerciseQuestion = () => {
+    const b = (0, randint_1.randint)(-10, 11, [0]);
+    const a = (0, randint_1.randint)(-10, 11, [0, 1]);
+    const c = (0, randint_1.randint)(-10, 11);
+    const affine = new affine_1.Affine(a, b).toTree();
+    const solution = new rational_1.Rational(c - b, a).simplify();
+    const statementTree = new equalNode_1.EqualNode(affine, new numberNode_1.NumberNode(c));
+    const answerTree = new equalNode_1.EqualNode(new variableNode_1.VariableNode("x"), solution.toTree());
+    const answer = answerTree.toTex();
+    const question = {
+        instruction: `Résoudre : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer,
+        keys: equationKeys_1.equationKeys,
+        answerFormat: "tex",
+        identifiers: { a, b, c },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b, c }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = new rational_1.Rational(c - b + (0, randint_1.randint)(-7, 8, [0, -c + b]), a + (0, randint_1.randint)(-7, 8, [-a, 0])).simplify();
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(new variableNode_1.VariableNode("x"), wrongAnswer.toTree()).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, c }) => {
+    const solution = new rational_1.Rational(c - b, a).simplify().toTree();
+    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([solution]), {
+        opts: { allowFractionToDecimal: true, allowRawRightChildAsSolution: true },
+    });
+    const validLatexs = answerTree.toAllValidTexs();
+    return validLatexs.includes(ans);
+};
+exports.equationType3Exercise = {
+    id: "equa3",
+    connector: "\\iff",
+    label: "Équations $ax+b=c$",
+    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
+    sections: ["Équations"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEquationType3ExerciseQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/equation/equationType4Exercise.d.ts

@@ -0,0 +1,13 @@
+import { MathExercise } from "../../../exercises/exercise";
+/**
+ *  type ax+b=cx+d
+ */
+type Identifiers = {
+    a: number;
+    b: number;
+    c: number;
+    d: number;
+};
+export declare const equationType4Exercise: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=equationType4Exercise.d.ts.map

package/lib/exercises/calculLitteral/equation/equationType4Exercise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equationType4Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType4Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAelC;;GAEG;AAEH,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2DF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAc3D,CAAC"}

package/lib/exercises/calculLitteral/equation/equationType4Exercise.js

@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.equationType4Exercise = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getEquationType4ExerciseQuestion = () => {
+    const a = (0, randint_1.randint)(-10, 11, [0]);
+    const b = (0, randint_1.randint)(-10, 11);
+    const c = (0, randint_1.randint)(-10, 11, [0, a]);
+    const d = (0, randint_1.randint)(-10, 11);
+    const affines = [new affine_1.Affine(a, b), new affine_1.Affine(c, d)];
+    const solution = new rational_1.Rational(d - b, a - c).simplify();
+    const statementTree = new equalNode_1.EqualNode(affines[0].toTree(), affines[1].toTree());
+    const answerTree = new equalNode_1.EqualNode(new variableNode_1.VariableNode("x"), solution.toTree());
+    const answer = answerTree.toTex();
+    const question = {
+        instruction: `Résoudre : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer,
+        keys: equationKeys_1.equationKeys,
+        answerFormat: "tex",
+        identifiers: {
+            a: a,
+            b: b,
+            c: c,
+            d: d,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b, c, d }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = new rational_1.Rational(d - b + (0, randint_1.randint)(-7, 8, [0, -d + b]), a - c + (0, randint_1.randint)(-7, 8, [-a + c, 0])).simplify();
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(new variableNode_1.VariableNode("x"), wrongAnswer.toTree()).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, c, d }) => {
+    const solution = new rational_1.Rational(d - b, a - c).simplify().toTree();
+    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([solution]), {
+        opts: { allowFractionToDecimal: true, allowRawRightChildAsSolution: true },
+    });
+    const validLatexs = answerTree.toAllValidTexs();
+    return validLatexs.includes(ans);
+};
+exports.equationType4Exercise = {
+    id: "equa4",
+    connector: "\\iff",
+    label: "Équations $ax+b=cx+d$",
+    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
+    sections: ["Équations"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEquationType4ExerciseQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/equation/expEquation.d.ts

@@ -0,0 +1,8 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    k: number;
+};
+export declare const expEquation: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=expEquation.d.ts.map

package/lib/exercises/calculLitteral/equation/expEquation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/expEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAelC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAwEF,eAAO,MAAM,WAAW,EAAE,YAAY,CAAC,WAAW,CAYjD,CAAC"}

package/lib/exercises/calculLitteral/equation/expEquation.js

@@ -0,0 +1,75 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.expEquation = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const expNode_1 = require("../../../tree/nodes/functions/expNode");
+const logNode_1 = require("../../../tree/nodes/functions/logNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getExpEquation = () => {
+    const a = (0, randint_1.randint)(-9, 20, [0]);
+    const k = a > 0 ? (0, randint_1.randint)(1, 20) : (0, randint_1.randint)(-20, 0);
+    const equation = new equalNode_1.EqualNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new variableNode_1.VariableNode("x"))), new numberNode_1.NumberNode(k));
+    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new logNode_1.LogNode(new rational_1.Rational(k, a).simplify().toTree())])).toTex();
+    const question = {
+        instruction: `Résoudre l'équation $${equation.toTex()}$.`,
+        answer: answer,
+        keys: [
+            "x",
+            "equal",
+            "epower",
+            "exp",
+            "ln",
+            "S",
+            "lbrace",
+            "semicolon",
+            "rbrace",
+        ],
+        answerFormat: "tex",
+        identifiers: { a, k },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const randomA = (0, randint_1.randint)(1, 10);
+        const randomK = (0, randint_1.randint)(1, 20);
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+            new logNode_1.LogNode(new rational_1.Rational(randomK, randomA).simplify().toTree()),
+        ])).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, k }) => {
+    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+        new logNode_1.LogNode(new rational_1.Rational(k, a)
+            .simplify()
+            .toTree({ allowFractionToDecimal: true })),
+    ], { allowRawRightChildAsSolution: true }));
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.expEquation = {
+    id: "expEquation",
+    connector: "=",
+    label: "Résoudre des équations de type $a \\times \\exp(x) = k$",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    sections: ["Exponentielle"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpEquation, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/equation/firstDegreeEquation.d.ts

@@ -0,0 +1,8 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    b: number;
+};
+export declare const firstDegreeEquation: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=firstDegreeEquation.d.ts.map

package/lib/exercises/calculLitteral/equation/firstDegreeEquation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"firstDegreeEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/firstDegreeEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA6CF,eAAO,MAAM,mBAAmB,EAAE,YAAY,CAAC,WAAW,CAYzD,CAAC"}