math-exercises 2.0.11 → 2.0.13

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,
+};

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

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../../exercises/exercise';
+export declare const exo: Exercise;
+export declare function getExoQuestion(): Question;
+//# sourceMappingURL=template.d.ts.map

package/lib/exercises/functions/affines/template.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"template.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/template.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK3E,eAAO,MAAM,GAAG,EAAE,QASjB,CAAC;AAEF,wBAAgB,cAAc,IAAI,QAAQ,CAyCzC"}

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

@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getExoQuestion = exports.exo = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.exo = {
+    id: 'name',
+    connector: '',
+    instruction: '',
+    label: '',
+    levels: [],
+    isSingleStep: true,
+    sections: [],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExoQuestion, nb),
+};
+function getExoQuestion() {
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = '';
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: '',
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getExoQuestion = getExoQuestion;

package/lib/exercises/functions/basics/graphicEquation.d.ts

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

package/lib/exercises/functions/basics/graphicEquation.js

@@ -1,109 +1,109 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.graphicEquation = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
-const randint_1 = require("../../../math/utils/random/randint");
-const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const getGraphicEquationQuestion = () => {
-    let xSolutions = [];
-    const nb = (0, randint_1.randint)(2, 4);
-    // const nb = 2;
-    for (let i = 0; i < nb; i++) {
-        xSolutions.push((0, randint_1.randint)(-9, 10, xSolutions));
-    }
-    xSolutions.sort((a, b) => a - b);
-    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(xSolutions.map((sol) => new numberNode_1.NumberNode(sol)))).toTex();
-    const yValue = (0, randint_1.randint)(-5, 6);
-    const splinePoints = [];
-    let prevYWasAbove = (0, coinFlip_1.coinFlip)();
-    if ((0, coinFlip_1.coinFlip)()) {
-        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
-        prevYWasAbove = y > 0;
-        splinePoints.push([xSolutions[0] - (1 + Math.random() * 3), yValue + y]);
-    }
-    for (let i = 0; i < xSolutions.length; i++) {
-        splinePoints.push([xSolutions[i], yValue]);
-        if (i < xSolutions.length - 1) {
-            const mid = (xSolutions[i] + xSolutions[i + 1]) / 2;
-            const distance = xSolutions[i + 1] - xSolutions[i];
-            const x = mid + ((Math.random() * 2) / 5) * (distance / 2);
-            const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
-            prevYWasAbove = y > 0;
-            splinePoints.push([x, yValue + y]);
-        }
-    }
-    if ((0, coinFlip_1.coinFlip)() || splinePoints.length < 4) {
-        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
-        prevYWasAbove = y > 0;
-        splinePoints.push([
-            xSolutions[xSolutions.length - 1] + (1 + Math.random() * 3),
-            yValue + y,
-        ]);
-    }
-    const xMin = Math.min(...splinePoints.map((point) => point[0]));
-    const yMin = Math.min(...splinePoints.map((point) => point[1]));
-    const xMax = Math.max(...splinePoints.map((point) => point[0]));
-    const yMax = Math.max(...splinePoints.map((point) => point[1]));
-    const question = {
-        answer,
-        instruction: `Déterminer graphiquement les solutions de l'équation $f(x) = ${yValue}$ où $f$ est la fonction représentée ci-dessous.`,
-        keys: equationKeys_1.equationKeys,
-        answerFormat: "tex",
-        commands: [
-            `Spline(${splinePoints
-                .map((point) => `(${point[0]},${point[1]})`)
-                .join(",")})`,
-            ...splinePoints.map((point) => `(${point[0]},${point[1]})`),
-        ],
-        coords: [
-            Math.min(xMin - 1, -1),
-            Math.max(xMax + 1, 1),
-            Math.min(yMin - 1, -1),
-            Math.max(yMax + 1, 1),
-        ],
-        identifiers: { yValue, splinePoints },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\emptyset`);
-    while (propositions.length < n) {
-        const nbs = [];
-        const nbSol = (0, randint_1.randint)(2, 4);
-        for (let i = 0; i < nbSol; i++) {
-            nbs.push((0, randint_1.randint)(-9, 10, nbs));
-        }
-        nbs.sort((a, b) => a - b);
-        const sol = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(nbs.map((nb) => new numberNode_1.NumberNode(nb))));
-        (0, exercise_1.tryToAddWrongProp)(propositions, sol.toTex());
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { yValue, splinePoints }) => {
-    const xSolutions = splinePoints
-        .filter((p) => p[1] === yValue)
-        .map((p) => p[0]);
-    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(xSolutions.map((sol) => new numberNode_1.NumberNode(sol))));
-    const texs = answerTree.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.graphicEquation = {
-    id: "graphicEquation",
-    connector: "\\iff",
-    label: "Résoudre graphiquement une équation",
-    levels: ["2ndPro", "2nde", "1rePro", "1reESM", "1reTech"],
-    isSingleStep: true,
-    sections: ["Équations", "Fonctions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getGraphicEquationQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.graphicEquation = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const getGraphicEquationQuestion = () => {
+    let xSolutions = [];
+    const nb = (0, randint_1.randint)(2, 4);
+    // const nb = 2;
+    for (let i = 0; i < nb; i++) {
+        xSolutions.push((0, randint_1.randint)(-9, 10, xSolutions));
+    }
+    xSolutions.sort((a, b) => a - b);
+    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(xSolutions.map((sol) => new numberNode_1.NumberNode(sol)))).toTex();
+    const yValue = (0, randint_1.randint)(-5, 6);
+    const splinePoints = [];
+    let prevYWasAbove = (0, coinFlip_1.coinFlip)();
+    if ((0, coinFlip_1.coinFlip)()) {
+        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+        prevYWasAbove = y > 0;
+        splinePoints.push([xSolutions[0] - (1 + Math.random() * 3), yValue + y]);
+    }
+    for (let i = 0; i < xSolutions.length; i++) {
+        splinePoints.push([xSolutions[i], yValue]);
+        if (i < xSolutions.length - 1) {
+            const mid = (xSolutions[i] + xSolutions[i + 1]) / 2;
+            const distance = xSolutions[i + 1] - xSolutions[i];
+            const x = mid + ((Math.random() * 2) / 5) * (distance / 2);
+            const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+            prevYWasAbove = y > 0;
+            splinePoints.push([x, yValue + y]);
+        }
+    }
+    if ((0, coinFlip_1.coinFlip)() || splinePoints.length < 4) {
+        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+        prevYWasAbove = y > 0;
+        splinePoints.push([
+            xSolutions[xSolutions.length - 1] + (1 + Math.random() * 3),
+            yValue + y,
+        ]);
+    }
+    const xMin = Math.min(...splinePoints.map((point) => point[0]));
+    const yMin = Math.min(...splinePoints.map((point) => point[1]));
+    const xMax = Math.max(...splinePoints.map((point) => point[0]));
+    const yMax = Math.max(...splinePoints.map((point) => point[1]));
+    const question = {
+        answer,
+        instruction: `Déterminer graphiquement les solutions de l'équation $f(x) = ${yValue}$ où $f$ est la fonction représentée ci-dessous.`,
+        keys: equationKeys_1.equationKeys,
+        answerFormat: "tex",
+        commands: [
+            `Spline(${splinePoints
+                .map((point) => `(${point[0]},${point[1]})`)
+                .join(",")})`,
+            ...splinePoints.map((point) => `(${point[0]},${point[1]})`),
+        ],
+        coords: [
+            Math.min(xMin - 1, -1),
+            Math.max(xMax + 1, 1),
+            Math.min(yMin - 1, -1),
+            Math.max(yMax + 1, 1),
+        ],
+        identifiers: { yValue, splinePoints },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\emptyset`);
+    while (propositions.length < n) {
+        const nbs = [];
+        const nbSol = (0, randint_1.randint)(2, 4);
+        for (let i = 0; i < nbSol; i++) {
+            nbs.push((0, randint_1.randint)(-9, 10, nbs));
+        }
+        nbs.sort((a, b) => a - b);
+        const sol = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(nbs.map((nb) => new numberNode_1.NumberNode(nb))));
+        (0, exercise_1.tryToAddWrongProp)(propositions, sol.toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { yValue, splinePoints }) => {
+    const xSolutions = splinePoints
+        .filter((p) => p[1] === yValue)
+        .map((p) => p[0]);
+    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(xSolutions.map((sol) => new numberNode_1.NumberNode(sol))));
+    const texs = answerTree.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.graphicEquation = {
+    id: "graphicEquation",
+    connector: "\\iff",
+    label: "Résoudre graphiquement une équation",
+    levels: ["2ndPro", "2nde", "1rePro", "1reESM", "1reTech"],
+    isSingleStep: true,
+    sections: ["Équations", "Fonctions"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getGraphicEquationQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/basics/graphicInequation.d.ts

@@ -1,16 +1,16 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { ClosureType } from "../../../tree/nodes/sets/intervalNode";
-type Identifiers = {
-    yValue: number;
-    splinePoints: [number, number][];
-    isStrict: boolean;
-    isAskingSup: boolean;
-    intervals: {
-        a: number;
-        b: number;
-        closure: ClosureType;
-    }[];
-};
-export declare const graphicInequation: MathExercise<Identifiers>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+import { ClosureType } from "../../../tree/nodes/sets/intervalNode";
+type Identifiers = {
+    yValue: number;
+    splinePoints: [number, number][];
+    isStrict: boolean;
+    isAskingSup: boolean;
+    intervals: {
+        a: number;
+        b: number;
+        closure: ClosureType;
+    }[];
+};
+export declare const graphicInequation: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=graphicInequation.d.ts.map