math-exercises 2.0.14 → 2.0.16

package/lib/exercises/probaStat/median.js

@@ -1,24 +1,11 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getMedianWithTable = exports.medianWithTable = void 0;
+exports.medianWithTable = 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.medianWithTable = {
-    id: 'medianWithTable',
-    connector: '=',
-    instruction: '',
-    label: "Calcul de la médiane d'un tableau d'effectifs",
-    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
-    isSingleStep: false,
-    sections: ['Statistiques'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMedianWithTable, nb),
-    keys: [],
-    qcmTimer: 60,
-    freeTimer: 60,
-};
-function getMedianWithTable() {
+const getMedianWithTable = () => {
     const getRandomUniqueValues = (count, min, max) => {
         const uniqueValues = new Set();
         while (uniqueValues.size < count) {
@@ -26,12 +13,12 @@ function getMedianWithTable() {
         }
         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 middleIndex = Math.floor(n / 2);
     let median;
@@ -41,44 +28,40 @@ function getMedianWithTable() {
     else {
         median = sortedValues[middleIndex];
     }
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: median + '',
-            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 = (median + '').replace('.', ',');
     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 la médiane de cette série de valeurs.`,
-        answer: median + '',
+        answer,
         keys: [],
-        getPropositions,
         answerFormat: 'tex',
+        qcmGeneratorProps: { answer, randomValues },
     };
     return question;
-}
-exports.getMedianWithTable = getMedianWithTable;
+};
+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.medianWithTable = {
+    id: 'medianWithTable',
+    connector: '=',
+    label: "Calcul de la médiane d'un tableau d'effectifs",
+    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
+    isSingleStep: false,
+    sections: ['Statistiques'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMedianWithTable, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

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

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

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

@@ -1 +1 @@
-{"version":3,"file":"medianList.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/medianList.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,aAAa,CAAC;AAInG,eAAO,MAAM,cAAc,EAAE,YAY5B,CAAC;AAEF,wBAAgB,aAAa,IAAI,QAAQ,CA8DxC"}
+{"version":3,"file":"medianList.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/medianList.ts"],"names":[],"mappings":"AAGA,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;AA6CnB,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW3D,CAAC"}

package/lib/exercises/probaStat/medianList.js

@@ -1,24 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getMedianList = exports.medianWithList = void 0;
+exports.medianWithList = 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.medianWithList = {
-    id: 'medianWithList',
-    connector: '=',
-    instruction: '',
-    label: "Calcul de la médiane d'une liste de valeurs",
-    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
-    isSingleStep: false,
-    sections: ['Statistiques'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMedianList, nb),
-    keys: ['f', 'cap', 'underscore'],
-    qcmTimer: 60,
-    freeTimer: 60,
-};
-function getMedianList() {
+const getMedianList = () => {
     let randomValeurs = [];
     const length = (0, randint_1.randint)(6, 10);
     for (let i = 0; i < length; i++)
@@ -32,40 +18,35 @@ function getMedianList() {
     else {
         median = sortedValues[middleIndex];
     }
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: median + '',
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        sortedValues.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 {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: (0, randint_1.randint)(0, 20) + '',
-                    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 = (median + '').replace('.', ',');
     const question = {
         instruction: `On considère la liste suivante : $${randomValeurs.join(';\\ ')}.$
     $\\\\$Calculer la médiane de cette liste de valeurs.`,
-        answer: median + '',
+        answer,
         keys: ['f', 'cap', 'underscore'],
-        getPropositions,
         answerFormat: 'tex',
+        qcmGeneratorProps: { answer, sortedValues },
     };
     return question;
-}
-exports.getMedianList = getMedianList;
+};
+const getPropositions = (n, { answer, sortedValues }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    sortedValues.forEach((value) => (0, exercise_1.tryToAddWrongProp)(propositions, value + ''));
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(0, 20) + '');
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+exports.medianWithList = {
+    id: 'medianWithList',
+    connector: '=',
+    label: "Calcul de la médiane d'une liste de valeurs",
+    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
+    isSingleStep: false,
+    sections: ['Statistiques'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMedianList, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

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

@@ -1,13 +1,13 @@
-import { MathExercise } from "../exercise";
-type Identifiers = {
-    type: number;
-    A: number;
-    B: number;
-    AC: number;
-    AD: number;
-    BC: number;
-    BD: number;
-};
-export declare const probabilityTree: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../exercise";
+type Identifiers = {
+    type: number;
+    A: number;
+    B: number;
+    AC: number;
+    AD: number;
+    BC: number;
+    BD: number;
+};
+export declare const probabilityTree: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=probabilityTree.d.ts.map

package/lib/exercises/probaStat/probabilityTree.js

@@ -1,140 +1,140 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.probabilityTree = void 0;
-const integer_1 = require("../../math/numbers/integer/integer");
-const rational_1 = require("../../math/numbers/rationals/rational");
-const gcd_1 = require("../../math/utils/arithmetic/gcd");
-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 getAnswerNode = ({ type, A, B, AC, AD, BC, BD }) => {
-    const pA = new rational_1.Rational(A, A + B).simplify();
-    const pB = new rational_1.Rational(B, A + B).simplify();
-    const pA_C = new rational_1.Rational(AC, AC + AD).simplify();
-    const pA_D = new rational_1.Rational(AD, AC + AD).simplify();
-    const pB_C = new rational_1.Rational(BC, BC + BD).simplify();
-    const pB_D = new rational_1.Rational(BD, BC + BD).simplify();
-    switch (type) {
-        case 1:
-            return pA.multiply(pA_C);
-        case 2:
-            return pA.multiply(pA_D);
-        case 3:
-            return pB.multiply(pB_C);
-        case 4:
-        default:
-            return pB.multiply(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 = "";
-    const type = (0, randint_1.randint)(1, 5);
-    const answer = getAnswerNode({ type, A, AC, AD, B, BC, BD });
-    const answerTex = answer.toTree().toTex();
-    switch (type) {
-        case 1: {
-            instruction += `calculer $P(A \\cap C)$.`;
-            startStatement = `P(A \\cap C)`;
-            break;
-        }
-        case 2: {
-            instruction += `calculer $P(A \\cap D)$.`;
-            startStatement = `P(A \\cap D)`;
-            break;
-        }
-        case 3: {
-            instruction += `calculer $P(B \\cap C)$.`;
-            startStatement = `P(B \\cap C)`;
-            break;
-        }
-        case 4: {
-            instruction += `calculer $P(B \\cap D)$.`;
-            startStatement = `P(B \\cap D)`;
-            break;
-        }
-    }
-    let commands = [
-        "A = Point({2,2})",
-        "B = Point({2,-2})",
-        "AC = Point({5,3})",
-        "AD = Point({5,1})",
-        "BC = Point({5,-1})",
-        "BD = Point({5,-3})",
-        "Segment(Point({0,0}),A)",
-        "Segment(A,AC)",
-        "Segment(A,AD)",
-        "Segment(Point({0,0}),B)",
-        "Segment(B,BC)",
-        "Segment(B,BD)",
-        "ShowAxes(false)",
-        "ShowGrid(false)",
-        `Text("\\scriptsize ${A / (0, gcd_1.gcd)(A, A + B)}/${(A + B) / (0, gcd_1.gcd)(A, A + B)}", (0.3, 2.1), true, true)`,
-        `Text("\\scriptsize ${AC / (0, gcd_1.gcd)(AC, AC + AD)}/${(AC + AD) / (0, gcd_1.gcd)(AC, AC + AD)}", (2.8, 3.5), true, true)`,
-        `Text("\\scriptsize ${AD / (0, gcd_1.gcd)(AD, AC + AD)}/${(AC + AD) / (0, gcd_1.gcd)(AD, AC + AD)}", (2.8, 1.4), true, true)`,
-        `Text("\\scriptsize ${B / (0, gcd_1.gcd)(B, A + B)}/${(A + B) / (0, gcd_1.gcd)(B, A + B)}", (0.3, -1.2), true, true)`,
-        `Text("\\scriptsize ${BC / (0, gcd_1.gcd)(BC, BC + BD)}/${(BC + BD) / (0, gcd_1.gcd)(BC, BC + BD)}", (2.8, -0.6), true, true)`,
-        `Text("\\scriptsize ${BD / (0, gcd_1.gcd)(BD, BC + BD)}/${(BC + BD) / (0, gcd_1.gcd)(BD, BC + BD)}", (2.8, -2.5), true, true)`,
-        'Text("A", (1.85 , 2.5))',
-        'Text("B", (1.85 , -2.8))',
-        'Text("C", (5.5 , 2.85))',
-        'Text("D", (5.5 , 0.85))',
-        'Text("C", (5.5 , -1.1))',
-        'Text("D", (5.5 , -3.1))',
-    ];
-    const question = {
-        instruction,
-        startStatement,
-        answer: answerTex,
-        keys: [],
-        commands,
-        coords: [-2, 8, -5, 5],
-        answerFormat: "tex",
-        identifiers: { A, AC, AD, B, BC, BD, type },
-    };
-    return question;
-};
-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) {
-        const wrongAnswer = answerNode.multiply(new integer_1.Integer((0, randint_1.randint)(2, 11)));
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTree().toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { A, AC, AD, B, BC, BD, type }) => {
-    const answer = getAnswerNode({ type, A, AC, AD, B, BC, BD });
-    const texs = answer.toTree({ allowFractionToDecimal: true }).toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-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,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.probabilityTree = void 0;
+const integer_1 = require("../../math/numbers/integer/integer");
+const rational_1 = require("../../math/numbers/rationals/rational");
+const gcd_1 = require("../../math/utils/arithmetic/gcd");
+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 getAnswerNode = ({ type, A, B, AC, AD, BC, BD }) => {
+    const pA = new rational_1.Rational(A, A + B).simplify();
+    const pB = new rational_1.Rational(B, A + B).simplify();
+    const pA_C = new rational_1.Rational(AC, AC + AD).simplify();
+    const pA_D = new rational_1.Rational(AD, AC + AD).simplify();
+    const pB_C = new rational_1.Rational(BC, BC + BD).simplify();
+    const pB_D = new rational_1.Rational(BD, BC + BD).simplify();
+    switch (type) {
+        case 1:
+            return pA.multiply(pA_C);
+        case 2:
+            return pA.multiply(pA_D);
+        case 3:
+            return pB.multiply(pB_C);
+        case 4:
+        default:
+            return pB.multiply(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 = "";
+    const type = (0, randint_1.randint)(1, 5);
+    const answer = getAnswerNode({ type, A, AC, AD, B, BC, BD });
+    const answerTex = answer.toTree().toTex();
+    switch (type) {
+        case 1: {
+            instruction += `calculer $P(A \\cap C)$.`;
+            startStatement = `P(A \\cap C)`;
+            break;
+        }
+        case 2: {
+            instruction += `calculer $P(A \\cap D)$.`;
+            startStatement = `P(A \\cap D)`;
+            break;
+        }
+        case 3: {
+            instruction += `calculer $P(B \\cap C)$.`;
+            startStatement = `P(B \\cap C)`;
+            break;
+        }
+        case 4: {
+            instruction += `calculer $P(B \\cap D)$.`;
+            startStatement = `P(B \\cap D)`;
+            break;
+        }
+    }
+    let commands = [
+        "A = Point({2,2})",
+        "B = Point({2,-2})",
+        "AC = Point({5,3})",
+        "AD = Point({5,1})",
+        "BC = Point({5,-1})",
+        "BD = Point({5,-3})",
+        "Segment(Point({0,0}),A)",
+        "Segment(A,AC)",
+        "Segment(A,AD)",
+        "Segment(Point({0,0}),B)",
+        "Segment(B,BC)",
+        "Segment(B,BD)",
+        "ShowAxes(false)",
+        "ShowGrid(false)",
+        `Text("\\scriptsize ${A / (0, gcd_1.gcd)(A, A + B)}/${(A + B) / (0, gcd_1.gcd)(A, A + B)}", (0.3, 2.1), true, true)`,
+        `Text("\\scriptsize ${AC / (0, gcd_1.gcd)(AC, AC + AD)}/${(AC + AD) / (0, gcd_1.gcd)(AC, AC + AD)}", (2.8, 3.5), true, true)`,
+        `Text("\\scriptsize ${AD / (0, gcd_1.gcd)(AD, AC + AD)}/${(AC + AD) / (0, gcd_1.gcd)(AD, AC + AD)}", (2.8, 1.4), true, true)`,
+        `Text("\\scriptsize ${B / (0, gcd_1.gcd)(B, A + B)}/${(A + B) / (0, gcd_1.gcd)(B, A + B)}", (0.3, -1.2), true, true)`,
+        `Text("\\scriptsize ${BC / (0, gcd_1.gcd)(BC, BC + BD)}/${(BC + BD) / (0, gcd_1.gcd)(BC, BC + BD)}", (2.8, -0.6), true, true)`,
+        `Text("\\scriptsize ${BD / (0, gcd_1.gcd)(BD, BC + BD)}/${(BC + BD) / (0, gcd_1.gcd)(BD, BC + BD)}", (2.8, -2.5), true, true)`,
+        'Text("A", (1.85 , 2.5))',
+        'Text("B", (1.85 , -2.8))',
+        'Text("C", (5.5 , 2.85))',
+        'Text("D", (5.5 , 0.85))',
+        'Text("C", (5.5 , -1.1))',
+        'Text("D", (5.5 , -3.1))',
+    ];
+    const question = {
+        instruction,
+        startStatement,
+        answer: answerTex,
+        keys: [],
+        commands,
+        coords: [-2, 8, -5, 5],
+        answerFormat: "tex",
+        identifiers: { A, AC, AD, B, BC, BD, type },
+    };
+    return question;
+};
+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) {
+        const wrongAnswer = answerNode.multiply(new integer_1.Integer((0, randint_1.randint)(2, 11)));
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTree().toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { A, AC, AD, B, BC, BD, type }) => {
+    const answer = getAnswerNode({ type, A, AC, AD, B, BC, BD });
+    const texs = answer.toTree({ allowFractionToDecimal: true }).toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+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,
+    isAnswerValid,
+};

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,
+};