math-exercises 2.0.2 → 2.0.4

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType1.js

@@ -1,80 +1,80 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.firstDegreeInequationsType1 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const random_1 = require("../../../utils/random");
-const shuffle_1 = require("../../../utils/shuffle");
-const getFirstDegreeInequationsQuestion = () => {
-    const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), 0);
-    const b = (0, randint_1.randint)(-10, 11);
-    const result = new rational_1.Rational(b, affine.a).simplify().toTree().toTex();
-    const ineqType = (0, random_1.random)(["\\le", "<", "\\ge", ">"]);
-    const invIneqType = ineqType === "<"
-        ? ">"
-        : ineqType === ">"
-            ? "<"
-            : ineqType === "\\le"
-                ? "\\ge"
-                : "\\le";
-    const answer = `x${affine.a > 0 ? ineqType : invIneqType}${result}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${b}$ `,
-        keys: inequationKeys_1.inequationKeys,
-        answerFormat: "tex",
-        identifiers: { a: affine.a, b, ineqType },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, a, ineqType, b }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const invIneqType = ineqType === "<"
-        ? ">"
-        : ineqType === ">"
-            ? "<"
-            : ineqType === "\\le"
-                ? "\\ge"
-                : "\\le";
-    const result = new rational_1.Rational(b, a).simplify().toTree().toTex();
-    (0, exercise_1.tryToAddWrongProp)(propositions, `x${a < 0 ? ineqType : invIneqType}${result}`);
-    while (propositions.length < n) {
-        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, ineqType }) => {
-    const trueIneqType = a < 0
-        ? (0, inequationNode_1.getInversedInequationSymbol)(ineqType)
-        : ineqType;
-    const result = new rational_1.Rational(b, a).simplify().toTree();
-    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
-    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
-        opts: { allowFractionToDecimal: true },
-    });
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.firstDegreeInequationsType1 = {
-    id: "firstDegreeInequationsType1",
-    connector: "\\iff",
-    getPropositions,
-    label: "Résoudre une inéquation du type $ax<b$",
-    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
-    isSingleStep: true,
-    sections: ["Inéquations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.firstDegreeInequationsType1 = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
+const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const random_1 = require("../../../utils/random");
+const shuffle_1 = require("../../../utils/shuffle");
+const getFirstDegreeInequationsQuestion = () => {
+    const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), 0);
+    const b = (0, randint_1.randint)(-10, 11);
+    const result = new rational_1.Rational(b, affine.a).simplify().toTree().toTex();
+    const ineqType = (0, random_1.random)(["\\le", "<", "\\ge", ">"]);
+    const invIneqType = ineqType === "<"
+        ? ">"
+        : ineqType === ">"
+            ? "<"
+            : ineqType === "\\le"
+                ? "\\ge"
+                : "\\le";
+    const answer = `x${affine.a > 0 ? ineqType : invIneqType}${result}`;
+    const question = {
+        answer: answer,
+        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${b}$ `,
+        keys: inequationKeys_1.inequationKeys,
+        answerFormat: "tex",
+        identifiers: { a: affine.a, b, ineqType },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, ineqType, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const invIneqType = ineqType === "<"
+        ? ">"
+        : ineqType === ">"
+            ? "<"
+            : ineqType === "\\le"
+                ? "\\ge"
+                : "\\le";
+    const result = new rational_1.Rational(b, a).simplify().toTree().toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, `x${a < 0 ? ineqType : invIneqType}${result}`);
+    while (propositions.length < n) {
+        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, ineqType }) => {
+    const trueIneqType = a < 0
+        ? (0, inequationNode_1.getInversedInequationSymbol)(ineqType)
+        : ineqType;
+    const result = new rational_1.Rational(b, a).simplify().toTree();
+    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
+    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
+        opts: { allowFractionToDecimal: true },
+    });
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.firstDegreeInequationsType1 = {
+    id: "firstDegreeInequationsType1",
+    connector: "\\iff",
+    getPropositions,
+    label: "Résoudre une inéquation du type $ax<b$",
+    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
+    isSingleStep: true,
+    sections: ["Inéquations"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.d.ts

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

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.js

@@ -1,83 +1,83 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.firstDegreeInequationsType2 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const random_1 = require("../../../utils/random");
-const shuffle_1 = require("../../../utils/shuffle");
-const getFirstDegreeInequationsQuestion = () => {
-    const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), (0, randint_1.randint)(-10, 10, [0]));
-    const c = (0, randint_1.randint)(-10, 11);
-    const result = new rational_1.Rational(c - affine.b, affine.a)
-        .simplify()
-        .toTree()
-        .toTex();
-    const ineqType = (0, random_1.random)(["\\le", "<", "\\ge", ">"]);
-    const invIneqType = ineqType === "<"
-        ? ">"
-        : ineqType === ">"
-            ? "<"
-            : ineqType === "\\le"
-                ? "\\ge"
-                : "\\le";
-    const answer = `x${affine.a > 0 ? ineqType : invIneqType}${result}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${c}$ `,
-        keys: inequationKeys_1.inequationKeys,
-        answerFormat: "tex",
-        identifiers: { a: affine.a, b: affine.b, c, ineqType },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, a, ineqType, b, c }) => {
-    const result = new rational_1.Rational(c - b, a).simplify().toTree().toTex();
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const invIneqType = ineqType === "<"
-        ? ">"
-        : ineqType === ">"
-            ? "<"
-            : ineqType === "\\le"
-                ? "\\ge"
-                : "\\le";
-    (0, exercise_1.tryToAddWrongProp)(propositions, `x${a < 0 ? ineqType : invIneqType}${result}`);
-    while (propositions.length < n) {
-        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, c, ineqType }) => {
-    const trueIneqType = a < 0
-        ? (0, inequationNode_1.getInversedInequationSymbol)(ineqType)
-        : ineqType;
-    const result = new rational_1.Rational(c - b, a).simplify().toTree();
-    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
-    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
-        opts: { allowFractionToDecimal: true },
-    });
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.firstDegreeInequationsType2 = {
-    id: "firstDegreeInequationsType2",
-    connector: "\\iff",
-    getPropositions,
-    isAnswerValid,
-    label: "Résoudre une inéquation du type $ax+b<c$",
-    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
-    isSingleStep: true,
-    sections: ["Inéquations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.firstDegreeInequationsType2 = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
+const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const random_1 = require("../../../utils/random");
+const shuffle_1 = require("../../../utils/shuffle");
+const getFirstDegreeInequationsQuestion = () => {
+    const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), (0, randint_1.randint)(-10, 10, [0]));
+    const c = (0, randint_1.randint)(-10, 11);
+    const result = new rational_1.Rational(c - affine.b, affine.a)
+        .simplify()
+        .toTree()
+        .toTex();
+    const ineqType = (0, random_1.random)(["\\le", "<", "\\ge", ">"]);
+    const invIneqType = ineqType === "<"
+        ? ">"
+        : ineqType === ">"
+            ? "<"
+            : ineqType === "\\le"
+                ? "\\ge"
+                : "\\le";
+    const answer = `x${affine.a > 0 ? ineqType : invIneqType}${result}`;
+    const question = {
+        answer: answer,
+        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${c}$ `,
+        keys: inequationKeys_1.inequationKeys,
+        answerFormat: "tex",
+        identifiers: { a: affine.a, b: affine.b, c, ineqType },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, ineqType, b, c }) => {
+    const result = new rational_1.Rational(c - b, a).simplify().toTree().toTex();
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const invIneqType = ineqType === "<"
+        ? ">"
+        : ineqType === ">"
+            ? "<"
+            : ineqType === "\\le"
+                ? "\\ge"
+                : "\\le";
+    (0, exercise_1.tryToAddWrongProp)(propositions, `x${a < 0 ? ineqType : invIneqType}${result}`);
+    while (propositions.length < n) {
+        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, c, ineqType }) => {
+    const trueIneqType = a < 0
+        ? (0, inequationNode_1.getInversedInequationSymbol)(ineqType)
+        : ineqType;
+    const result = new rational_1.Rational(c - b, a).simplify().toTree();
+    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
+    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
+        opts: { allowFractionToDecimal: true },
+    });
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.firstDegreeInequationsType2 = {
+    id: "firstDegreeInequationsType2",
+    connector: "\\iff",
+    getPropositions,
+    isAnswerValid,
+    label: "Résoudre une inéquation du type $ax+b<c$",
+    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
+    isSingleStep: true,
+    sections: ["Inéquations"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.d.ts

@@ -1,12 +1,12 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    coeff: number;
-    ineqType: string;
-    a: number;
-    b: number;
-    c: number;
-    d: number;
-};
-export declare const firstDegreeInequationsType3: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    coeff: number;
+    ineqType: string;
+    a: number;
+    b: number;
+    c: number;
+    d: number;
+};
+export declare const firstDegreeInequationsType3: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=firstDegreeInequationsType3.d.ts.map

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.js

@@ -1,92 +1,92 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.firstDegreeInequationsType3 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const random_1 = require("../../../utils/random");
-const shuffle_1 = require("../../../utils/shuffle");
-const getFirstDegreeInequationsQuestion = () => {
-    const affine1 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0]), (0, randint_1.randint)(-10, 10));
-    const affine2 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, affine1.a]), (0, randint_1.randint)(-10, 10));
-    const result = new rational_1.Rational(affine2.b - affine1.b, affine1.a - affine2.a)
-        .simplify()
-        .toTree()
-        .toTex();
-    const coeff = affine1.a - affine2.a;
-    const ineqType = (0, random_1.random)(["\\le", "<", "\\ge", ">"]);
-    const invIneqType = ineqType === "<"
-        ? ">"
-        : ineqType === ">"
-            ? "<"
-            : ineqType === "\\le"
-                ? "\\ge"
-                : "\\le";
-    const answer = `x${coeff > 0 ? ineqType : invIneqType}${result}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine1.toTex()} ${ineqType} ${affine2.toTex()}$ `,
-        keys: inequationKeys_1.inequationKeys,
-        answerFormat: "tex",
-        identifiers: {
-            coeff,
-            ineqType,
-            a: affine1.a,
-            b: affine1.b,
-            c: affine2.a,
-            d: affine2.b,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, coeff, ineqType, a, b, c, d }) => {
-    const result = new rational_1.Rational(d - b, a - c).simplify().toTree().toTex();
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const invIneqType = ineqType === "<"
-        ? ">"
-        : ineqType === ">"
-            ? "<"
-            : ineqType === "\\le"
-                ? "\\ge"
-                : "\\le";
-    (0, exercise_1.tryToAddWrongProp)(propositions, `x${coeff < 0 ? ineqType : invIneqType}${result}`);
-    while (propositions.length < n) {
-        const wrongAnswer = `x ${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType} ${(0, randint_1.randint)(-10, 11)}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, c, d, ineqType }) => {
-    const trueIneqType = a - c < 0
-        ? (0, inequationNode_1.getInversedInequationSymbol)(ineqType)
-        : ineqType;
-    const result = new rational_1.Rational(d - b, a - c).simplify().toTree();
-    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
-    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
-        opts: { allowFractionToDecimal: true },
-    });
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.firstDegreeInequationsType3 = {
-    id: "firstDegreeInequationsType3",
-    connector: "\\iff",
-    label: "Résoudre une inéquation du type $ax+b<cx+d$",
-    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
-    isSingleStep: true,
-    sections: ["Inéquations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.firstDegreeInequationsType3 = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
+const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const random_1 = require("../../../utils/random");
+const shuffle_1 = require("../../../utils/shuffle");
+const getFirstDegreeInequationsQuestion = () => {
+    const affine1 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0]), (0, randint_1.randint)(-10, 10));
+    const affine2 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, affine1.a]), (0, randint_1.randint)(-10, 10));
+    const result = new rational_1.Rational(affine2.b - affine1.b, affine1.a - affine2.a)
+        .simplify()
+        .toTree()
+        .toTex();
+    const coeff = affine1.a - affine2.a;
+    const ineqType = (0, random_1.random)(["\\le", "<", "\\ge", ">"]);
+    const invIneqType = ineqType === "<"
+        ? ">"
+        : ineqType === ">"
+            ? "<"
+            : ineqType === "\\le"
+                ? "\\ge"
+                : "\\le";
+    const answer = `x${coeff > 0 ? ineqType : invIneqType}${result}`;
+    const question = {
+        answer: answer,
+        instruction: `Résoudre l'inéquation : $${affine1.toTex()} ${ineqType} ${affine2.toTex()}$ `,
+        keys: inequationKeys_1.inequationKeys,
+        answerFormat: "tex",
+        identifiers: {
+            coeff,
+            ineqType,
+            a: affine1.a,
+            b: affine1.b,
+            c: affine2.a,
+            d: affine2.b,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, coeff, ineqType, a, b, c, d }) => {
+    const result = new rational_1.Rational(d - b, a - c).simplify().toTree().toTex();
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const invIneqType = ineqType === "<"
+        ? ">"
+        : ineqType === ">"
+            ? "<"
+            : ineqType === "\\le"
+                ? "\\ge"
+                : "\\le";
+    (0, exercise_1.tryToAddWrongProp)(propositions, `x${coeff < 0 ? ineqType : invIneqType}${result}`);
+    while (propositions.length < n) {
+        const wrongAnswer = `x ${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType} ${(0, randint_1.randint)(-10, 11)}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, c, d, ineqType }) => {
+    const trueIneqType = a - c < 0
+        ? (0, inequationNode_1.getInversedInequationSymbol)(ineqType)
+        : ineqType;
+    const result = new rational_1.Rational(d - b, a - c).simplify().toTree();
+    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
+    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
+        opts: { allowFractionToDecimal: true },
+    });
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.firstDegreeInequationsType3 = {
+    id: "firstDegreeInequationsType3",
+    connector: "\\iff",
+    label: "Résoudre une inéquation du type $ax+b<cx+d$",
+    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
+    isSingleStep: true,
+    sections: ["Inéquations"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/inequations/index.d.ts

@@ -1,5 +1,5 @@
-export * from "./firstDegreeInequationsType0";
-export * from "./firstDegreeInequationsType1";
-export * from "./firstDegreeInequationsType2";
-export * from "./firstDegreeInequationsType3";
+export * from "./firstDegreeInequationsType0";
+export * from "./firstDegreeInequationsType1";
+export * from "./firstDegreeInequationsType2";
+export * from "./firstDegreeInequationsType3";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/calculLitteral/inequations/index.js

@@ -1,20 +1,20 @@
-"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("./firstDegreeInequationsType0"), exports);
-__exportStar(require("./firstDegreeInequationsType1"), exports);
-__exportStar(require("./firstDegreeInequationsType2"), exports);
-__exportStar(require("./firstDegreeInequationsType3"), 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("./firstDegreeInequationsType0"), exports);
+__exportStar(require("./firstDegreeInequationsType1"), exports);
+__exportStar(require("./firstDegreeInequationsType2"), exports);
+__exportStar(require("./firstDegreeInequationsType3"), exports);

package/lib/exercises/calculLitteral/simplifying/evaluateExpression.d.ts

@@ -1,10 +1,10 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    rand: boolean;
-    poly1: number[];
-    poly2: number[];
-    xValue: number;
-};
-export declare const evaluateExpression: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    rand: boolean;
+    poly1: number[];
+    poly2: number[];
+    xValue: number;
+};
+export declare const evaluateExpression: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=evaluateExpression.d.ts.map