math-exercises 2.2.58 → 2.2.59

package/lib/exercises/math/functions/trinoms/factorizedFormFromRoots.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factorizedFormFromRoots.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/trinoms/factorizedFormFromRoots.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA8EF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAczD,CAAC"}
+{"version":3,"file":"factorizedFormFromRoots.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/trinoms/factorizedFormFromRoots.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,0BAA0B,CAAC;AAgBlC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA+EF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAczD,CAAC"}

package/lib/exercises/math/functions/trinoms/factorizedFormFromRoots.js

@@ -7,13 +7,20 @@ const randint_1 = require("../../../../math/utils/random/randint");
 const multiplyNode_1 = require("../../../../tree/nodes/operators/multiplyNode");
 const powerNode_1 = require("../../../../tree/nodes/operators/powerNode");
 const substractNode_1 = require("../../../../tree/nodes/operators/substractNode");
-const variableNode_1 = require("../../../../tree/nodes/variables/variableNode");
 const probaFlip_1 = require("../../../../utils/alea/probaFlip");
-const getAnswer = (roots, a) => {
+const getAnswerNode = (roots, a) => {
     const isSingleRoot = roots.length === 1;
     return isSingleRoot
-        ? new multiplyNode_1.MultiplyNode(a.toTree(), new powerNode_1.SquareNode(new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), roots[0].toTree()))).simplify({ keepPowers: true })
-        : new multiplyNode_1.MultiplyNode(new multiplyNode_1.MultiplyNode(a.toTree(), new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), roots[0].toTree())), new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), roots[1].toTree())).simplify();
+        ? (0, multiplyNode_1.multiply)(a, (0, powerNode_1.square)((0, substractNode_1.substract)("x", roots[0]))).simplify({
+            keepPowers: true,
+        })
+        : (0, multiplyNode_1.multiply)((0, multiplyNode_1.multiply)(a, (0, substractNode_1.substract)("x", roots[0])), (0, substractNode_1.substract)("x", roots[1])).simplify();
+};
+const getInstruction = (identifiers) => {
+    const { a, roots } = identifiers;
+    return `Soit $f(x) = ax^2 + bx + c$ un polynôme du second degré avec $a = ${a}$ et qui a ${roots.length === 1
+        ? `pour seule racine : $${roots[0]}$`
+        : `deux racines : $${roots[0]}$ et $${roots[1]}$`}. Déterminer la forme factorisée de $f$.`;
 };
 const getFactorizedFormFromRootsQuestion = () => {
     const a = (0, randint_1.randint)(-10, 10, [0]);
@@ -23,32 +30,31 @@ const getFactorizedFormFromRootsQuestion = () => {
     const roots = isSingleRoot
         ? [firstRoot]
         : [firstRoot, secondRoot].sort((a, b) => a - b);
-    const answer = getAnswer(roots, a);
+    const answer = getAnswerNode(roots, a);
     const answerTex = answer.toTex();
+    const identifiers = { a, roots };
     const question = {
         answer: answerTex,
-        instruction: `Soit $f(x) = ax^2 + bx + c$ un polynôme du second degré avec $a = ${a}$ et qui a ${roots.length === 1
-            ? `une racine : $${roots[0]}$`
-            : `deux racines : $${roots[0]}$ et $${roots[1]}$`}. Déterminer la forme factorisée de $f$.`,
+        instruction: getInstruction(identifiers),
         keys: ["x"],
         answerFormat: "tex",
-        identifiers: { a, roots },
+        identifiers,
     };
     return question;
 };
 const getPropositions = (n, { answer, a, roots }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer(roots.map((r) => -r), a).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, getAnswerNode(roots.map((r) => -r), a).toTex());
     while (propositions.length < n) {
         const x1 = (0, randint_1.randint)(-10, 10);
         const x2 = (0, randint_1.randint)(-10, 10, [x1]);
-        (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer([x1, x2].sort((a, b) => a - b), (0, randint_1.randint)(-10, 10, [0])).toTex());
+        (0, exercise_1.tryToAddWrongProp)(propositions, getAnswerNode([x1, x2].sort((a, b) => a - b), (0, randint_1.randint)(-10, 10, [0])).toTex());
     }
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
 const isAnswerValid = (ans, { answer, a, roots }) => {
-    const answerNode = getAnswer(roots, a);
+    const answerNode = getAnswerNode(roots, a);
     const texs = answerNode.toAllValidTexs();
     return texs.includes(ans);
 };

package/lib/exercises/math/probaStat/binomial/binomialInequation.js

@@ -66,7 +66,7 @@ ${identifiers.isSentence
         : `Calculer en donnant la réponse à $10^{-2}$ près :
   
 $$
-${interval.toInequality("P(X)".toTree()).toTex()}
+P\\left(${interval.toInequality("X".toTree()).toTex()}\\right)
 $$`}`;
 };
 // const getHint: GetHint<Identifiers> = (identifiers) => {};
@@ -145,7 +145,7 @@ const options = [
 exports.binomialInequation = {
     id: "binomialInequation",
     connector: "\\iff",
-    label: "Calculer une probabilité binomiale du type $P(X) \\leq a$, $P(X)\\geq a$ ou $a\\leq P(X)\\leq b$",
+    label: "Calculer une probabilité binomiale du type $P(X \\leq a)$, $P(X \\geq a)$ ou $P(a\\leq X\\leq b)$",
     isSingleStep: true,
     generator: (nb, opts) => (0, getDistinctQuestions_1.getDistinctQuestions)(() => getBinomialInequationQuestion(opts), nb),
     qcmTimer: 60,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "2.2.58",
+  "version": "2.2.59",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [