math-exercises 2.0.44 → 2.1.1

package/lib/exercises/math/geometry/vectors/scalarProductViaCos.d.ts

@@ -0,0 +1,9 @@
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {
+    AB: number;
+    AC: number;
+    trigoPoint: string;
+};
+export declare const scalarProductViaCos: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=scalarProductViaCos.d.ts.map

package/lib/exercises/math/geometry/vectors/scalarProductViaCos.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scalarProductViaCos.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/vectors/scalarProductViaCos.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAyDF,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,WAAW,CAcrD,CAAC"}

package/lib/exercises/math/geometry/vectors/scalarProductViaCos.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.scalarProductViaCos = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const remarkableValue_1 = require("../../../../math/trigonometry/remarkableValue");
+const remarkableValues_1 = require("../../../../math/trigonometry/remarkableValues");
+const randint_1 = require("../../../../math/utils/random/randint");
+const numberNode_1 = require("../../../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../../../tree/nodes/operators/multiplyNode");
+const randomLetter_1 = require("../../../../utils/randomLetter");
+const shuffle_1 = require("../../../../utils/shuffle");
+//|u| |v| cos(u,v)
+const getScalarProductViaCosQuestion = () => {
+    const AB = (0, randint_1.randint)(1, 10);
+    const AC = (0, randint_1.randint)(1, 10);
+    const trigo = remarkableValue_1.RemarkableValueConstructor.mainInterval();
+    const answer = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(AB * AC), trigo.cos)
+        .simplify()
+        .toTex();
+    const letters = [];
+    for (let i = 0; i < 3; i++) {
+        letters.push((0, randomLetter_1.randomLetter)(true, letters));
+    }
+    letters.sort((a, b) => a.localeCompare(b));
+    const [letterA, letterB, letterC] = letters;
+    const question = {
+        answer,
+        instruction: `Soient trois points $${letterA}$, $${letterB}$ et $${letterC}$ tels que $${letterA}${letterB} = ${AB}$, $${letterA}${letterC}= ${AC}$, et $\\widehat{${letterB}${letterA}${letterC}} = ${trigo.angle.toTex()}$. Calculer $\\overrightarrow{${letterA}${letterB}}\\cdot \\overrightarrow{${letterA}${letterC}}$.`,
+        keys: ["pi"],
+        answerFormat: "tex",
+        identifiers: { AB, AC, trigoPoint: trigo.point },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, AB, AC, trigoPoint }) => {
+    const propositions = [];
+    const trigo = remarkableValues_1.remarkableTrigoValues.find((v) => v.point === trigoPoint);
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(AB * AC), trigo.sin).simplify().toTex());
+    const coeff = new numberNode_1.NumberNode(AB * AC);
+    while (propositions.length < n) {
+        const trigoValue = remarkableValue_1.RemarkableValueConstructor.mainInterval();
+        (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(coeff, trigoValue.sin).simplify().toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { AB, AC, trigoPoint }) => {
+    const trigo = remarkableValues_1.remarkableTrigoValues.find((v) => v.point === trigoPoint);
+    const tree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(AB * AC), trigo.cos).simplify();
+    const texs = tree.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.scalarProductViaCos = {
+    id: "scalarProductViaCos",
+    connector: "=",
+    label: "Calculer un produit scalaire (formule avec $cos$)",
+    levels: ["1reSpé"],
+    isSingleStep: true,
+    sections: ["Vecteurs", "Produit scalaire"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getScalarProductViaCosQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/geometry/vectors/vectorCoordinatesFromTwoPoints.d.ts

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

package/lib/exercises/math/geometry/vectors/vectorCoordinatesFromTwoPoints.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectorCoordinatesFromTwoPoints.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/vectors/vectorCoordinatesFromTwoPoints.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAKlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,CAAC,EAAE,MAAM,EAAE,CAAC;CACb,CAAC;AAyDF,eAAO,MAAM,8BAA8B,EAAE,QAAQ,CAAC,WAAW,CAchE,CAAC"}

package/lib/exercises/math/geometry/vectors/vectorCoordinatesFromTwoPoints.js

@@ -0,0 +1,53 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.vectorCoordinatesFromTwoPoints = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../../math/utils/random/randint");
+const randomLetter_1 = require("../../../../utils/randomLetter");
+const getVectorCoordinatesFromTwoPointsQuestion = () => {
+    const A = [(0, randint_1.randint)(-9, 9), (0, randint_1.randint)(-9, 9)];
+    const B = [(0, randint_1.randint)(-9, 9), (0, randint_1.randint)(-9, 9)];
+    const startLetter = (0, randomLetter_1.randomLetter)(true);
+    let endLetter = "";
+    do {
+        endLetter = (0, randomLetter_1.randomLetter)(true);
+    } while (endLetter === startLetter);
+    const answer = `\\left(${B[0] - A[0]};${B[1] - A[1]}\\right)`;
+    const question = {
+        answer,
+        instruction: `Soit $${startLetter}\\left(${A[0]};${A[1]}\\right)$ et $${endLetter}\\left(${B[0]};${B[1]}\\right)$. Quelles sont les coordonnées du vecteur $\\overrightarrow{${startLetter}${endLetter}}$ ?`,
+        keys: ["semicolon"],
+        answerFormat: "tex",
+        identifiers: { A, B },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, A, B }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `\\left(${A[0] - B[0]};${A[1] - B[1]}\\right)`);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `\\left(${A[1] - A[0]};${B[1] - B[0]}\\right)`);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `\\left(${B[1] - B[0]};${A[1] - A[0]}\\right)`);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `\\left(${(0, randint_1.randint)(-10, 10)};${(0, randint_1.randint)(-10, 10)}\\right)`);
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return [ans, ans.replace(",", ";"), "\\left(" + ans + "\\right)"].includes(answer);
+};
+exports.vectorCoordinatesFromTwoPoints = {
+    id: "vectorCoordinatesFromTwoPoints",
+    connector: "=",
+    label: "Déterminer les coordonnées d'un vecteur à partir de deux points",
+    levels: ["2nde"],
+    isSingleStep: true,
+    sections: ["Vecteurs"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getVectorCoordinatesFromTwoPointsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

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

@@ -0,0 +1,20 @@
+export * from "./calcul";
+export * from "./calculLitteral";
+export * from "./combinatory";
+export * from "./complex";
+export * from "./conversion";
+export * from "./derivation";
+export * from "./equaDiff";
+export * from "./functions";
+export * from "./geometry";
+export * from "./limits";
+export * from "./matrices";
+export * from "./percent";
+export * from "./powers";
+export * from "./primitive";
+export * from "./probaStat";
+export * from "./sequences";
+export * from "./sets";
+export * from "./squareRoots";
+export * from "./trigonometry";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/math/index.ts"],"names":[],"mappings":"AAAA,cAAc,UAAU,CAAC;AACzB,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC;AAC1B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,UAAU,CAAC;AACzB,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,UAAU,CAAC;AACzB,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,QAAQ,CAAC;AACvB,cAAc,eAAe,CAAC;AAC9B,cAAc,gBAAgB,CAAC"}

package/lib/exercises/math/index.js

@@ -0,0 +1,35 @@
+"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("./calcul"), exports);
+__exportStar(require("./calculLitteral"), exports);
+__exportStar(require("./combinatory"), exports);
+__exportStar(require("./complex"), exports);
+__exportStar(require("./conversion"), exports);
+__exportStar(require("./derivation"), exports);
+__exportStar(require("./equaDiff"), exports);
+__exportStar(require("./functions"), exports);
+__exportStar(require("./geometry"), exports);
+__exportStar(require("./limits"), exports);
+__exportStar(require("./matrices"), exports);
+__exportStar(require("./percent"), exports);
+__exportStar(require("./powers"), exports);
+__exportStar(require("./primitive"), exports);
+__exportStar(require("./probaStat"), exports);
+__exportStar(require("./sequences"), exports);
+__exportStar(require("./sets"), exports);
+__exportStar(require("./squareRoots"), exports);
+__exportStar(require("./trigonometry"), exports);

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

@@ -0,0 +1,11 @@
+export * from "./polynomLimit";
+export * from "./polynomLimitNoFI";
+export * from "./rationalFracForbiddenValueLimit";
+export * from "./rationalFracLimit";
+export * from "./sequenceGeometricLimit";
+export * from "./sequencePolynomLimit";
+export * from "./sequencePolynomNoFILimit";
+export * from "./sequencePolynomProductLimit";
+export * from "./sequenceRationalFracLimit";
+export * from "./limitReading";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC;AAC/B,cAAc,oBAAoB,CAAC;AACnC,cAAc,mCAAmC,CAAC;AAClD,cAAc,qBAAqB,CAAC;AACpC,cAAc,0BAA0B,CAAC;AACzC,cAAc,wBAAwB,CAAC;AACvC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,gBAAgB,CAAC"}

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

@@ -0,0 +1,26 @@
+"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("./polynomLimit"), exports);
+__exportStar(require("./polynomLimitNoFI"), exports);
+__exportStar(require("./rationalFracForbiddenValueLimit"), exports);
+__exportStar(require("./rationalFracLimit"), exports);
+__exportStar(require("./sequenceGeometricLimit"), exports);
+__exportStar(require("./sequencePolynomLimit"), exports);
+__exportStar(require("./sequencePolynomNoFILimit"), exports);
+__exportStar(require("./sequencePolynomProductLimit"), exports);
+__exportStar(require("./sequenceRationalFracLimit"), exports);
+__exportStar(require("./limitReading"), exports);

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"limitReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/limitReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAyBlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IACzB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AAyGF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAc9C,CAAC"}

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

@@ -0,0 +1,121 @@
+"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 colors_1 = require("../../../geogebra/colors");
+const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
+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 commands = [`f(x) = ${fct}`, `SetColor(f, "${(0, colors_1.randomColor)()}")`];
+    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
+        isAxesRatioFixed: false,
+        isGridSimple: true,
+    });
+    const question = {
+        answer,
+        instruction: `Ci-dessous est tracée 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: ["infty"],
+        commands: ggb.commands,
+        coords: [-10, 10, -10, 10],
+        options: ggb.getOptions(),
+        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,
+    hasGeogebra: true,
+    subject: "Mathématiques",
+};

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"polynomLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/polynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAwCF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAa9C,CAAC"}

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"polynomLimitNoFI.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/polynomLimitNoFI.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AA4CF,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,CAclD,CAAC"}

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"rationalFracForbiddenValueLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/rationalFracForbiddenValueLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;IAEtB,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AAyEF,eAAO,MAAM,+BAA+B,EAAE,QAAQ,CAAC,WAAW,CAcjE,CAAC"}

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

@@ -0,0 +1,70 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.rationalFracForbiddenValueLimit = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const affine_1 = require("../../../math/polynomials/affine");
+const trinom_1 = require("../../../math/polynomials/trinom");
+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 polyNum = trinom_1.TrinomConstructor.randomFactorized(undefined, { excludes: [forbiddenValue] }, { excludes: [forbiddenValue] });
+    const numLimit = polyNum.calculate(-polyDenum.b);
+    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 question = {
+        answer,
+        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",
+        identifiers: {
+            numCoeffs: polyNum.coefficients,
+            denumCoeffs: polyDenum.coefficients,
+            isRight,
+        },
+    };
+    return question;
+};
+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, numCoeffs[numCoeffs.length - 1].toString());
+    while (propositions.length < n) {
+        (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: "=",
+    label: "Limite d'une fraction rationnelle avec valeur interdite",
+    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/rationalFracLimit.d.ts

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

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

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