math-exercises 3.0.200 → 3.0.201

package/lib/exercises/math/limits/logOfPolynomialLimit.js

@@ -0,0 +1,154 @@
+import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
+import { getArrNodeCoeffOfPolynomialNode } from "../../../math/utils/polynomial/polynomialUtils.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { LogNode } from "../../../tree/nodes/functions/logNode.js";
+import { NodeConstructor, } from "../../../tree/nodes/nodeConstructor.js";
+import { MinusInfinityNode, PlusInfinityNode, } from "../../../tree/nodes/numbers/infiniteNode.js";
+import { multiply } from "../../../tree/nodes/operators/multiplyNode.js";
+import { substract } from "../../../tree/nodes/operators/substractNode.js";
+import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
+import { coinFlip } from "../../../utils/alea/coinFlip.js";
+const getHydrated = (identifiers) => {
+    const { nodeIdsLimitAbscissa, nodeIdsP, isPossible } = identifiers;
+    const [nodeLimitAbscissa, nodeP] = [nodeIdsLimitAbscissa, nodeIdsP].map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    const nodeLimitP = isPossible ? PlusInfinityNode : MinusInfinityNode;
+    return {
+        nodeLimitAbscissa,
+        nodeP,
+        isPossible,
+        nodeLimitP,
+    };
+};
+const getInstruction = (identifiers) => {
+    const { nodeLimitAbscissa, nodeP } = getHydrated(identifiers);
+    return `Déterminer la limite en $${nodeLimitAbscissa.toTex()}$ de la fonction $f$ définie par : 
+  
+$$
+f(x) = \\ln(${nodeP.toTex()})
+$$`;
+};
+const getAnswer = (identifiers) => {
+    const { isPossible, nodeLimitP } = getHydrated(identifiers);
+    return isPossible
+        ? nodeLimitP.toTex()
+        : "Absurde : $\\ln$ est définie seulement sur $]0;+\\infty[$.";
+};
+const getHint = (identifiers) => {
+    const { nodeLimitAbscissa, nodeP } = getHydrated(identifiers);
+    return `Commence par déterminer : 
+
+$$
+\\displaystyle \\lim_{x \\to ${nodeLimitAbscissa.toTex()}} ${nodeP.toTex()}
+$$
+  
+et détermine ensuite, pour la limite demandée dans l'énoncé : 
+
+- Est-ce absurde ? $x$ peut-il tendre vers la valeur demandée ? Attention : $\\ln$ est définie seulement sur $]0;+\\infty[$.
+
+- Est-ce possible ? La limite existe-t-elle quand $x$ tend vers la valeur demandée ? Certaines fonctions, comme par exemple $\\cos$ ou $\\sin$ n'ont pas de limite en $+\\infty$.
+
+`;
+};
+const getCorrection = (identifiers) => {
+    const { nodeLimitAbscissa, nodeP, isPossible, nodeLimitP } = getHydrated(identifiers);
+    if (isPossible) {
+        return `On a : 
+
+$$
+\\displaystyle \\lim_{x \\to ${nodeLimitAbscissa.toTex()}} ${nodeP.toTex()} = ${nodeLimitP.toTex()}
+$$
+
+$$
+\\displaystyle \\lim_{x \\to +\\infty} \\ln(x) = ${nodeLimitP.toTex()}
+$$
+
+Par conséquent : 
+
+$$
+\\displaystyle \\lim_{x \\to +\\infty} \\ln(${nodeP.toTex()}) = ${nodeLimitP.toTex()}
+$$
+
+`;
+    }
+    else {
+        return `On a : 
+
+$$
+\\displaystyle \\lim_{x \\to ${nodeLimitAbscissa.toTex()}} ${nodeP.toTex()} = ${nodeLimitP.toTex()}
+$$
+
+Mais, $\\ln$ est seulement définie sur $]0;+\\infty[$.
+
+L'écriture suivante est donc absurde : 
+
+$$
+\\displaystyle \\lim_{x \\to ${nodeLimitAbscissa.toTex()}} \\ln(${nodeP.toTex()})
+$$
+    
+`;
+    }
+};
+const getPropositions = (n, { answer, ...identifiers }) => {
+    const { isPossible } = identifiers;
+    const propositions = [];
+    addValidProp(propositions, answer, isPossible ? "tex" : "raw");
+    const { nodeP } = getHydrated(identifiers);
+    const [nodeC, _nodeB, nodeA] = getArrNodeCoeffOfPolynomialNode(nodeP);
+    tryToAddWrongProp(propositions, MinusInfinityNode.toTex());
+    tryToAddWrongProp(propositions, (0).frenchify());
+    if (nodeA.evaluate() > 0) {
+        tryToAddWrongProp(propositions, multiply(2, new LogNode(nodeA)).toTex());
+    }
+    if (nodeC.evaluate() > 0) {
+        tryToAddWrongProp(propositions, new LogNode(nodeC).toTex());
+    }
+    tryToAddWrongProp(propositions, "Impossible : Cette limite n'existe pas.", "raw");
+    tryToAddWrongProp(propositions, "Absurde : $\\ln$ est définie seulement sur $]0;+\\infty[$.", "raw");
+    return shuffleProps(propositions, n);
+};
+const createRandomIdentifiers = () => {
+    const isPossible = coinFlip();
+    const nodeVarX = new VariableNode("x");
+    const k = isPossible ? randint(1, 7) : randint(-6, -1);
+    const a = randint(1, 11, [0]);
+    const b = randint(-10, 11, [0, a]);
+    const nodeP = multiply(k, multiply(substract(nodeVarX, a), substract(nodeVarX, b))).simplify({ towardsDistribute: true, forbidFactorize: true });
+    const nodeLimitAbscissa = coinFlip() ? MinusInfinityNode : PlusInfinityNode;
+    const identifiers = {
+        nodeIdsLimitAbscissa: nodeLimitAbscissa.toIdentifiers(),
+        nodeIdsP: nodeP.toIdentifiers(),
+        isPossible,
+    };
+    return identifiers;
+};
+const getLogOfPolynomialLimitQuestion = () => {
+    const identifiers = createRandomIdentifiers();
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    const { isPossible } = identifiers;
+    const question = {
+        instruction: getInstruction(identifiers),
+        answer: getAnswer(identifiers),
+        answerFormat: isPossible ? "tex" : "raw",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+    return question;
+};
+export const logOfPolynomialLimit = {
+    id: "logOfPolynomialLimit",
+    connector: "\\iff",
+    label: "Limite de $\\ln(P(x))$ en $-\\infty$ ou $+\\infty$",
+    isSingleStep: false,
+    generator: (nb) => getDistinctQuestions(getLogOfPolynomialLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    subject: "Mathématiques",
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+    answerType: "QCU",
+};

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfLinearCombination.d.ts

@@ -0,0 +1,12 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { NodeIdentifiers } from "../../../../tree/nodes/nodeConstructor.js";
+type Identifiers = {
+    nodeIdsE: NodeIdentifiers[];
+    nodeIdsCoeff: NodeIdentifiers[];
+};
+type Options = {
+    typeLinearCombination: string;
+};
+export declare const expectedValueOfLinearCombination: Exercise<Identifiers, Options>;
+export {};
+//# sourceMappingURL=expectedValueOfLinearCombination.d.ts.map

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfLinearCombination.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expectedValueOfLinearCombination.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/probaStat/basicProbas/expectedValueOfLinearCombination.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAKrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAS7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,EAAE,CAAC;IAC5B,YAAY,EAAE,eAAe,EAAE,CAAC;CACjC,CAAC;AA0KF,KAAK,OAAO,GAAG;IACb,qBAAqB,EAAE,MAAM,CAAC;CAC/B,CAAC;AAgBF,eAAO,MAAM,gCAAgC,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAwBzE,CAAC"}

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfLinearCombination.js

@@ -0,0 +1,170 @@
+import { addValidProp, shuffleProps, tryToAddWrongProp, propWhile, GeneratorOptionTarget, GeneratorOptionType, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { randfloat } from "../../../../math/utils/random/randfloat.js";
+import { randint } from "../../../../math/utils/random/randint.js";
+import { NodeConstructor, } from "../../../../tree/nodes/nodeConstructor.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
+import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
+import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
+import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
+import { alignTex } from "../../../../utils/latex/alignTex.js";
+const getHydrated = (identifiers) => {
+    const { nodeIdsE, nodeIdsCoeff } = identifiers;
+    const [nodeEX, nodeEY, nodeCoeffX, nodeCoeffY] = [
+        ...nodeIdsE,
+        ...nodeIdsCoeff,
+    ].map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    const texE = `E(${add(multiply(nodeCoeffX, new VariableNode("X")), multiply(nodeCoeffY, new VariableNode("Y")))
+        .simplify({ towardsDistribute: true })
+        .toTex({})})`;
+    const nodeLinearCombinationForTex = add(multiply(nodeCoeffX, new VariableNode("E(X)")), multiply(nodeCoeffY, new VariableNode("E(Y)"))).simplify({ towardsDistribute: true });
+    const nodeLinearCombinationForResult = nodeCoeffY.evaluate() !== 0
+        ? add(multiply(nodeCoeffX, nodeEX), multiply(nodeCoeffY, nodeEY))
+        : multiply(nodeCoeffX, nodeEX);
+    return {
+        nodeEX,
+        nodeEY,
+        nodeCoeffX,
+        nodeCoeffY,
+        texE,
+        nodeLinearCombinationForTex,
+        nodeLinearCombinationForResult,
+    };
+};
+const getInstruction = (identifiers) => {
+    const { nodeEX, nodeEY, texE } = getHydrated(identifiers);
+    return `Soient $X$ et $Y$ deux variables aléatoires dont les espérances sont données ci-dessous :
+
+$$
+E(X) = ${nodeEX.toTex()}
+$$
+
+$$
+E(Y) = ${nodeEY.toTex()}
+$$
+
+Que vaut $${texE}$ ?`;
+};
+const getAnswer = (identifiers) => {
+    const { nodeLinearCombinationForResult } = getHydrated(identifiers);
+    return nodeLinearCombinationForResult.simplify().toTex();
+};
+const getHint = () => {
+    return `Soit $a$ et $b$ deux réels :
+$$
+E(aX+bY) = a \\ E(X) + b \\ E(Y)
+$$
+  
+`;
+};
+const getCorrection = (identifiers) => {
+    const { texE, nodeLinearCombinationForTex, nodeLinearCombinationForResult } = getHydrated(identifiers);
+    return `
+  
+${alignTex([
+        ["", texE],
+        ["=", nodeLinearCombinationForTex.toTex()],
+        ["=", nodeLinearCombinationForResult.toTex()],
+        ["=", nodeLinearCombinationForResult.simplify().toTex()],
+    ])}
+
+`;
+};
+const getPropositions = (n, { answer }, optsIn) => {
+    const opts = optsIn ?? optsDefault;
+    const propositions = [];
+    addValidProp(propositions, answer);
+    propWhile(propositions, n, () => {
+        const identifiersWrong = createRandomIdentifiers(opts);
+        tryToAddWrongProp(propositions, getAnswer(identifiersWrong));
+    });
+    return shuffleProps(propositions, n);
+};
+const getKeys = () => {
+    return [];
+};
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        const nodeAns = parseAlgebraic(ans);
+        const nodeAnswer = parseAlgebraic(answer);
+        return (NodeComparator.isEqualViaSub(nodeAns, nodeAnswer) ||
+            NodeComparator.isEqualViaFrac(nodeAns, nodeAnswer));
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+const createRandomIdentifiers = (opts) => {
+    const { typeLinearCombination } = opts;
+    const [nodeEX, nodeEY] = [...Array(2).keys()].map(() => randfloat(-10, 10, 2).toTree());
+    const [nodeCoeffX, nodeCoeffY] = (() => {
+        switch (typeLinearCombination) {
+            case "aX": {
+                return [randint(-5, 5, [0, 1]).toTree(), (0).toTree()];
+            }
+            case "X+Y": {
+                return [(1).toTree(), (1).toTree()];
+            }
+            case "aX+Y": {
+                return [randint(-5, 5, [0, 1]).toTree(), (1).toTree()];
+            }
+            default:
+                throw new Error("Unsupported typeLinearCombination: " + typeLinearCombination);
+        }
+    })();
+    const identifiers = {
+        nodeIdsE: [nodeEX, nodeEY].map((node) => node.toIdentifiers()),
+        nodeIdsCoeff: [nodeCoeffX, nodeCoeffY].map((node) => node.toIdentifiers()),
+    };
+    return identifiers;
+};
+const getExpectedValueOfLinearCombinationQuestion = (optsIn) => {
+    const opts = optsIn ?? optsDefault;
+    const identifiers = createRandomIdentifiers(opts);
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers, opts) => {
+    return {
+        answer: getAnswer(identifiers, opts),
+        instruction: getInstruction(identifiers, opts),
+        keys: getKeys(identifiers, opts),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers, opts),
+        correction: getCorrection(identifiers, opts),
+    };
+};
+const optsDefault = {
+    typeLinearCombination: "aX+Y",
+};
+const options = [
+    {
+        id: "typeLinearCombination",
+        label: "Type de combinaison linéaire",
+        target: GeneratorOptionTarget.generation,
+        type: GeneratorOptionType.select,
+        values: ["aX", "X+Y", "aX+Y"],
+        defaultValue: optsDefault.typeLinearCombination,
+    },
+];
+export const expectedValueOfLinearCombination = {
+    id: "expectedValueOfLinearCombination",
+    connector: "=",
+    label: "Calculer l'espérance d'une combination linéaire de variables aléatoires",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getExpectedValueOfLinearCombinationQuestion(opts), nb),
+    options,
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getInstruction,
+    getHint,
+    getCorrection,
+    getAnswer,
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+};

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromDice.d.ts

@@ -0,0 +1,7 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+type Identifiers = {
+    arrNbSide: number[];
+};
+export declare const expectedValueOfSumFromDice: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=expectedValueOfSumFromDice.d.ts.map

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromDice.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expectedValueOfSumFromDice.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/probaStat/basicProbas/expectedValueOfSumFromDice.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB,CAAC;AAkLF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAkB5D,CAAC"}

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromDice.js

@@ -0,0 +1,163 @@
+import { addValidProp, shuffleProps, tryToAddWrongProp, propWhile, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../../tree/nodes/operators/fractionNode.js";
+import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
+import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
+import { randomMany } from "../../../../utils/alea/random.js";
+import { zip } from "../../../../utils/arrays/arrayZip.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
+import { alignTex } from "../../../../utils/latex/alignTex.js";
+const getInstruction = (identifiers) => {
+    const { arrNbSide } = identifiers;
+    const [nbSidesX, nbSidesY] = arrNbSide;
+    return `On lance un dé classique à $${nbSidesX.frenchify()}$ faces et un dé classique à $${nbSidesY.frenchify()}$ faces. 
+On note $S$ la variable aléatoire qui donne la somme des deux résultats. 
+Calculer l'espérance de $S$.`;
+};
+const getAnswerNode = (identifiers) => {
+    const { arrNbSide } = identifiers;
+    const [nbSidesX, nbSidesY] = arrNbSide;
+    const [nodeEXForResult, nodeEYForResult] = [nbSidesX, nbSidesY].map((nbSides) => frac(add(nbSides, 1).simplify(), 2));
+    const EXPlusY = add(nodeEXForResult, nodeEYForResult);
+    return EXPlusY;
+};
+const getAnswer = (identifiers) => {
+    return getAnswerNode(identifiers)
+        .simplify({
+        towardsDistribute: true,
+        forceAddFractions: true,
+    })
+        .toTex();
+};
+const getHint = () => {
+    return `Soient $X$ et $Y$ les variables aléatoires associées à chaque dé.
+  
+Calcule d'abord $E(X)$ et $E(Y)$ :
+
+$E(X)$ est la somme des produits des valeurs de $X$ par leur probabilité.
+
+Calcule ensuite $E(X+Y)$ :
+
+$$
+E(X+Y) = E(X) + E(Y)
+$$
+  
+`;
+};
+const getCorrection = (identifiers) => {
+    const { arrNbSide } = identifiers;
+    const [nbSidesX, nbSidesY] = arrNbSide;
+    const [nodeEXForResult, nodeEYForResult] = [nbSidesX, nbSidesY].map((nbSides) => frac(add(nbSides, 1).simplify(), 2));
+    const [texEX1, texEY1] = zip(["X", "Y"], [nbSidesX, nbSidesY]).map(([letter, nbSides]) => {
+        const letterLowercase = letter.toLocaleLowerCase();
+        const letterUppercase = letter.toLocaleUpperCase();
+        return `\\displaystyle \\sum_{i=1}^{i=${nbSides}} ${letterLowercase}_{i} P(${letterUppercase} = ${letterLowercase}_{i})`;
+    });
+    const [texEX2, texEY2] = zip(["X", "Y"], [nbSidesX, nbSidesY]).map(([letter, nbSides]) => {
+        const letterLowercase = letter.toLocaleLowerCase();
+        return `\\displaystyle \\sum_{i=1}^{i=${nbSides}} ${letterLowercase}_{i} \\frac{1}{${nbSides}}`;
+    });
+    const [texEX3, texEY3] = zip(["X", "Y"], [nbSidesX, nbSidesY]).map(([_letter, nbSides]) => {
+        return `\\frac{1}{${nbSides}} \\displaystyle \\sum_{i=1}^{i=${nbSides}} i`;
+    });
+    const [texEX4, texEY4] = zip(["X", "Y"], [nbSidesX, nbSidesY]).map(([_letter, nbSides]) => {
+        return `\\frac{1}{${nbSides}} \\times \\frac{${nbSides} \\times ${nbSides + 1}}{2}`;
+    });
+    const nodeEXPlusY = add(nodeEXForResult, nodeEYForResult);
+    return `On note $X$ et $Y$ les variables aléatoires associées à chaque dé.
+  
+On a :
+  
+${alignTex([
+        ["", "E(X)"],
+        ["=", texEX1],
+        ["=", texEX2],
+        ["=", texEX3],
+        ["=", texEX4],
+        ["=", nodeEXForResult.toTex()],
+    ])}
+  
+${alignTex([
+        ["", "E(Y)"],
+        ["=", texEY1],
+        ["=", texEY2],
+        ["=", texEY3],
+        ["=", texEY4],
+        ["=", nodeEYForResult.toTex()],
+    ])}
+
+Par conséquent :
+
+${alignTex([
+        ["S", "=", "E(X+Y)"],
+        ["", "=", "E(X)+E(Y)"],
+        ["", "=", nodeEXPlusY.toTex()],
+        ["", "=", nodeEXPlusY.simplify().toTex()],
+    ])}
+
+`;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    propWhile(propositions, n, () => {
+        const identifiersWrong = createRandomIdentifiers();
+        tryToAddWrongProp(propositions, getAnswer(identifiersWrong));
+    });
+    return shuffleProps(propositions, n);
+};
+const getKeys = () => {
+    return [];
+};
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        const nodeAns = parseAlgebraic(ans);
+        const nodeAnswer = parseAlgebraic(answer);
+        return (NodeComparator.isEqualViaSub(nodeAns, nodeAnswer) ||
+            NodeComparator.isEqualViaFrac(nodeAns, nodeAnswer));
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+const createRandomIdentifiers = () => {
+    const arrNbSide = randomMany([4, 6, 8, 10, 12, 20], 2);
+    const identifiers = {
+        arrNbSide,
+    };
+    return identifiers;
+};
+const getExpectedValueOfSumFromDiceQuestion = () => {
+    const identifiers = createRandomIdentifiers();
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    return {
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: getKeys(identifiers),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+};
+export const expectedValueOfSumFromDice = {
+    id: "expectedValueOfSumFromDice",
+    connector: "=",
+    label: "Calculer l'espérance d'une somme de lancers de dés",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getExpectedValueOfSumFromDiceQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getInstruction,
+    getHint,
+    getCorrection,
+    getAnswer,
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+};

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromProbaLaw.d.ts

@@ -0,0 +1,14 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { NodeIdentifiers } from "../../../../tree/nodes/nodeConstructor.js";
+type RVIds = {
+    xValuesIds: NodeIdentifiers[];
+    yValuesIds: NodeIdentifiers[];
+    name: string;
+};
+type Identifiers = {
+    rvIdsX: RVIds;
+    rvIdsY: RVIds;
+};
+export declare const expectedValueOfSumFromProbaLaw: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=expectedValueOfSumFromProbaLaw.d.ts.map

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromProbaLaw.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expectedValueOfSumFromProbaLaw.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/probaStat/basicProbas/expectedValueOfSumFromProbaLaw.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAO7C,KAAK,KAAK,GAAG;IACX,UAAU,EAAE,eAAe,EAAE,CAAC;IAC9B,UAAU,EAAE,eAAe,EAAE,CAAC;IAC9B,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAmBF,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,KAAK,CAAC;IACd,MAAM,EAAE,KAAK,CAAC;CACf,CAAC;AAuIF,eAAO,MAAM,8BAA8B,EAAE,QAAQ,CAAC,WAAW,CAsBhE,CAAC"}

package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromProbaLaw.js

@@ -0,0 +1,150 @@
+import { addValidProp, shuffleProps, tryToAddWrongProp, propWhile, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { RandomVariable, RandomVariableConstructor, } from "../../../../math/probability/randomVariable.js";
+import { reifyAlgebraic, } from "../../../../tree/nodes/nodeConstructor.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
+import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
+import { alignTex } from "../../../../utils/latex/alignTex.js";
+const createRVIds = (rv) => {
+    return {
+        xValuesIds: rv.xValues.map((e) => e.toIdentifiers()),
+        yValuesIds: rv.yValues.map((e) => e.toIdentifiers()),
+        name: rv.name,
+    };
+};
+const rvFromIds = (rvIds) => {
+    const { xValuesIds, yValuesIds } = rvIds;
+    return new RandomVariable(xValuesIds.map((e) => reifyAlgebraic(e)), yValuesIds.map((e) => reifyAlgebraic(e)), rvIds.name);
+};
+const getHydrated = (identifiers) => {
+    const { rvIdsX, rvIdsY } = identifiers;
+    const [rvX, rvY] = [rvIdsX, rvIdsY].map((rvIds) => rvFromIds(rvIds));
+    const [EX, EY] = [rvX, rvY].map((rv) => rv.getAverage());
+    const EXPlusY = add(EX.simplify(), EY.simplify());
+    return {
+        rvX,
+        rvY,
+        EX,
+        EY,
+        EXPlusY,
+    };
+};
+const getInstruction = (identifiers) => {
+    const { rvX, rvY } = getHydrated(identifiers);
+    return `Soient $X$ et $Y$ deux variables aléatoires dont les lois de probabilités sont données ci-dessous :
+
+${rvX.getLawMdTable()}
+
+${rvY.getLawMdTable()}
+
+Que vaut $E(X+Y)$ ?
+`;
+};
+const getAnswer = (identifiers) => {
+    const { EXPlusY } = getHydrated(identifiers);
+    return EXPlusY.simplify().toTex();
+};
+const getHint = () => {
+    return `Calcule d'abord $E(X)$ et $E(Y)$ :
+
+$E(X)$ est la somme des produits des valeurs de $X$ par leur probabilité.
+
+Calcule ensuite $E(X+Y)$ :
+
+$$
+E(X+Y) = E(X) + E(Y)
+$$
+  
+`;
+};
+const getCorrection = (identifiers) => {
+    const { EX, EY, EXPlusY } = getHydrated(identifiers);
+    return `On a :
+  
+${alignTex([
+        ["", "E(X)"],
+        ["=", EX.toTex()],
+        ["=", EX.simplify().toTex()],
+    ])}
+  
+${alignTex([
+        ["", "E(Y)"],
+        ["=", EY.toTex()],
+        ["=", EY.simplify().toTex()],
+    ])}
+
+Par conséquent :
+
+$$
+E(X+Y) = E(X) + E(Y) = ${EXPlusY.toTex()} = ${EXPlusY.simplify().toTex()}
+$$
+
+`;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    propWhile(propositions, n, () => {
+        const identifiersWrong = createRandomIdentifiers();
+        tryToAddWrongProp(propositions, getAnswer(identifiersWrong));
+    });
+    return shuffleProps(propositions, n);
+};
+const getKeys = () => {
+    return [];
+};
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        const nodeAns = parseAlgebraic(ans);
+        const nodeAnswer = parseAlgebraic(answer);
+        return (NodeComparator.isEqualViaSub(nodeAns, nodeAnswer) ||
+            NodeComparator.isEqualViaFrac(nodeAns, nodeAnswer));
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+const createRandomIdentifiers = () => {
+    const rvX = RandomVariableConstructor.random("X", 3);
+    const rvY = RandomVariableConstructor.random("Y", 3);
+    const identifiers = {
+        rvIdsX: createRVIds(rvX),
+        rvIdsY: createRVIds(rvY),
+    };
+    return identifiers;
+};
+const getExpectedValueOfSumFromProbaLawQuestion = () => {
+    const identifiers = createRandomIdentifiers();
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    return {
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: getKeys(identifiers),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+};
+export const expectedValueOfSumFromProbaLaw = {
+    id: "expectedValueOfSumFromProbaLaw",
+    connector: "=",
+    label: "Calculer l'espérance d'une somme de variables aléatoires à partir des lois de probabilité",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getExpectedValueOfSumFromProbaLawQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getInstruction,
+    getHint,
+    getCorrection,
+    getAnswer,
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+};