math-exercises 2.0.0 → 2.0.2

package/lib/exercises/limits/rationalFracForbiddenValueLimit.js

@@ -10,53 +10,65 @@ const discreteSet_1 = require("../../math/sets/discreteSet");
 const intervals_1 = require("../../math/sets/intervals/intervals");
 const randint_1 = require("../../math/utils/random/randint");
 const coinFlip_1 = require("../../utils/coinFlip");
+const getSign = (nb) => {
+    return nb >= 0 ? "+" : "-";
+};
 const getSequenceRationalFracLimitQuestion = () => {
     const polyDenum = new affine_1.Affine(1, (0, randint_1.randint)(-9, 10, [0]));
     const forbiddenValue = -polyDenum.b;
-    const interval = new intervals_1.Interval('[[-10;10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(forbiddenValue)]));
-    const intervalStar = new intervals_1.Interval('[[-10;10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
+    const interval = new intervals_1.Interval("[[-10;10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(forbiddenValue)]));
+    const intervalStar = new intervals_1.Interval("[[-10;10]]").difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
     const polyNum = trinom_1.TrinomConstructor.randomFactorized(intervalStar, interval, interval);
     const numLimit = polyNum.calculate(-polyDenum.b);
-    const getSign = (nb) => {
-        return nb >= 0 ? '+' : '-';
-    };
     const isRight = (0, coinFlip_1.coinFlip)();
     const to = isRight ? `${forbiddenValue}` : `${forbiddenValue}`;
     const from = isRight ? `x>${forbiddenValue}` : `x<${forbiddenValue}`;
-    const answer = isRight ? `${getSign(numLimit)}\\infty` : `${getSign(-numLimit)}\\infty`;
+    const answer = isRight
+        ? `${getSign(numLimit)}\\infty`
+        : `${getSign(-numLimit)}\\infty`;
     const question = {
         answer,
-        instruction: `Soit $f$ la fonction définie par : $f(x) = \\dfrac{${polyNum.toTree().toTex()}}{${polyDenum
+        instruction: `Soit $f$ la fonction définie par : $f(x) = \\dfrac{${polyNum
+            .toTree()
+            .toTex()}}{${polyDenum
             .toTree()
             .toTex()}}$. Déterminer $\\lim\\limits_{x \\to ${to}, \\ ${from}}f(x).$
       `,
-        keys: ['infty'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, coeffs: polyNum.coefficients },
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: {
+            numCoeffs: polyNum.coefficients,
+            denumCoeffs: polyDenum.coefficients,
+            isRight,
+        },
     };
     return question;
 };
-const getPropositions = (n, { answer, coeffs }) => {
+const getPropositions = (n, { answer, numCoeffs }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, '+\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '-\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '0');
-    (0, exercise_1.tryToAddWrongProp)(propositions, coeffs[coeffs.length - 1].toString());
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
+    (0, exercise_1.tryToAddWrongProp)(propositions, numCoeffs[numCoeffs.length - 1].toString());
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + '');
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
     }
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
+const isAnswerValid = (ans, { answer, numCoeffs, denumCoeffs, isRight }) => {
+    return ans === answer;
+};
 exports.rationalFracForbiddenValueLimit = {
-    id: 'rationalFracForbiddenValueLimit',
-    connector: '=',
+    id: "rationalFracForbiddenValueLimit",
+    connector: "=",
     label: "Limite d'une fraction rationnelle avec valeur interdite",
-    levels: ['TermSpé', 'MathComp'],
+    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ['Limites'],
+    sections: ["Limites"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

package/lib/exercises/limits/rationalFracLimit.d.ts

@@ -1,9 +1,9 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-    leadingCoeffsRational: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    limitTo: "+\\infty" | "-\\infty";
+    numCoeffs: number[];
+    denumCoeffs: number[];
 };
-type VEAProps = {};
-export declare const rationalFracLimit: MathExercise<QCMProps, VEAProps>;
+export declare const rationalFracLimit: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=rationalFracLimit.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"rationalFracLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/rationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,qBAAqB,EAAE,MAAM,CAAC;CAC/B,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAiDnB,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW9D,CAAC"}
+{"version":3,"file":"rationalFracLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/rationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAclC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,UAAU,GAAG,UAAU,CAAC;IACjC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAqGF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAavD,CAAC"}

package/lib/exercises/limits/rationalFracLimit.js

@@ -7,6 +7,7 @@ const rational_1 = require("../../math/numbers/rationals/rational");
 const monom_1 = require("../../math/polynomials/monom");
 const polynomial_1 = require("../../math/polynomials/polynomial");
 const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const coinFlip_1 = require("../../utils/coinFlip");
 const shuffle_1 = require("../../utils/shuffle");
 const getSequenceRationalFracLimitQuestion = () => {
@@ -14,14 +15,17 @@ const getSequenceRationalFracLimitQuestion = () => {
     const polyDenum = polynomial_1.PolynomialConstructor.randomWithLength(4, (0, randint_1.randint)(2, 5));
     const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
     const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
-    const to = (0, coinFlip_1.coinFlip)() ? '+\\infty' : '-\\infty';
+    const to = (0, coinFlip_1.coinFlip)() ? "+\\infty" : "-\\infty";
     let answer;
-    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff).simplify().toTree().toTex();
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
     if (polyDenum.degree === polyNum.degree) {
         answer = leadingCoeffsRational;
     }
     else if (polyDenum.degree > polyNum.degree) {
-        answer = '0';
+        answer = "0";
     }
     else {
         const tempPoly = new monom_1.Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
@@ -32,33 +36,66 @@ const getSequenceRationalFracLimitQuestion = () => {
         instruction: `Déterminer la limite en $${to}$ de la fonction $f$ définie par : $f(x) = \\dfrac{${polyNum
             .toTree()
             .toTex()}}{${polyDenum.toTree().toTex()}}$.`,
-        keys: ['infty'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, leadingCoeffsRational },
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: {
+            numCoeffs: polyNum.coefficients,
+            denumCoeffs: polyDenum.coefficients,
+            limitTo: to,
+        },
     };
     return question;
 };
-const getPropositions = (n, { answer, leadingCoeffsRational }) => {
+const getPropositions = (n, { answer, denumCoeffs, numCoeffs }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, '+\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '-\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '0');
+    const numLeadingCoeff = numCoeffs[numCoeffs.length - 1];
+    const denumLeadingCoeff = denumCoeffs[denumCoeffs.length - 1];
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
     (0, exercise_1.tryToAddWrongProp)(propositions, leadingCoeffsRational);
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + '');
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
     }
     return (0, shuffle_1.shuffle)(propositions);
 };
+const isAnswerValid = (ans, { denumCoeffs, numCoeffs, limitTo }) => {
+    const numDegree = numCoeffs.length - 1;
+    const denumDegree = denumCoeffs.length - 1;
+    const numLeadingCoeff = numCoeffs[numDegree];
+    const denumLeadingCoeff = denumCoeffs[denumDegree];
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    let answer;
+    if (denumDegree === numDegree) {
+        answer = leadingCoeffsRational;
+    }
+    else if (denumDegree > numDegree) {
+        answer = new numberNode_1.NumberNode(0);
+    }
+    else {
+        const tempPoly = new monom_1.Monom(numDegree - denumDegree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
+        answer = tempPoly.getLimitNode(limitTo);
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
 exports.rationalFracLimit = {
-    id: 'rationalFracLimit',
-    connector: '=',
+    id: "rationalFracLimit",
+    connector: "=",
     label: "Limite d'une fraction rationnelle",
-    levels: ['TermSpé', 'MathComp'],
+    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ['Limites'],
+    sections: ["Limites"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

package/lib/exercises/limits/sequenceGeometricLimit.d.ts

@@ -1,10 +1,8 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
     reason: string;
     firstTerm: string;
 };
-type VEAProps = {};
-export declare const sequenceGeometricLimit: MathExercise<QCMProps, VEAProps>;
+export declare const sequenceGeometricLimit: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=sequenceGeometricLimit.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"sequenceGeometricLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceGeometricLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA+BnB,eAAO,MAAM,sBAAsB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWnE,CAAC"}
+{"version":3,"file":"sequenceGeometricLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceGeometricLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAIlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA6CF,eAAO,MAAM,sBAAsB,EAAE,YAAY,CAAC,WAAW,CAa5D,CAAC"}

package/lib/exercises/limits/sequenceGeometricLimit.js

@@ -6,38 +6,46 @@ const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestio
 const geometricSequence_1 = require("../../math/sequences/geometricSequence");
 const getSequenceGeometricLimitQuestion = () => {
     const sequence = geometricSequence_1.GeometricSequenceConstructor.randomWithLimit();
-    const to = '+\\infty';
     const answer = sequence.getLimit();
     if (!answer)
-        throw Error('received geometric sequence with no limit');
+        throw Error("received geometric sequence with no limit");
     const question = {
         answer: answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${sequence.toTree().toTex()}$.`,
-        keys: ['infty'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, reason: sequence.reason.tex, firstTerm: sequence.firstTerm.tex },
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${sequence
+            .toTree()
+            .toTex()}$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: {
+            reason: sequence.reason.toTree().toTex(),
+            firstTerm: sequence.firstTerm.toTree().toTex(),
+        },
     };
     return question;
 };
 const getPropositions = (n, { answer, reason, firstTerm }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, '+\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '-\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '0');
-    (0, exercise_1.tryToAddWrongProp)(propositions, reason + '');
-    (0, exercise_1.tryToAddWrongProp)(propositions, firstTerm + '');
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
+    (0, exercise_1.tryToAddWrongProp)(propositions, reason + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, firstTerm + "");
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
 exports.sequenceGeometricLimit = {
-    id: 'sequenceGeometricLimit',
-    connector: '=',
+    id: "sequenceGeometricLimit",
+    connector: "=",
     label: "Limite d'une suite géométrique",
-    levels: ['TermSpé', 'MathComp'],
+    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ['Limites', 'Suites'],
+    sections: ["Limites", "Suites"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceGeometricLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

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

@@ -1,9 +1,7 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
     coeffs: number[];
 };
-type VEAProps = {};
-export declare const sequencePolynomLimit: MathExercise<QCMProps, VEAProps>;
+export declare const sequencePolynomLimit: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=sequencePolynomLimit.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAmCnB,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWjE,CAAC"}
+{"version":3,"file":"sequencePolynomLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAuCF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,WAAW,CAa1D,CAAC"}

package/lib/exercises/limits/sequencePolynomLimit.js

@@ -7,40 +7,46 @@ const polynomial_1 = require("../../math/polynomials/polynomial");
 const randint_1 = require("../../math/utils/random/randint");
 const shuffle_1 = require("../../utils/shuffle");
 const getSequencePolynomLimitQuestion = () => {
-    const poly = polynomial_1.PolynomialConstructor.random(4, 'n');
-    const to = '+\\infty';
+    const poly = polynomial_1.PolynomialConstructor.random(4, "n");
+    const to = "+\\infty";
     const answer = poly.getLimit(to);
     const question = {
         answer: answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly.toTree().toTex()}$.`,
-        keys: ['infty'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, coeffs: poly.coefficients },
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly
+            .toTree()
+            .toTex()}$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: { coeffs: poly.coefficients },
     };
     return question;
 };
 const getPropositions = (n, { answer, coeffs }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, '+\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '-\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '0');
-    (0, exercise_1.tryToAddWrongProp)(propositions, coeffs[coeffs.length - 1] + '');
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
+    (0, exercise_1.tryToAddWrongProp)(propositions, coeffs[coeffs.length - 1] + "");
     while (propositions.length < n) {
-        const wrongAnswer = (0, randint_1.randint)(-10, 10) + '';
+        const wrongAnswer = (0, randint_1.randint)(-10, 10) + "";
         (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
     }
     return (0, shuffle_1.shuffle)(propositions);
 };
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
 exports.sequencePolynomLimit = {
-    id: 'sequencePolynomLimit',
-    connector: '=',
+    id: "sequencePolynomLimit",
+    connector: "=",
     label: "Limite d'une suite polynomiale",
-    levels: ['TermSpé', 'MathComp'],
+    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ['Limites', 'Suites'],
+    sections: ["Limites", "Suites"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

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

@@ -1,9 +1,7 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
     coeffs: number[];
 };
-type VEAProps = {};
-export declare const sequencePolynomNoFILimit: MathExercise<QCMProps, VEAProps>;
+export declare const sequencePolynomNoFILimit: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=sequencePolynomNoFILimit.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomNoFILimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomNoFILimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAmCnB,eAAO,MAAM,wBAAwB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWrE,CAAC"}
+{"version":3,"file":"sequencePolynomNoFILimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomNoFILimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AA6CF,eAAO,MAAM,wBAAwB,EAAE,YAAY,CAAC,WAAW,CAa9D,CAAC"}

package/lib/exercises/limits/sequencePolynomNoFILimit.js

@@ -8,39 +8,45 @@ const randint_1 = require("../../math/utils/random/randint");
 const shuffle_1 = require("../../utils/shuffle");
 const getSequencePolynomNoFILimitQuestion = () => {
     const length = (0, randint_1.randint)(2, 5);
-    const poly = polynomial_1.PolynomialConstructor.randomWithLengthAndSameSigns(4, length, 'n');
-    const to = '+\\infty';
+    const poly = polynomial_1.PolynomialConstructor.randomWithLengthAndSameSigns(4, length, "n");
+    const to = "+\\infty";
     const answer = poly.getLimit(to);
     const question = {
         answer: answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly.toTree().toTex()}$.`,
-        keys: ['infty'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, coeffs: poly.coefficients },
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly
+            .toTree()
+            .toTex()}$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: { coeffs: poly.coefficients },
     };
     return question;
 };
 const getPropositions = (n, { answer, coeffs }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, '+\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '-\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '0');
-    (0, exercise_1.tryToAddWrongProp)(propositions, coeffs[coeffs.length - 1] + '');
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
+    (0, exercise_1.tryToAddWrongProp)(propositions, coeffs[coeffs.length - 1] + "");
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + '');
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
     }
     return (0, shuffle_1.shuffle)(propositions);
 };
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
 exports.sequencePolynomNoFILimit = {
-    id: 'sequencePolynomNoFILimit',
-    connector: '=',
+    id: "sequencePolynomNoFILimit",
+    connector: "=",
     label: "Limite d'une suite polynomiale (sans F.I.)",
-    levels: ['TermSpé', 'MathComp'],
+    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ['Limites', 'Suites'],
+    sections: ["Limites", "Suites"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomNoFILimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

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

@@ -1,9 +1,8 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-    leadingCoeffsRational: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    polyNumCoeffs: number[];
+    polyDenumCoeffs: number[];
 };
-type VEAProps = {};
-export declare const sequencePolynomProductLimit: MathExercise<QCMProps, VEAProps>;
+export declare const sequencePolynomProductLimit: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=sequencePolynomProductLimit.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AASlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,qBAAqB,EAAE,MAAM,CAAC;CAC/B,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAyCnB,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWxE,CAAC"}
+{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC;AAkEF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/limits/sequencePolynomProductLimit.js

@@ -9,46 +9,62 @@ const polynomial_1 = require("../../math/polynomials/polynomial");
 const randint_1 = require("../../math/utils/random/randint");
 const shuffle_1 = require("../../utils/shuffle");
 const getSequencePolynomProductLimitQuestion = () => {
-    const polyNum = polynomial_1.PolynomialConstructor.randomWithLength(3, 2, 'n');
-    const polyDenum = polynomial_1.PolynomialConstructor.randomWithLength(3, 2, 'n');
+    const polyNum = polynomial_1.PolynomialConstructor.randomWithLength(3, 2, "n");
+    const polyDenum = polynomial_1.PolynomialConstructor.randomWithLength(3, 2, "n");
     const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
     const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
-    const product = new monom_1.Monom(polyNum.degree + polyDenum.degree, numLeadingCoeff * denumLeadingCoeff, 'n');
-    const to = '+\\infty';
+    const product = new monom_1.Monom(polyNum.degree + polyDenum.degree, numLeadingCoeff * denumLeadingCoeff, "n");
+    const to = "+\\infty";
     let answer = product.getLimit(to);
-    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff).simplify().toTree().toTex();
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
     const question = {
         answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = (${polyNum.toTree().toTex()})(${polyDenum
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = (${polyNum
             .toTree()
-            .toTex()})$.`,
-        keys: ['infty'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, leadingCoeffsRational },
+            .toTex()})(${polyDenum.toTree().toTex()})$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: {
+            polyDenumCoeffs: polyDenum.coefficients,
+            polyNumCoeffs: polyNum.coefficients,
+        },
     };
     return question;
 };
-const getPropositions = (n, { answer, leadingCoeffsRational }) => {
+const getPropositions = (n, { answer, polyDenumCoeffs, polyNumCoeffs }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, '+\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '-\\infty');
-    (0, exercise_1.tryToAddWrongProp)(propositions, '0');
+    const numLeadingCoeff = polyNumCoeffs[polyNumCoeffs.length - 1];
+    const denumLeadingCoeff = polyDenumCoeffs[polyDenumCoeffs.length - 1];
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
     (0, exercise_1.tryToAddWrongProp)(propositions, leadingCoeffsRational);
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + '');
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
     }
     return (0, shuffle_1.shuffle)(propositions);
 };
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
 exports.sequencePolynomProductLimit = {
-    id: 'sequencePolynomProductLimit',
-    connector: '=',
+    id: "sequencePolynomProductLimit",
+    connector: "=",
     label: "Limite d'un produit de suites polynomiales",
-    levels: ['TermSpé', 'MathComp'],
+    levels: ["TermSpé", "MathComp"],
     isSingleStep: true,
-    sections: ['Limites', 'Suites'],
+    sections: ["Limites", "Suites"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomProductLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

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

@@ -1,9 +1,8 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-    leadingCoeffsRational: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    numCoeffs: number[];
+    denumCoeffs: number[];
 };
-type VEAProps = {};
-export declare const sequenceRationalFracLimit: MathExercise<QCMProps, VEAProps>;
+export declare const sequenceRationalFracLimit: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=sequenceRationalFracLimit.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AASlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,qBAAqB,EAAE,MAAM,CAAC;CAC/B,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAqDnB,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWtE,CAAC"}
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAmGF,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,WAAW,CAa/D,CAAC"}