math-exercises 2.0.2 → 2.0.3

package/lib/exercises/sequences/geometric/index.js

@@ -1,22 +1,22 @@
-"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("./geometricExplicitFormulaUsage"), exports);
-__exportStar(require("./geometricFindExplicitFormula"), exports);
-__exportStar(require("./geometricFindReason"), exports);
-__exportStar(require("./geometricFirstTermsSum"), exports);
-__exportStar(require("./geometricReasonUsage"), exports);
-__exportStar(require("./geometricRecurrenceFormulaUsage"), 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("./geometricExplicitFormulaUsage"), exports);
+__exportStar(require("./geometricFindExplicitFormula"), exports);
+__exportStar(require("./geometricFindReason"), exports);
+__exportStar(require("./geometricFirstTermsSum"), exports);
+__exportStar(require("./geometricReasonUsage"), exports);
+__exportStar(require("./geometricRecurrenceFormulaUsage"), exports);

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

@@ -1,6 +1,6 @@
-export * from "./arithmetic";
-export * from "./geometric";
-export * from "./explicitFormulaUsage";
-export * from "./genericSequenceVariations";
-export * from "./recurrenceFormulaUsage";
+export * from "./arithmetic";
+export * from "./geometric";
+export * from "./explicitFormulaUsage";
+export * from "./genericSequenceVariations";
+export * from "./recurrenceFormulaUsage";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/sequences/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("./arithmetic"), exports);
-__exportStar(require("./geometric"), exports);
-__exportStar(require("./explicitFormulaUsage"), exports);
-__exportStar(require("./genericSequenceVariations"), exports);
-__exportStar(require("./recurrenceFormulaUsage"), 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("./arithmetic"), exports);
+__exportStar(require("./geometric"), exports);
+__exportStar(require("./explicitFormulaUsage"), exports);
+__exportStar(require("./genericSequenceVariations"), exports);
+__exportStar(require("./recurrenceFormulaUsage"), exports);

package/lib/exercises/sequences/recurrenceFormulaUsage.d.ts

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

package/lib/exercises/sequences/recurrenceFormulaUsage.js

@@ -1,55 +1,55 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.recurrenceFormulaUsage = 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 getRecurrenceFormulaUsageQuestion = () => {
-    const coeffs = [(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-3, 4, [0])];
-    const u = new polynomial_1.Polynomial(coeffs, "u_n");
-    const u0 = (0, randint_1.randint)(-2, 3, [0]);
-    const rank = (0, randint_1.randint)(1, 4);
-    let currentValue = u0;
-    for (let i = 0; i < rank; i++) {
-        currentValue = u.calculate(currentValue);
-    }
-    const answer = currentValue + "";
-    const question = {
-        answer,
-        instruction: `Soit $u$ la suite définie par $u_0 = ${u0}$ et pour tout $n\\geq 1$, $u_{n+1} = ${u
-            .toTree()
-            .toTex()}$. Calculer $u_${rank}$.`,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: { rank, u0, coeffs },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, rank, u0, coeffs }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const u = new polynomial_1.Polynomial(coeffs, "u_n");
-    (0, exercise_1.tryToAddWrongProp)(propositions, u.calculate(rank) + "");
-    while (propositions.length < n) {
-        const wrongAnswer = (0, randint_1.randint)(-100, 100) + "";
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
-};
-exports.recurrenceFormulaUsage = {
-    id: "recurrenceFormulaUsage",
-    connector: "=",
-    label: "Utiliser la formule de récurrence d'une suite",
-    levels: ["1reESM", "1reSpé", "1reTech"],
-    isSingleStep: true,
-    sections: ["Suites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRecurrenceFormulaUsageQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.recurrenceFormulaUsage = 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 getRecurrenceFormulaUsageQuestion = () => {
+    const coeffs = [(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-3, 4, [0])];
+    const u = new polynomial_1.Polynomial(coeffs, "u_n");
+    const u0 = (0, randint_1.randint)(-2, 3, [0]);
+    const rank = (0, randint_1.randint)(1, 4);
+    let currentValue = u0;
+    for (let i = 0; i < rank; i++) {
+        currentValue = u.calculate(currentValue);
+    }
+    const answer = currentValue + "";
+    const question = {
+        answer,
+        instruction: `Soit $u$ la suite définie par $u_0 = ${u0}$ et pour tout $n\\geq 1$, $u_{n+1} = ${u
+            .toTree()
+            .toTex()}$. Calculer $u_${rank}$.`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { rank, u0, coeffs },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, rank, u0, coeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const u = new polynomial_1.Polynomial(coeffs, "u_n");
+    (0, exercise_1.tryToAddWrongProp)(propositions, u.calculate(rank) + "");
+    while (propositions.length < n) {
+        const wrongAnswer = (0, randint_1.randint)(-100, 100) + "";
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.recurrenceFormulaUsage = {
+    id: "recurrenceFormulaUsage",
+    connector: "=",
+    label: "Utiliser la formule de récurrence d'une suite",
+    levels: ["1reESM", "1reSpé", "1reTech"],
+    isSingleStep: true,
+    sections: ["Suites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRecurrenceFormulaUsageQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

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

package/lib/exercises/sets/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("./intervals"), exports);
-__exportStar(require("./setBelonging"), 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("./intervals"), exports);
+__exportStar(require("./setBelonging"), exports);

package/lib/exercises/sets/intervals/index.d.ts

@@ -1,4 +1,4 @@
-export * from "./inequalityToInterval";
-export * from "./intervalsIntersection";
-export * from "./intervalsUnion";
+export * from "./inequalityToInterval";
+export * from "./intervalsIntersection";
+export * from "./intervalsUnion";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/sets/intervals/index.js

@@ -1,19 +1,19 @@
-"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("./inequalityToInterval"), exports);
-__exportStar(require("./intervalsIntersection"), exports);
-__exportStar(require("./intervalsUnion"), 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("./inequalityToInterval"), exports);
+__exportStar(require("./intervalsIntersection"), exports);
+__exportStar(require("./intervalsUnion"), exports);

package/lib/exercises/sets/intervals/inequalityToInterval.d.ts

@@ -1,8 +1,8 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    isIntervalToInequality: boolean;
-    intervalTex: string;
-};
-export declare const inequalityToInterval: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    isIntervalToInequality: boolean;
+    intervalTex: string;
+};
+export declare const inequalityToInterval: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=inequalityToInterval.d.ts.map

package/lib/exercises/sets/intervals/inequalityToInterval.js

@@ -1,145 +1,145 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.inequalityToInterval = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
-const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const belongsNode_1 = require("../../../tree/nodes/sets/belongsNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const getInequalityToIntervalQuestion = () => {
-    const isIntervalToInequality = (0, coinFlip_1.coinFlip)();
-    const interval = intervals_1.IntervalConstructor.random();
-    const inequalityString = interval.toInequality();
-    const answer = isIntervalToInequality
-        ? inequalityString
-        : `x\\in${interval.toTex()}`;
-    const instruction = isIntervalToInequality
-        ? `Soit $x \\in ${interval.toTex()}$. Traduire cette appartenance en une inégalité.`
-        : `Soit $${inequalityString}$. Traduire cette inégalité en appartenance à un intervalle.`;
-    const question = {
-        answer,
-        instruction: instruction,
-        keys: [
-            "x",
-            "belongs",
-            "inf",
-            "sup",
-            "geq",
-            "leq",
-            "lbracket",
-            "rbracket",
-            "semicolon",
-            "infty",
-        ],
-        answerFormat: "tex",
-        identifiers: {
-            isIntervalToInequality: isIntervalToInequality,
-            intervalTex: interval.tex,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, isIntervalToInequality, intervalTex }) => {
-    const reverseBracket = (bracket) => {
-        return bracket === "[" ? "]" : "[";
-    };
-    const switchInclusion = (symbol) => {
-        if (symbol === "\\le")
-            return "<";
-        if (symbol === "<")
-            return "\\le";
-        if (symbol === ">")
-            return "\\ge";
-        return ">";
-    };
-    const reverseInequality = (symbol) => {
-        if (symbol === "\\le")
-            return "\\ge";
-        if (symbol === "<")
-            return ">";
-        if (symbol === ">")
-            return "<";
-        return "\\le";
-    };
-    const interval = new intervals_1.Interval(intervalTex);
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const xNode = new variableNode_1.VariableNode("x");
-    if (isIntervalToInequality) {
-        let wrongIneqs = [];
-        if (interval.min === -Infinity) {
-            wrongIneqs = [
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], switchInclusion(interval.rightInequalitySymbol)),
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(switchInclusion(interval.rightInequalitySymbol))),
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(interval.rightInequalitySymbol)),
-            ];
-        }
-        else if (interval.max === Infinity) {
-            wrongIneqs = [
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], switchInclusion(interval.leftInequalitySymbol)),
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(switchInclusion(interval.leftInequalitySymbol))),
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(interval.leftInequalitySymbol)),
-            ];
-        }
-        else {
-            wrongIneqs = [
-                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
-                    switchInclusion(interval.leftInequalitySymbol),
-                    interval.rightInequalitySymbol,
-                ]),
-                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
-                    interval.leftInequalitySymbol,
-                    switchInclusion(interval.rightInequalitySymbol),
-                ]),
-                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
-                    switchInclusion(interval.leftInequalitySymbol),
-                    switchInclusion(interval.rightInequalitySymbol),
-                ]),
-            ];
-        }
-        wrongIneqs.forEach((ineq) => {
-            (0, exercise_1.addWrongProp)(propositions, ineq.toTex());
-        });
-    }
-    else {
-        const wrongStatements = [
-            `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${interval.rightBracket}`,
-            `x\\in${interval.leftBracket}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
-            `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
-        ];
-        wrongStatements.forEach((ineq) => {
-            (0, exercise_1.addWrongProp)(propositions, ineq);
-        });
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { intervalTex, isIntervalToInequality }) => {
-    const interval = new intervals_1.Interval(intervalTex).toTree();
-    console.log(interval.toTex());
-    const inequality = interval.toInequality();
-    const answer = isIntervalToInequality
-        ? inequality
-        : new belongsNode_1.BelongsNode(new variableNode_1.VariableNode("x"), interval, {
-            allowRawRightChildAsSolution: true,
-        });
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.inequalityToInterval = {
-    id: "inequalityToInterval",
-    connector: "=",
-    label: "Traduire une inégalité en intervalle",
-    levels: ["2ndPro", "2nde", "CAP", "1reESM"],
-    isSingleStep: true,
-    sections: ["Ensembles et intervalles"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInequalityToIntervalQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.inequalityToInterval = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const intervals_1 = require("../../../math/sets/intervals/intervals");
+const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const belongsNode_1 = require("../../../tree/nodes/sets/belongsNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getInequalityToIntervalQuestion = () => {
+    const isIntervalToInequality = (0, coinFlip_1.coinFlip)();
+    const interval = intervals_1.IntervalConstructor.random();
+    const inequalityString = interval.toInequality();
+    const answer = isIntervalToInequality
+        ? inequalityString
+        : `x\\in${interval.toTex()}`;
+    const instruction = isIntervalToInequality
+        ? `Soit $x \\in ${interval.toTex()}$. Traduire cette appartenance en une inégalité.`
+        : `Soit $${inequalityString}$. Traduire cette inégalité en appartenance à un intervalle.`;
+    const question = {
+        answer,
+        instruction: instruction,
+        keys: [
+            "x",
+            "belongs",
+            "inf",
+            "sup",
+            "geq",
+            "leq",
+            "lbracket",
+            "rbracket",
+            "semicolon",
+            "infty",
+        ],
+        answerFormat: "tex",
+        identifiers: {
+            isIntervalToInequality: isIntervalToInequality,
+            intervalTex: interval.tex,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, isIntervalToInequality, intervalTex }) => {
+    const reverseBracket = (bracket) => {
+        return bracket === "[" ? "]" : "[";
+    };
+    const switchInclusion = (symbol) => {
+        if (symbol === "\\le")
+            return "<";
+        if (symbol === "<")
+            return "\\le";
+        if (symbol === ">")
+            return "\\ge";
+        return ">";
+    };
+    const reverseInequality = (symbol) => {
+        if (symbol === "\\le")
+            return "\\ge";
+        if (symbol === "<")
+            return ">";
+        if (symbol === ">")
+            return "<";
+        return "\\le";
+    };
+    const interval = new intervals_1.Interval(intervalTex);
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const xNode = new variableNode_1.VariableNode("x");
+    if (isIntervalToInequality) {
+        let wrongIneqs = [];
+        if (interval.min === -Infinity) {
+            wrongIneqs = [
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], switchInclusion(interval.rightInequalitySymbol)),
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(switchInclusion(interval.rightInequalitySymbol))),
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(interval.rightInequalitySymbol)),
+            ];
+        }
+        else if (interval.max === Infinity) {
+            wrongIneqs = [
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], switchInclusion(interval.leftInequalitySymbol)),
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(switchInclusion(interval.leftInequalitySymbol))),
+                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(interval.leftInequalitySymbol)),
+            ];
+        }
+        else {
+            wrongIneqs = [
+                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                    switchInclusion(interval.leftInequalitySymbol),
+                    interval.rightInequalitySymbol,
+                ]),
+                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                    interval.leftInequalitySymbol,
+                    switchInclusion(interval.rightInequalitySymbol),
+                ]),
+                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                    switchInclusion(interval.leftInequalitySymbol),
+                    switchInclusion(interval.rightInequalitySymbol),
+                ]),
+            ];
+        }
+        wrongIneqs.forEach((ineq) => {
+            (0, exercise_1.addWrongProp)(propositions, ineq.toTex());
+        });
+    }
+    else {
+        const wrongStatements = [
+            `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${interval.rightBracket}`,
+            `x\\in${interval.leftBracket}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
+            `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
+        ];
+        wrongStatements.forEach((ineq) => {
+            (0, exercise_1.addWrongProp)(propositions, ineq);
+        });
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { intervalTex, isIntervalToInequality }) => {
+    const interval = new intervals_1.Interval(intervalTex).toTree();
+    console.log(interval.toTex());
+    const inequality = interval.toInequality();
+    const answer = isIntervalToInequality
+        ? inequality
+        : new belongsNode_1.BelongsNode(new variableNode_1.VariableNode("x"), interval, {
+            allowRawRightChildAsSolution: true,
+        });
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.inequalityToInterval = {
+    id: "inequalityToInterval",
+    connector: "=",
+    label: "Traduire une inégalité en intervalle",
+    levels: ["2ndPro", "2nde", "CAP", "1reESM"],
+    isSingleStep: true,
+    sections: ["Ensembles et intervalles"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInequalityToIntervalQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};