math-exercises 2.1.21 → 2.1.23

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

@@ -1,84 +0,0 @@
-"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 closure_1 = require("../../../tree/nodes/sets/closure");
-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, closure_1.ClosureType.FO).toTex();
-    const toLeftInfInteral = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, root, closure_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, closure_1.ClosureType.OF).toTex();
-        const rightInf = new intervalNode_1.IntervalNode(root, infiniteNode_1.PlusInfinityNode, closure_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, closure_1.ClosureType.FO);
-    const toLeftInfInteral = new intervalNode_1.IntervalNode(infiniteNode_1.MinusInfinityNode, root, closure_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/basics/graphicEquation.d.ts

@@ -1,8 +0,0 @@
-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.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"graphicEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/graphicEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAelC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;CAClC,CAAC;AAkGF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAcrD,CAAC"}

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

@@ -1,113 +0,0 @@
-"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 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 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 commands = [
-        `S = Spline(${splinePoints
-            .map((point) => `(${point[0]},${point[1]})`)
-            .join(",")})`,
-        "SetFixed(S, true)",
-        `SetColor(S, "${(0, colors_1.randomColor)()}")`,
-    ];
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        isGridSimple: true,
-    });
-    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: discreteSetKeys_1.discreteSetKeys,
-        answerFormat: "tex",
-        commands: ggb.commands,
-        options: ggb.getOptions(),
-        coords: ggb.getAdaptedCoords({ xMin, xMax, yMin, yMax }),
-        identifiers: { yValue, splinePoints },
-    };
-    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, { 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,
-    hasGeogebra: true,
-};

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

@@ -1,16 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { ClosureType } from "../../../tree/nodes/sets/closure";
-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

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

@@ -1 +0,0 @@
-{"version":3,"file":"graphicInequation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/graphicInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAQlC,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAM5D,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;IACjC,QAAQ,EAAE,OAAO,CAAC;IAClB,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,WAAW,CAAA;KAAE,EAAE,CAAC;CAC7D,CAAC;AAiKF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAcvD,CAAC"}

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

@@ -1,153 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.graphicInequation = 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 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 getGraphicInequationQuestion = () => {
-    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 isAskingSup = (0, coinFlip_1.coinFlip)();
-    const isStrict = (0, coinFlip_1.coinFlip)();
-    const intervals = [];
-    const yValue = (0, randint_1.randint)(-5, 6);
-    const splinePoints = [];
-    let prevYWasAbove = (0, coinFlip_1.coinFlip)();
-    if (!isStrict || (0, coinFlip_1.coinFlip)()) {
-        //le !isStrict sert à empcher les points uniques solution
-        const x = xSolutions[0] - (0, randint_1.randint)(1, 3);
-        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
-        if ((y > 0 && isAskingSup) || (y < 0 && !isAskingSup)) {
-            intervals.push({
-                a: x,
-                b: xSolutions[0],
-                closure: isStrict ? closure_1.ClosureType.FO : closure_1.ClosureType.FF,
-            });
-        }
-        prevYWasAbove = y > 0;
-        splinePoints.push([x, 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);
-            if ((y > 0 && isAskingSup) || (y < 0 && !isAskingSup)) {
-                intervals.push({
-                    a: xSolutions[i],
-                    b: xSolutions[i + 1],
-                    closure: isStrict ? closure_1.ClosureType.OO : closure_1.ClosureType.FF,
-                });
-            }
-            prevYWasAbove = y > 0;
-            splinePoints.push([x, yValue + y]);
-        }
-    }
-    if (!isStrict || (0, coinFlip_1.coinFlip)() || splinePoints.length < 4) {
-        const x = xSolutions[xSolutions.length - 1] + (0, randint_1.randint)(1, 3);
-        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
-        if ((y > 0 && isAskingSup) || (y < 0 && !isAskingSup)) {
-            intervals.push({
-                a: xSolutions[xSolutions.length - 1],
-                b: x,
-                closure: isStrict ? closure_1.ClosureType.OF : closure_1.ClosureType.FF,
-            });
-        }
-        prevYWasAbove = y > 0;
-        splinePoints.push([x, 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 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 commands = [
-        `S =Spline(${splinePoints
-            .map((point) => `(${point[0]},${point[1]})`)
-            .join(",")})`,
-        "SetFixed(S, true)",
-        `SetColor(S, "${(0, colors_1.randomColor)()}")`,
-    ];
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        isGridSimple: true,
-    });
-    const question = {
-        answer,
-        instruction: `Déterminer graphiquement les solutions de l'inéquation $f(x)${isAskingSup ? (isStrict ? ">" : "\\geq") : isStrict ? "<" : "\\leq"}${yValue}$ où $f$ est la fonction représentée ci-dessous.`,
-        keys: [
-            "S",
-            "equal",
-            "lbracket",
-            "semicolon",
-            "rbracket",
-            "cup",
-            "lbrace",
-            "rbrace",
-            "varnothing",
-        ],
-        answerFormat: "tex",
-        commands: ggb.commands,
-        options: ggb.getOptions(),
-        coords: ggb.getAdaptedCoords({ xMin, xMax, yMin, yMax }),
-        identifiers: {
-            yValue,
-            splinePoints,
-            isAskingSup,
-            isStrict,
-            intervals,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, intervals, splinePoints, yValue }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\varnothing`);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\ ${new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(splinePoints[0][0]), new numberNode_1.NumberNode(yValue), closure_1.ClosureType.FF).toTex()}`);
-    while (propositions.length < n) {
-        const a = (0, randint_1.randint)(-9, 3);
-        const b = (0, randint_1.randint)(3, 10, [a]);
-        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\ ${new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b), closure_1.ClosureType.FF).toTex()}`);
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { 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.graphicInequation = {
-    id: "graphicInequation",
-    connector: "\\iff",
-    label: "Résoudre graphiquement une inéquation",
-    levels: ["2ndPro", "2nde", "1rePro", "1reESM", "1reTech"],
-    isSingleStep: true,
-    sections: ["Inéquations", "Fonctions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getGraphicInequationQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"imageFunction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/imageFunction.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,OAAO,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAmDF,eAAO,MAAM,aAAa,EAAE,YAAY,CAAC,WAAW,CAYnD,CAAC"}

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

@@ -1,64 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.imageFunction = 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 coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const getImageFunction = () => {
-    const rand = (0, coinFlip_1.coinFlip)();
-    const polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-5, 6, [0])]);
-    const polynome2 = new polynomial_1.Polynomial([
-        (0, randint_1.randint)(-9, 10),
-        (0, randint_1.randint)(-9, 10),
-        (0, randint_1.randint)(-4, 5, [0]),
-    ]);
-    const xValue = (0, randint_1.randint)(-9, 10);
-    const statement = rand
-        ? `Soit $f(x) = ${polynome1.toTree().toTex()}$. Calculer $f(${xValue})$.`
-        : `Soit $f(x) = ${polynome2.toTree().toTex()}$. Calculer $f(${xValue})$.`;
-    const answer = rand
-        ? polynome1.calculate(xValue) + ""
-        : polynome2.calculate(xValue) + "";
-    const question = {
-        instruction: statement,
-        startStatement: `f(${xValue})`,
-        answer: answer,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: {
-            poly1: polynome1.coefficients,
-            poly2: polynome2.coefficients,
-            rand,
-            xValue,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const wrongAnswer = Number(answer) + (0, randint_1.randint)(-10, 11, [0]);
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer + "");
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return answer === ans;
-};
-exports.imageFunction = {
-    id: "imageFunction",
-    connector: "=",
-    label: "Calcul d'image par une fonction",
-    levels: ["3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
-    sections: ["Fonctions"],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getImageFunction, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"imageFunctionGeogebra.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/imageFunctionGeogebra.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,OAAO,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AA2EF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAa3D,CAAC"}

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

@@ -1,86 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.imageFunctionGeogebra = 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 polynomial_1 = require("../../../math/polynomials/polynomial");
-const randint_1 = require("../../../math/utils/random/randint");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const getImageFunctionGeogebra = () => {
-    const rand = (0, coinFlip_1.coinFlip)();
-    const xValue = (0, randint_1.randint)(-5, 6);
-    let polynome1;
-    do {
-        polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-5, 6, [0])]);
-    } while (polynome1.calculate(xValue) > 10 ||
-        polynome1.calculate(xValue) < -10);
-    let polynome2;
-    do {
-        polynome2 = new polynomial_1.Polynomial([
-            (0, randint_1.randint)(-9, 10),
-            (0, randint_1.randint)(-9, 10),
-            (0, randint_1.randint)(-4, 5, [0]),
-        ]);
-    } while (polynome2.calculate(xValue) > 10 ||
-        polynome2.calculate(xValue) < -10);
-    const statement = `Quelle est l'image de $${xValue}$ par la fonction $f$ représentée ci dessous ?`;
-    const answer = rand
-        ? polynome1.calculate(xValue)
-        : polynome2.calculate(xValue);
-    const xMin = xValue;
-    const xMax = xValue;
-    const yMin = answer;
-    const yMax = answer;
-    const commands = [
-        `f(x) = ${rand ? polynome1.toString() : polynome2.toString()}`,
-        `SetColor(f, "${(0, colors_1.randomColor)()}")`,
-    ];
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, { isGridSimple: true });
-    const answerTex = answer + "";
-    const question = {
-        instruction: statement,
-        startStatement: `f(${xValue})`,
-        answer: answerTex,
-        keys: [],
-        commands: ggb.commands,
-        options: ggb.getOptions(),
-        coords: [-10, 10, -10, 10],
-        answerFormat: "tex",
-        identifiers: {
-            poly1: polynome1.coefficients,
-            poly2: polynome2.coefficients,
-            rand,
-            xValue,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const wrongAnswer = Number(answer) + (0, randint_1.randint)(-10, 11, [0]);
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer + "");
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
-};
-exports.imageFunctionGeogebra = {
-    id: "imageFunctionGeogebra",
-    connector: "=",
-    label: "Lecture d'une image",
-    levels: ["3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
-    sections: ["Fonctions"],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getImageFunctionGeogebra, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

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

@@ -1,9 +0,0 @@
-export * from "./imageFunction";
-export * from "./imageFunctionGeogebra";
-export * from "./inverseImageFunction";
-export * from "./inverseImageFunctionGeogebra";
-export * from "./graphicEquation";
-export * from "./graphicInequation";
-export * from "./twoFunctionsEquation";
-export * from "./twoFunctionsInequation";
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AACxC,cAAc,wBAAwB,CAAC;AACvC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,wBAAwB,CAAC;AACvC,cAAc,0BAA0B,CAAC"}

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

@@ -1,24 +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("./imageFunction"), exports);
-__exportStar(require("./imageFunctionGeogebra"), exports);
-__exportStar(require("./inverseImageFunction"), exports);
-__exportStar(require("./inverseImageFunctionGeogebra"), exports);
-__exportStar(require("./graphicEquation"), exports);
-__exportStar(require("./graphicInequation"), exports);
-__exportStar(require("./twoFunctionsEquation"), exports);
-__exportStar(require("./twoFunctionsInequation"), exports);

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"inverseImageFunction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/inverseImageFunction.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAKlC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAoCF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,WAAW,CAY1D,CAAC"}