math-exercises 1.3.41 → 1.3.43

package/lib/exercises/primitve/logarithmePrimitive.js

@@ -0,0 +1,74 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLogarithmePrimitive = exports.logarithmePrimitive = 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 fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.logarithmePrimitive = {
+    id: 'logarithmePrimitive',
+    connector: '=',
+    instruction: '',
+    label: 'Primitive de la fonction logarithme',
+    levels: ['1', '0'],
+    section: 'Intégration',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLogarithmePrimitive, nb),
+    keys: ['x', 'C', 'ln', 'abs'],
+};
+function getLogarithmePrimitive() {
+    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
+    const selectedFunction = new fractionNode_1.FractionNode(u.derivate().toTree(), u.toTree());
+    const integratedFuction = `ln\|${u.toTex()}\|`;
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: `${integratedFuction} + C`,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            let wrongIntegral;
+            do {
+                const wrongIntegrals = [
+                    new fractionNode_1.FractionNode(u.derivate().toTree(), new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2))).toTex(),
+                    new fractionNode_1.FractionNode(u
+                        .derivate()
+                        .multiply(new polynomial_1.Polynomial([-1]))
+                        .toTree(), new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2))).toTex(),
+                    `ln(${new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2)).toTex()})`,
+                    new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2)).toTex(),
+                    `ln\|${(0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3)).toTex()}\|`,
+                ];
+                wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: `${wrongIntegral} + C`,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    const question = {
+        instruction: `Déterminer la forme générale des primitives de la fonction f définie par $f(x) = ${(0, simplify_1.simplifyNode)(selectedFunction).toTex()}$.`,
+        startStatement: `F(x)`,
+        answer: `${integratedFuction} + C`,
+        keys: ['x', 'C', 'ln', 'abs'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLogarithmePrimitive = getLogarithmePrimitive;

package/lib/exercises/primitve/polynomialPrimitive.d.ts

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

package/lib/exercises/primitve/polynomialPrimitive.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"polynomialPrimitive.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitve/polynomialPrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB3E,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAkBF,wBAAgB,sBAAsB,IAAI,QAAQ,CAiDjD"}

package/lib/exercises/primitve/polynomialPrimitive.js

@@ -0,0 +1,80 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getPolynomialPrimitive = exports.polynomialPrimitive = 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 constantNode_1 = require("../../tree/nodes/numbers/constantNode");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.polynomialPrimitive = {
+    id: 'polynomialPrimitive',
+    connector: '=',
+    instruction: '',
+    label: "Primitive d'une fonction polynomiale",
+    levels: ['1', '0'],
+    section: 'Intégration',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPolynomialPrimitive, nb),
+    keys: ['x', 'C'],
+};
+function getIntegratedPolynomialNode(polynomial) {
+    let integralPolynomial = new constantNode_1.ConstantNode('C', 'C');
+    for (let i = 0; i < polynomial.degree + 1; i++) {
+        const coeff = polynomial.coefficients[i];
+        if (coeff === 0)
+            continue;
+        const nodeCoeff = new fractionNode_1.FractionNode(new numberNode_1.NumberNode(coeff), new numberNode_1.NumberNode(i + 1));
+        const terme = new multiplyNode_1.MultiplyNode((0, simplify_1.simplifyNode)(nodeCoeff), i + 1 === 1 ? new variableNode_1.VariableNode('x') : new powerNode_1.PowerNode(new variableNode_1.VariableNode('x'), new numberNode_1.NumberNode(i + 1)));
+        integralPolynomial = new addNode_1.AddNode(terme, integralPolynomial);
+    }
+    return integralPolynomial;
+}
+function getPolynomialPrimitive() {
+    const degree = (0, randint_1.randint)(1, 4);
+    const polynomial = (0, polynomial_1.createRandomPolynomialWithOrder)(degree);
+    const integralPolynomial = getIntegratedPolynomialNode(polynomial);
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: `${integralPolynomial.toTex()}`,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongPolynomial = (0, polynomial_1.createRandomPolynomialWithOrder)(degree);
+                const wrongIntegral = getIntegratedPolynomialNode(wrongPolynomial);
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: wrongIntegral.toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    const question = {
+        instruction: `Déterminer la forme générale des primitives de la fonction polynomiale $f$ définie par $f(x) = ${polynomial.toTex()}$.`,
+        startStatement: `F(x)`,
+        answer: `${integralPolynomial.toTex()}`,
+        keys: ['x', 'C'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getPolynomialPrimitive = getPolynomialPrimitive;

package/lib/exercises/primitve/sinCosPrimitive.d.ts

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

package/lib/exercises/primitve/sinCosPrimitive.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sinCosPrimitive.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitve/sinCosPrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAe3E,eAAO,MAAM,eAAe,EAAE,QAU7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CAkG7C"}

package/lib/exercises/primitve/sinCosPrimitive.js

@@ -0,0 +1,112 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSinCosPrimitive = exports.sinCosPrimitive = 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 cosNode_1 = require("../../tree/nodes/functions/cosNode");
+const sinNode_1 = require("../../tree/nodes/functions/sinNode");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+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.sinCosPrimitive = {
+    id: 'sinCosPrimitive',
+    connector: '=',
+    instruction: '',
+    label: 'Primitive de sin et cos',
+    levels: ['1', '0'],
+    section: 'Intégration',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSinCosPrimitive, nb),
+    keys: ['x', 'C', 'sin', 'cos'],
+};
+function getSinCosPrimitive() {
+    const rand = (0, coinFlip_1.coinFlip)();
+    const a = (0, randint_1.randint)(-9, 10, [0]);
+    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
+    let selectedFunction;
+    let integratedFuction;
+    if (rand) {
+        // a * cos(x) ou a* sin(x)
+        const oneOrTwo = (0, coinFlip_1.coinFlip)();
+        selectedFunction = oneOrTwo
+            ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new cosNode_1.CosNode(new variableNode_1.VariableNode('x')))
+            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new sinNode_1.SinNode(new variableNode_1.VariableNode('x')));
+        integratedFuction = oneOrTwo
+            ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new sinNode_1.SinNode(new variableNode_1.VariableNode('x')))
+            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), new cosNode_1.CosNode(new variableNode_1.VariableNode('x')));
+    }
+    else {
+        // u'(x) * cos(u(x))
+        const oneOrTwo = (0, coinFlip_1.coinFlip)();
+        selectedFunction = oneOrTwo
+            ? new multiplyNode_1.MultiplyNode(u.derivate().toTree(), new cosNode_1.CosNode(u.toTree()))
+            : new multiplyNode_1.MultiplyNode(u.derivate().toTree(), new sinNode_1.SinNode(u.toTree()));
+        integratedFuction = oneOrTwo
+            ? new sinNode_1.SinNode(u.toTree())
+            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-1), new cosNode_1.CosNode(u.toTree()));
+    }
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()} + C`,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            let wrongIntegral;
+            do {
+                if (rand) {
+                    const wrongIntegrals = [
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new sinNode_1.SinNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), new cosNode_1.CosNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new cosNode_1.CosNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), new sinNode_1.SinNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [a, 0])), new cosNode_1.CosNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [a, 0])), new sinNode_1.SinNode(new variableNode_1.VariableNode('x'))),
+                    ];
+                    wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
+                }
+                else {
+                    const wrongIntegrals = [
+                        new multiplyNode_1.MultiplyNode(u.toTree(), new cosNode_1.CosNode(u.toTree())),
+                        new multiplyNode_1.MultiplyNode(u.toTree(), new sinNode_1.SinNode(u.toTree())),
+                        new sinNode_1.SinNode(u.toTree()),
+                        new cosNode_1.CosNode(u.toTree()),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-1), new cosNode_1.CosNode(u.toTree())),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-1), new sinNode_1.SinNode(u.toTree())),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [0])), new cosNode_1.CosNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [0])), new sinNode_1.SinNode(new variableNode_1.VariableNode('x'))),
+                    ];
+                    wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
+                }
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: `${(0, simplify_1.simplifyNode)(wrongIntegral).toTex()} + C`,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    const question = {
+        instruction: `Déterminer la forme générale des primitives de la fonction f définie par $f(x) = ${(0, simplify_1.simplifyNode)(selectedFunction).toTex()}$.`,
+        startStatement: `F(x)`,
+        answer: `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()} + C`,
+        keys: ['x', 'C', 'sin', 'cos'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSinCosPrimitive = getSinCosPrimitive;

package/lib/exercises/primitve/usualPrimitives.d.ts

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

package/lib/exercises/primitve/usualPrimitives.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"usualPrimitives.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitve/usualPrimitives.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS9D,eAAO,MAAM,eAAe,EAAE,QAU7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CAiB7C"}

package/lib/exercises/primitve/usualPrimitives.js

@@ -0,0 +1,39 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getUsualPrimitives = exports.usualPrimitives = void 0;
+const constantPrimitive_1 = require("../../exercises/primitve/constantPrimitive");
+const exponentialPrimitive_1 = require("../../exercises/primitve/exponentialPrimitive");
+const logarithmePrimitive_1 = require("../../exercises/primitve/logarithmePrimitive");
+const polynomialPrimitive_1 = require("../../exercises/primitve/polynomialPrimitive");
+const sinCosPrimitive_1 = require("../../exercises/primitve/sinCosPrimitive");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+exports.usualPrimitives = {
+    id: 'usualPrimitives',
+    connector: '=',
+    instruction: '',
+    label: 'Primitives des fonctions de référence',
+    levels: ['1', '0'],
+    section: 'Intégrations',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getUsualPrimitives, nb),
+    keys: ['x'],
+};
+function getUsualPrimitives() {
+    const rand = (0, randint_1.randint)(1, 6);
+    switch (rand) {
+        case 1:
+            return (0, constantPrimitive_1.getConstantPrimitive)();
+        case 2:
+            return (0, polynomialPrimitive_1.getPolynomialPrimitive)();
+        case 3:
+            return (0, logarithmePrimitive_1.getLogarithmePrimitive)();
+        case 4:
+            return (0, sinCosPrimitive_1.getSinCosPrimitive)();
+        case 5:
+            return (0, exponentialPrimitive_1.getExponentialPrimitive)();
+        default:
+            throw Error('erreur');
+    }
+}
+exports.getUsualPrimitives = getUsualPrimitives;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"conditionalProbability.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/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,CA+GpD"}

package/lib/exercises/probaStat/conditionalProbability.js

@@ -0,0 +1,102 @@
+"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,
+            format: 'tex',
+        });
+        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,
+                    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,
+        keys: ['p', 'cap', 'underscore'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getConditionalProbability = getConditionalProbability;

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

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

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

package/lib/exercises/probaStat/frequencyTable.js

@@ -0,0 +1,76 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getFrequencyTable = exports.frequencyTable = void 0;
+const randint_1 = require("../../math/utils/random/randint");
+const round_1 = require("../../math/utils/round");
+const shuffle_1 = require("../../utils/shuffle");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+exports.frequencyTable = {
+    id: 'frequencyTable',
+    connector: '=',
+    instruction: '',
+    label: "Calcul de la moyenne d'une série de valeurs",
+    levels: ['1', '0'],
+    isSingleStep: false,
+    section: 'Statistiques',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFrequencyTable, nb),
+    keys: [],
+};
+function getFrequencyTable() {
+    const getRandomUniqueValues = (count, min, max) => {
+        const uniqueValues = new Set();
+        while (uniqueValues.size < count) {
+            uniqueValues.add((0, randint_1.randint)(min, max));
+        }
+        return Array.from(uniqueValues).sort((a, b) => a - b);
+    };
+    const randomValeurs = getRandomUniqueValues(5, 1, 20);
+    const randomEffectives = [1, 2, 3, 4, 5].map((el) => (0, randint_1.randint)(1, 6));
+    const sumEffectives = randomEffectives.reduce((sum, value) => sum + value, 0);
+    let average = 0;
+    for (let i = 0; i < randomValeurs.length; i++)
+        average += randomValeurs[i] * randomEffectives[i];
+    average /= sumEffectives;
+    average = (0, round_1.round)(average, 2);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: average + '',
+            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, round_1.round)(average + (0, randint_1.randint)(-average, 20 - average, [0]) + (0, randint_1.randint)(1, 100) / 100, 2) + '',
+                    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: `On considère le tableau d'effectifs suivant : 
+
+| | | | | | |
+|-|-|-|-|-|-|
+|Valeur|${randomValeurs[0]}|${randomValeurs[1]}|${randomValeurs[2]}|${randomValeurs[3]}|${randomValeurs[4]}|
+|Effectif|${randomEffectives[0]}|${randomEffectives[1]}|${randomEffectives[2]}|${randomEffectives[3]}|${randomEffectives[4]}|
+
+Calculer la moyenne de cette série de valeurs.`,
+        answer: average + '',
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getFrequencyTable = getFrequencyTable;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"marginalAndConditionalFrequency.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/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,CAoG7D"}

package/lib/exercises/probaStat/marginalAndConditionalFrequency.js

@@ -0,0 +1,109 @@
+"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,
+            format: 'tex',
+        });
+        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,
+                    format: 'tex',
+                };
+                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,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getMarginalAndConditionalFrequency = getMarginalAndConditionalFrequency;

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

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