math-exercises 2.0.12 → 2.0.13

package/lib/exercises/geometry/cartesian/leadingCoefficient.js

@@ -0,0 +1,93 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLeadingCoefficientQuestion = exports.leadingCoefficient = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const droite_1 = require("../../../math/geometry/droite");
+const point_1 = require("../../../math/geometry/point");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const mathjs_1 = require("mathjs");
+const uuid_1 = require("uuid");
+exports.leadingCoefficient = {
+    id: 'leadingCoefficient',
+    connector: '=',
+    instruction: 'Déterminer le coefficient directeur de la droite représentée ci-dessous :',
+    label: 'Déterminer le coefficient directeur',
+    levels: ['3', '2', '1'],
+    isSingleStep: false,
+    section: 'Droites',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientQuestion, nb),
+};
+function getLeadingCoefficientQuestion() {
+    let xA, yA, xB, yB;
+    let pointA, pointB;
+    do {
+        [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-5, 6));
+        xB = xA > 0 ? (0, randint_1.randint)(xA - 4, 6) : (0, randint_1.randint)(-4, xA + 5); // l'écart entre les deux points ne soit pas grand
+        yB = yA > 0 ? (0, randint_1.randint)(yA - 4, 6) : (0, randint_1.randint)(-4, yA + 5);
+        pointA = new point_1.Point('A', new numberNode_1.NumberNode(xA), new numberNode_1.NumberNode(yA));
+        pointB = new point_1.Point('B', new numberNode_1.NumberNode(xB), new numberNode_1.NumberNode(yB));
+    } while (xB - xA === 0);
+    const droite = droite_1.DroiteConstructor.fromTwoPoints(pointA, pointB, 'D');
+    const a = droite.a.toMathString();
+    const b = droite.b.toMathString();
+    const aValue = (0, mathjs_1.evaluate)(a);
+    const bValue = (0, mathjs_1.evaluate)(b);
+    let xmin, xmax, ymin, ymax;
+    if (bValue > 0) {
+        ymax = bValue + 1;
+        ymin = -1;
+    }
+    else {
+        ymin = bValue - 1;
+        ymax = 1;
+    }
+    if (-bValue / aValue > 0) {
+        xmax = -bValue / aValue + 1;
+        xmin = -1;
+    }
+    else {
+        xmin = -bValue / aValue - 1;
+        xmax = 1;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: droite.getLeadingCoefficient(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = droite.getLeadingCoefficient() !== '0'
+                    ? (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(droite.a, new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0, 1]))))
+                    : new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0]));
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: droite.getLeadingCoefficient(),
+        keys: [],
+        commands: [`f(x) = (${a}) * x + (${b})`],
+        coords: [xmin, xmax, ymin, ymax],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLeadingCoefficientQuestion = getLeadingCoefficientQuestion;

package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV1.d.ts

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../../exercises/exercise';
+export declare const leadingCoefficientCalculV1: Exercise;
+export declare function getLeadingCoefficientCalculV1Question(): Question;
+//# sourceMappingURL=leadingCoefficientCalculV1.d.ts.map

package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV1.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leadingCoefficientCalculV1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/leadingCoefficientCalculV1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CAmDhE"}

package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV1.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLeadingCoefficientCalculV1Question = exports.leadingCoefficientCalculV1 = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.leadingCoefficientCalculV1 = {
+    id: 'leadingCoefficientCalculV1',
+    connector: '=',
+    instruction: '',
+    label: "Calculer le coefficient directeur d'une fonction affine",
+    levels: ['3', '2', '1'],
+    isSingleStep: true,
+    section: 'Fonctions affines',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
+};
+function getLeadingCoefficientCalculV1Question() {
+    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
+    const xB = (0, randint_1.randint)(-9, 10, [xA]);
+    const yB = (0, randint_1.randint)(-9, 10);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA + (0, randint_1.randint)(-3, 4, [0])), new numberNode_1.NumberNode(xB - xA + (0, randint_1.randint)(-3, 4, [0])))).toTex();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: `Soit $f$ une fonction affine telle que $f(${xA})$ = $${yA}$ et $f(${xB})$ = $${yB}$.$\\\\$Quel est le coefficient directeur de $f$ ?`,
+        startStatement: 'a',
+        answer: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLeadingCoefficientCalculV1Question = getLeadingCoefficientCalculV1Question;

package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV2.d.ts

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../../exercises/exercise';
+export declare const leadingCoefficientCalculV2: Exercise;
+export declare function getLeadingCoefficientCalculV1Question(): Question;
+//# sourceMappingURL=leadingCoefficientCalculV2.d.ts.map

package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leadingCoefficientCalculV2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/leadingCoefficientCalculV2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CAkDhE"}

package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV2.js

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLeadingCoefficientCalculV1Question = exports.leadingCoefficientCalculV2 = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.leadingCoefficientCalculV2 = {
+    id: 'leadingCoefficientCalculV2',
+    connector: '=',
+    instruction: '',
+    label: "Coefficient directeur à l'aide de deux points",
+    levels: ['3', '2', '1'],
+    isSingleStep: false,
+    section: 'Droites',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
+};
+function getLeadingCoefficientCalculV1Question() {
+    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
+    const xB = (0, randint_1.randint)(-9, 10, [xA]);
+    const yB = (0, randint_1.randint)(-9, 10);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA + (0, randint_1.randint)(-3, 4, [0])), new numberNode_1.NumberNode(xB - xA + (0, randint_1.randint)(-3, 4, [0])))).toTex();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: `Soit $d$ une droite passant par les points $A(${xA};${yA})$ et $B(${xB};${yB})$.$\\\\$Déterminer le coefficient directeur de $d$.`,
+        answer: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLeadingCoefficientCalculV1Question = getLeadingCoefficientCalculV1Question;

package/lib/exercises/geometry/cartesian/midpoint.d.ts

@@ -1,8 +1,8 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    coordsA: number[];
-    coordsB: number[];
-};
-export declare const midpoint: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    coordsA: number[];
+    coordsB: number[];
+};
+export declare const midpoint: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=midpoint.d.ts.map

package/lib/exercises/geometry/cartesian/midpoint.js

@@ -1,63 +1,63 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.midpoint = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const point_1 = require("../../../math/geometry/point");
-const randTupleInt_1 = require("../../../math/utils/random/randTupleInt");
-const pointNode_1 = require("../../../tree/nodes/geometry/pointNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const getMidpointQuestion = () => {
-    const [coords1, coords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, { from: -9, to: 10 });
-    const A = new point_1.Point("A", new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
-    const B = new point_1.Point("B", new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
-    const answer = A.midpoint(B).toTexWithCoords();
-    const question = {
-        instruction: `Soit $${A.toTexWithCoords()}$ et $${B.toTexWithCoords()}$. Quelles sont les coordonnées du milieu $I$ de $[AB]$ ?`,
-        startStatement: "I",
-        answer,
-        keys: ["I", "semicolon"],
-        answerFormat: "tex",
-        identifiers: { coordsA: coords1, coordsB: coords2 },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const [tempCoords1, tempsCoords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, {
-            from: -9,
-            to: 10,
-        });
-        const temps1 = new point_1.Point("A", new numberNode_1.NumberNode(tempCoords1[0]), new numberNode_1.NumberNode(tempCoords1[1]));
-        const temps2 = new point_1.Point("B", new numberNode_1.NumberNode(tempsCoords2[0]), new numberNode_1.NumberNode(tempsCoords2[1]));
-        const wrongAnswer = temps1.midpoint(temps2);
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTexWithCoords());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { coordsA, coordsB }) => {
-    const A = new point_1.Point("A", new numberNode_1.NumberNode(coordsA[0]), new numberNode_1.NumberNode(coordsA[1]));
-    const B = new point_1.Point("B", new numberNode_1.NumberNode(coordsB[0]), new numberNode_1.NumberNode(coordsB[1]));
-    const answer = new pointNode_1.PointNode(A.midpoint(B), {
-        allowFractionToDecimal: true,
-    });
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.midpoint = {
-    id: "midpoint",
-    connector: "=",
-    label: "Coordonnées du milieu",
-    levels: ["3ème", "2nde"],
-    isSingleStep: false,
-    sections: ["Géométrie cartésienne"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMidpointQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.midpoint = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const point_1 = require("../../../math/geometry/point");
+const randTupleInt_1 = require("../../../math/utils/random/randTupleInt");
+const pointNode_1 = require("../../../tree/nodes/geometry/pointNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getMidpointQuestion = () => {
+    const [coords1, coords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, { from: -9, to: 10 });
+    const A = new point_1.Point("A", new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
+    const B = new point_1.Point("B", new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
+    const answer = A.midpoint(B).toTexWithCoords();
+    const question = {
+        instruction: `Soit $${A.toTexWithCoords()}$ et $${B.toTexWithCoords()}$. Quelles sont les coordonnées du milieu $I$ de $[AB]$ ?`,
+        startStatement: "I",
+        answer,
+        keys: ["I", "semicolon"],
+        answerFormat: "tex",
+        identifiers: { coordsA: coords1, coordsB: coords2 },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const [tempCoords1, tempsCoords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, {
+            from: -9,
+            to: 10,
+        });
+        const temps1 = new point_1.Point("A", new numberNode_1.NumberNode(tempCoords1[0]), new numberNode_1.NumberNode(tempCoords1[1]));
+        const temps2 = new point_1.Point("B", new numberNode_1.NumberNode(tempsCoords2[0]), new numberNode_1.NumberNode(tempsCoords2[1]));
+        const wrongAnswer = temps1.midpoint(temps2);
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTexWithCoords());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { coordsA, coordsB }) => {
+    const A = new point_1.Point("A", new numberNode_1.NumberNode(coordsA[0]), new numberNode_1.NumberNode(coordsA[1]));
+    const B = new point_1.Point("B", new numberNode_1.NumberNode(coordsB[0]), new numberNode_1.NumberNode(coordsB[1]));
+    const answer = new pointNode_1.PointNode(A.midpoint(B), {
+        allowFractionToDecimal: true,
+    });
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.midpoint = {
+    id: "midpoint",
+    connector: "=",
+    label: "Coordonnées du milieu",
+    levels: ["3ème", "2nde"],
+    isSingleStep: false,
+    sections: ["Géométrie cartésienne"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMidpointQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/geometry/cartesian/signFunction.d.ts

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../../exercises/exercise';
+export declare const signFunction: Exercise;
+export declare function getSignFunction(): Question;
+//# sourceMappingURL=signFunction.d.ts.map

package/lib/exercises/geometry/cartesian/signFunction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"signFunction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/signFunction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAEF,wBAAgB,eAAe,IAAI,QAAQ,CAuE1C"}

package/lib/exercises/geometry/cartesian/signFunction.js

@@ -0,0 +1,84 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSignFunction = exports.signFunction = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../../math/polynomials/polynomial");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.signFunction = {
+    id: 'signFunction',
+    connector: '=',
+    instruction: '',
+    label: "Signe d'une fonction affine",
+    levels: ['4', '3', '2'],
+    section: 'Fonctions affines',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSignFunction, nb),
+    keys: ['S', 'equal', 'lbracket', 'rbracket', 'semicolon', 'infty'],
+};
+function getSignFunction() {
+    const a = (0, randint_1.randint)(-9, 10, [0]);
+    const b = (0, randint_1.randint)(-9, 10);
+    const affine = new polynomial_1.Polynomial([b, a]);
+    let instruction = `Soit $f$ la fonction définie par : $f(x) = ${affine.toTex()}$. Sur quel intervalle $f$ est-elle `;
+    let answer = '';
+    switch ((0, coinFlip_1.coinFlip)()) {
+        case true:
+            instruction += 'positive ?';
+            answer =
+                a > 0
+                    ? `\\left[${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()};+\\infty\\right[`
+                    : `\\left]-\\infty;${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()}\\right]`;
+            break;
+        case false:
+            instruction += 'négative ?';
+            answer =
+                a > 0
+                    ? `\\left]-\\infty;${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()}\\right]`
+                    : `\\left[${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()};+\\infty\\left[`;
+            break;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const a = (0, randint_1.randint)(-9, 10, [0]);
+                const b = (0, randint_1.randint)(-9, 10);
+                const wrongAnswer = (0, coinFlip_1.coinFlip)()
+                    ? `\\left[${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()};+\\infty\\right[`
+                    : `\\left]-\\infty;${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()}\\right]`;
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction,
+        startStatement: 'S',
+        answer,
+        keys: ['S', 'equal', 'lbracket', 'rbracket', 'semicolon', 'infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSignFunction = getSignFunction;

package/lib/exercises/geometry/euclidean/circleArea.d.ts

@@ -1,8 +1,4 @@
-import { MathExercise } from '../../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-};
-type VEAProps = {};
-export declare const circleArea: MathExercise<QCMProps, VEAProps>;
-export {};
+import { MathExercise, Question } from '../../../exercises/exercise';
+export declare const circleArea: MathExercise;
+export declare function getCircleArea(): Question;
 //# sourceMappingURL=circleArea.d.ts.map

package/lib/exercises/geometry/euclidean/circleArea.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"circleArea.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/circleArea.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAOlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA8BnB,eAAO,MAAM,UAAU,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWvD,CAAC"}
+{"version":3,"file":"circleArea.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/circleArea.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAe,MAAM,0BAA0B,CAAC;AAQ/E,eAAO,MAAM,UAAU,EAAE,YAWxB,CAAC;AAEF,wBAAgB,aAAa,IAAI,QAAQ,CAgDxC"}

package/lib/exercises/geometry/euclidean/circleArea.js

@@ -1,38 +1,16 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.circleArea = void 0;
-const exercise_1 = require("../../../exercises/exercise");
+exports.getCircleArea = exports.circleArea = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const randint_1 = require("../../../math/utils/random/randint");
 const round_1 = require("../../../math/utils/round");
 const coinFlip_1 = require("../../../utils/coinFlip");
 const shuffle_1 = require("../../../utils/shuffle");
-const getCircleArea = () => {
-    const radius = (0, randint_1.randint)(1, 13);
-    const diametre = (0, randint_1.randint)(1, 21);
-    const coin = (0, coinFlip_1.coinFlip)();
-    const answerNb = coin ? (0, round_1.round)(Math.PI * radius ** 2, 2) : (0, round_1.round)(Math.PI * (diametre / 2) ** 2, 2);
-    const answer = (answerNb + '').replace('.', ',');
-    const question = {
-        instruction: `Calculer l'aire d'un cercle de ${coin ? 'rayon ' + radius : 'diamètre ' + diametre} cm.`,
-        answer,
-        answerFormat: 'tex',
-        keys: [],
-        qcmGeneratorProps: { answer },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, round_1.round)(Math.random() * 100, 2) + '');
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
+const uuid_1 = require("uuid");
 exports.circleArea = {
     id: 'circleArea',
     connector: '=',
+    instruction: '',
     label: "Calculer l'aire d'un cercle",
     levels: ['4ème', '3ème', '2nde'],
     isSingleStep: false,
@@ -40,5 +18,44 @@ exports.circleArea = {
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCircleArea, nb),
     qcmTimer: 60,
     freeTimer: 60,
-    getPropositions,
 };
+function getCircleArea() {
+    const radius = (0, randint_1.randint)(1, 13);
+    const diametre = (0, randint_1.randint)(1, 21);
+    const coin = (0, coinFlip_1.coinFlip)();
+    const correctAnswer = coin ? (0, round_1.round)(Math.PI * radius ** 2, 2) + '' : (0, round_1.round)(Math.PI * (diametre / 2) ** 2, 2) + '';
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: correctAnswer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, round_1.round)(Math.random() * 100, 2) + '';
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: `Calculer l'aire d'un cercle de ${coin ? 'rayon ' + radius : 'diamètre ' + diametre} cm.`,
+        answer: correctAnswer,
+        getPropositions,
+        answerFormat: 'tex',
+        keys: [],
+    };
+    return question;
+}
+exports.getCircleArea = getCircleArea;

package/lib/exercises/geometry/euclidean/circleCircumference.d.ts

@@ -1,8 +1,4 @@
-import { MathExercise } from '../../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-};
-type VEAProps = {};
-export declare const circleCircumference: MathExercise<QCMProps, VEAProps>;
-export {};
+import { MathExercise, Question } from '../../../exercises/exercise';
+export declare const circleCircumference: MathExercise;
+export declare function getCircleCircumference(): Question;
 //# sourceMappingURL=circleCircumference.d.ts.map

package/lib/exercises/geometry/euclidean/circleCircumference.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"circleCircumference.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/circleCircumference.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA8BnB,eAAO,MAAM,mBAAmB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWhE,CAAC"}
+{"version":3,"file":"circleCircumference.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/circleCircumference.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAe,MAAM,0BAA0B,CAAC;AAQ/E,eAAO,MAAM,mBAAmB,EAAE,YAWjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CAgDjD"}