math-exercises 2.0.15 → 2.0.17

package/lib/exercises/functions/absolute/absoluteValueInequations.js

@@ -1,69 +1,69 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.absoluteValueInequations = 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 inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const getAbsoluteValueInequationsQuestion = () => {
-    const poly = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10, [0]), 1]);
-    const a = (0, randint_1.randint)(1, 10);
-    //|x-b| <= a
-    const b = -poly.coefficients[0];
-    const isStrict = (0, coinFlip_1.coinFlip)();
-    const answer = isStrict ? `S=]${b - a};${b + a}[` : `S=[${b - a};${b + a}]`;
-    const question = {
-        answer,
-        instruction: `Résoudre l'inéquation $|${poly.toTree().toTex()}|${isStrict ? "<" : "\\le"}${a}$.`,
-        keys: [
-            "S",
-            "equal",
-            "lbracket",
-            "semicolon",
-            "rbracket",
-            "emptyset",
-            "x",
-            "leq",
-            "geq",
-            "sup",
-            "inf",
-        ],
-        answerFormat: "tex",
-        identifiers: { a, b, isStrict },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, a, b }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=]${b - a};${b + a}[`);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=[${b - a};${b + a}]`);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{${b - a};${b + a}\\right\\}`);
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, `S=[${(0, randint_1.randint)(-9, 0)};${(0, randint_1.randint)(0, 10)}]`);
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { a, b, isStrict }) => {
-    const answer = new inequationSolutionNode_1.InequationSolutionNode(new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(b - a), new numberNode_1.NumberNode(b + a), isStrict ? intervalNode_1.ClosureType.OO : intervalNode_1.ClosureType.FF));
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.absoluteValueInequations = {
-    id: "absoluteValueInequations",
-    connector: "\\iff",
-    label: "Résoudre une inéquation avec valeur absolue",
-    levels: ["2nde", "1reESM"],
-    isSingleStep: true,
-    sections: ["Valeur absolue", "Inéquations", "Ensembles et intervalles"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAbsoluteValueInequationsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.absoluteValueInequations = 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 inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const getAbsoluteValueInequationsQuestion = () => {
+    const poly = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10, [0]), 1]);
+    const a = (0, randint_1.randint)(1, 10);
+    //|x-b| <= a
+    const b = -poly.coefficients[0];
+    const isStrict = (0, coinFlip_1.coinFlip)();
+    const answer = isStrict ? `S=]${b - a};${b + a}[` : `S=[${b - a};${b + a}]`;
+    const question = {
+        answer,
+        instruction: `Résoudre l'inéquation $|${poly.toTree().toTex()}|${isStrict ? "<" : "\\le"}${a}$.`,
+        keys: [
+            "S",
+            "equal",
+            "lbracket",
+            "semicolon",
+            "rbracket",
+            "emptyset",
+            "x",
+            "leq",
+            "geq",
+            "sup",
+            "inf",
+        ],
+        answerFormat: "tex",
+        identifiers: { a, b, isStrict },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=]${b - a};${b + a}[`);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=[${b - a};${b + a}]`);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{${b - a};${b + a}\\right\\}`);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=[${(0, randint_1.randint)(-9, 0)};${(0, randint_1.randint)(0, 10)}]`);
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { a, b, isStrict }) => {
+    const answer = new inequationSolutionNode_1.InequationSolutionNode(new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(b - a), new numberNode_1.NumberNode(b + a), isStrict ? intervalNode_1.ClosureType.OO : intervalNode_1.ClosureType.FF));
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.absoluteValueInequations = {
+    id: "absoluteValueInequations",
+    connector: "\\iff",
+    label: "Résoudre une inéquation avec valeur absolue",
+    levels: ["2nde", "1reESM"],
+    isSingleStep: true,
+    sections: ["Valeur absolue", "Inéquations", "Ensembles et intervalles"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAbsoluteValueInequationsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/absolute/index.d.ts

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

package/lib/exercises/functions/absolute/index.js

@@ -1,18 +1,18 @@
-"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("./absoluteValueEquations"), exports);
-__exportStar(require("./absoluteValueInequations"), exports);
+"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("./absoluteValueEquations"), exports);
+__exportStar(require("./absoluteValueInequations"), exports);

package/lib/exercises/functions/affines/affineExpressionReading.d.ts

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

package/lib/exercises/functions/affines/affineExpressionReading.js

@@ -1,94 +1,94 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.affineExpressionReading = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-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 getAffineExpressionReadingQuestion = () => {
-    const b = (0, randint_1.randint)(-5, 6);
-    const secondPoint = [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6)];
-    const leadingCoeff = new rational_1.Rational(secondPoint[1] - b, secondPoint[0])
-        .simplify()
-        .toTree();
-    const answer = new equalNode_1.EqualNode(new variableNode_1.VariableNode("f(x)"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(leadingCoeff, new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(b)).simplify({ forceDistributeFractions: true, forbidFactorize: true })).toTex();
-    let xMin = Math.min(0, secondPoint[0]);
-    if (xMin > 0)
-        xMin = -0.5;
-    let xMax = Math.max(0, secondPoint[0]);
-    if (xMax < 0)
-        xMax = 0.5;
-    let yMin = Math.min(b, secondPoint[1]);
-    if (yMin > 0)
-        yMin = -0.5;
-    let yMax = Math.max(b, secondPoint[1]);
-    if (yMax < 0)
-        yMax = 0.5;
-    const coords = [xMin - 1, xMax + 1, yMin - 1, yMax + 1];
-    const question = {
-        answer,
-        instruction: `Ci-dessous est tracée la courbe représentative d'une fonction affine $f$. Déterminer graphiquement l'expression algébrique de $f(x)$.`,
-        keys: ["fx", "equal"],
-        commands: [`Line((0, ${b}), (${secondPoint[0]}, ${secondPoint[1]}))`],
-        coords,
-        answerFormat: "tex",
-        identifiers: { b, secondPoint },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, b, secondPoint }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const wrongAs = [];
-    if (secondPoint[1] - b !== 0)
-        wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] - b).simplify().toTree());
-    if (secondPoint[0] !== 0)
-        wrongAs.push(new rational_1.Rational(secondPoint[1] + b, secondPoint[0]).simplify().toTree());
-    if (secondPoint[1] + b !== 0)
-        wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] + b).simplify().toTree());
-    if (b !== 0)
-        wrongAs.push(new rational_1.Rational(secondPoint[1] - secondPoint[0], b).simplify().toTree());
-    const fx = new variableNode_1.VariableNode("f(x)");
-    const x = new variableNode_1.VariableNode("x");
-    wrongAs.forEach((coeff) => {
-        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(fx, new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(coeff, x), new numberNode_1.NumberNode(b)).simplify({
-            forceDistributeFractions: true,
-            forbidFactorize: true,
-        })).toTex());
-    });
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(fx, affine_1.AffineConstructor.random().toTree()).toTex());
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { answer, secondPoint, b }) => {
-    const leadingCoeff = new rational_1.Rational(secondPoint[1] - b, secondPoint[0])
-        .simplify()
-        .toTree();
-    const tree = new equalNode_1.EqualNode(new variableNode_1.VariableNode("f(x)"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(leadingCoeff, new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(b)).simplify({ forceDistributeFractions: true, forbidFactorize: true }), {
-        allowFractionToDecimal: true,
-        allowMinusAnywhereInFraction: true,
-        allowRawRightChildAsSolution: true,
-    });
-    const texs = tree.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.affineExpressionReading = {
-    id: "affineExpressionReading",
-    connector: "=",
-    label: "Lire graphiquement l'expression d'une fonction affine",
-    levels: ["2nde", "1reESM", "1rePro", "1reSpé", "1reTech"],
-    isSingleStep: true,
-    sections: ["Droites", "Fonctions affines"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAffineExpressionReadingQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.affineExpressionReading = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+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 getAffineExpressionReadingQuestion = () => {
+    const b = (0, randint_1.randint)(-5, 6);
+    const secondPoint = [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6)];
+    const leadingCoeff = new rational_1.Rational(secondPoint[1] - b, secondPoint[0])
+        .simplify()
+        .toTree();
+    const answer = new equalNode_1.EqualNode(new variableNode_1.VariableNode("f(x)"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(leadingCoeff, new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(b)).simplify({ forceDistributeFractions: true, forbidFactorize: true })).toTex();
+    let xMin = Math.min(0, secondPoint[0]);
+    if (xMin > 0)
+        xMin = -0.5;
+    let xMax = Math.max(0, secondPoint[0]);
+    if (xMax < 0)
+        xMax = 0.5;
+    let yMin = Math.min(b, secondPoint[1]);
+    if (yMin > 0)
+        yMin = -0.5;
+    let yMax = Math.max(b, secondPoint[1]);
+    if (yMax < 0)
+        yMax = 0.5;
+    const coords = [xMin - 1, xMax + 1, yMin - 1, yMax + 1];
+    const question = {
+        answer,
+        instruction: `Ci-dessous est tracée la courbe représentative d'une fonction affine $f$. Déterminer graphiquement l'expression algébrique de $f(x)$.`,
+        keys: ["fx", "equal"],
+        commands: [`Line((0, ${b}), (${secondPoint[0]}, ${secondPoint[1]}))`],
+        coords,
+        answerFormat: "tex",
+        identifiers: { b, secondPoint },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, b, secondPoint }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const wrongAs = [];
+    if (secondPoint[1] - b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] - b).simplify().toTree());
+    if (secondPoint[0] !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[1] + b, secondPoint[0]).simplify().toTree());
+    if (secondPoint[1] + b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] + b).simplify().toTree());
+    if (b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[1] - secondPoint[0], b).simplify().toTree());
+    const fx = new variableNode_1.VariableNode("f(x)");
+    const x = new variableNode_1.VariableNode("x");
+    wrongAs.forEach((coeff) => {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(fx, new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(coeff, x), new numberNode_1.NumberNode(b)).simplify({
+            forceDistributeFractions: true,
+            forbidFactorize: true,
+        })).toTex());
+    });
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(fx, affine_1.AffineConstructor.random().toTree()).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, secondPoint, b }) => {
+    const leadingCoeff = new rational_1.Rational(secondPoint[1] - b, secondPoint[0])
+        .simplify()
+        .toTree();
+    const tree = new equalNode_1.EqualNode(new variableNode_1.VariableNode("f(x)"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(leadingCoeff, new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(b)).simplify({ forceDistributeFractions: true, forbidFactorize: true }), {
+        allowFractionToDecimal: true,
+        allowMinusAnywhereInFraction: true,
+        allowRawRightChildAsSolution: true,
+    });
+    const texs = tree.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.affineExpressionReading = {
+    id: "affineExpressionReading",
+    connector: "=",
+    label: "Lire graphiquement l'expression d'une fonction affine",
+    levels: ["2nde", "1reESM", "1rePro", "1reSpé", "1reTech"],
+    isSingleStep: true,
+    sections: ["Droites", "Fonctions affines"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAffineExpressionReadingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/affines/index.d.ts

@@ -1,6 +1,6 @@
-export * from "./leadingCoefficient";
-export * from "./leadingCoefficientCalculV1";
-export * from "./leadingCoefficientCalculV2";
-export * from "./signFunction";
-export * from "./affineExpressionReading";
+export * from "./leadingCoefficient";
+export * from "./leadingCoefficientCalculV1";
+export * from "./leadingCoefficientCalculV2";
+export * from "./signFunction";
+export * from "./affineExpressionReading";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/affines/index.js

@@ -1,21 +1,21 @@
-"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("./leadingCoefficient"), exports);
-__exportStar(require("./leadingCoefficientCalculV1"), exports);
-__exportStar(require("./leadingCoefficientCalculV2"), exports);
-__exportStar(require("./signFunction"), exports);
-__exportStar(require("./affineExpressionReading"), exports);
+"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("./leadingCoefficient"), exports);
+__exportStar(require("./leadingCoefficientCalculV1"), exports);
+__exportStar(require("./leadingCoefficientCalculV2"), exports);
+__exportStar(require("./signFunction"), exports);
+__exportStar(require("./affineExpressionReading"), exports);

package/lib/exercises/functions/affines/leadingCoefficient.d.ts

@@ -1,10 +1,10 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    xA: number;
-    yA: number;
-    xB: number;
-    yB: number;
-};
-export declare const leadingCoefficient: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    xA: number;
+    yA: number;
+    xB: number;
+    yB: number;
+};
+export declare const leadingCoefficient: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=leadingCoefficient.d.ts.map

package/lib/exercises/functions/affines/leadingCoefficient.js

@@ -1,87 +1,87 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.leadingCoefficient = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const integer_1 = require("../../../math/numbers/integer/integer");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const randint_1 = require("../../../math/utils/random/randint");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const getLeadingCoefficientQuestion = () => {
-    let xA, yA, xB, yB;
-    [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-5, 6));
-    xB = xA > 0 ? (0, randint_1.randint)(xA - 4, 6, [xA]) : (0, randint_1.randint)(-4, xA + 5, [xA]); // l'écart entre les deux points ne soit pas grand
-    yB = yA > 0 ? (0, randint_1.randint)(yA - 4, 6) : (0, randint_1.randint)(-4, yA + 5);
-    const a = new rational_1.Rational(yB - yA, xB - xA).simplify();
-    const b = a.opposite().multiply(new integer_1.Integer(xA)).add(new integer_1.Integer(yA));
-    const aTree = a.toTree();
-    const bTree = b.toTree();
-    const aString = aTree.toMathString();
-    const bString = bTree.toMathString();
-    const aValue = a.value;
-    const bValue = b.value;
-    let xmin, xmax, ymin, ymax;
-    if (bValue > 0) {
-        ymax = bValue + 1;
-        ymin = -1;
-    }
-    else {
-        ymin = bValue - 1;
-        ymax = 1;
-    }
-    if (aValue === 0) {
-        xmax = 5;
-        xmin = -5;
-    }
-    else if (-bValue / aValue > 0) {
-        xmax = -bValue / aValue + 1;
-        xmin = -1;
-    }
-    else {
-        xmin = -bValue / aValue - 1;
-        xmax = 1;
-    }
-    const answer = aTree.toTex();
-    const question = {
-        instruction: "Déterminer le coefficient directeur de la droite représentée ci-dessous : ",
-        answer,
-        keys: [],
-        commands: [`f(x) = (${aString}) * x + (${bString})`],
-        coords: [xmin, xmax, ymin, ymax],
-        answerFormat: "tex",
-        identifiers: { xA, xB, yA, yB },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    if (yB - yA !== 0)
-        (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(xB - xA, yB - yA).simplify().toTree().toTex());
-    while (propositions.length < n) {
-        const wrongAnswer = new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0]));
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
-    const leadingCoeff = new rational_1.Rational(yB - yA, xB - xA)
-        .simplify()
-        .toTree({ allowFractionToDecimal: true });
-    const texs = leadingCoeff.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.leadingCoefficient = {
-    id: "leadingCoefficient",
-    connector: "=",
-    label: "Lire le coefficient directeur",
-    levels: ["3ème", "2nde", "1reESM", "2ndPro", "1rePro", "1reTech"],
-    isSingleStep: false,
-    sections: ["Droites", "Fonctions affines"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.leadingCoefficient = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const integer_1 = require("../../../math/numbers/integer/integer");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getLeadingCoefficientQuestion = () => {
+    let xA, yA, xB, yB;
+    [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-5, 6));
+    xB = xA > 0 ? (0, randint_1.randint)(xA - 4, 6, [xA]) : (0, randint_1.randint)(-4, xA + 5, [xA]); // l'écart entre les deux points ne soit pas grand
+    yB = yA > 0 ? (0, randint_1.randint)(yA - 4, 6) : (0, randint_1.randint)(-4, yA + 5);
+    const a = new rational_1.Rational(yB - yA, xB - xA).simplify();
+    const b = a.opposite().multiply(new integer_1.Integer(xA)).add(new integer_1.Integer(yA));
+    const aTree = a.toTree();
+    const bTree = b.toTree();
+    const aString = aTree.toMathString();
+    const bString = bTree.toMathString();
+    const aValue = a.value;
+    const bValue = b.value;
+    let xmin, xmax, ymin, ymax;
+    if (bValue > 0) {
+        ymax = bValue + 1;
+        ymin = -1;
+    }
+    else {
+        ymin = bValue - 1;
+        ymax = 1;
+    }
+    if (aValue === 0) {
+        xmax = 5;
+        xmin = -5;
+    }
+    else if (-bValue / aValue > 0) {
+        xmax = -bValue / aValue + 1;
+        xmin = -1;
+    }
+    else {
+        xmin = -bValue / aValue - 1;
+        xmax = 1;
+    }
+    const answer = aTree.toTex();
+    const question = {
+        instruction: "Déterminer le coefficient directeur de la droite représentée ci-dessous : ",
+        answer,
+        keys: [],
+        commands: [`f(x) = (${aString}) * x + (${bString})`],
+        coords: [xmin, xmax, ymin, ymax],
+        answerFormat: "tex",
+        identifiers: { xA, xB, yA, yB },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    if (yB - yA !== 0)
+        (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(xB - xA, yB - yA).simplify().toTree().toTex());
+    while (propositions.length < n) {
+        const wrongAnswer = new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0]));
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
+    const leadingCoeff = new rational_1.Rational(yB - yA, xB - xA)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    const texs = leadingCoeff.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.leadingCoefficient = {
+    id: "leadingCoefficient",
+    connector: "=",
+    label: "Lire le coefficient directeur",
+    levels: ["3ème", "2nde", "1reESM", "2ndPro", "1rePro", "1reTech"],
+    isSingleStep: false,
+    sections: ["Droites", "Fonctions affines"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};