math-exercises 1.4.18 → 2.0.1

package/lib/exercises/functions/trinoms/extremumFromCanonicalForm.d.ts

@@ -1,4 +1,11 @@
-import { MathExercise, Question } from '../../../exercises/exercise';
-export declare const extremumFromCanonicalForm: MathExercise;
-export declare function getExtremumFromCanonicalFormQuestion(): Question;
+import { MathExercise } from '../../../exercises/exercise';
+type QCMProps = {
+    answer: string;
+    a: number;
+    b: number;
+    c: number;
+};
+type VEAProps = {};
+export declare const extremumFromCanonicalForm: MathExercise<QCMProps, VEAProps>;
+export {};
 //# sourceMappingURL=extremumFromCanonicalForm.d.ts.map

package/lib/exercises/functions/trinoms/extremumFromCanonicalForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"extremumFromCanonicalForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/extremumFromCanonicalForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO/E,eAAO,MAAM,yBAAyB,EAAE,YAWvC,CAAC;AAEF,wBAAgB,oCAAoC,IAAI,QAAQ,CAmE/D"}
+{"version":3,"file":"extremumFromCanonicalForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/extremumFromCanonicalForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAoCnB,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWtE,CAAC"}

package/lib/exercises/functions/trinoms/extremumFromCanonicalForm.js

@@ -1,86 +1,48 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getExtremumFromCanonicalFormQuestion = exports.extremumFromCanonicalForm = void 0;
+exports.extremumFromCanonicalForm = void 0;
+const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const trinom_1 = require("../../../math/polynomials/trinom");
 const randint_1 = require("../../../math/utils/random/randint");
 const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.extremumFromCanonicalForm = {
-    id: 'extremumFromCanonicalForm',
-    connector: '=',
-    instruction: '',
-    label: "Déterminer les coordonnées du sommet d'une parabole à partir de la forme canonique",
-    levels: ['1reSpé'],
-    isSingleStep: true,
-    sections: ['Second degré'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExtremumFromCanonicalFormQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-};
-function getExtremumFromCanonicalFormQuestion() {
+const getExtremumFromCanonicalFormQuestion = () => {
     const trinom = trinom_1.TrinomConstructor.randomCanonical();
     const answer = trinom.getSommet();
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        const alpha = trinom.getAlpha();
-        const beta = trinom.getBeta();
-        if (alpha !== beta) {
-            res.push({
-                id: (0, uuid_1.v4)(),
-                statement: `S\\left(${beta}; ${alpha}\\right)`,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        }
-        if (alpha !== 0) {
-            res.push({
-                id: (0, uuid_1.v4)(),
-                statement: `S\\left(${-alpha}; ${beta}\\right)`,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        }
-        if (beta !== 0) {
-            res.push({
-                id: (0, uuid_1.v4)(),
-                statement: `S\\left(${alpha}; ${-beta}\\right)`,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        }
-        const missing = n - res.length;
-        for (let i = 0; i < missing; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: `S\\left(${(0, randint_1.randint)(-10, 11)}; ${(0, randint_1.randint)(-10, 11)} \\right)`,
-                    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: answer,
         instruction: `Soit $f$ la fonction définie par $${trinom
             .getCanonicalForm()
             .toTex()}$. Quelles sont les coordonnées du sommet $S$ de la parabole représentative de $f$ ?`,
         keys: ['S', 'equal', 'semicolon'],
-        getPropositions,
         answerFormat: 'tex',
+        qcmGeneratorProps: { answer, a: trinom.a, b: trinom.b, c: trinom.c },
     };
     return question;
-}
-exports.getExtremumFromCanonicalFormQuestion = getExtremumFromCanonicalFormQuestion;
+};
+const getPropositions = (n, { answer, a, b, c }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const trinom = new trinom_1.Trinom(a, b, c);
+    const alpha = trinom.getAlpha();
+    const beta = trinom.getBeta();
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S\\left(${beta}; ${alpha}\\right)`);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S\\left(${-alpha}; ${beta}\\right)`);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S\\left(${alpha}; ${-beta}\\right)`);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S\\left(${(0, randint_1.randint)(-10, 11)}; ${(0, randint_1.randint)(-10, 11)} \\right)`);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.extremumFromCanonicalForm = {
+    id: 'extremumFromCanonicalForm',
+    connector: '=',
+    label: "Déterminer les coordonnées du sommet d'une parabole à partir de la forme canonique",
+    levels: ['1reSpé'],
+    isSingleStep: true,
+    sections: ['Second degré'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExtremumFromCanonicalFormQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

package/lib/exercises/functions/trinoms/extremumTypeFromAlgebricForm.d.ts

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

package/lib/exercises/functions/trinoms/extremumTypeFromAlgebricForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"extremumTypeFromAlgebricForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/extremumTypeFromAlgebricForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO/E,eAAO,MAAM,4BAA4B,EAAE,YAW1C,CAAC;AAEF,wBAAgB,uCAAuC,IAAI,QAAQ,CA6ClE"}
+{"version":3,"file":"extremumTypeFromAlgebricForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/extremumTypeFromAlgebricForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA6BnB,eAAO,MAAM,4BAA4B,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWzE,CAAC"}

package/lib/exercises/functions/trinoms/extremumTypeFromAlgebricForm.js

@@ -1,14 +1,34 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getExtremumTypeFromAlgebricFormQuestion = exports.extremumTypeFromAlgebricForm = void 0;
+exports.extremumTypeFromAlgebricForm = void 0;
+const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const trinom_1 = require("../../../math/polynomials/trinom");
 const coinFlip_1 = require("../../../utils/coinFlip");
 const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
+const getExtremumTypeFromAlgebricFormQuestion = () => {
+    const isDevForm = (0, coinFlip_1.coinFlip)();
+    const trinom = isDevForm ? trinom_1.TrinomConstructor.random() : trinom_1.TrinomConstructor.randomCanonical();
+    const answer = trinom.a > 0 ? 'Un minimum' : 'Un maximum';
+    const question = {
+        answer: answer,
+        instruction: `La fonction $f$ définie par $f(x) = ${isDevForm ? trinom.toTree().toTex() : trinom.getCanonicalForm().toTex()}$ admet-elle un maximum ou un minimum ?`,
+        answerFormat: 'raw',
+        keys: [],
+        qcmGeneratorProps: { answer, a: trinom.a },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer, 'raw');
+    (0, exercise_1.tryToAddWrongProp)(propositions, a < 0 ? 'Un minimum' : 'Un maximum', 'raw');
+    (0, exercise_1.addWrongProp)(propositions, "Ni l'un ni l'autre", 'raw');
+    (0, exercise_1.addWrongProp)(propositions, 'On ne peut pas savoir', 'raw');
+    return (0, shuffle_1.shuffle)(propositions);
+};
 exports.extremumTypeFromAlgebricForm = {
     id: 'extremumTypeFromAlgebricForm',
-    instruction: '',
     label: "Déterminer le type d'extremum d'une fonction du second degré via sa forme algébrique",
     levels: ['1reSpé'],
     isSingleStep: true,
@@ -17,46 +37,5 @@ exports.extremumTypeFromAlgebricForm = {
     answerType: 'QCM',
     qcmTimer: 60,
     freeTimer: 60,
+    getPropositions,
 };
-function getExtremumTypeFromAlgebricFormQuestion() {
-    const isDevForm = (0, coinFlip_1.coinFlip)();
-    const trinom = isDevForm ? trinom_1.TrinomConstructor.random() : trinom_1.TrinomConstructor.randomCanonical();
-    const answer = trinom.a > 0 ? 'Un minimum' : 'Un maximum';
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: answer,
-            isRightAnswer: true,
-            format: 'raw',
-        });
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: trinom.a < 0 ? 'Un minimum' : 'Un maximum',
-            isRightAnswer: false,
-            format: 'raw',
-        });
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: "Ni l'un ni l'autre",
-            isRightAnswer: false,
-            format: 'raw',
-        });
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: 'On ne peut pas savoir',
-            isRightAnswer: false,
-            format: 'raw',
-        });
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        answer: answer,
-        instruction: `La fonction $f$ définie par $f(x) = ${isDevForm ? trinom.toTree().toTex() : trinom.getCanonicalForm().toTex()}$ admet-elle un maximum ou un minimum ?`,
-        getPropositions,
-        answerFormat: 'raw',
-        keys: [],
-    };
-    return question;
-}
-exports.getExtremumTypeFromAlgebricFormQuestion = getExtremumTypeFromAlgebricFormQuestion;

package/lib/exercises/functions/trinoms/niceRootsFromDevForm.d.ts

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

package/lib/exercises/functions/trinoms/niceRootsFromDevForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"niceRootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/niceRootsFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAOlG,eAAO,MAAM,oBAAoB,EAAE,YAWlC,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CAgDtD"}
+{"version":3,"file":"niceRootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/niceRootsFromDevForm.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;AAgCnB,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAYjE,CAAC"}

package/lib/exercises/functions/trinoms/niceRootsFromDevForm.js

@@ -1,16 +1,39 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getRootsFromDevFormQuestion = exports.niceRootsFromDevForm = void 0;
+exports.niceRootsFromDevForm = void 0;
 const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const trinom_1 = require("../../../math/polynomials/trinom");
 const randint_1 = require("../../../math/utils/random/randint");
 const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
+const getRootsFromDevFormQuestion = () => {
+    const trinom = trinom_1.TrinomConstructor.randomFactorized();
+    const answer = trinom.getRootsEquationSolutionTex();
+    const question = {
+        answer: answer,
+        instruction: `Soit $f(x) = ${trinom.toTree().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
+        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
+        qcmGeneratorProps: { answer },
+        answerFormat: 'tex',
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, 'S=\\emptyset');
+    while (propositions.length < n) {
+        let wrongX1 = (0, randint_1.randint)(-19, 0);
+        let wrongX2 = (0, randint_1.randint)(0, 20);
+        const wrongAnswer = `S=\\left\\{${wrongX1};${wrongX2}\\right\\}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
 exports.niceRootsFromDevForm = {
     id: 'niceRootsFromDevForm',
     connector: '\\iff',
-    instruction: '',
+    getPropositions,
     label: 'Résoudre une équation du second degré (solutions entières)',
     levels: ['1reSpé', 'TermSpé', 'MathComp'],
     isSingleStep: true,
@@ -19,45 +42,3 @@ exports.niceRootsFromDevForm = {
     qcmTimer: 60,
     freeTimer: 60,
 };
-function getRootsFromDevFormQuestion() {
-    const trinom = trinom_1.TrinomConstructor.randomFactorized();
-    const answer = trinom.getRootsEquationSolutionTex();
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: answer,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        (0, exercise_1.tryToAddWrongProp)(res, 'S=\\emptyset');
-        const missing = n - res.length;
-        for (let i = 0; i < missing; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                let wrongX1 = (0, randint_1.randint)(-19, 0);
-                let wrongX2 = (0, randint_1.randint)(0, 20);
-                const wrongAnswer = `S=\\left\\{${wrongX1};${wrongX2}\\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 = {
-        answer: answer,
-        instruction: `Soit $f(x) = ${trinom.toTree().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
-        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getRootsFromDevFormQuestion = getRootsFromDevFormQuestion;

package/lib/exercises/functions/trinoms/rootsFromDevForm.d.ts

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

package/lib/exercises/functions/trinoms/rootsFromDevForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAOlG,eAAO,MAAM,gBAAgB,EAAE,YAW9B,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CA+CtD"}
+{"version":3,"file":"rootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsFromDevForm.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;AAgCnB,eAAO,MAAM,gBAAgB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAY7D,CAAC"}

package/lib/exercises/functions/trinoms/rootsFromDevForm.js

@@ -1,16 +1,39 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getRootsFromDevFormQuestion = exports.rootsFromDevForm = void 0;
+exports.rootsFromDevForm = void 0;
 const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const trinom_1 = require("../../../math/polynomials/trinom");
 const randint_1 = require("../../../math/utils/random/randint");
 const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
+const getRootsFromDevFormQuestion = () => {
+    const trinom = trinom_1.TrinomConstructor.random();
+    const answer = trinom.getRootsEquationSolutionTex();
+    const question = {
+        answer: answer,
+        instruction: `Soit $f(x) = ${trinom.toTree().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
+        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
+        answerFormat: 'tex',
+        qcmGeneratorProps: { answer },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, 'S=\\emptyset');
+    while (propositions.length < n) {
+        let wrongX1 = (0, randint_1.randint)(-19, 0);
+        let wrongX2 = (0, randint_1.randint)(0, 20);
+        const wrongAnswer = `S=\\left\\{${wrongX1};${wrongX2}\\right\\}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
 exports.rootsFromDevForm = {
     id: 'rootsFromDevForm',
     connector: '\\iff',
-    instruction: '',
+    getPropositions,
     label: 'Résoudre une équation du second degré',
     levels: ['1reSpé', 'TermSpé', 'MathComp'],
     isSingleStep: true,
@@ -19,45 +42,3 @@ exports.rootsFromDevForm = {
     qcmTimer: 60,
     freeTimer: 60,
 };
-function getRootsFromDevFormQuestion() {
-    const trinom = trinom_1.TrinomConstructor.random();
-    const answer = trinom.getRootsEquationSolutionTex();
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: answer,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        (0, exercise_1.tryToAddWrongProp)(res, 'S=\\emptyset');
-        const missing = n - res.length;
-        for (let i = 0; i < missing; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                let wrongX1 = (0, randint_1.randint)(-19, 0);
-                let wrongX2 = (0, randint_1.randint)(0, 20);
-                const wrongAnswer = `S=\\left\\{${wrongX1};${wrongX2}\\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 = {
-        answer: answer,
-        instruction: `Soit $f(x) = ${trinom.toTree().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
-        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getRootsFromDevFormQuestion = getRootsFromDevFormQuestion;

package/lib/exercises/functions/trinoms/rootsFromFactorizedForm.d.ts

@@ -1,4 +1,11 @@
-import { MathExercise, Question } from '../../../exercises/exercise';
-export declare const rootsFromFactorizedForm: MathExercise;
-export declare function getRootsFromFactorizedFormQuestion(): Question;
+import { MathExercise } from '../../../exercises/exercise';
+type QCMProps = {
+    answer: string;
+    a: number;
+    b: number;
+    c: number;
+};
+type VEAProps = {};
+export declare const rootsFromFactorizedForm: MathExercise<QCMProps, VEAProps>;
+export {};
 //# sourceMappingURL=rootsFromFactorizedForm.d.ts.map

package/lib/exercises/functions/trinoms/rootsFromFactorizedForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rootsFromFactorizedForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsFromFactorizedForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS/E,eAAO,MAAM,uBAAuB,EAAE,YAWrC,CAAC;AAEF,wBAAgB,kCAAkC,IAAI,QAAQ,CAiF7D"}
+{"version":3,"file":"rootsFromFactorizedForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsFromFactorizedForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA8CnB,eAAO,MAAM,uBAAuB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWpE,CAAC"}

package/lib/exercises/functions/trinoms/rootsFromFactorizedForm.js

@@ -1,17 +1,51 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getRootsFromFactorizedFormQuestion = exports.rootsFromFactorizedForm = void 0;
+exports.rootsFromFactorizedForm = void 0;
+const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const trinom_1 = require("../../../math/polynomials/trinom");
 const randint_1 = require("../../../math/utils/random/randint");
 const oppositeNode_1 = require("../../../tree/nodes/functions/oppositeNode");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
+const getRootsFromFactorizedFormQuestion = () => {
+    const trinom = trinom_1.TrinomConstructor.randomFactorized();
+    const answer = trinom.getRootsEquationSolutionTex();
+    const question = {
+        answer: answer,
+        instruction: `Soit $f(x) = ${trinom.getFactorizedForm().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
+        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
+        answerFormat: 'tex',
+        qcmGeneratorProps: { answer, a: trinom.a, b: trinom.b, c: trinom.c },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b, c }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const trinom = new trinom_1.Trinom(a, b, c);
+    const roots = trinom.getRoots();
+    if (roots.length === 1 && roots[0] !== 0) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\{${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0]))}\\}`);
+    }
+    if (roots.length === 2 && roots[0] !== 0) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\{${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0])).toTex()};${roots[1]}\\}`);
+    }
+    if (roots.length === 2 && roots[1] !== 0) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\{${roots[0]};${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[1])).toTex()}\\}`);
+    }
+    if (roots.length === 2 && roots[0] !== 0 && roots[1] !== 0) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\{${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0])).toTex()};${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[1])).toTex()}\\}`);
+    }
+    while (propositions.length < n) {
+        const wrongAnswer = `S=\\{${(0, randint_1.randint)(-10, 11)};${(0, randint_1.randint)(-10, 11)}\\}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
 exports.rootsFromFactorizedForm = {
     id: 'rootsFromFactorizedForm',
     connector: '=',
-    instruction: '',
     label: "Déterminer les racines d'un trinôme à partir de sa forme factorisée",
     levels: ['1reSpé', 'TermSpé', 'MathComp'],
     isSingleStep: true,
@@ -19,76 +53,5 @@ exports.rootsFromFactorizedForm = {
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRootsFromFactorizedFormQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
+    getPropositions,
 };
-function getRootsFromFactorizedFormQuestion() {
-    const trinom = trinom_1.TrinomConstructor.randomFactorized();
-    const answer = trinom.getRootsEquationSolutionTex();
-    const roots = trinom.getRoots();
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: answer,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        if (roots.length === 1 && roots[0] !== 0) {
-            res.push({
-                id: (0, uuid_1.v4)(),
-                statement: `S=\\{${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0]))}\\}`,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        }
-        if (roots.length === 2 && roots[0] !== 0) {
-            res.push({
-                id: (0, uuid_1.v4)(),
-                statement: `S=\\{${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0])).toTex()};${roots[1]}\\}`,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        }
-        if (roots.length === 2 && roots[1] !== 0) {
-            res.push({
-                id: (0, uuid_1.v4)(),
-                statement: `S=\\{${roots[0]};${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[1])).toTex()}\\}`,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        }
-        if (roots.length === 2 && roots[0] !== 0 && roots[1] !== 0) {
-            res.push({
-                id: (0, uuid_1.v4)(),
-                statement: `S=\\{${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[0])).toTex()};${new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(roots[1])).toTex()}\\}`,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-        }
-        const missing = n - res.length;
-        for (let i = 0; i < missing; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = `S=\\{${(0, randint_1.randint)(-10, 11)};${(0, randint_1.randint)(-10, 11)}\\}`;
-                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 = {
-        answer: answer,
-        instruction: `Soit $f(x) = ${trinom.getFactorizedForm().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
-        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getRootsFromFactorizedFormQuestion = getRootsFromFactorizedFormQuestion;

package/lib/exercises/functions/trinoms/variationsFromAlgebricForm.d.ts

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

package/lib/exercises/functions/trinoms/variationsFromAlgebricForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"variationsFromAlgebricForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/variationsFromAlgebricForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO/E,eAAO,MAAM,0BAA0B,EAAE,YAWxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CA4ChE"}
+{"version":3,"file":"variationsFromAlgebricForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/variationsFromAlgebricForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA6BnB,eAAO,MAAM,0BAA0B,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWvE,CAAC"}