math-exercises 2.0.12 → 2.0.13

package/lib/exercises/limits/limitReading.js

@@ -1,111 +1,111 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.limitReading = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../math/utils/random/randint");
-const infiniteNode_1 = require("../../tree/nodes/numbers/infiniteNode");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-const limitNode_1 = require("../../tree/nodes/operators/limitNode");
-const substractNode_1 = require("../../tree/nodes/operators/substractNode");
-const variableNode_1 = require("../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../utils/coinFlip");
-const getLimitReadingQuestion = () => {
-    let to;
-    let from = undefined;
-    const type = (0, randint_1.randint)(1, 3);
-    let fct;
-    let answer = "";
-    let a;
-    switch (type) {
-        case 1: //a + b/(x-c)
-            a = (0, randint_1.randint)(-3, 4);
-            const b = (0, randint_1.randint)(-1, 2, [0]);
-            const c = (0, randint_1.randint)(-5, 6);
-            fct = new addNode_1.AddNode(new numberNode_1.NumberNode(a), new fractionNode_1.FractionNode(new numberNode_1.NumberNode(b), new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(c)))).toMathString();
-            if ((0, coinFlip_1.coinFlip)()) {
-                // limites en +-inf
-                answer = a + "";
-                to = (0, coinFlip_1.coinFlip)() ? infiniteNode_1.PlusInfinityNode : infiniteNode_1.MinusInfinityNode;
-            }
-            else {
-                // limite en VI
-                to = new numberNode_1.NumberNode(c);
-                if ((0, coinFlip_1.coinFlip)()) {
-                    from = "+";
-                    answer = b > 0 ? infiniteNode_1.PlusInfinityNode.toTex() : infiniteNode_1.MinusInfinityNode.toTex();
-                }
-                else {
-                    from = "-";
-                    answer = b < 0 ? infiniteNode_1.PlusInfinityNode.toTex() : infiniteNode_1.MinusInfinityNode.toTex();
-                }
-            }
-            break;
-        case 2:
-        default:
-            const aPositive = (0, coinFlip_1.coinFlip)();
-            const polyPoints = [];
-            polyPoints.push([-8, (0, randint_1.randint)(-4, 5)]);
-            polyPoints.push([
-                -4,
-                aPositive ? polyPoints[0][1] + 2 : polyPoints[0][1] - 2,
-            ]);
-            polyPoints.push([2, polyPoints[0][1]]);
-            polyPoints.push([6, polyPoints[1][1]]);
-            const pointsString = polyPoints
-                .map((point) => `(${point[0]},${point[1]})`)
-                .join(",");
-            fct = `Polynomial({${pointsString}})`;
-            const isPlusInf = (0, coinFlip_1.coinFlip)();
-            to = isPlusInf ? infiniteNode_1.PlusInfinityNode : infiniteNode_1.MinusInfinityNode;
-            answer = aPositive
-                ? isPlusInf
-                    ? infiniteNode_1.PlusInfinityNode.toTex()
-                    : infiniteNode_1.MinusInfinityNode.toTex()
-                : isPlusInf
-                    ? infiniteNode_1.MinusInfinityNode.toTex()
-                    : infiniteNode_1.PlusInfinityNode.toTex();
-            break;
-    }
-    const question = {
-        answer,
-        instruction: `Ci-dessous est tracé la courbe représentative d'une fonction $f$. Déterminer la limite: $\\displaystyle ${new limitNode_1.LimitNode(to, new variableNode_1.VariableNode("f(x)"), from).toTex()}$`,
-        keys: [],
-        commands: [fct],
-        coords: [-10, 10, -10, 10],
-        answerFormat: "tex",
-        identifiers: { type, to: to.toTex(), from, a },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, type, to, from, a }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
-    if (a !== undefined)
-        (0, exercise_1.tryToAddWrongProp)(propositions, a + "");
-    (0, exercise_1.tryToAddWrongProp)(propositions, to);
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-5, 6) + "");
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return answer === ans;
-};
-exports.limitReading = {
-    id: "limitReading",
-    connector: "=",
-    label: "Conjecturer graphiquement la limite d'une fonction",
-    levels: ["1reSpé", "TermSpé", "MathComp"],
-    isSingleStep: true,
-    sections: ["Limites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLimitReadingQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.limitReading = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+const infiniteNode_1 = require("../../tree/nodes/numbers/infiniteNode");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const limitNode_1 = require("../../tree/nodes/operators/limitNode");
+const substractNode_1 = require("../../tree/nodes/operators/substractNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../utils/coinFlip");
+const getLimitReadingQuestion = () => {
+    let to;
+    let from = undefined;
+    const type = (0, randint_1.randint)(1, 3);
+    let fct;
+    let answer = "";
+    let a;
+    switch (type) {
+        case 1: //a + b/(x-c)
+            a = (0, randint_1.randint)(-3, 4);
+            const b = (0, randint_1.randint)(-1, 2, [0]);
+            const c = (0, randint_1.randint)(-5, 6);
+            fct = new addNode_1.AddNode(new numberNode_1.NumberNode(a), new fractionNode_1.FractionNode(new numberNode_1.NumberNode(b), new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(c)))).toMathString();
+            if ((0, coinFlip_1.coinFlip)()) {
+                // limites en +-inf
+                answer = a + "";
+                to = (0, coinFlip_1.coinFlip)() ? infiniteNode_1.PlusInfinityNode : infiniteNode_1.MinusInfinityNode;
+            }
+            else {
+                // limite en VI
+                to = new numberNode_1.NumberNode(c);
+                if ((0, coinFlip_1.coinFlip)()) {
+                    from = "+";
+                    answer = b > 0 ? infiniteNode_1.PlusInfinityNode.toTex() : infiniteNode_1.MinusInfinityNode.toTex();
+                }
+                else {
+                    from = "-";
+                    answer = b < 0 ? infiniteNode_1.PlusInfinityNode.toTex() : infiniteNode_1.MinusInfinityNode.toTex();
+                }
+            }
+            break;
+        case 2:
+        default:
+            const aPositive = (0, coinFlip_1.coinFlip)();
+            const polyPoints = [];
+            polyPoints.push([-8, (0, randint_1.randint)(-4, 5)]);
+            polyPoints.push([
+                -4,
+                aPositive ? polyPoints[0][1] + 2 : polyPoints[0][1] - 2,
+            ]);
+            polyPoints.push([2, polyPoints[0][1]]);
+            polyPoints.push([6, polyPoints[1][1]]);
+            const pointsString = polyPoints
+                .map((point) => `(${point[0]},${point[1]})`)
+                .join(",");
+            fct = `Polynomial({${pointsString}})`;
+            const isPlusInf = (0, coinFlip_1.coinFlip)();
+            to = isPlusInf ? infiniteNode_1.PlusInfinityNode : infiniteNode_1.MinusInfinityNode;
+            answer = aPositive
+                ? isPlusInf
+                    ? infiniteNode_1.PlusInfinityNode.toTex()
+                    : infiniteNode_1.MinusInfinityNode.toTex()
+                : isPlusInf
+                    ? infiniteNode_1.MinusInfinityNode.toTex()
+                    : infiniteNode_1.PlusInfinityNode.toTex();
+            break;
+    }
+    const question = {
+        answer,
+        instruction: `Ci-dessous est tracé la courbe représentative d'une fonction $f$. Déterminer la limite: $\\displaystyle ${new limitNode_1.LimitNode(to, new variableNode_1.VariableNode("f(x)"), from).toTex()}$`,
+        keys: [],
+        commands: [fct],
+        coords: [-10, 10, -10, 10],
+        answerFormat: "tex",
+        identifiers: { type, to: to.toTex(), from, a },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, type, to, from, a }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    if (a !== undefined)
+        (0, exercise_1.tryToAddWrongProp)(propositions, a + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, to);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-5, 6) + "");
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return answer === ans;
+};
+exports.limitReading = {
+    id: "limitReading",
+    connector: "=",
+    label: "Conjecturer graphiquement la limite d'une fonction",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLimitReadingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -1,8 +1,8 @@
-import { MathExercise } from "../../exercises/exercise";
-type Identifiers = {
-    coeffs: number[];
-    to: string;
-};
-export declare const polynomLimit: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    coeffs: number[];
+    to: string;
+};
+export declare const polynomLimit: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=polynomLimit.d.ts.map

package/lib/exercises/limits/polynomLimit.js

@@ -1,53 +1,53 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.polynomLimit = 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 coinFlip_1 = require("../../utils/coinFlip");
-const shuffle_1 = require("../../utils/shuffle");
-const getPolynomLimitQuestion = () => {
-    const poly = polynomial_1.PolynomialConstructor.random(4);
-    const to = (0, coinFlip_1.coinFlip)() ? "+\\infty" : "-\\infty";
-    const answer = poly.getLimit(to);
-    const question = {
-        answer: answer,
-        instruction: `Déterminer la limite en $${to}$ de la fonction $f$ définie par : $f(x) = ${poly
-            .toTree()
-            .toTex()}$.`,
-        keys: ["infty"],
-        answerFormat: "tex",
-        identifiers: { coeffs: poly.coefficients, to },
-    };
-    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.polynomLimit = {
-    id: "polynomLimit",
-    connector: "=",
-    label: "Limite d'une fonction polynomiale",
-    levels: ["TermSpé", "MathComp"],
-    isSingleStep: true,
-    sections: ["Limites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPolynomLimitQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.polynomLimit = 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 coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const getPolynomLimitQuestion = () => {
+    const poly = polynomial_1.PolynomialConstructor.random(4);
+    const to = (0, coinFlip_1.coinFlip)() ? "+\\infty" : "-\\infty";
+    const answer = poly.getLimit(to);
+    const question = {
+        answer: answer,
+        instruction: `Déterminer la limite en $${to}$ de la fonction $f$ définie par : $f(x) = ${poly
+            .toTree()
+            .toTex()}$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: { coeffs: poly.coefficients, to },
+    };
+    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.polynomLimit = {
+    id: "polynomLimit",
+    connector: "=",
+    label: "Limite d'une fonction polynomiale",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPolynomLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -1,8 +1,8 @@
-import { MathExercise } from "../../exercises/exercise";
-type Identifiers = {
-    coeffs: number[];
-    to: string;
-};
-export declare const polynomLimitNoFI: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    coeffs: number[];
+    to: string;
+};
+export declare const polynomLimitNoFI: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=polynomLimitNoFI.d.ts.map

package/lib/exercises/limits/polynomLimitNoFI.js

@@ -1,53 +1,53 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.polynomLimitNoFI = 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 coinFlip_1 = require("../../utils/coinFlip");
-const shuffle_1 = require("../../utils/shuffle");
-const getSequencePolynomNoFILimitQuestion = () => {
-    const length = (0, randint_1.randint)(2, 5);
-    const to = (0, coinFlip_1.coinFlip)() ? "+\\infty" : "-\\infty";
-    const poly = polynomial_1.PolynomialConstructor.randomNoFI(4, to, length);
-    const answer = poly.getLimit(to);
-    const question = {
-        answer: answer,
-        instruction: `Déterminer la limite en $${to}$ de la fonction $f$ définie par : $f(x) = ${poly
-            .toTree()
-            .toTex()}$.`,
-        keys: ["infty"],
-        answerFormat: "tex",
-        identifiers: { coeffs: poly.coefficients, to },
-    };
-    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.polynomLimitNoFI = {
-    id: "polynomLimitNoFI",
-    connector: "=",
-    label: "Limite d'une fonction polynomiale (sans F.I.)",
-    levels: ["TermSpé", "MathComp"],
-    isSingleStep: true,
-    sections: ["Limites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomNoFILimitQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.polynomLimitNoFI = 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 coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const getSequencePolynomNoFILimitQuestion = () => {
+    const length = (0, randint_1.randint)(2, 5);
+    const to = (0, coinFlip_1.coinFlip)() ? "+\\infty" : "-\\infty";
+    const poly = polynomial_1.PolynomialConstructor.randomNoFI(4, to, length);
+    const answer = poly.getLimit(to);
+    const question = {
+        answer: answer,
+        instruction: `Déterminer la limite en $${to}$ de la fonction $f$ définie par : $f(x) = ${poly
+            .toTree()
+            .toTex()}$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: { coeffs: poly.coefficients, to },
+    };
+    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.polynomLimitNoFI = {
+    id: "polynomLimitNoFI",
+    connector: "=",
+    label: "Limite d'une fonction polynomiale (sans F.I.)",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomNoFILimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -0,0 +1,4 @@
+import { MathExercise, Question } from '../exercise';
+export declare const polynomeLimit: MathExercise;
+export declare function getApplyPercentQuestion(): Question;
+//# sourceMappingURL=polynomeLimit.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"polynomeLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/polynomeLimit.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAIlE,eAAO,MAAM,aAAa,EAAE,YAY3B,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAgIlD"}

package/lib/exercises/limits/polynomeLimit.js

@@ -0,0 +1,134 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getApplyPercentQuestion = exports.polynomeLimit = void 0;
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+exports.polynomeLimit = {
+    id: 'polynomeLimit',
+    connector: '=',
+    instruction: '',
+    label: "Calculer la limite d'une fonction polynomiale",
+    levels: ['TermSpé'],
+    sections: ['Limites'],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getApplyPercentQuestion, nb),
+    keys: ['infty'],
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getApplyPercentQuestion() {
+    const polynome1 = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(2, 6));
+    const polynome2 = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(2, 6));
+    // a_1x^n + b_2x^(n-1) + ...
+    const a1 = polynome1.coefficients[polynome1.coefficients.length - 1];
+    const a2 = polynome2.coefficients[polynome2.coefficients.length - 1];
+    const rand = (0, coinFlip_1.coinFlip)(); // polynome ou fraction
+    const randLimite = (0, coinFlip_1.coinFlip)() ? 1 : -1; // + infini ou - infini
+    let instruction = '';
+    let answer = '';
+    if (rand) {
+        instruction = `Déterminer la limite en $${randLimite > 0 ? `+` : `-`} \\infty$ de la fonction $f$ définie par : $f(x)$ = $${polynome1.toTex()}$.`;
+        answer = a1 * randLimite ** polynome1.degree > 0 ? `+\\infty` : `-\\infty`;
+    }
+    else {
+        instruction = `Déterminer la limite en $${randLimite > 0 ? `+` : `-`} \\infty$ de la fonction $f$ définie par : $f(x)$ = $${new fractionNode_1.FractionNode(polynome1.toTree(), polynome2.toTree()).toTex()}$.`;
+        if (polynome1.degree > polynome2.degree)
+            answer = a1 * randLimite > 0 ? `+\\infty` : `-\\infty`;
+        else if (polynome2.degree > polynome1.degree)
+            answer = '0';
+        else
+            answer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(a1), new numberNode_1.NumberNode(a2))).toTex();
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        let wrongAnswer = '';
+        let k = n - 1;
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        wrongAnswer = `+\\infty`;
+        if (k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        wrongAnswer = `-\\infty`;
+        if (k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        wrongAnswer = `0`;
+        if (k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(a1), new numberNode_1.NumberNode(a2))).toTex();
+        if (!rand && k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        wrongAnswer = `${a1}`;
+        if (k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        for (let i = 0; i < k; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: (0, randint_1.randint)(-9, 10) + '',
+                    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 = {
+        instruction,
+        answer,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getApplyPercentQuestion = getApplyPercentQuestion;

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

@@ -1,9 +1,9 @@
-import { MathExercise } from "../../exercises/exercise";
-type Identifiers = {
-    numCoeffs: number[];
-    denumCoeffs: number[];
-    isRight: boolean;
-};
-export declare const rationalFracForbiddenValueLimit: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    numCoeffs: number[];
+    denumCoeffs: number[];
+    isRight: boolean;
+};
+export declare const rationalFracForbiddenValueLimit: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=rationalFracForbiddenValueLimit.d.ts.map