math-exercises 1.4.18 → 2.0.0

package/lib/exercises/probaStat/probabilityTree.js

@@ -1,74 +1,70 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getProbabilityTree = exports.probabilityTree = void 0;
+exports.probabilityTree = void 0;
 const randint_1 = require("../../math/utils/random/randint");
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
 const simplify_1 = require("../../tree/parsers/simplify");
 const shuffle_1 = require("../../utils/shuffle");
+const exercise_1 = require("../exercise");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-exports.probabilityTree = {
-    id: 'probabilityTree',
-    connector: '=',
-    instruction: '',
-    label: "Calculs de probabilités à l'aide d'un arbre pondéré",
-    levels: ['2nde', '1reESM', '1reSpé', '1reTech', '1rePro', 'TermPro', 'TermTech'],
-    isSingleStep: false,
-    sections: ['Probabilités'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getProbabilityTree, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-};
 function pgcd(a, b) {
     while (b)
         [a, b] = [b, a % b];
     return a;
 }
-function getProbabilityTree() {
-    const A = (0, randint_1.randint)(2, 9);
-    const B = (0, randint_1.randint)(2, 10 - A);
-    const AC = (0, randint_1.randint)(2, 9);
-    const AD = (0, randint_1.randint)(2, 10 - AC);
-    const BC = (0, randint_1.randint)(2, 9);
-    const BD = (0, randint_1.randint)(2, 10 - BC);
+const getAnswerNode = ({ type, A, B, AC, AD, BC, BD }) => {
     const pA = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(A / (A + B)));
     const pB = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(B / (A + B)));
     const pA_C = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(AC / (AC + AD)));
     const pA_D = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(AD / (AC + AD)));
     const pB_C = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(BC / (BC + BD)));
     const pB_D = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(BD / (BC + BD)));
+    switch (type) {
+        case 1:
+            return (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_C));
+        case 2:
+            return (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_D));
+        case 3:
+            return (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_C));
+        case 4:
+        default:
+            return (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_D));
+    }
+};
+const getProbabilityTree = () => {
+    const A = (0, randint_1.randint)(2, 9);
+    const B = (0, randint_1.randint)(2, 10 - A);
+    const AC = (0, randint_1.randint)(2, 9);
+    const AD = (0, randint_1.randint)(2, 10 - AC);
+    const BC = (0, randint_1.randint)(2, 9);
+    const BD = (0, randint_1.randint)(2, 10 - BC);
     let instruction = `En utilisant l'arbre de probabilité suivant, `;
     let startStatement = '';
-    let answer;
-    const rand = (0, randint_1.randint)(1, 5);
-    switch (rand) {
+    const type = (0, randint_1.randint)(1, 5);
+    const answer = getAnswerNode({ type, A, AC, AD, B, BC, BD });
+    const answerTex = answer.toTex();
+    switch (type) {
         case 1: {
             instruction += `$\\\\$ Calculer $P(A \\cap C)$`;
             startStatement = `P(A \\cap C)`;
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_C));
             break;
         }
         case 2: {
             instruction += `$\\\\$ Calculer $P(A \\cap D)$`;
             startStatement = `P(A \\cap D)`;
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_D));
             break;
         }
         case 3: {
             instruction += `$\\\\$ Calculer $P(B \\cap C)$`;
             startStatement = `P(B \\cap C)`;
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_C));
             break;
         }
         case 4: {
             instruction += `$\\\\$ Calculer $P(B \\cap D)$`;
             startStatement = `P(B \\cap D)`;
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_D));
             break;
         }
-        default:
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_D)); // juste pour éviter l'erreur
     }
     let commands = [
         'A = Point({2,2})',
@@ -98,40 +94,36 @@ function getProbabilityTree() {
         'Text("C", (5.5 , -1.1))',
         'Text("D", (5.5 , -3.1))',
     ];
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer.toTex(),
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(answer, new numberNode_1.NumberNode((0, randint_1.randint)(2, 11)))).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 = {
         instruction,
         startStatement,
-        answer: answer.toTex(),
+        answer: answerTex,
         keys: [],
         commands,
         coords: [-2, 8, -5, 5],
-        getPropositions,
         answerFormat: 'tex',
+        qcmGeneratorProps: { answer: answerTex, A, AC, AD, B, BC, BD, type },
     };
     return question;
-}
-exports.getProbabilityTree = getProbabilityTree;
+};
+const getPropositions = (n, { answer, A, AC, AD, B, BC, BD, type }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const answerNode = getAnswerNode({ A, AC, AD, B, BC, BD, type });
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(answerNode, new numberNode_1.NumberNode((0, randint_1.randint)(2, 11)))).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.probabilityTree = {
+    id: 'probabilityTree',
+    connector: '=',
+    label: "Calculs de probabilités à l'aide d'un arbre pondéré",
+    levels: ['2nde', '1reESM', '1reSpé', '1reTech', '1rePro', 'TermPro', 'TermTech'],
+    isSingleStep: false,
+    sections: ['Probabilités'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getProbabilityTree, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

package/lib/exercises/probaStat/quartiles.d.ts

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

package/lib/exercises/probaStat/quartiles.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"quartiles.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/quartiles.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAIlE,eAAO,MAAM,SAAS,EAAE,YAYvB,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CAiGvC"}
+{"version":3,"file":"quartiles.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/quartiles.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,YAAY,EAOb,MAAM,aAAa,CAAC;AAIrB,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAkFnB,eAAO,MAAM,SAAS,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWtD,CAAC"}

package/lib/exercises/probaStat/quartiles.js

@@ -1,24 +1,11 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getQuartiles = exports.quartiles = void 0;
+exports.quartiles = void 0;
 const randint_1 = require("../../math/utils/random/randint");
 const shuffle_1 = require("../../utils/shuffle");
+const exercise_1 = require("../exercise");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-exports.quartiles = {
-    id: 'quartiles',
-    connector: '=',
-    instruction: '',
-    label: "Calcul des quartiles d'un tableau d'effectifs",
-    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
-    isSingleStep: false,
-    sections: ['Statistiques'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getQuartiles, nb),
-    keys: ['cap', 'underscore'],
-    qcmTimer: 60,
-    freeTimer: 60,
-};
-function getQuartiles() {
+const getQuartiles = () => {
     const getRandomUniqueValues = (count, min, max) => {
         const uniqueValues = new Set();
         while (uniqueValues.size < count) {
@@ -26,12 +13,12 @@ function getQuartiles() {
         }
         return Array.from(uniqueValues).sort((a, b) => a - b);
     };
-    const randomValeurs = getRandomUniqueValues(5, 1, 20);
+    const randomValues = getRandomUniqueValues(5, 1, 20);
     const randomEffectives = [1, 2, 3, 4, 5].map((el) => (0, randint_1.randint)(1, 6));
     let sortedValues = [];
     for (let i = 0; i < randomEffectives.length; i++)
         for (let j = 0; j < randomEffectives[i]; j++)
-            sortedValues.push(randomValeurs[i]);
+            sortedValues.push(randomValues[i]);
     const n = randomEffectives.reduce((sum, value) => sum + value, 0);
     const firstQuartileIndex = Math.round(n / 4 + 0.49);
     const thirdQuartileIndex = Math.round((3 * n) / 4 + 0.49);
@@ -54,44 +41,40 @@ function getQuartiles() {
             choosenQuartile = thirdQuartile;
             break;
     }
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: choosenQuartile + '',
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: randomValeurs[(0, randint_1.randint)(0, randomValeurs.length)] + '',
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
+    const answer = choosenQuartile + '';
     const question = {
         instruction: `On considère le tableau d'effectifs suivant : 
 
 | | | | | | |
 |-|-|-|-|-|-|
-|Valeur|${randomValeurs[0]}|${randomValeurs[1]}|${randomValeurs[2]}|${randomValeurs[3]}|${randomValeurs[4]}|
+|Valeur|${randomValues[0]}|${randomValues[1]}|${randomValues[2]}|${randomValues[3]}|${randomValues[4]}|
 |Effectif|${randomEffectives[0]}|${randomEffectives[1]}|${randomEffectives[2]}|${randomEffectives[3]}|${randomEffectives[4]}|
 
 Calculer le ${quartileToString} de cette série de valeurs.`,
-        answer: choosenQuartile + '',
+        answer,
         keys: ['f', 'cap', 'underscore'],
-        getPropositions,
         answerFormat: 'tex',
+        qcmGeneratorProps: { answer, randomValues },
     };
     return question;
-}
-exports.getQuartiles = getQuartiles;
+};
+const getPropositions = (n, { answer, randomValues }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, randomValues[(0, randint_1.randint)(0, randomValues.length)] + '');
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.quartiles = {
+    id: 'quartiles',
+    connector: '=',
+    label: "Calcul des quartiles d'un tableau d'effectifs",
+    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
+    isSingleStep: false,
+    sections: ['Statistiques'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getQuartiles, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

package/lib/exercises/probaStat/quartilesList.d.ts

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

package/lib/exercises/probaStat/quartilesList.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"quartilesList.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/quartilesList.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,aAAa,CAAC;AAInG,eAAO,MAAM,aAAa,EAAE,YAY3B,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CAqFvC"}
+{"version":3,"file":"quartilesList.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/quartilesList.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,YAAY,EAQb,MAAM,aAAa,CAAC;AAGrB,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAmEnB,eAAO,MAAM,aAAa,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW1D,CAAC"}

package/lib/exercises/probaStat/quartilesList.js

@@ -1,31 +1,17 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getQuartiles = exports.quartilesList = void 0;
+exports.quartilesList = void 0;
 const randint_1 = require("../../math/utils/random/randint");
 const exercise_1 = require("../exercise");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-exports.quartilesList = {
-    id: 'quartilesList',
-    connector: '=',
-    instruction: '',
-    label: "Calcul des quartiles d'une liste",
-    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
-    isSingleStep: false,
-    sections: ['Statistiques'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getQuartiles, nb),
-    keys: [],
-    qcmTimer: 60,
-    freeTimer: 60,
-};
-function getQuartiles() {
-    let randomValeurs = [];
+const getQuartiles = () => {
+    let randomValues = [];
     const length = (0, randint_1.randint)(5, 9);
     for (let i = 0; i < length; i++)
-        randomValeurs.push((0, randint_1.randint)(1, 20));
-    const sortedValues = randomValeurs.sort((a, b) => a - b);
-    const firstQuartileIndex = Math.round(randomValeurs.length / 4 + 0.49);
-    const thirdQuartileIndex = Math.round((3 * randomValeurs.length) / 4 + 0.49);
+        randomValues.push((0, randint_1.randint)(1, 20));
+    const sortedValues = randomValues.sort((a, b) => a - b);
+    const firstQuartileIndex = Math.round(randomValues.length / 4 + 0.49);
+    const thirdQuartileIndex = Math.round((3 * randomValues.length) / 4 + 0.49);
     const firstQuartile = sortedValues[firstQuartileIndex - 1];
     const thirdQuartile = sortedValues[thirdQuartileIndex - 1];
     const randomQuartile = (0, randint_1.randint)(0, 2);
@@ -45,44 +31,38 @@ function getQuartiles() {
             choosenQuartile = thirdQuartile;
             break;
     }
-    let stringList = '';
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: choosenQuartile + '',
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        randomValeurs.forEach((value) => {
-            (0, exercise_1.tryToAddWrongProp)(res, value + '');
-        });
-        const missing = n - res.length;
-        for (let i = 0; i < missing; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const randValue = (0, randint_1.randint)(0, 100);
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: randValue + '',
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, exercise_1.shuffleProps)(res, n);
-    };
+    const answer = choosenQuartile + '';
     const question = {
-        instruction: `On considère la liste suivante : $${randomValeurs.join(';\\ ')}.$
+        instruction: `On considère la liste suivante : $${randomValues.join(';\\ ')}.$
     $\\\\$Calculer le ${quartileToString} de cette série de valeurs.`,
-        answer: choosenQuartile + '',
+        answer,
         keys: [],
-        getPropositions,
         answerFormat: 'tex',
+        qcmGeneratorProps: { answer, randomValues },
     };
     return question;
-}
-exports.getQuartiles = getQuartiles;
+};
+const getPropositions = (n, { answer, randomValues }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    randomValues.forEach((value) => {
+        (0, exercise_1.tryToAddWrongProp)(propositions, value + '');
+    });
+    while (propositions.length < n) {
+        const randValue = (0, randint_1.randint)(0, 100);
+        (0, exercise_1.tryToAddWrongProp)(propositions, randValue + '');
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+exports.quartilesList = {
+    id: 'quartilesList',
+    connector: '=',
+    label: "Calcul des quartiles d'une liste",
+    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
+    isSingleStep: false,
+    sections: ['Statistiques'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getQuartiles, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

package/lib/exercises/probaStat/stats2var/averagePoint.d.ts

@@ -0,0 +1,8 @@
+import { MathExercise } from '../../../exercises/exercise';
+type QCMProps = {
+    answer: string;
+};
+type VEAProps = {};
+export declare const averagePoint: MathExercise<QCMProps, VEAProps>;
+export {};
+//# sourceMappingURL=averagePoint.d.ts.map

package/lib/exercises/probaStat/stats2var/averagePoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"averagePoint.d.ts","sourceRoot":"","sources":["../../../../src/exercises/probaStat/stats2var/averagePoint.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAwCnB,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWzD,CAAC"}

package/lib/exercises/probaStat/stats2var/averagePoint.js

@@ -0,0 +1,54 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.averagePoint = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const frenchify_1 = require("../../../math/utils/latex/frenchify");
+const randTupleInt_1 = require("../../../math/utils/random/randTupleInt");
+const randint_1 = require("../../../math/utils/random/randint");
+const average_1 = require("../../../utils/average");
+const getAveragePointQuestion = () => {
+    const points = (0, randTupleInt_1.distinctRandTupleInt)(4, 2, { from: -9, to: 10 });
+    const tab = `
+| | | | | |
+|-|-|-|-|-|
+|x|${points[0][0]}|${points[1][0]}|${points[2][0]}|${points[3][0]}|
+|y|${points[0][1]}|${points[1][1]}|${points[2][1]}|${points[3][1]}|
+  `;
+    const instruction = `On considère la liste de points suivante : ${tab}
+  
+  Déterminer les coordonnées du point moyen $G$.
+  `;
+    const xG = (0, frenchify_1.frenchify)((0, average_1.average)(points.map((el) => el[0])) + '');
+    const yG = (0, frenchify_1.frenchify)((0, average_1.average)(points.map((el) => el[1])) + '');
+    const answer = `\\left(${xG};${yG}\\right)`;
+    const question = {
+        answer,
+        instruction,
+        keys: ['semicolon'],
+        answerFormat: 'tex',
+        qcmGeneratorProps: { answer },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = `\\left(${(0, frenchify_1.frenchify)((0, randint_1.randint)(-9, 10) + '')};${(0, frenchify_1.frenchify)((0, randint_1.randint)(-9, 10) + '')}\\right)`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+exports.averagePoint = {
+    id: 'averagePoint',
+    connector: '=',
+    label: 'Déterminer le point moyen',
+    levels: ['1rePro', '1reTech', 'TermTech', 'TermPro', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Statistiques'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAveragePointQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.d.ts

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

package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO/E,eAAO,MAAM,8BAA8B,EAAE,YAY5C,CAAC;AAEF,wBAAgB,iCAAiC,IAAI,QAAQ,CAgD5D"}
+{"version":3,"file":"arithmeticExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAiCnB,eAAO,MAAM,8BAA8B,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW3E,CAAC"}

package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.js

@@ -1,61 +1,44 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getArithmeticExplicitFormulaUsage = exports.arithmeticExplicitFormulaUsage = void 0;
+exports.arithmeticExplicitFormulaUsage = void 0;
+const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const polynomial_1 = require("../../../math/polynomials/polynomial");
 const randint_1 = require("../../../math/utils/random/randint");
 const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.arithmeticExplicitFormulaUsage = {
-    id: 'arithmeticExplicitFormulaUsage',
-    connector: '=',
-    instruction: '',
-    label: "Utiliser la formule générale d'une suite arithmétique",
-    levels: ['1reESM', '1reSpé', '1reTech', '1rePro', 'TermTech', 'TermPro'],
-    sections: ['Suites'],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getArithmeticExplicitFormulaUsage, nb),
-    keys: ['r', 'n', 'u', 'underscore'],
-    qcmTimer: 60,
-    freeTimer: 60,
-};
-function getArithmeticExplicitFormulaUsage() {
+const getArithmeticExplicitFormulaUsage = () => {
     const askedRank = (0, randint_1.randint)(0, 10);
     const firstValue = (0, randint_1.randint)(-10, 10);
     const reason = (0, randint_1.randint)(-10, 10, [0]);
     const polynomial = new polynomial_1.Polynomial([firstValue, reason], 'n');
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: (firstValue + askedRank * reason).toString(),
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: ((0, randint_1.randint)(-5, 6, [firstValue]) + askedRank * reason).toString(),
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
+    const answer = (firstValue + askedRank * reason).toString();
     const question = {
         instruction: `$(u_n)$ est une suite arithmétique définie par $u_n = ${polynomial.toString()}$. Calculer : $u_{${askedRank}}$`,
         startStatement: `u_{${askedRank}}`,
-        answer: (firstValue + askedRank * reason).toString(),
+        answer,
         keys: ['r', 'n', 'u', 'underscore'],
-        getPropositions,
         answerFormat: 'tex',
+        qcmGeneratorProps: { answer, firstValue, askedRank, reason },
     };
     return question;
-}
-exports.getArithmeticExplicitFormulaUsage = getArithmeticExplicitFormulaUsage;
+};
+const getPropositions = (n, { answer, firstValue, askedRank, reason }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, ((0, randint_1.randint)(-5, 6, [firstValue]) + askedRank * reason).toString());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.arithmeticExplicitFormulaUsage = {
+    id: 'arithmeticExplicitFormulaUsage',
+    connector: '=',
+    label: "Utiliser la formule générale d'une suite arithmétique",
+    levels: ['1reESM', '1reSpé', '1reTech', '1rePro', 'TermTech', 'TermPro'],
+    sections: ['Suites'],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getArithmeticExplicitFormulaUsage, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

package/lib/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.d.ts

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

package/lib/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO/E,eAAO,MAAM,6BAA6B,EAAE,YAY3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAgD3D"}
+{"version":3,"file":"arithmeticFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAmCnB,eAAO,MAAM,6BAA6B,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW1E,CAAC"}