math-exercises 1.4.7 → 1.4.9

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

@@ -1 +0,0 @@
-{"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

@@ -1,84 +0,0 @@
-"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/limits/polynomeLimit.d.ts

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

package/lib/exercises/limits/polynomeLimit.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"polynomeLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/polynomeLimit.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAIlE,eAAO,MAAM,aAAa,EAAE,YAY3B,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAgIlD"}

package/lib/exercises/limits/polynomeLimit.js

@@ -1,134 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getApplyPercentQuestion = exports.polynomeLimit = void 0;
-const polynomial_1 = require("../../math/polynomials/polynomial");
-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 coinFlip_1 = require("../../utils/coinFlip");
-const shuffle_1 = require("../../utils/shuffle");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-exports.polynomeLimit = {
-    id: 'polynomeLimit',
-    connector: '=',
-    instruction: '',
-    label: "Calculer la limite d'une fonction polynomiale",
-    levels: ['TermSpé'],
-    sections: ['Limites'],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getApplyPercentQuestion, nb),
-    keys: ['infty'],
-    qcmTimer: 60,
-    freeTimer: 60,
-};
-function getApplyPercentQuestion() {
-    const polynome1 = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(2, 6));
-    const polynome2 = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(2, 6));
-    // a_1x^n + b_2x^(n-1) + ...
-    const a1 = polynome1.coefficients[polynome1.coefficients.length - 1];
-    const a2 = polynome2.coefficients[polynome2.coefficients.length - 1];
-    const rand = (0, coinFlip_1.coinFlip)(); // polynome ou fraction
-    const randLimite = (0, coinFlip_1.coinFlip)() ? 1 : -1; // + infini ou - infini
-    let instruction = '';
-    let answer = '';
-    if (rand) {
-        instruction = `Déterminer la limite en $${randLimite > 0 ? `+` : `-`} \\infty$ de la fonction $f$ définie par : $f(x)$ = $${polynome1.toTex()}$.`;
-        answer = a1 * randLimite ** polynome1.degree > 0 ? `+\\infty` : `-\\infty`;
-    }
-    else {
-        instruction = `Déterminer la limite en $${randLimite > 0 ? `+` : `-`} \\infty$ de la fonction $f$ définie par : $f(x)$ = $${new fractionNode_1.FractionNode(polynome1.toTree(), polynome2.toTree()).toTex()}$.`;
-        if (polynome1.degree > polynome2.degree)
-            answer = a1 * randLimite > 0 ? `+\\infty` : `-\\infty`;
-        else if (polynome2.degree > polynome1.degree)
-            answer = '0';
-        else
-            answer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(a1), new numberNode_1.NumberNode(a2))).toTex();
-    }
-    const getPropositions = (n) => {
-        const res = [];
-        let wrongAnswer = '';
-        let k = n - 1;
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        wrongAnswer = `+\\infty`;
-        if (k > 0 && answer !== wrongAnswer) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: wrongAnswer,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-            k--;
-        }
-        wrongAnswer = `-\\infty`;
-        if (k > 0 && answer !== wrongAnswer) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: wrongAnswer,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-            k--;
-        }
-        wrongAnswer = `0`;
-        if (k > 0 && answer !== wrongAnswer) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: wrongAnswer,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-            k--;
-        }
-        wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(a1), new numberNode_1.NumberNode(a2))).toTex();
-        if (!rand && k > 0 && answer !== wrongAnswer) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: wrongAnswer,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-            k--;
-        }
-        wrongAnswer = `${a1}`;
-        if (k > 0 && answer !== wrongAnswer) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: wrongAnswer,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-            k--;
-        }
-        for (let i = 0; i < k; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: (0, randint_1.randint)(-9, 10) + '',
-                    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,
-        answer,
-        keys: ['infty'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getApplyPercentQuestion = getApplyPercentQuestion;

package/lib/exercises/proba/conditionalProbability.d.ts

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

package/lib/exercises/proba/conditionalProbability.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"conditionalProbability.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/conditionalProbability.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAM9D,eAAO,MAAM,sBAAsB,EAAE,QAUpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CA4GpD"}

package/lib/exercises/proba/conditionalProbability.js

@@ -1,99 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getConditionalProbability = exports.conditionalProbability = void 0;
-const randint_1 = require("../../math/utils/random/randint");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const round_1 = require("../../math/utils/round");
-const shuffle_1 = require("../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.conditionalProbability = {
-    id: 'conditionalProbability',
-    connector: '=',
-    instruction: '',
-    label: 'Calcul de probabilité conditionnelle avec la formule de Bayes',
-    levels: ['1', '0'],
-    isSingleStep: false,
-    section: 'Probabilités',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getConditionalProbability, nb),
-    keys: ['p', 'cap', 'underscore'],
-};
-function getConditionalProbability() {
-    const pA = (0, randint_1.randint)(2, 100);
-    const pB = (0, randint_1.randint)(2, 100);
-    const pAB = (0, randint_1.randint)(1, Math.min(pA, pB));
-    const pA_B = (0, round_1.round)(pAB / pB, 2);
-    const pB_A = (0, round_1.round)(pAB / pA, 2);
-    const flip = (0, randint_1.randint)(1, 7);
-    let instruction = `On considère deux événements A et B tels que `;
-    let startStatement = '';
-    let answer = '';
-    switch (flip) {
-        case 1: {
-            instruction += `$P(A) = ${(pA / 100 + '').replace('.', ',')}\\ $ et $\\ P(A \\cap B) = ${(pAB / 100 + '').replace('.', ',')}$.$\\\\$Déterminer $P_A(B)$.`;
-            startStatement = `P_A(B)`;
-            answer = `${pB_A}`;
-            break;
-        }
-        case 2: {
-            instruction += `$P(B) = ${(pB / 100 + '').replace('.', ',')}\\ $ et $\\ P(B \\cap A) = ${(pAB / 100 + '').replace('.', ',')}$.$\\\\$Déterminer $P_B(A)$.`;
-            startStatement = `P_B(A)`;
-            answer = `${pA_B}`;
-            break;
-        }
-        case 3: {
-            instruction += `$P(A) = ${(pA / 100 + '').replace('.', ',')}\\ $ et $\\ P_A(B) = ${(pB_A + '').replace('.', ',')}$.$\\\\$Déterminer $P(A \\cap B)$.`;
-            startStatement = `P(A \\cap B)`;
-            answer = `${pAB / 100}`;
-            break;
-        }
-        case 4: {
-            instruction += `$P(B) = ${(pB / 100 + '').replace('.', ',')}\\ $ et $\\ P_B(A) = ${(pA_B + '').replace('.', ',')}$.$\\\\$Déterminer $P(A \\cap B)$.`;
-            startStatement = `P(A \\cap B)`;
-            answer = `${pAB / 100}`;
-            break;
-        }
-        case 5: {
-            instruction += `$P(A \\cap B) = ${(pAB / 100 + '').replace('.', ',')}\\ $ et $\\ P_B(A) = ${(pA_B + '').replace('.', ',')}$.$\\\\$Déterminer $P(B)$.`;
-            startStatement = `P(B)`;
-            answer = `${pB / 100}`;
-            break;
-        }
-        case 6: {
-            instruction += `$P(A \\cap B) = ${(pAB / 100 + '').replace('.', ',')}\\ $ et $\\ P_A(B) = ${(pB_A + '').replace('.', ',')}$.$\\\\$Déterminer $P(A)$.`;
-            startStatement = `P(A)`;
-            answer = `${pA / 100}`;
-            break;
-        }
-    }
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer,
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: Math.floor(Math.random() * 100) / 100 + '',
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction,
-        startStatement,
-        answer,
-        keys: ['p', 'cap', 'underscore'],
-        getPropositions,
-    };
-    return question;
-}
-exports.getConditionalProbability = getConditionalProbability;

package/lib/exercises/proba/marginalAndConditionalFrequency.d.ts

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

package/lib/exercises/proba/marginalAndConditionalFrequency.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"marginalAndConditionalFrequency.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/marginalAndConditionalFrequency.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,+BAA+B,EAAE,QAU7C,CAAC;AAEF,wBAAgB,kCAAkC,IAAI,QAAQ,CAiG7D"}

package/lib/exercises/proba/marginalAndConditionalFrequency.js

@@ -1,106 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getMarginalAndConditionalFrequency = exports.marginalAndConditionalFrequency = void 0;
-const randint_1 = require("../../math/utils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const simplify_1 = require("../../tree/parsers/simplify");
-const shuffle_1 = require("../../utils/shuffle");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-exports.marginalAndConditionalFrequency = {
-    id: 'marginalAndConditionalFrequency',
-    connector: '=',
-    instruction: '',
-    label: 'Calculs de fréquences marginales et conditionnelles',
-    levels: ['1', '0'],
-    isSingleStep: false,
-    section: 'Probabilités',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMarginalAndConditionalFrequency, nb),
-    keys: ['f', 'cap', 'underscore'],
-};
-function getMarginalAndConditionalFrequency() {
-    const [x1, x2, x3, x4] = [1, 2, 3, 4].map((el) => (0, randint_1.randint)(1, 100));
-    const x = x1 + x2 + x3 + x4;
-    const rand = (0, randint_1.randint)(0, 12);
-    const freqString = [
-        'marginale de A',
-        'marginale de B',
-        'marginale de C',
-        'marginale de D',
-        'conditionnelle de A parmi C',
-        'conditionnelle de A parmi D',
-        'conditionnelle de B parmi C',
-        'conditionnelle de B parmi D',
-        'conditionnelle de C parmi A',
-        'conditionnelle de C parmi B',
-        'conditionnelle de D parmi A',
-        'conditionnelle de D parmi B',
-    ];
-    const frequences = [
-        'f(A)',
-        'f(B)',
-        'f(C)',
-        'f(D)',
-        'f_C(A)',
-        'f_D(A)',
-        'f_C(B)',
-        'f_D(B)',
-        'f_A(C)',
-        'f_B(C)',
-        'f_A(D)',
-        'f_B(D)',
-    ];
-    const Calculs = [
-        (x1 + x3) / x,
-        (x2 + x4) / x,
-        (x1 + x2) / x,
-        (x3 + x4) / x,
-        x1 / (x1 + x2),
-        x3 / (x3 + x4),
-        x2 / (x1 + x2),
-        x4 / (x3 + x4),
-        x1 / (x1 + x3),
-        x3 / (x1 + x3),
-        x2 / (x2 + x4),
-        x4 / (x2 + x4),
-    ];
-    const calculsNodes = Calculs.map((el) => (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(el)));
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: calculsNodes[rand].toTex(),
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: calculsNodes[(0, randint_1.randint)(0, 12, [rand])].toTex(),
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction: `On considère le tableau d'effectifs suivant : 
-
-| |A|B|
-|-|-|-|
-|C|${x1}|${x2}|
-|D|${x3}|${x4}|
-
-Calculer la fréquence ${freqString[rand]}.`,
-        startStatement: `${frequences[rand]}`,
-        answer: calculsNodes[rand].toTex(),
-        keys: ['f', 'cap', 'underscore'],
-        getPropositions,
-    };
-    return question;
-}
-exports.getMarginalAndConditionalFrequency = getMarginalAndConditionalFrequency;

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

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

package/lib/exercises/proba/probabilityTree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"probabilityTree.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/probabilityTree.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AAOF,wBAAgB,kBAAkB,IAAI,QAAQ,CAwH7C"}

package/lib/exercises/proba/probabilityTree.js

@@ -1,132 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getProbabilityTree = 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 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: ['1', '0'],
-    isSingleStep: false,
-    section: 'Probabilités',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getProbabilityTree, nb),
-};
-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 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)));
-    let instruction = `En utilisant l'arbre de probabilité suivant, `;
-    let startStatement = '';
-    let answer;
-    const rand = (0, randint_1.randint)(1, 5);
-    switch (rand) {
-        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})',
-        '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 / pgcd(A, A + B)}/${(A + B) / pgcd(A, A + B)}", (0.3, 2.1), true, true)`,
-        `Text("\\scriptsize${AC / pgcd(AC, AC + AD)}/${(AC + AD) / pgcd(AC, AC + AD)}", (2.8, 3.5), true, true)`,
-        `Text("\\scriptsize${AD / pgcd(AD, AC + AD)}/${(AC + AD) / pgcd(AD, AC + AD)}", (2.8, 1.4), true, true)`,
-        `Text("\\scriptsize${B / pgcd(B, A + B)}/${(A + B) / pgcd(B, A + B)}", (0.3, -1.2), true, true)`,
-        `Text("\\scriptsize${BC / pgcd(BC, BC + BD)}/${(BC + BD) / pgcd(BC, BC + BD)}", (2.8, -0.6), true, true)`,
-        `Text("\\scriptsize${BD / pgcd(BD, BC + BD)}/${(BC + BD) / pgcd(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 getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer.toTex(),
-            isRightAnswer: true,
-        });
-        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,
-                };
-                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(),
-        keys: [],
-        commands,
-        coords: [-2, 8, -5, 5],
-        getPropositions,
-    };
-    return question;
-}
-exports.getProbabilityTree = getProbabilityTree;

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"frequencyTable.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/frequencyTable.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CAsE5C"}