math-exercises 2.0.44 → 2.1.0

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

@@ -0,0 +1,102 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.rationalFracLimit = 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 coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getSequenceRationalFracLimitQuestion = () => {
+    const polyNum = polynomial_1.PolynomialConstructor.randomWithLength(4, (0, randint_1.randint)(2, 5));
+    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";
+    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);
+        answer = tempPoly.getLimit(to);
+    }
+    const question = {
+        answer,
+        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",
+        identifiers: {
+            numCoeffs: polyNum.coefficients,
+            denumCoeffs: polyDenum.coefficients,
+            limitTo: to,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, denumCoeffs, numCoeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    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) + "");
+    }
+    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: "=",
+    label: "Limite d'une fraction rationnelle",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceGeometricLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequenceGeometricLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAIlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA6CF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAcxD,CAAC"}

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

@@ -0,0 +1,52 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequenceGeometricLimit = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const geometricSequence_1 = require("../../../math/sequences/geometricSequence");
+const getSequenceGeometricLimitQuestion = () => {
+    const sequence = geometricSequence_1.GeometricSequenceConstructor.randomWithLimit();
+    const answer = sequence.getLimit();
+    if (!answer)
+        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",
+        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 + "");
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.sequenceGeometricLimit = {
+    id: "sequenceGeometricLimit",
+    connector: "=",
+    label: "Limite d'une suite géométrique",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites", "Suites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceGeometricLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

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

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

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

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

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

@@ -0,0 +1,53 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequencePolynomLimit = 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",
+        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) {
+        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: "=",
+    label: "Limite d'une suite polynomiale",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites", "Suites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

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

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

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

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

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

@@ -0,0 +1,53 @@
+"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,
+    subject: "Mathématiques",
+};

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,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,QAAQ,CAAC,WAAW,CAc7D,CAAC"}

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

@@ -0,0 +1,71 @@
+"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,
+    subject: "Mathématiques",
+};

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,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,QAAQ,CAAC,WAAW,CAc3D,CAAC"}

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

@@ -0,0 +1,101 @@
+"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,
+    subject: "Mathématiques",
+};

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

@@ -0,0 +1,3 @@
+export * from "./matrixInversibilityDomain";
+export * from "./productCell";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,eAAe,CAAC"}

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

@@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./matrixInversibilityDomain"), exports);
+__exportStar(require("./productCell"), exports);
+// export * from "./matrixGeneralTerm";

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

@@ -0,0 +1,10 @@
+import { Exercise } from "../../../exercises/exercise";
+type Identifiers = {
+    n: number;
+    p: number;
+    alpha: number;
+    beta: number;
+};
+export declare const matrixGeneralTerm: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=matrixGeneralTerm.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"matrixGeneralTerm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixGeneralTerm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AASlC,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,CAcnD,CAAC"}

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

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.matrixGeneralTerm = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const matrix_1 = require("../../../math/matrices/matrix");
+const randint_1 = require("../../../math/utils/random/randint");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const doWhile_1 = require("../../../utils/doWhile");
+//A d'ordre nxp avec a_(i,j) = alpha*i + beta*j
+const getMatrixGeneralTermQuestion = () => {
+    const n = (0, randint_1.randint)(1, 5);
+    const p = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(1, 5), (res) => n === 1 && res === 1);
+    const alpha = (0, randint_1.randint)(-5, 6, [0]);
+    const beta = (0, randint_1.randint)(-5, 6, [0]);
+    const aij = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(alpha.toTree(), new variableNode_1.VariableNode("i")), new multiplyNode_1.MultiplyNode(beta.toTree(), new variableNode_1.VariableNode("j"))).simplify();
+    const elements = Array.from(Array(n), (_, rowIndex) => Array.from(Array(p), (__, colIndex) => (alpha * (rowIndex + 1) + beta * (colIndex + 1)).toTree()));
+    const matrix = new matrix_1.Matrix(elements);
+    const answer = matrix.toTex();
+    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$ ? `,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { n, p, alpha, beta },
+    };
+    return question;
+};
+const getPropositions = (nb, { answer, n, p, alpha, beta }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const transposedElements = Array.from(Array(p), (_, rowIndex) => Array.from(Array(n), (__, colIndex) => (alpha * (rowIndex + 1) + beta * (colIndex + 1)).toTree()));
+    const matrix = new matrix_1.Matrix(transposedElements);
+    (0, exercise_1.tryToAddWrongProp)(propositions, matrix.toTex());
+    while (propositions.length < nb) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, matrix_1.MatrixConstructor.random(n, p).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, nb);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.matrixGeneralTerm = {
+    id: "matrixGeneralTerm",
+    label: "Déterminer l'expression d'une matrice",
+    levels: ["MathExp"],
+    isSingleStep: true,
+    sections: ["Matrices"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMatrixGeneralTermQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    answerType: "QCM",
+    subject: "Mathématiques",
+};

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

@@ -0,0 +1,10 @@
+import { Exercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: string;
+    b: string;
+    c: string;
+    d: string;
+};
+export declare const matrixInversibilityDomain: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=matrixInversibilityDomain.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"matrixInversibilityDomain.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/matrices/matrixInversibilityDomain.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAyBlC,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;AA0FF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}