math-exercises 3.0.68 → 3.0.70

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

@@ -23,6 +23,9 @@ const getSequenceGeometricLimitQuestion = () => {
         reason: sequence.reason.toIdentifiers(),
         firstTerm: sequence.firstTerm.toIdentifiers(),
     };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
@@ -58,4 +61,5 @@ export const sequenceGeometricLimit = {
     subject: "Mathématiques",
     getAnswer,
     getInstruction,
+    getQuestionFromIdentifiers,
 };

package/lib/exercises/math/limits/sequencePolynomLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAuCF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CActD,CAAC"}
+{"version":3,"file":"sequencePolynomLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAyDF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAatD,CAAC"}

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

@@ -1,23 +1,37 @@
 import { addValidProp, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
-import { PolynomialConstructor } from "../../../math/polynomials/polynomial.js";
+import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
-const getSequencePolynomLimitQuestion = () => {
-    const poly = PolynomialConstructor.random(4, "n");
+const getInstruction = (identifiers) => {
+    const poly = new Polynomial(identifiers.coeffs);
+    return `Déterminer la limite de la suite $u$ définie par : 
+  
+$$
+u_n = ${poly.toTree().toTex()}
+$$`;
+};
+const getAnswer = (identifiers) => {
     const to = "+\\infty";
+    const poly = new Polynomial(identifiers.coeffs);
     const answer = poly.getLimit(to);
+    return answer;
+};
+const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
-        answer: answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly
-            .toTree()
-            .toTex()}$.`,
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
         keys: ["infty"],
         answerFormat: "tex",
-        identifiers: { coeffs: poly.coefficients },
+        identifiers,
     };
     return question;
 };
+const getSequencePolynomLimitQuestion = () => {
+    const poly = PolynomialConstructor.random(4, "n");
+    const identifiers = { coeffs: poly.coefficients };
+    return getQuestionFromIdentifiers(identifiers);
+};
 const getPropositions = (n, { answer, coeffs }) => {
     const propositions = [];
     addValidProp(propositions, answer);
@@ -38,13 +52,12 @@ export const sequencePolynomLimit = {
     id: "sequencePolynomLimit",
     connector: "=",
     label: "Limite d'une suite polynomiale",
-    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ["Limites", "Suites"],
     generator: (nb) => getDistinctQuestions(getSequencePolynomLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
+    getQuestionFromIdentifiers,
 };

package/lib/exercises/math/limits/sequencePolynomNoFILimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomNoFILimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomNoFILimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AA6CF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAc1D,CAAC"}
+{"version":3,"file":"sequencePolynomNoFILimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomNoFILimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AA+DF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAa1D,CAAC"}

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

@@ -1,24 +1,38 @@
 import { addValidProp, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
-import { PolynomialConstructor } from "../../../math/polynomials/polynomial.js";
+import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
-const getSequencePolynomNoFILimitQuestion = () => {
-    const length = randint(2, 5);
-    const poly = PolynomialConstructor.randomWithLengthAndSameSigns(4, length, "n");
+const getInstruction = (identifiers) => {
+    const poly = new Polynomial(identifiers.coeffs);
+    return `Déterminer la limite de la suite $u$ définie par :
+  
+$$
+u_n = ${poly.toTree().toTex()}
+$$`;
+};
+const getAnswer = (identifiers) => {
     const to = "+\\infty";
+    const poly = new Polynomial(identifiers.coeffs);
     const answer = poly.getLimit(to);
+    return answer;
+};
+const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
-        answer: answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly
-            .toTree()
-            .toTex()}$.`,
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
         keys: ["infty"],
         answerFormat: "tex",
-        identifiers: { coeffs: poly.coefficients },
+        identifiers,
     };
     return question;
 };
+const getSequencePolynomNoFILimitQuestion = () => {
+    const length = randint(2, 5);
+    const poly = PolynomialConstructor.randomWithLengthAndSameSigns(4, length, "n");
+    const identifiers = { coeffs: poly.coefficients };
+    return getQuestionFromIdentifiers(identifiers);
+};
 const getPropositions = (n, { answer, coeffs }) => {
     const propositions = [];
     addValidProp(propositions, answer);
@@ -38,13 +52,12 @@ export const sequencePolynomNoFILimit = {
     id: "sequencePolynomNoFILimit",
     connector: "=",
     label: "Limite d'une suite polynomiale (sans F.I.)",
-    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ["Limites", "Suites"],
     generator: (nb) => getDistinctQuestions(getSequencePolynomNoFILimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
+    getQuestionFromIdentifiers,
 };

package/lib/exercises/math/limits/sequencePolynomProductLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC;AAkEF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAc7D,CAAC"}
+{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC;AAoFF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAa7D,CAAC"}

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

@@ -2,35 +2,49 @@ import { addValidProp, tryToAddWrongProp, } from "../../../exercises/exercise.js
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Rational } from "../../../math/numbers/rationals/rational.js";
 import { Monom } from "../../../math/polynomials/monom.js";
-import { PolynomialConstructor } from "../../../math/polynomials/polynomial.js";
+import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
-const getSequencePolynomProductLimitQuestion = () => {
-    const polyNum = PolynomialConstructor.randomWithLength(3, 2, "n");
-    const polyDenum = PolynomialConstructor.randomWithLength(3, 2, "n");
+const getInstruction = (identifiers) => {
+    const { polyNumCoeffs, polyDenumCoeffs } = identifiers;
+    const polyNum = new Polynomial(polyNumCoeffs);
+    const polyDenum = new Polynomial(polyDenumCoeffs);
+    return `Déterminer la limite de la suite $u$ définie par : 
+
+$$
+u_n = (${polyNum.toTree().toTex()})(${polyDenum.toTree().toTex()})
+$$`;
+};
+const getAnswer = (identifiers) => {
+    const { polyNumCoeffs, polyDenumCoeffs } = identifiers;
+    const polyNum = new Polynomial(polyNumCoeffs);
+    const polyDenum = new Polynomial(polyDenumCoeffs);
     const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
     const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
     const product = new Monom(polyNum.degree + polyDenum.degree, numLeadingCoeff * denumLeadingCoeff, "n");
     const to = "+\\infty";
     let answer = product.getLimit(to);
-    let leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
-        .simplify()
-        .toTree()
-        .toTex();
+    return answer;
+};
+const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
-        answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = (${polyNum
-            .toTree()
-            .toTex()})(${polyDenum.toTree().toTex()})$.`,
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
         keys: ["infty"],
         answerFormat: "tex",
-        identifiers: {
-            polyDenumCoeffs: polyDenum.coefficients,
-            polyNumCoeffs: polyNum.coefficients,
-        },
+        identifiers,
     };
     return question;
 };
+const getSequencePolynomProductLimitQuestion = () => {
+    const polyNum = PolynomialConstructor.randomWithLength(3, 2, "n");
+    const polyDenum = PolynomialConstructor.randomWithLength(3, 2, "n");
+    const identifiers = {
+        polyDenumCoeffs: polyDenum.coefficients,
+        polyNumCoeffs: polyNum.coefficients,
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
 const getPropositions = (n, { answer, polyDenumCoeffs, polyNumCoeffs }) => {
     const propositions = [];
     addValidProp(propositions, answer);
@@ -56,13 +70,12 @@ export const sequencePolynomProductLimit = {
     id: "sequencePolynomProductLimit",
     connector: "=",
     label: "Limite d'un produit de suites polynomiales",
-    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ["Limites", "Suites"],
     generator: (nb) => getDistinctQuestions(getSequencePolynomProductLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
+    getQuestionFromIdentifiers,
 };

package/lib/exercises/math/limits/sequenceRationalFracLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAmGF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAc3D,CAAC"}
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAyHF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}

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

@@ -2,17 +2,28 @@ import { addValidProp, tryToAddWrongProp, } from "../../../exercises/exercise.js
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Rational } from "../../../math/numbers/rationals/rational.js";
 import { Monom } from "../../../math/polynomials/monom.js";
-import { PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
+import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
 import { NumberNode } from "../../../tree/nodes/numbers/numberNode.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
-const getSequenceRationalFracLimitQuestion = () => {
-    const polyNum = PolynomialConstructor.random(4, "n");
-    const polyDenum = PolynomialConstructor.random(4, "n");
+const getInstruction = (identifiers) => {
+    const { numCoeffs, denumCoeffs } = identifiers;
+    const polyNum = new Polynomial(numCoeffs);
+    const polyDenum = new Polynomial(denumCoeffs);
+    return `Déterminer la limite de la suite $u$ définie par : 
+  
+$$
+u_n = \\dfrac{${polyNum.toTree().toTex()}}{${polyDenum.toTree().toTex()}}
+$$`;
+};
+const getAnswer = (identifiers) => {
+    const { numCoeffs, denumCoeffs } = identifiers;
+    const polyNum = new Polynomial(numCoeffs);
+    const polyDenum = new Polynomial(denumCoeffs);
+    let answer = "";
+    const to = "+\\infty";
     const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
     const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
-    const to = "+\\infty";
-    let answer;
     let leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
         .simplify()
         .toTree()
@@ -27,20 +38,27 @@ const getSequenceRationalFracLimitQuestion = () => {
         const tempPoly = new Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1, "n");
         answer = tempPoly.getLimit(to);
     }
+    return answer;
+};
+const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
-        answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = \\dfrac{${polyNum
-            .toTree()
-            .toTex()}}{${polyDenum.toTree().toTex()}}$.`,
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
         keys: ["infty"],
         answerFormat: "tex",
-        identifiers: {
-            numCoeffs: polyNum.coefficients,
-            denumCoeffs: polyDenum.coefficients,
-        },
+        identifiers,
     };
     return question;
 };
+const getSequenceRationalFracLimitQuestion = () => {
+    const polyNum = PolynomialConstructor.random(4, "n");
+    const polyDenum = PolynomialConstructor.random(4, "n");
+    const identifiers = {
+        numCoeffs: polyNum.coefficients,
+        denumCoeffs: polyDenum.coefficients,
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
 const getPropositions = (n, { answer, numCoeffs, denumCoeffs }) => {
     const propositions = [];
     addValidProp(propositions, answer);
@@ -86,13 +104,12 @@ export const sequenceRationalFracLimit = {
     id: "sequenceRationalFracLimit",
     connector: "=",
     label: "Limite d'une suite rationnelle",
-    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ["Limites", "Suites"],
     generator: (nb) => getDistinctQuestions(getSequenceRationalFracLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
+    getQuestionFromIdentifiers,
 };

package/lib/exercises/math/matrices/matrixGeneralTerm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"matrixGeneralTerm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixGeneralTerm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAsDF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAYnD,CAAC"}
+{"version":3,"file":"matrixGeneralTerm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixGeneralTerm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAyEF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAanD,CAAC"}

package/lib/exercises/math/matrices/matrixGeneralTerm.js

@@ -7,24 +7,36 @@ import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
 import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
 import { doWhile } from "../../../utils/doWhile.js";
 //A d'ordre nxp avec a_(i,j) = alpha*i + beta*j
-const getMatrixGeneralTermQuestion = () => {
-    const n = randint(1, 5);
-    const p = doWhile(() => randint(1, 5), (res) => n === 1 && res === 1);
-    const alpha = randint(-5, 6, [0]);
-    const beta = randint(-5, 6, [0]);
+const getInstruction = (identifiers) => {
+    const { alpha, beta, n, p } = identifiers;
     const aij = new AddNode(new MultiplyNode(alpha.toTree(), new VariableNode("i")), new MultiplyNode(beta.toTree(), new VariableNode("j"))).simplify();
+    return `Soit $A = (a_{i,j})$ une matrice d'ordre $n \\times p$ telle que : $n = ${n}$, $p = ${p}$ et pour tout $1\\leq i \\leq n$ et $1\\leq j \\leq p$, $a_{i,j} = ${aij.toTex()}$. Quelle est l'expression de la matrice $A$ ? `;
+};
+const getAnswer = (identifiers) => {
+    const { alpha, beta, n, p } = identifiers;
     const elements = Array.from(Array(n), (_, rowIndex) => Array.from(Array(p), (__, colIndex) => (alpha * (rowIndex + 1) + beta * (colIndex + 1)).toTree()));
     const matrix = new Matrix(elements);
     const answer = matrix.toTex();
+    return answer;
+};
+const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
-        answer,
-        instruction: `Soit $A = (a_{i,j})$ une matrice d'ordre $n \\times p$ telle que : $n = ${n}$, $p = ${p}$ et pour tout $1\\leq i \\leq n$ et $1\\leq j \\leq p$, $a_{i,j} = ${aij.toTex()}$. Quelle est l'expression de la matrice $A$ ? `,
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
         keys: [],
         answerFormat: "tex",
-        identifiers: { n, p, alpha, beta },
+        identifiers,
     };
     return question;
 };
+const getMatrixGeneralTermQuestion = () => {
+    const n = randint(1, 5);
+    const p = doWhile(() => randint(1, 5), (res) => n === 1 && res === 1);
+    const alpha = randint(-5, 6, [0]);
+    const beta = randint(-5, 6, [0]);
+    const identifiers = { n, p, alpha, beta };
+    return getQuestionFromIdentifiers(identifiers);
+};
 const getPropositions = (nb, { answer, n, p, alpha, beta }) => {
     const propositions = [];
     addValidProp(propositions, answer);
@@ -50,4 +62,5 @@ export const matrixGeneralTerm = {
     isAnswerValid,
     answerType: "QCU",
     subject: "Mathématiques",
+    getQuestionFromIdentifiers,
 };

package/lib/exercises/math/matrices/matrixInversibilityDomain.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"matrixInversibilityDomain.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixInversibilityDomain.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AA2BrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAoGF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAc3D,CAAC"}
+{"version":3,"file":"matrixInversibilityDomain.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixInversibilityDomain.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AA2BrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2HF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}

package/lib/exercises/math/matrices/matrixInversibilityDomain.js

@@ -17,28 +17,34 @@ import { parseAlgebraic } from "../../../tree/parsers/latexParser.js";
 import { unionIntervalParser } from "../../../tree/parsers/unionIntervalParser.js";
 import { handleVEAError } from "../../../utils/errors/handleVEAError.js";
 import { intervalKeys } from "../../utils/keys/intervalKeys.js";
-const getMatrixInversibilityDomainQuestion = () => {
-    const elements = [[], []];
-    for (let i = 0; i < 2; i++) {
-        for (let j = 0; j < 2; j++) {
-            elements[i][j] = NombreConstructor.random({
-                types: [NumberType.Integer, NumberType.Rational],
-                excludes: i === 0 && j === 0 ? [new Integer(0)] : undefined,
-            }).toTree();
-        }
-    }
+const getInstruction = (identifiers) => {
+    const { a, b, c, d } = identifiers;
+    const elements = [
+        [a, b],
+        [c, d],
+    ].map((e) => e.map((f) => parseAlgebraic(f)));
     const matrix = new Matrix([
         [new MultiplyNode(elements[0][0], new VariableNode("x")), elements[0][1]],
         elements[1],
     ]);
-    // si d=0 & (b|c)=0 alors det = 0 sur R donc non inversible sur R
-    // sinon si d=0, inversible sur R
-    // sinon x = bc /ad et inversible sur R\x
+    return `Soit $M = ${matrix.toTex()}$, où $x\\in \\mathbb{R}$. 
+
+Sur quel ensemble la matrice $M$ est-elle inversible ?`;
+};
+const getAnswer = (identifiers) => {
+    const { a, b, c, d } = identifiers;
+    const elements = [
+        [a, b],
+        [c, d],
+    ].map((e) => e.map((f) => parseAlgebraic(f)));
     const isDZero = elements[1][1].evaluate({}) === 0;
     const isBorCZero = elements[0][1].evaluate({}) === 0 || elements[1][0].evaluate({}) === 0;
     const x = isDZero
         ? undefined
         : new FractionNode(new MultiplyNode(elements[0][1], elements[1][0]), new MultiplyNode(elements[0][0], elements[1][1])).simplify();
+    // si d=0 & (b|c)=0 alors det = 0 sur R donc non inversible sur R
+    // sinon si d=0, inversible sur R
+    // sinon x = bc /ad et inversible sur R\x
     const answer = isDZero && isBorCZero
         ? EmptySet.toTex()
         : isDZero
@@ -47,23 +53,36 @@ const getMatrixInversibilityDomainQuestion = () => {
                 new IntervalNode(MinusInfinityNode, x, ClosureType.OO),
                 new IntervalNode(x, PlusInfinityNode, ClosureType.OO),
             ]).toTex();
+    return answer;
+};
+const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
-        answer,
-        instruction: `Soit $M = ${matrix.toTex()}$, où $x\\in \\mathbb{R}$. 
-
-Sur quel ensemble la matrice $M$ est-elle inversible ?
-    `,
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
         keys: [...intervalKeys, "reals", "varnothing"],
         answerFormat: "tex",
-        identifiers: {
-            a: elements[0][0].toTex(),
-            b: elements[0][1].toTex(),
-            c: elements[1][0].toTex(),
-            d: elements[1][1].toTex(),
-        },
+        identifiers,
     };
     return question;
 };
+const getMatrixInversibilityDomainQuestion = () => {
+    const elements = [[], []];
+    for (let i = 0; i < 2; i++) {
+        for (let j = 0; j < 2; j++) {
+            elements[i][j] = NombreConstructor.random({
+                types: [NumberType.Integer, NumberType.Rational],
+                excludes: i === 0 && j === 0 ? [new Integer(0)] : undefined,
+            }).toTree();
+        }
+    }
+    const identifiers = {
+        a: elements[0][0].toTex(),
+        b: elements[0][1].toTex(),
+        c: elements[1][0].toTex(),
+        d: elements[1][1].toTex(),
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
 const getPropositions = (n, { answer, a, b, c, d }) => {
     const propositions = [];
     addValidProp(propositions, answer);
@@ -94,9 +113,7 @@ const isAnswerValid = (ans, { answer }) => {
 export const matrixInversibilityDomain = {
     id: "matrixInversibilityDomain",
     label: "Déterminer le domaine d'inversibilité d'une matrice",
-    levels: ["MathExp"],
     isSingleStep: true,
-    sections: ["Matrices"],
     generator: (nb) => getDistinctQuestions(getMatrixInversibilityDomainQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
@@ -104,5 +121,6 @@ export const matrixInversibilityDomain = {
     isAnswerValid,
     subject: "Mathématiques",
     pdfOptions: { shouldSpreadPropositions: true },
+    getQuestionFromIdentifiers,
 };
 //lbracket

package/lib/exercises/math/matrices/productCell.d.ts

@@ -4,6 +4,8 @@ type Identifiers = {
     AjCoeff: number;
     BiCoeff: number;
     BjCoeff: number;
+    i: number;
+    j: number;
 };
 export declare const productCell: Exercise<Identifiers>;
 export {};

package/lib/exercises/math/matrices/productCell.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"productCell.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/productCell.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAqDF,eAAO,MAAM,WAAW,EAAE,QAAQ,CAAC,WAAW,CAa7C,CAAC"}
+{"version":3,"file":"productCell.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/productCell.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA4EF,eAAO,MAAM,WAAW,EAAE,QAAQ,CAAC,WAAW,CAY7C,CAAC"}

package/lib/exercises/math/matrices/productCell.js

@@ -9,25 +9,41 @@ import { doWhile } from "../../../utils/doWhile.js";
 //$A=(a_{i,j})$ avec $a_{i,j}=2i-j$ et $B=(b_{i,j})$ avec $b_{i,j}=i+j$ calculer $c_{2,3}$ Réponse: $c_{2,3} = \sum_{k=1}^{3} (2 \cdot 2 - k) \cdot (k + 3)$ $ c_{2,3} = (2 \cdot 2 - 1) \cdot (1 + 3) + (2 \cdot 2 - 2) \cdot (2 + 3) + (2 \cdot 2 - 3) \cdot (3 + 3)$ $c_{2,3}=3\times 4+2\times 5+1\times 6 =28$. Si l'élève détermine l'expression des matrices A et B puis effectue le calcul des bons blocs pour obtenir le coefficient cela est intéressant aussi ! Bonne journée merci
 // Les matrices A et B sont définies par combinaisons linéaires de leurs lignes/colonnes
 // exp a_(i,j) = 2i+j
-const getProductCellQuestion = () => {
-    const i = randint(1, 4);
-    const j = randint(1, 4);
-    const AiCoeff = randint(-3, 4, [0]);
-    const AjCoeff = randint(-3, 4, [0]);
-    const BiCoeff = randint(-3, 4, [0]);
-    const BjCoeff = doWhile(() => randint(-3, 4, [0]), (x) => BiCoeff === AiCoeff && x === AjCoeff);
+const getInstruction = (identifiers) => {
+    const { i, j, AiCoeff, AjCoeff, BiCoeff, BjCoeff } = identifiers;
     const aij = new AddNode(new MultiplyNode(AiCoeff.toTree(), new VariableNode("i")), new MultiplyNode(AjCoeff.toTree(), new VariableNode("j"))).simplify();
     const bij = new AddNode(new MultiplyNode(BiCoeff.toTree(), new VariableNode("i")), new MultiplyNode(BjCoeff.toTree(), new VariableNode("j"))).simplify();
+    return `Soient  $A = \\left(a_{i,j}\\right)$ et $B = \\left(b_{i,j}\\right)$ deux matrices carrées d'ordre $3$, avec $a_{i,j} = ${aij.toTex()}$ et $b_{i,j} = ${bij.toTex()}$. 
+  
+Soit $C = AB$. 
+
+Calculer $c_{${i},${j}}$.`;
+};
+const getAnswer = (identifiers) => {
+    const { i, j, AiCoeff, AjCoeff, BiCoeff, BjCoeff } = identifiers;
     const answer = sum(1, 3, (k) => (AiCoeff * i + AjCoeff * k) * (BiCoeff * k + BjCoeff * j)) + "";
+    return answer;
+};
+const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
-        answer,
-        instruction: `Soient  $A = \\left(a_{i,j}\\right)$ et $B = \\left(b_{i,j}\\right)$ deux matrices carrées d'ordre $3$, avec $a_{i,j} = ${aij.toTex()}$ et $b_{i,j} = ${bij.toTex()}$. Soit $C = AB$. Calculer $c_{${i},${j}}$.`,
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
         keys: [],
         answerFormat: "tex",
-        identifiers: { AiCoeff, AjCoeff, BiCoeff, BjCoeff },
+        identifiers,
     };
     return question;
 };
+const getProductCellQuestion = () => {
+    const i = randint(1, 4);
+    const j = randint(1, 4);
+    const AiCoeff = randint(-3, 4, [0]);
+    const AjCoeff = randint(-3, 4, [0]);
+    const BiCoeff = randint(-3, 4, [0]);
+    const BjCoeff = doWhile(() => randint(-3, 4, [0]), (x) => BiCoeff === AiCoeff && x === AjCoeff);
+    const identifiers = { i, j, AiCoeff, AjCoeff, BiCoeff, BjCoeff };
+    return getQuestionFromIdentifiers(identifiers);
+};
 const getPropositions = (n, { answer }) => {
     const propositions = [];
     addValidProp(propositions, answer);
@@ -43,13 +59,12 @@ export const productCell = {
     id: "productCell",
     connector: "=",
     label: "Calculer un coefficient du produit de deux matrices",
-    levels: ["MathExp"],
     isSingleStep: true,
-    sections: ["Matrices"],
     generator: (nb) => getDistinctQuestions(getProductCellQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
+    getQuestionFromIdentifiers,
 };

package/lib/exercises/math/powers/decimalToScientific.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"decimalToScientific.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/powers/decimalToScientific.ts"],"names":[],"mappings":"AAyBA,OAAO,EACL,QAAQ,EAeT,MAAM,mBAAmB,CAAC;AAG3B,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AA4HF,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,WAAW,CAcrD,CAAC"}
+{"version":3,"file":"decimalToScientific.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/powers/decimalToScientific.ts"],"names":[],"mappings":"AAyBA,OAAO,EACL,QAAQ,EAgBT,MAAM,mBAAmB,CAAC;AAG3B,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAwIF,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,WAAW,CAerD,CAAC"}

package/lib/exercises/math/powers/decimalToScientific.js

@@ -104,6 +104,7 @@ const isAnswerValid = (ans, { decimal }) => {
                 return false;
             if (parsed.rightChild.leftChild.value !== 10)
                 return false;
+            console.log(parsed.simplify({ calculatePowers: true }).toTex(), decimal.frenchify());
             return (parsed.simplify({ calculatePowers: true }).toTex() ===
                 decimal.frenchify());
         }
@@ -113,6 +114,13 @@ const isAnswerValid = (ans, { decimal }) => {
         return handleVEAError(err);
     }
 };
+const getTests = () => [
+    {
+        identifiers: { decimal: 0.0001 },
+        answer: "1\\times10^{-4}",
+        // valids: ["10^{-4}"],
+    },
+];
 export const decimalToScientific = {
     id: "decimalToScientific",
     connector: "=",
@@ -126,4 +134,5 @@ export const decimalToScientific = {
     subject: "Mathématiques",
     hasHintAndCorrection: true,
     getQuestionFromIdentifiers,
+    getTests,
 };

package/lib/exercises/math/primitive/constantPrimitive.d.ts

@@ -1,8 +1,9 @@
-import { Exercise, QCMGenerator, QuestionGenerator, VEA } from "../../../exercises/exercise.js";
+import { Exercise, GetQuestionFromIdentifiers, QCMGenerator, QuestionGenerator, VEA } from "../../../exercises/exercise.js";
 type Identifiers = {
     c: number;
 };
 export declare const getConstantPrimitive: QuestionGenerator<Identifiers>;
+export declare const getConstantPrimitiveQuestionFromIdentifiers: GetQuestionFromIdentifiers<Identifiers>;
 export declare const getConstantPrimitivePropositions: QCMGenerator<Identifiers>;
 export declare const isConstantPrimitiveAnswerValid: VEA<Identifiers>;
 export declare const constantPrimitive: Exercise<Identifiers>;

package/lib/exercises/math/primitive/constantPrimitive.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"constantPrimitive.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/primitive/constantPrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAKR,YAAY,EAEZ,iBAAiB,EACjB,GAAG,EAGJ,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAoBF,eAAO,MAAM,oBAAoB,EAAE,iBAAiB,CAAC,WAAW,CAI/D,CAAC;AAgBF,eAAO,MAAM,gCAAgC,EAAE,YAAY,CAAC,WAAW,CActE,CAAC;AAEF,eAAO,MAAM,8BAA8B,EAAE,GAAG,CAAC,WAAW,CAO3D,CAAC;AAEF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAYnD,CAAC"}
+{"version":3,"file":"constantPrimitive.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/primitive/constantPrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAGR,0BAA0B,EAE1B,YAAY,EAEZ,iBAAiB,EACjB,GAAG,EAGJ,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAoBF,eAAO,MAAM,oBAAoB,EAAE,iBAAiB,CAAC,WAAW,CAI/D,CAAC;AAEF,eAAO,MAAM,2CAA2C,EAAE,0BAA0B,CAClF,WAAW,CAYZ,CAAC;AACF,eAAO,MAAM,gCAAgC,EAAE,YAAY,CAAC,WAAW,CActE,CAAC;AAEF,eAAO,MAAM,8BAA8B,EAAE,GAAG,CAAC,WAAW,CAO3D,CAAC;AAEF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAYnD,CAAC"}