math-exercises 2.0.12 → 2.0.13

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

@@ -1,61 +1,61 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.simpleDistributivity = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const integer_1 = require("../../../math/numbers/integer/integer");
-const affine_1 = require("../../../math/polynomials/affine");
-const discreteSet_1 = require("../../../math/sets/discreteSet");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const excludeNbrs = [new integer_1.Integer(-1), new integer_1.Integer(0), new integer_1.Integer(1)];
-const interval = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet(excludeNbrs));
-const getSimpleDistributivityQuestion = () => {
-    const affine = affine_1.AffineConstructor.random(interval, interval);
-    const coeff = interval.getRandomElement();
-    const statementTree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff.value), affine.toTree());
-    const answer = affine.times(coeff.value).toTree().toTex();
-    const question = {
-        instruction: `Développer et réduire : $${statementTree.toTex()}$`,
-        startStatement: statementTree.toTex(),
-        answer,
-        keys: ["x"],
-        answerFormat: "tex",
-        identifiers: { a: affine.a, b: affine.b, coeff: coeff.value },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, a, b, coeff }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const affine = new affine_1.Affine(a, b);
-    (0, exercise_1.tryToAddWrongProp)(propositions, new affine_1.Affine(coeff * a, b).toTree().toTex());
-    (0, exercise_1.tryToAddWrongProp)(propositions, new affine_1.Affine(a, coeff * b).toTree().toTex());
-    (0, exercise_1.tryToAddWrongProp)(propositions, affine.times(-coeff).toTree().toTex());
-    while (propositions.length < n) {
-        const wrongAnswer = affine_1.AffineConstructor.random(interval, interval).toTree();
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, coeff }) => {
-    const affine = new affine_1.Affine(a, b);
-    const answerTree = affine.times(coeff).toTree();
-    const validLatexs = answerTree.toAllValidTexs();
-    return validLatexs.includes(ans);
-};
-exports.simpleDistributivity = {
-    id: "simpleDistri",
-    connector: "=",
-    label: "Distributivité simple",
-    levels: ["3ème", "2nde", "CAP", "2ndPro", "1reTech"],
-    sections: ["Calcul littéral"],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSimpleDistributivityQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.simpleDistributivity = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const integer_1 = require("../../../math/numbers/integer/integer");
+const affine_1 = require("../../../math/polynomials/affine");
+const discreteSet_1 = require("../../../math/sets/discreteSet");
+const intervals_1 = require("../../../math/sets/intervals/intervals");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const excludeNbrs = [new integer_1.Integer(-1), new integer_1.Integer(0), new integer_1.Integer(1)];
+const interval = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet(excludeNbrs));
+const getSimpleDistributivityQuestion = () => {
+    const affine = affine_1.AffineConstructor.random(interval, interval);
+    const coeff = interval.getRandomElement();
+    const statementTree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff.value), affine.toTree());
+    const answer = affine.times(coeff.value).toTree().toTex();
+    const question = {
+        instruction: `Développer et réduire : $${statementTree.toTex()}$`,
+        startStatement: statementTree.toTex(),
+        answer,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: { a: affine.a, b: affine.b, coeff: coeff.value },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b, coeff }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const affine = new affine_1.Affine(a, b);
+    (0, exercise_1.tryToAddWrongProp)(propositions, new affine_1.Affine(coeff * a, b).toTree().toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new affine_1.Affine(a, coeff * b).toTree().toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, affine.times(-coeff).toTree().toTex());
+    while (propositions.length < n) {
+        const wrongAnswer = affine_1.AffineConstructor.random(interval, interval).toTree();
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, coeff }) => {
+    const affine = new affine_1.Affine(a, b);
+    const answerTree = affine.times(coeff).toTree();
+    const validLatexs = answerTree.toAllValidTexs();
+    return validLatexs.includes(ans);
+};
+exports.simpleDistributivity = {
+    id: "simpleDistri",
+    connector: "=",
+    label: "Distributivité simple",
+    levels: ["3ème", "2nde", "CAP", "2ndPro", "1reTech"],
+    sections: ["Calcul littéral"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSimpleDistributivityQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/distributivity/thirdIdentity.d.ts

@@ -1,11 +1,11 @@
-import { MathExercise, QCMGenerator, QuestionGenerator, VEA } from "../../../exercises/exercise";
-type Identifiers = {
-    affine1Coeffs: number[];
-    affine2Coeffs: number[];
-};
-export declare const getThirdIdentityQuestion: QuestionGenerator<Identifiers>;
-export declare const getThirdIdentityPropositions: QCMGenerator<Identifiers>;
-export declare const isThirdIdentityAnswerValid: VEA<Identifiers>;
-export declare const thirdIdentity: MathExercise<Identifiers>;
-export {};
+import { MathExercise, QCMGenerator, QuestionGenerator, VEA } from "../../../exercises/exercise";
+type Identifiers = {
+    affine1Coeffs: number[];
+    affine2Coeffs: number[];
+};
+export declare const getThirdIdentityQuestion: QuestionGenerator<Identifiers>;
+export declare const getThirdIdentityPropositions: QCMGenerator<Identifiers>;
+export declare const isThirdIdentityAnswerValid: VEA<Identifiers>;
+export declare const thirdIdentity: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=thirdIdentity.d.ts.map

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

@@ -1,69 +1,69 @@
-"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 integer_1 = require("../../../math/numbers/integer/integer");
-const affine_1 = require("../../../math/polynomials/affine");
-const discreteSet_1 = require("../../../math/sets/discreteSet");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const interval = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
-const getThirdIdentityQuestion = () => {
-    const affine = affine_1.AffineConstructor.random(interval, interval);
-    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(interval, interval);
-        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,
-};
+"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 integer_1 = require("../../../math/numbers/integer/integer");
+const affine_1 = require("../../../math/polynomials/affine");
+const discreteSet_1 = require("../../../math/sets/discreteSet");
+const intervals_1 = require("../../../math/sets/intervals/intervals");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const interval = new intervals_1.Interval("[[-10; 10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
+const getThirdIdentityQuestion = () => {
+    const affine = affine_1.AffineConstructor.random(interval, interval);
+    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(interval, interval);
+        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

@@ -1,7 +1,7 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    randNbr: number;
-};
-export declare const equationSimpleSquare: MathExercise<Identifiers>;
-export {};
+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.js

@@ -1,140 +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=\\emptyset`);
-        }
-    }
-    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=\\emptyset`);
-        }
-    }
-    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,
-};
+"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=\\emptyset`);
+        }
+    }
+    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=\\emptyset`);
+        }
+    }
+    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

@@ -1,11 +1,11 @@
-import { MathExercise } from "../../../exercises/exercise";
-/**
- *  type x+a=b
- */
-type Identifiers = {
-    a: number;
-    b: number;
-};
-export declare const equationType1Exercise: MathExercise<Identifiers>;
-export {};
+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