math-exercises 2.1.20 → 2.1.23

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

@@ -1,140 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.inverseImageFunctionGeogebra = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const colors_1 = require("../../../geogebra/colors");
-const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
-const affine_1 = require("../../../math/polynomials/affine");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const trinom_1 = require("../../../math/polynomials/trinom");
-const randint_1 = require("../../../math/utils/random/randint");
-const round_1 = require("../../../math/utils/round");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const getInverseImageFunctionGeogebra = () => {
-    const isAffine = (0, coinFlip_1.coinFlip)();
-    const xValue = (0, randint_1.randint)(-5, 6);
-    // const yValue = randint(-5, 6);
-    let yValue;
-    let affine;
-    let trinom;
-    let answer = "";
-    let xMin = -1;
-    let xMax = 1;
-    let yMin = -1;
-    let yMax = 1;
-    let commands;
-    if (isAffine) {
-        do {
-            affine = new affine_1.Affine((0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-9, 10));
-            yValue = affine.calculate(xValue);
-        } while (Math.abs(yValue) > 10);
-        answer = xValue.toString().replace(".", ",");
-        yMin = yValue;
-        yMax = yValue;
-        xMin = xValue;
-        xMax = xValue;
-        commands = [affine.toString()];
-    }
-    else {
-        let roots;
-        yValue = (0, randint_1.randint)(-5, 6);
-        do {
-            trinom = new trinom_1.Trinom((0, randint_1.randint)(-4, 5, [0]), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10) - yValue);
-            roots = trinom.getRoots();
-        } while (roots.some((root) => Math.abs(root) > 10));
-        answer = !roots.length
-            ? "\\text{Aucun}"
-            : roots
-                .map((r) => (0, round_1.round)(r, 1).toString().replace(".", ","))
-                .join("\\text{ et }");
-        const beta = trinom.getBeta() + yValue;
-        yMin = trinom.a > 0 ? beta : roots.length ? yValue : beta - 5;
-        yMax = trinom.a < 0 ? beta : roots.length ? yValue : beta + 5;
-        xMax = roots.length ? Math.max(...roots) : -10;
-        xMin = roots.length ? Math.min(...roots) : 10;
-        commands = [
-            `f(x) = ${yValue !== 0
-                ? trinom.add(new polynomial_1.Polynomial([yValue])).toString()
-                : trinom.toString()}`,
-            `SetColor(f, "${(0, colors_1.randomColor)()}")`,
-        ];
-    }
-    const statement = `Lire graphiquement le ou les antécédents de $${yValue}$ par la fonction $f$ représentée ci dessous.`;
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        isGridSimple: true,
-    });
-    const question = {
-        instruction: statement,
-        answer,
-        keys: ["et", "aucun"],
-        commands: ggb.commands,
-        options: ggb.getOptions(),
-        coords: ggb.getAdaptedCoords({ xMin, xMax, yMin, yMax }),
-        answerFormat: "tex",
-        identifiers: {
-            xValue,
-            affineCoeffs: isAffine ? affine.coefficients : undefined,
-            trinomCoeffs: isAffine ? undefined : trinom.coefficients,
-            yValue,
-            isAffine,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, xValue, affineCoeffs, trinomCoeffs, yValue, isAffine }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, "\\text{Aucun}");
-    if (isAffine) {
-        const affine = new polynomial_1.Polynomial(affineCoeffs);
-        (0, exercise_1.tryToAddWrongProp)(propositions, affine.calculate(yValue).toString().replace(".", ","));
-    }
-    else {
-        const trinom = new polynomial_1.Polynomial(trinomCoeffs);
-        (0, exercise_1.tryToAddWrongProp)(propositions, trinom.calculate(yValue).toString().replace(".", ","));
-    }
-    while (propositions.length < n) {
-        const wrongAnswer = (0, coinFlip_1.coinFlip)()
-            ? `${(0, randint_1.randint)(-9, 10)}`
-            : `${(0, randint_1.randint)(-9, 10)}\\text{ et }${(0, randint_1.randint)(-9, 10)}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { answer, xValue, affineCoeffs, trinomCoeffs, yValue, isAffine }) => {
-    const antecedents = [];
-    if (isAffine) {
-        antecedents.push(xValue);
-    }
-    else {
-        const trinom = new polynomial_1.Polynomial(trinomCoeffs);
-        const roots = trinom.getRoots();
-        antecedents.push(...roots);
-    }
-    if (!antecedents.length)
-        return ans === `\\text{Aucun}`;
-    const studentNumbers = ans
-        .split("\\text{ et }")
-        .map((n) => Number(n.replace(",", ".")))
-        .filter((n) => !isNaN(n))
-        .sort((a, b) => a - b);
-    antecedents.sort((a, b) => a - b);
-    return (!!studentNumbers.length &&
-        studentNumbers.every((nb, index) => Math.abs(nb - antecedents[index]) < 0.2));
-};
-exports.inverseImageFunctionGeogebra = {
-    id: "inverseImageFunctionGeogebra",
-    connector: "\\iff",
-    label: "Lecture d'antécédents",
-    levels: ["3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
-    sections: ["Fonctions"],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInverseImageFunctionGeogebra, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

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

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

package/lib/exercises/functions/basics/twoFunctionsEquation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"twoFunctionsEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/twoFunctionsEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,EAAE,EAAE,CAAC;IAC1B,aAAa,EAAE,MAAM,EAAE,EAAE,CAAC;CAC3B,CAAC;AA2IF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,WAAW,CAa1D,CAAC"}

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

@@ -1,135 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.twoFunctionsEquation = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const discreteSetKeys_1 = require("../../../exercises/utils/keys/discreteSetKeys");
-const colors_1 = require("../../../geogebra/colors");
-const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
-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 random_1 = require("../../../utils/random");
-const getTwoFunctionsEquationQuestion = () => {
-    const yValue = (0, randint_1.randint)(-5, 5);
-    let xSolutions = [];
-    const nb = (0, randint_1.randint)(2, 4);
-    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 fSplinePoints = [];
-    const gSplinePoints = [];
-    let prevYWasAbove = (0, coinFlip_1.coinFlip)();
-    fSplinePoints.push([
-        xSolutions[0] - (1 + Math.random() * 3),
-        yValue + (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-    ]);
-    gSplinePoints.push([
-        xSolutions[0] - (1 + Math.random() * 3),
-        yValue - (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-    ]);
-    prevYWasAbove = !prevYWasAbove;
-    for (let i = 0; i < xSolutions.length; i++) {
-        fSplinePoints.push([xSolutions[i], yValue]);
-        gSplinePoints.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);
-            fSplinePoints.push([
-                x,
-                yValue + (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-            ]);
-            gSplinePoints.push([
-                x,
-                yValue - (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-            ]);
-            prevYWasAbove = !prevYWasAbove;
-        }
-    }
-    fSplinePoints.push([
-        xSolutions[xSolutions.length - 1] + (1 + Math.random() * 3),
-        yValue + (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-    ]);
-    gSplinePoints.push([
-        xSolutions[xSolutions.length - 1] + (1 + Math.random() * 3),
-        yValue - (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-    ]);
-    const xMin = Math.min(...[...fSplinePoints, ...gSplinePoints].map((point) => point[0]));
-    const yMin = Math.min(...[...fSplinePoints, ...gSplinePoints].map((point) => point[1]));
-    const xMax = Math.max(...[...fSplinePoints, ...gSplinePoints].map((point) => point[0]));
-    const yMax = Math.max(...[...fSplinePoints, ...gSplinePoints].map((point) => point[1]));
-    const fColor = (0, random_1.random)(colors_1.blues);
-    const gColor = (0, random_1.random)(colors_1.oranges);
-    const commands = [
-        `S = Spline(${fSplinePoints
-            .map((point) => `(${point[0]},${point[1]})`)
-            .join(",")})`,
-        "SetFixed(S, true)",
-        `SetColor(S, "${fColor}")`,
-        `SetCaption(S, "$f$")`,
-        `ShowLabel(S, true)`,
-        `T = Spline(${gSplinePoints
-            .map((point) => `(${point[0]},${point[1]})`)
-            .join(",")})`,
-        "SetFixed(T, true)",
-        `SetColor(T, "${gColor}")`,
-        `SetCaption(T, "$g$")`,
-        `ShowLabel(T, true)`,
-    ];
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        isGridSimple: true,
-    });
-    const question = {
-        answer,
-        instruction: `Déterminer graphiquement les solutions de l'équation $f(x) = g(x)$ où $f$ et $g$ sont les fonctions représentées ci-dessous.`,
-        keys: discreteSetKeys_1.discreteSetKeys,
-        answerFormat: "tex",
-        identifiers: { yValue, fSplinePoints, gSplinePoints },
-        commands: ggb.commands,
-        coords: ggb.getAdaptedCoords({ xMax, xMin, yMax, yMin }),
-        options: ggb.getOptions(),
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\varnothing`);
-    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, { answer, fSplinePoints, yValue }) => {
-    const xSolutions = fSplinePoints
-        .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.twoFunctionsEquation = {
-    id: "twoFunctionsEquation",
-    label: "Résoudre graphiquement une équation du type $f(x)=g(x)$",
-    levels: ["2nde"],
-    isSingleStep: true,
-    sections: ["Fonctions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getTwoFunctionsEquationQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

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

@@ -1,17 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { InegalitySymbols } from "../../../math/inequations/inequation";
-import { ClosureType } from "../../../tree/nodes/sets/closure";
-type Identifiers = {
-    yValue: number;
-    fSplinePoints: number[][];
-    gSplinePoints: number[][];
-    ineqSymbol: InegalitySymbols;
-    intervals: {
-        a: number;
-        b: number;
-        closure: ClosureType;
-    }[];
-};
-export declare const twoFunctionsInequation: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=twoFunctionsInequation.d.ts.map

package/lib/exercises/functions/basics/twoFunctionsInequation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"twoFunctionsInequation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/twoFunctionsInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAKlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAK3C,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAQ5D,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,EAAE,EAAE,CAAC;IAC1B,aAAa,EAAE,MAAM,EAAE,EAAE,CAAC;IAC1B,UAAU,EAAE,gBAAgB,CAAC;IAC7B,SAAS,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,WAAW,CAAA;KAAE,EAAE,CAAC;CAC7D,CAAC;AA0MF,eAAO,MAAM,sBAAsB,EAAE,YAAY,CAAC,WAAW,CAa5D,CAAC"}

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

@@ -1,181 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.twoFunctionsInequation = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const colors_1 = require("../../../geogebra/colors");
-const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
-const inequation_1 = require("../../../math/inequations/inequation");
-const randint_1 = require("../../../math/utils/random/randint");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const closure_1 = require("../../../tree/nodes/sets/closure");
-const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
-const unionIntervalNode_1 = require("../../../tree/nodes/sets/unionIntervalNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const random_1 = require("../../../utils/random");
-const getTwoFunctionsInequationQuestion = () => {
-    const ineq = inequation_1.InequationSymbolConstructor.random();
-    const yValue = (0, randint_1.randint)(-5, 5);
-    let xSolutions = [];
-    const nb = (0, randint_1.randint)(2, 4);
-    for (let i = 0; i < nb; i++) {
-        xSolutions.push((0, randint_1.randint)(-9, 10, xSolutions));
-    }
-    xSolutions.sort((a, b) => a - b);
-    const fSplinePoints = [];
-    const gSplinePoints = [];
-    let prevYWasAbove = (0, coinFlip_1.coinFlip)();
-    const intervals = [];
-    const xStart = xSolutions[0] - (0, randint_1.randint)(1, 4);
-    fSplinePoints.push([
-        xStart,
-        yValue + (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-    ]);
-    gSplinePoints.push([
-        xStart,
-        yValue - (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-    ]);
-    if ((ineq.isSup && !prevYWasAbove) || (!ineq.isSup && prevYWasAbove))
-        intervals.push({
-            a: xStart,
-            b: xSolutions[0],
-            closure: ineq.isStrict ? closure_1.ClosureType.FO : closure_1.ClosureType.FF,
-        });
-    prevYWasAbove = !prevYWasAbove;
-    for (let i = 0; i < xSolutions.length; i++) {
-        fSplinePoints.push([xSolutions[i], yValue]);
-        gSplinePoints.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);
-            if ((!prevYWasAbove && ineq.isSup) || (prevYWasAbove && !ineq.isSup)) {
-                intervals.push({
-                    a: xSolutions[i],
-                    b: xSolutions[i + 1],
-                    closure: ineq.isStrict ? closure_1.ClosureType.OO : closure_1.ClosureType.FF,
-                });
-            }
-            fSplinePoints.push([
-                x,
-                yValue + (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-            ]);
-            gSplinePoints.push([
-                x,
-                yValue - (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-            ]);
-            prevYWasAbove = !prevYWasAbove;
-        }
-    }
-    const xEnd = xSolutions[xSolutions.length - 1] + (0, randint_1.randint)(1, 4);
-    fSplinePoints.push([
-        xEnd,
-        yValue + (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-    ]);
-    gSplinePoints.push([
-        xEnd,
-        yValue - (prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3)),
-    ]);
-    if ((ineq.isSup && !prevYWasAbove) || (!ineq.isSup && prevYWasAbove))
-        intervals.push({
-            a: xSolutions[xSolutions.length - 1],
-            b: xEnd,
-            closure: ineq.isStrict ? closure_1.ClosureType.OF : closure_1.ClosureType.FF,
-        });
-    const xMin = Math.min(...[...fSplinePoints, ...gSplinePoints].map((point) => point[0]));
-    const yMin = Math.min(...[...fSplinePoints, ...gSplinePoints].map((point) => point[1]));
-    const xMax = Math.max(...[...fSplinePoints, ...gSplinePoints].map((point) => point[0]));
-    const yMax = Math.max(...[...fSplinePoints, ...gSplinePoints].map((point) => point[1]));
-    const fColor = (0, random_1.random)(colors_1.blues);
-    const gColor = (0, random_1.random)(colors_1.oranges);
-    const commands = [
-        `S = Spline(${fSplinePoints
-            .map((point) => `(${point[0]},${point[1]})`)
-            .join(",")})`,
-        "SetFixed(S, true)",
-        `SetColor(S, "${fColor}")`,
-        `SetCaption(S, "$f$")`,
-        `ShowLabel(S, true)`,
-        `T = Spline(${gSplinePoints
-            .map((point) => `(${point[0]},${point[1]})`)
-            .join(",")})`,
-        "SetFixed(T, true)",
-        `SetColor(T, "${gColor}")`,
-        `SetCaption(T, "$g$")`,
-        `ShowLabel(T, true)`,
-    ];
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        isGridSimple: true,
-    });
-    const intervalsNodes = intervals.map((i) => new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(i.a), new numberNode_1.NumberNode(i.b), i.closure));
-    const answer = intervalsNodes.length === 1
-        ? `S=\\ ${intervalsNodes[0].toTex()}`
-        : `S=\\ ${new unionIntervalNode_1.UnionIntervalNode(intervalsNodes).toTex()}`;
-    const question = {
-        answer,
-        instruction: `Déterminer graphiquement les solutions de l'inéquation $f(x) ${ineq.symbol} g(x)$ où $f$ et $g$ sont les fonctions représentées ci-dessous.`,
-        keys: [
-            "S",
-            "equal",
-            "lbracket",
-            "semicolon",
-            "rbracket",
-            "cup",
-            "lbrace",
-            "rbrace",
-            "varnothing",
-        ],
-        answerFormat: "tex",
-        identifiers: {
-            yValue,
-            fSplinePoints,
-            gSplinePoints,
-            ineqSymbol: ineq.symbol,
-            intervals,
-        },
-        commands: ggb.commands,
-        coords: ggb.getAdaptedCoords({ xMax, xMin, yMax, yMin }),
-        options: ggb.getOptions(),
-    };
-    return question;
-};
-const getPropositions = (n, { answer, intervals, fSplinePoints, ineqSymbol }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\varnothing`);
-    while (propositions.length < n) {
-        const isStrict = ineqSymbol === "<" || ineqSymbol === ">";
-        const x1 = (0, randint_1.randint)(-10, -5);
-        const x2 = (0, randint_1.randint)(x1 + 1, x1 + 5);
-        const x3 = (0, randint_1.randint)(x2 + 3, x2 + 6);
-        const x4 = (0, randint_1.randint)(x3 + 1, x3 + 3);
-        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\ ${new unionIntervalNode_1.UnionIntervalNode([
-            new intervalNode_1.IntervalNode(x1.toTree(), x2.toTree(), isStrict ? closure_1.ClosureType.FO : closure_1.ClosureType.FF),
-            new intervalNode_1.IntervalNode(x3.toTree(), x4.toTree(), isStrict ? closure_1.ClosureType.OF : closure_1.ClosureType.FF),
-        ]).toTex()}`);
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { answer, fSplinePoints, yValue, intervals }) => {
-    const intervalsNodes = intervals.map((n) => new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(n.a), new numberNode_1.NumberNode(n.b), n.closure));
-    const intervalsTree = intervalsNodes.length === 1
-        ? intervalsNodes[0]
-        : new unionIntervalNode_1.UnionIntervalNode(intervalsNodes);
-    const answerTree = new inequationSolutionNode_1.InequationSolutionNode(intervalsTree);
-    const texs = answerTree.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.twoFunctionsInequation = {
-    id: "twoFunctionsInequation",
-    label: "Résoudre graphiquement une inéquation du type $f(x)<g(x)$",
-    levels: ["2nde"],
-    isSingleStep: true,
-    sections: ["Fonctions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getTwoFunctionsInequationQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

package/lib/exercises/functions/cube/cubicEquation.d.ts

@@ -1,7 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    k: number;
-};
-export declare const cubicEquation: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=cubicEquation.d.ts.map

package/lib/exercises/functions/cube/cubicEquation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cubicEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/cube/cubicEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAuCF,eAAO,MAAM,aAAa,EAAE,YAAY,CAAC,WAAW,CAcnD,CAAC"}

package/lib/exercises/functions/cube/cubicEquation.js

@@ -1,55 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.cubicEquation = 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 shuffle_1 = require("../../../utils/shuffle");
-const getCubicEquationQuestion = () => {
-    const x = (0, randint_1.randint)(-10, 11);
-    const k = x ** 3;
-    const answer = `S=\\left\\{${x}\\right\\}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'équation suivante : $x^3 = ${k}$`,
-        keys: equationKeys_1.equationKeys,
-        answerFormat: "tex",
-        identifiers: { k },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, k }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{${k ** 3}\\right\\}`);
-    while (propositions.length < n) {
-        const wrongAnswer = (0, randint_1.randint)(-10, 11) + "";
-        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{${wrongAnswer}\\right\\}`);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { k }) => {
-    const sol = Math.cbrt(k);
-    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new numberNode_1.NumberNode(sol)]));
-    const texs = answerTree.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.cubicEquation = {
-    id: "cubicEquation",
-    connector: "\\iff",
-    label: "Résoudre une équation du type $x^3 = k$",
-    levels: ["2nde", "1reESM", "1reSpé", "1reTech"],
-    isSingleStep: true,
-    sections: ["Fonctions de référence", "Fonction cube", "Équations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCubicEquationQuestion, nb, 20),
-    isAnswerValid,
-    qcmTimer: 60,
-    freeTimer: 60,
-    maxAllowedQuestions: 20,
-    getPropositions,
-};

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

@@ -1,2 +0,0 @@
-export * from "./cubicEquation";
-//# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/cube/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/cube/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC"}

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

@@ -1,17 +0,0 @@
-"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("./cubicEquation"), exports);

package/lib/exercises/functions/exponential/expEquation.d.ts

@@ -1,9 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-/**ae^x = k */
-type Identifiers = {
-    a: number;
-    k: number;
-};
-export declare const expEquation: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=expEquation.d.ts.map

package/lib/exercises/functions/exponential/expEquation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"expEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/exponential/expEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAelC,cAAc;AACd,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAwEF,eAAO,MAAM,WAAW,EAAE,YAAY,CAAC,WAAW,CAYjD,CAAC"}