math-exercises 2.0.12 → 2.0.13

package/lib/exercises/limits/sequencePolynomNoFILimit.js

@@ -1,52 +1,52 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sequencePolynomNoFILimit = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const polynomial_1 = require("../../math/polynomials/polynomial");
-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 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",
-        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] + "");
-    while (propositions.length < n) {
-        (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: "=",
-    label: "Limite d'une suite polynomiale (sans F.I.)",
-    levels: ["TermSpé", "MathComp"],
-    isSingleStep: true,
-    sections: ["Limites", "Suites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomNoFILimitQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequencePolynomNoFILimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+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 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",
+        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] + "");
+    while (propositions.length < n) {
+        (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: "=",
+    label: "Limite d'une suite polynomiale (sans F.I.)",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    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,8 +1,8 @@
-import { MathExercise } from "../../exercises/exercise";
-type Identifiers = {
-    polyNumCoeffs: number[];
-    polyDenumCoeffs: number[];
-};
-export declare const sequencePolynomProductLimit: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    polyNumCoeffs: number[];
+    polyDenumCoeffs: number[];
+};
+export declare const sequencePolynomProductLimit: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=sequencePolynomProductLimit.d.ts.map

package/lib/exercises/limits/sequencePolynomProductLimit.js

@@ -1,70 +1,70 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sequencePolynomProductLimit = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-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 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 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";
-    let answer = product.getLimit(to);
-    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.toTree().toTex()})$.`,
-        keys: ["infty"],
-        answerFormat: "tex",
-        identifiers: {
-            polyDenumCoeffs: polyDenum.coefficients,
-            polyNumCoeffs: polyNum.coefficients,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, polyDenumCoeffs, polyNumCoeffs }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    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) + "");
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
-};
-exports.sequencePolynomProductLimit = {
-    id: "sequencePolynomProductLimit",
-    connector: "=",
-    label: "Limite d'un produit de suites polynomiales",
-    levels: ["TermSpé", "MathComp"],
-    isSingleStep: true,
-    sections: ["Limites", "Suites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomProductLimitQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequencePolynomProductLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+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 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 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";
+    let answer = product.getLimit(to);
+    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.toTree().toTex()})$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: {
+            polyDenumCoeffs: polyDenum.coefficients,
+            polyNumCoeffs: polyNum.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, polyDenumCoeffs, polyNumCoeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    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) + "");
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.sequencePolynomProductLimit = {
+    id: "sequencePolynomProductLimit",
+    connector: "=",
+    label: "Limite d'un produit de suites polynomiales",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    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,8 +1,8 @@
-import { MathExercise } from "../../exercises/exercise";
-type Identifiers = {
-    numCoeffs: number[];
-    denumCoeffs: number[];
-};
-export declare const sequenceRationalFracLimit: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    numCoeffs: number[];
+    denumCoeffs: number[];
+};
+export declare const sequenceRationalFracLimit: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=sequenceRationalFracLimit.d.ts.map

package/lib/exercises/limits/sequenceRationalFracLimit.js

@@ -1,100 +1,100 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sequenceRationalFracLimit = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-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 shuffle_1 = require("../../utils/shuffle");
-const getSequenceRationalFracLimitQuestion = () => {
-    const polyNum = polynomial_1.PolynomialConstructor.random(4, "n");
-    const polyDenum = polynomial_1.PolynomialConstructor.random(4, "n");
-    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
-    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
-    const to = "+\\infty";
-    let answer;
-    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";
-    }
-    else {
-        const tempPoly = new monom_1.Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1, "n");
-        answer = tempPoly.getLimit(to);
-    }
-    const question = {
-        answer,
-        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = \\dfrac{${polyNum
-            .toTree()
-            .toTex()}}{${polyDenum.toTree().toTex()}}$.`,
-        keys: ["infty"],
-        answerFormat: "tex",
-        identifiers: {
-            numCoeffs: polyNum.coefficients,
-            denumCoeffs: polyDenum.coefficients,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, numCoeffs, denumCoeffs }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const numLeadingCoeff = numCoeffs[numCoeffs.length - 1];
-    const denumLeadingCoeff = denumCoeffs[denumCoeffs.length - 1];
-    const to = "+\\infty";
-    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) + "");
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { denumCoeffs, numCoeffs }) => {
-    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("+\\infty");
-    }
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.sequenceRationalFracLimit = {
-    id: "sequenceRationalFracLimit",
-    connector: "=",
-    label: "Limite d'une suite rationnelle",
-    levels: ["TermSpé", "MathComp"],
-    isSingleStep: true,
-    sections: ["Limites", "Suites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequenceRationalFracLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+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 shuffle_1 = require("../../utils/shuffle");
+const getSequenceRationalFracLimitQuestion = () => {
+    const polyNum = polynomial_1.PolynomialConstructor.random(4, "n");
+    const polyDenum = polynomial_1.PolynomialConstructor.random(4, "n");
+    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
+    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
+    const to = "+\\infty";
+    let answer;
+    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";
+    }
+    else {
+        const tempPoly = new monom_1.Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1, "n");
+        answer = tempPoly.getLimit(to);
+    }
+    const question = {
+        answer,
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = \\dfrac{${polyNum
+            .toTree()
+            .toTex()}}{${polyDenum.toTree().toTex()}}$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: {
+            numCoeffs: polyNum.coefficients,
+            denumCoeffs: polyDenum.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, numCoeffs, denumCoeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const numLeadingCoeff = numCoeffs[numCoeffs.length - 1];
+    const denumLeadingCoeff = denumCoeffs[denumCoeffs.length - 1];
+    const to = "+\\infty";
+    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) + "");
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { denumCoeffs, numCoeffs }) => {
+    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("+\\infty");
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.sequenceRationalFracLimit = {
+    id: "sequenceRationalFracLimit",
+    connector: "=",
+    label: "Limite d'une suite rationnelle",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites", "Suites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -1,9 +1,4 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-    coeffs: number[];
-};
-type VEAProps = {};
-export declare const sequenceSimpleElementsSumLimit: MathExercise<QCMProps, VEAProps>;
-export {};
+import { MathExercise, Question } from '../../exercises/exercise';
+export declare const sequenceSimpleElementsSumLimit: MathExercise;
+export declare function getSequencePolynomLimitQuestion(): Question;
 //# sourceMappingURL=sequenceSimpleElementsSumLimit.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"sequenceSimpleElementsSumLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceSimpleElementsSumLimit.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;AAiCnB,eAAO,MAAM,8BAA8B,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW3E,CAAC"}
+{"version":3,"file":"sequenceSimpleElementsSumLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceSimpleElementsSumLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAQlG,eAAO,MAAM,8BAA8B,EAAE,YAW5C,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAkD1D"}

package/lib/exercises/limits/sequenceSimpleElementsSumLimit.js

@@ -1,39 +1,16 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.sequenceSimpleElementsSumLimit = void 0;
+exports.getSequencePolynomLimitQuestion = exports.sequenceSimpleElementsSumLimit = void 0;
 const exercise_1 = require("../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
 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 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 },
-    };
-    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] + '');
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + '');
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
+const uuid_1 = require("uuid");
 exports.sequenceSimpleElementsSumLimit = {
     id: 'sequenceSimpleElementsSumLimit',
     connector: '=',
+    instruction: '',
     label: "Limite d'une suite de sommes",
     levels: ['TermSpé', 'MathComp'],
     isSingleStep: true,
@@ -41,5 +18,48 @@ exports.sequenceSimpleElementsSumLimit = {
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomLimitQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
-    getPropositions,
 };
+function getSequencePolynomLimitQuestion() {
+    const poly = polynomial_1.PolynomialConstructor.random(4, 'n');
+    const to = '+\\infty';
+    const answer = poly.getLimit(to);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, '+\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '-\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '0');
+        (0, exercise_1.tryToAddWrongProp)(res, poly.coefficients[poly.degree] + '');
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, randint_1.randint)(-10, 10) + '';
+                proposition = {
+                    id: (0, uuid_1.v4)() + ``,
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answer,
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly.toTree().toTex()}$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequencePolynomLimitQuestion = getSequencePolynomLimitQuestion;

package/lib/exercises/percent/applyPercent.d.ts

@@ -1,9 +1,9 @@
-import { MathExercise } from "../exercise";
-type Identifiers = {
-    randNbr: number;
-    randPercent: number;
-    isUp: boolean;
-};
-export declare const applyPercent: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../exercise";
+type Identifiers = {
+    randNbr: number;
+    randPercent: number;
+    isUp: boolean;
+};
+export declare const applyPercent: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=applyPercent.d.ts.map