math-exercises 2.0.2 → 2.0.4

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,83 +1,83 @@
-"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 (-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"],
-    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 (-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"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

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

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

@@ -1,55 +1,55 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.leadingCoefficientCalculV1 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const randint_1 = require("../../../math/utils/random/randint");
-const shuffle_1 = require("../../../utils/shuffle");
-const getLeadingCoefficientCalculV1Question = () => {
-    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
-    const xB = (0, randint_1.randint)(-9, 10, [xA]);
-    const yB = (0, randint_1.randint)(-9, 10);
-    const answer = new rational_1.Rational(yB - yA, xB - xA).simplify().toTree().toTex();
-    const question = {
-        instruction: `Soit $f$ une fonction affine telle que $f(${xA})$ = $${yA}$ et $f(${xB})$ = $${yB}$.$\\\\$Quel est le coefficient directeur de $f$ ?`,
-        startStatement: "a",
-        answer,
-        answerFormat: "tex",
-        keys: [],
-        identifiers: { xA, xB, yA, yB },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const wrongAnswer = new rational_1.Rational(yB - yA + (0, randint_1.randint)(-3, 4, [0]), xB - xA + (0, randint_1.randint)(-3, 4, [xA - xB]))
-            .simplify()
-            .toTree()
-            .toTex();
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
-    const answer = new rational_1.Rational(yB - yA, xB - xA)
-        .simplify()
-        .toTree({ allowFractionToDecimal: true });
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.leadingCoefficientCalculV1 = {
-    id: "leadingCoefficientCalculV1",
-    connector: "=",
-    label: "Calculer le coefficient directeur d'une fonction affine",
-    levels: ["3ème", "2nde", "2ndPro", "1rePro", "1reTech"],
-    isSingleStep: true,
-    sections: ["Fonctions affines"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.leadingCoefficientCalculV1 = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const getLeadingCoefficientCalculV1Question = () => {
+    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
+    const xB = (0, randint_1.randint)(-9, 10, [xA]);
+    const yB = (0, randint_1.randint)(-9, 10);
+    const answer = new rational_1.Rational(yB - yA, xB - xA).simplify().toTree().toTex();
+    const question = {
+        instruction: `Soit $f$ une fonction affine telle que $f(${xA})$ = $${yA}$ et $f(${xB})$ = $${yB}$.$\\\\$Quel est le coefficient directeur de $f$ ?`,
+        startStatement: "a",
+        answer,
+        answerFormat: "tex",
+        keys: [],
+        identifiers: { xA, xB, yA, yB },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = new rational_1.Rational(yB - yA + (0, randint_1.randint)(-3, 4, [0]), xB - xA + (0, randint_1.randint)(-3, 4, [xA - xB]))
+            .simplify()
+            .toTree()
+            .toTex();
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
+    const answer = new rational_1.Rational(yB - yA, xB - xA)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.leadingCoefficientCalculV1 = {
+    id: "leadingCoefficientCalculV1",
+    connector: "=",
+    label: "Calculer le coefficient directeur d'une fonction affine",
+    levels: ["3ème", "2nde", "2ndPro", "1rePro", "1reTech"],
+    isSingleStep: true,
+    sections: ["Fonctions affines"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

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

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

@@ -1,54 +1,54 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.leadingCoefficientCalculV2 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const randint_1 = require("../../../math/utils/random/randint");
-const shuffle_1 = require("../../../utils/shuffle");
-const getLeadingCoefficientCalculV1Question = () => {
-    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
-    const xB = (0, randint_1.randint)(-9, 10, [xA]);
-    const yB = (0, randint_1.randint)(-9, 10);
-    const answer = new rational_1.Rational(yB - yA, xB - xA).simplify().toTree().toTex();
-    const question = {
-        instruction: `Soit $d$ une droite passant par les points $A(${xA};${yA})$ et $B(${xB};${yB})$.$\\\\$Déterminer le coefficient directeur de $d$.`,
-        answer: answer,
-        answerFormat: "tex",
-        keys: [],
-        identifiers: { xA, xB, yA, yB },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const wrongAnswer = new rational_1.Rational(yB - yA + (0, randint_1.randint)(-3, 4, [0]), xB - xA + (0, randint_1.randint)(-3, 4, [xA - xB]))
-            .simplify()
-            .toTree()
-            .toTex();
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
-    const answer = new rational_1.Rational(yB - yA, xB - xA)
-        .simplify()
-        .toTree({ allowFractionToDecimal: true });
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.leadingCoefficientCalculV2 = {
-    id: "leadingCoefficientCalculV2",
-    connector: "=",
-    label: "Coefficient directeur à l'aide de deux points",
-    levels: ["3ème", "2nde", "2ndPro", "1rePro", "1reTech"],
-    isSingleStep: false,
-    sections: ["Droites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.leadingCoefficientCalculV2 = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const getLeadingCoefficientCalculV1Question = () => {
+    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
+    const xB = (0, randint_1.randint)(-9, 10, [xA]);
+    const yB = (0, randint_1.randint)(-9, 10);
+    const answer = new rational_1.Rational(yB - yA, xB - xA).simplify().toTree().toTex();
+    const question = {
+        instruction: `Soit $d$ une droite passant par les points $A(${xA};${yA})$ et $B(${xB};${yB})$.$\\\\$Déterminer le coefficient directeur de $d$.`,
+        answer: answer,
+        answerFormat: "tex",
+        keys: [],
+        identifiers: { xA, xB, yA, yB },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = new rational_1.Rational(yB - yA + (0, randint_1.randint)(-3, 4, [0]), xB - xA + (0, randint_1.randint)(-3, 4, [xA - xB]))
+            .simplify()
+            .toTree()
+            .toTex();
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
+    const answer = new rational_1.Rational(yB - yA, xB - xA)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.leadingCoefficientCalculV2 = {
+    id: "leadingCoefficientCalculV2",
+    connector: "=",
+    label: "Coefficient directeur à l'aide de deux points",
+    levels: ["3ème", "2nde", "2ndPro", "1rePro", "1reTech"],
+    isSingleStep: false,
+    sections: ["Droites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -1,9 +1,9 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    a: number;
-    b: number;
-    askingPositive: boolean;
-};
-export declare const signFunction: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    b: number;
+    askingPositive: boolean;
+};
+export declare const signFunction: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=signFunction.d.ts.map

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

@@ -1,83 +1,83 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.signFunction = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const randint_1 = require("../../../math/utils/random/randint");
-const infiniteNode_1 = require("../../../tree/nodes/numbers/infiniteNode");
-const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const getSignFunction = () => {
-    const a = (0, randint_1.randint)(-9, 10, [0]);
-    const b = (0, randint_1.randint)(-9, 10);
-    const affine = new polynomial_1.Polynomial([b, a]);
-    let instruction = `Soit $f$ la fonction définie par : $f(x) = ${affine.toTex()}$. Sur quel intervalle $f$ est-elle `;
-    let answer = "";
-    const askingPositive = (0, coinFlip_1.coinFlip)();
-    const root = new rational_1.Rational(-b, a).simplify().toTree();
-    const toRightInfInterval = new intervalNode_1.IntervalNode(root, infiniteNode_1.PlusInfinityNode, intervalNode_1.ClosureType.FO).toTex();
-    const toLeftInfInteral = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, root, intervalNode_1.ClosureType.OF).toTex();
-    if (askingPositive) {
-        instruction += "positive ?";
-        answer = a > 0 ? toRightInfInterval : toLeftInfInteral;
-    }
-    else {
-        instruction += "négative ?";
-        answer = a > 0 ? toLeftInfInteral : toRightInfInterval;
-    }
-    const question = {
-        instruction,
-        startStatement: "S",
-        answer,
-        keys: ["S", "equal", "lbracket", "rbracket", "semicolon", "infty"],
-        answerFormat: "tex",
-        identifiers: { a, askingPositive, b },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const a = (0, randint_1.randint)(-9, 10, [0]);
-        const b = (0, randint_1.randint)(-9, 10);
-        const root = new rational_1.Rational(-b, a).simplify().toTree();
-        const leftInf = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, root, intervalNode_1.ClosureType.OF).toTex();
-        const rightInf = new intervalNode_1.IntervalNode(root, infiniteNode_1.PlusInfinityNode, intervalNode_1.ClosureType.FO).toTex();
-        const wrongAnswer = (0, coinFlip_1.coinFlip)() ? rightInf : leftInf;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, askingPositive }) => {
-    const root = new rational_1.Rational(-b, a)
-        .simplify()
-        .toTree({ allowFractionToDecimal: true });
-    const toRightInfInterval = new intervalNode_1.IntervalNode(root, infiniteNode_1.PlusInfinityNode, intervalNode_1.ClosureType.FO);
-    const toLeftInfInteral = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, root, intervalNode_1.ClosureType.OF);
-    let answer;
-    if (askingPositive) {
-        answer = a > 0 ? toRightInfInterval : toLeftInfInteral;
-    }
-    else {
-        answer = a > 0 ? toLeftInfInteral : toRightInfInterval;
-    }
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.signFunction = {
-    id: "signFunction",
-    connector: "=",
-    label: "Signe d'une fonction affine",
-    levels: ["3ème", "2nde", "2ndPro", "1rePro", "1reTech"],
-    sections: ["Fonctions affines"],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSignFunction, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.signFunction = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const polynomial_1 = require("../../../math/polynomials/polynomial");
+const randint_1 = require("../../../math/utils/random/randint");
+const infiniteNode_1 = require("../../../tree/nodes/numbers/infiniteNode");
+const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getSignFunction = () => {
+    const a = (0, randint_1.randint)(-9, 10, [0]);
+    const b = (0, randint_1.randint)(-9, 10);
+    const affine = new polynomial_1.Polynomial([b, a]);
+    let instruction = `Soit $f$ la fonction définie par : $f(x) = ${affine.toTex()}$. Sur quel intervalle $f$ est-elle `;
+    let answer = "";
+    const askingPositive = (0, coinFlip_1.coinFlip)();
+    const root = new rational_1.Rational(-b, a).simplify().toTree();
+    const toRightInfInterval = new intervalNode_1.IntervalNode(root, infiniteNode_1.PlusInfinityNode, intervalNode_1.ClosureType.FO).toTex();
+    const toLeftInfInteral = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, root, intervalNode_1.ClosureType.OF).toTex();
+    if (askingPositive) {
+        instruction += "positive ?";
+        answer = a > 0 ? toRightInfInterval : toLeftInfInteral;
+    }
+    else {
+        instruction += "négative ?";
+        answer = a > 0 ? toLeftInfInteral : toRightInfInterval;
+    }
+    const question = {
+        instruction,
+        startStatement: "S",
+        answer,
+        keys: ["S", "equal", "lbracket", "rbracket", "semicolon", "infty"],
+        answerFormat: "tex",
+        identifiers: { a, askingPositive, b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const a = (0, randint_1.randint)(-9, 10, [0]);
+        const b = (0, randint_1.randint)(-9, 10);
+        const root = new rational_1.Rational(-b, a).simplify().toTree();
+        const leftInf = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, root, intervalNode_1.ClosureType.OF).toTex();
+        const rightInf = new intervalNode_1.IntervalNode(root, infiniteNode_1.PlusInfinityNode, intervalNode_1.ClosureType.FO).toTex();
+        const wrongAnswer = (0, coinFlip_1.coinFlip)() ? rightInf : leftInf;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, askingPositive }) => {
+    const root = new rational_1.Rational(-b, a)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    const toRightInfInterval = new intervalNode_1.IntervalNode(root, infiniteNode_1.PlusInfinityNode, intervalNode_1.ClosureType.FO);
+    const toLeftInfInteral = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, root, intervalNode_1.ClosureType.OF);
+    let answer;
+    if (askingPositive) {
+        answer = a > 0 ? toRightInfInterval : toLeftInfInteral;
+    }
+    else {
+        answer = a > 0 ? toLeftInfInteral : toRightInfInterval;
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.signFunction = {
+    id: "signFunction",
+    connector: "=",
+    label: "Signe d'une fonction affine",
+    levels: ["3ème", "2nde", "2ndPro", "1rePro", "1reTech"],
+    sections: ["Fonctions affines"],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSignFunction, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};