math-exercises 2.0.12 → 2.0.13

package/lib/exercises/geometry/cartesian/distanceBetweenTwoPoints.js

@@ -1,95 +1,95 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.distanceBetweenTwoPoints = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const point_1 = require("../../../math/geometry/point");
-const real_1 = require("../../../math/numbers/reals/real");
-const randTupleInt_1 = require("../../../math/utils/random/randTupleInt");
-const round_1 = require("../../../math/utils/round");
-const sqrtNode_1 = require("../../../tree/nodes/functions/sqrtNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const getDistanceBetweenTwoPoints = () => {
-    const [coords1, coords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, { from: -9, to: 10 });
-    let A = new point_1.Point("A", new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
-    let B = new point_1.Point("B", new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
-    const answer = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
-        .simplify()
-        .toTree()
-        .toTex();
-    const question = {
-        instruction: `Soit $${A.toTexWithCoords()}$ et $${B.toTexWithCoords()}$. Calculer la distance $AB$.`,
-        startStatement: "AB",
-        answer,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: { coords1, coords2 },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, coords1, coords2 }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const xA = new numberNode_1.NumberNode(coords1[0]);
-    const xB = new numberNode_1.NumberNode(coords1[1]);
-    const yA = new numberNode_1.NumberNode(coords2[0]);
-    const yB = new numberNode_1.NumberNode(coords2[1]);
-    let A, B;
-    A = new point_1.Point("A", xA, xB);
-    B = new point_1.Point("B", new numberNode_1.NumberNode(-coords2[0]), new numberNode_1.NumberNode(-coords2[1]));
-    let wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
-        .simplify()
-        .toTree()
-        .toTex();
-    (0, exercise_1.tryToAddWrongProp)(propositions, wrongStatement);
-    A = new point_1.Point("A", xB, xA);
-    B = new point_1.Point("B", yA, yB);
-    wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
-        .simplify()
-        .toTree()
-        .toTex();
-    (0, exercise_1.tryToAddWrongProp)(propositions, wrongStatement);
-    A = new point_1.Point("A", xA, yA);
-    B = new point_1.Point("B", xB, yB);
-    wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
-        .simplify()
-        .toTree()
-        .toTex();
-    (0, exercise_1.tryToAddWrongProp)(propositions, wrongStatement);
-    while (propositions.length < n) {
-        const [tempCoords1, tempsCoords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, {
-            from: -9,
-            to: 10,
-        });
-        const A = new point_1.Point("A", new numberNode_1.NumberNode(tempCoords1[0]), new numberNode_1.NumberNode(tempCoords1[1]));
-        const B = new point_1.Point("B", new numberNode_1.NumberNode(tempsCoords2[0]), new numberNode_1.NumberNode(tempsCoords2[1]));
-        (0, exercise_1.tryToAddWrongProp)(propositions, new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
-            .simplify()
-            .toTree()
-            .toTex());
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { coords1, coords2 }) => {
-    const A = new point_1.Point("A", new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
-    const B = new point_1.Point("B", new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
-    const answer = new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode((0, round_1.round)(A.distanceTo(B) ** 2, 0)), {
-        allowSimplifySqrt: true,
-    });
-    const texs = answer.toAllValidTexs();
-    console.log(ans, texs);
-    return texs.includes(ans);
-};
-exports.distanceBetweenTwoPoints = {
-    id: "distanceBetweenTwoPoints",
-    connector: "=",
-    label: "Distance entre deux points",
-    levels: ["2nde", "1reESM"],
-    sections: ["Géométrie cartésienne"],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDistanceBetweenTwoPoints, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.distanceBetweenTwoPoints = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const point_1 = require("../../../math/geometry/point");
+const real_1 = require("../../../math/numbers/reals/real");
+const randTupleInt_1 = require("../../../math/utils/random/randTupleInt");
+const round_1 = require("../../../math/utils/round");
+const sqrtNode_1 = require("../../../tree/nodes/functions/sqrtNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const getDistanceBetweenTwoPoints = () => {
+    const [coords1, coords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, { from: -9, to: 10 });
+    let A = new point_1.Point("A", new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
+    let B = new point_1.Point("B", new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
+    const answer = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
+        .simplify()
+        .toTree()
+        .toTex();
+    const question = {
+        instruction: `Soit $${A.toTexWithCoords()}$ et $${B.toTexWithCoords()}$. Calculer la distance $AB$.`,
+        startStatement: "AB",
+        answer,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { coords1, coords2 },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, coords1, coords2 }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const xA = new numberNode_1.NumberNode(coords1[0]);
+    const xB = new numberNode_1.NumberNode(coords1[1]);
+    const yA = new numberNode_1.NumberNode(coords2[0]);
+    const yB = new numberNode_1.NumberNode(coords2[1]);
+    let A, B;
+    A = new point_1.Point("A", xA, xB);
+    B = new point_1.Point("B", new numberNode_1.NumberNode(-coords2[0]), new numberNode_1.NumberNode(-coords2[1]));
+    let wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
+        .simplify()
+        .toTree()
+        .toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, wrongStatement);
+    A = new point_1.Point("A", xB, xA);
+    B = new point_1.Point("B", yA, yB);
+    wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
+        .simplify()
+        .toTree()
+        .toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, wrongStatement);
+    A = new point_1.Point("A", xA, yA);
+    B = new point_1.Point("B", xB, yB);
+    wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
+        .simplify()
+        .toTree()
+        .toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, wrongStatement);
+    while (propositions.length < n) {
+        const [tempCoords1, tempsCoords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, {
+            from: -9,
+            to: 10,
+        });
+        const A = new point_1.Point("A", new numberNode_1.NumberNode(tempCoords1[0]), new numberNode_1.NumberNode(tempCoords1[1]));
+        const B = new point_1.Point("B", new numberNode_1.NumberNode(tempsCoords2[0]), new numberNode_1.NumberNode(tempsCoords2[1]));
+        (0, exercise_1.tryToAddWrongProp)(propositions, new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0))
+            .simplify()
+            .toTree()
+            .toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { coords1, coords2 }) => {
+    const A = new point_1.Point("A", new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
+    const B = new point_1.Point("B", new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
+    const answer = new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode((0, round_1.round)(A.distanceTo(B) ** 2, 0)), {
+        allowSimplifySqrt: true,
+    });
+    const texs = answer.toAllValidTexs();
+    console.log(ans, texs);
+    return texs.includes(ans);
+};
+exports.distanceBetweenTwoPoints = {
+    id: "distanceBetweenTwoPoints",
+    connector: "=",
+    label: "Distance entre deux points",
+    levels: ["2nde", "1reESM"],
+    sections: ["Géométrie cartésienne"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDistanceBetweenTwoPoints, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/geometry/cartesian/imageFunction.d.ts

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

package/lib/exercises/geometry/cartesian/imageFunction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"imageFunction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/imageFunction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,gBAAgB,IAAI,QAAQ,CAqD3C"}

package/lib/exercises/geometry/cartesian/imageFunction.js

@@ -0,0 +1,65 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getImageFunction = exports.imageFunction = void 0;
+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 uuid_1 = require("uuid");
+exports.imageFunction = {
+    id: 'imageFunction',
+    connector: '=',
+    instruction: '',
+    label: "Image d'une fonction",
+    levels: ['4', '3', '2'],
+    section: 'Géométrie cartésienne',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getImageFunction, nb),
+    keys: [],
+};
+function 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 getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = answer + (0, randint_1.randint)(-10, 11, [0]);
+                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 = {
+        instruction: statement,
+        startStatement: `f(${xValue})`,
+        answer: answer + '',
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getImageFunction = getImageFunction;

package/lib/exercises/geometry/cartesian/imageFunctionGeogebra.d.ts

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

package/lib/exercises/geometry/cartesian/imageFunctionGeogebra.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"imageFunctionGeogebra.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/imageFunctionGeogebra.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAiFnD"}

package/lib/exercises/geometry/cartesian/imageFunctionGeogebra.js

@@ -0,0 +1,89 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getImageFunctionGeogebra = exports.imageFunctionGeogebra = void 0;
+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 uuid_1 = require("uuid");
+exports.imageFunctionGeogebra = {
+    id: 'imageFunctionGeogebra',
+    connector: '=',
+    instruction: '',
+    label: "Lecture d'une image",
+    levels: ['4', '3', '2'],
+    section: 'Géométrie cartésienne',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getImageFunctionGeogebra, nb),
+    keys: [],
+};
+function 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);
+    let xmin, xmax, ymin, ymax;
+    if (answer > 0) {
+        ymax = answer + 1;
+        ymin = -1;
+    }
+    else {
+        ymin = answer - 1;
+        ymax = 1;
+    }
+    if (xValue > 0) {
+        xmax = xValue + 1;
+        xmin = -1;
+    }
+    else {
+        xmin = xValue - 1;
+        xmax = 1;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = answer + (0, randint_1.randint)(-10, 11, [0]);
+                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 commands = [rand ? polynome1.toString() : polynome2.toString()];
+    const question = {
+        instruction: statement,
+        startStatement: `f(${xValue})`,
+        answer: answer + '',
+        keys: [],
+        commands,
+        coords: [xmin, xmax, ymin, ymax],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getImageFunctionGeogebra = getImageFunctionGeogebra;

package/lib/exercises/geometry/cartesian/index.d.ts

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

package/lib/exercises/geometry/cartesian/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("./distanceBetweenTwoPoints"), exports);
-__exportStar(require("./midpoint"), 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("./distanceBetweenTwoPoints"), exports);
+__exportStar(require("./midpoint"), exports);

package/lib/exercises/geometry/cartesian/inverseImageFunction.d.ts

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

package/lib/exercises/geometry/cartesian/inverseImageFunction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inverseImageFunction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/inverseImageFunction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAkDlD"}

package/lib/exercises/geometry/cartesian/inverseImageFunction.js

@@ -0,0 +1,62 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getInverseImageFunction = exports.inverseImageFunction = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../../math/polynomials/polynomial");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.inverseImageFunction = {
+    id: 'inverseImageFunction',
+    connector: '\\iff',
+    instruction: '',
+    label: 'Calculer des antécédents',
+    levels: ['4', '3', '2'],
+    section: 'Géométrie cartésienne',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInverseImageFunction, nb),
+    keys: [],
+};
+function getInverseImageFunction() {
+    const polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-5, 6, [0])]);
+    const xValue = (0, randint_1.randint)(-9, 10);
+    const answer = polynome1.calculate(xValue);
+    const statement = `Soit $f(x) = ${polynome1
+        .toTree()
+        .toTex()}$. Déterminer le ou les antécédents de $${answer}$ par $f$.`;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: xValue + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = xValue + (0, randint_1.randint)(-10, 11, [0]);
+                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 = {
+        instruction: statement,
+        startStatement: `f(x) = ${answer}`,
+        answer: xValue + '',
+        keys: ['x', 'equal'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getInverseImageFunction = getInverseImageFunction;

package/lib/exercises/geometry/cartesian/inverseImageFunctionGeogebra.d.ts

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

package/lib/exercises/geometry/cartesian/inverseImageFunctionGeogebra.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inverseImageFunctionGeogebra.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/inverseImageFunctionGeogebra.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,4BAA4B,EAAE,QAU1C,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAsJ1D"}

package/lib/exercises/geometry/cartesian/inverseImageFunctionGeogebra.js

@@ -0,0 +1,154 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getInverseImageFunctionGeogebra = exports.inverseImageFunctionGeogebra = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../../math/polynomials/polynomial");
+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 uuid_1 = require("uuid");
+exports.inverseImageFunctionGeogebra = {
+    id: 'inverseImageFunctionGeogebra',
+    connector: '\\iff',
+    instruction: '',
+    label: "Lecture d'antécédents",
+    levels: ['3', '2', '1'],
+    section: 'Fonctions',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInverseImageFunctionGeogebra, nb),
+    keys: ['S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+};
+function getInverseImageFunctionGeogebra() {
+    const rand = (0, coinFlip_1.coinFlip)();
+    const xValue = (0, randint_1.randint)(-5, 6);
+    const yValue = (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 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10) - yValue, (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-4, 5, [0])]);
+    let roots = polynome2.getRoots();
+    if (roots.length === 2)
+        while (roots[0] > 10 || roots[0] < -10 || roots[1] > 10 || roots[1] < -10) {
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10) - yValue, (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-4, 5, [0])]);
+            roots = polynome2.getRoots();
+        }
+    if (roots.length === 1)
+        while (roots[0] < -10 || roots[0] > 10) {
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10) - yValue, (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-4, 5, [0])]);
+            roots = polynome2.getRoots();
+        }
+    const statement = rand
+        ? `Déterminer le ou les antécédents de ${polynome1.calculate(xValue)}$ par la fonction $f$ représentée ci dessous.`
+        : `Déterminer le ou les antécédents de ${yValue}$ par la fonction $f$ représentée ci dessous.`;
+    const answer = rand
+        ? xValue
+        : roots.length === 2
+            ? `\\{${(0, round_1.round)(roots[0], 1)};${(0, round_1.round)(roots[1], 1)} \\}`
+            : roots.length === 1
+                ? roots[0]
+                : `\\emptyset`;
+    const optimum = polynome2.derivate().getRoots()[0];
+    let xmin = 0, xmax = 0, ymin = 0, ymax = 0;
+    if (rand) {
+        if (polynome1.calculate(xValue) > 0) {
+            ymax = polynome1.calculate(xValue) + 1;
+            ymin = -1;
+        }
+        else {
+            ymin = polynome1.calculate(xValue) - 1;
+            ymax = 1;
+        }
+        if (xValue > 0) {
+            xmax = xValue + 1;
+            xmin = -1;
+        }
+        else {
+            xmin = xValue - 1;
+            xmax = 1;
+        }
+    }
+    else {
+        console.log(optimum);
+        if (roots.length === 2) {
+            if (yValue > polynome2.calculate(optimum) + yValue) {
+                ymax = yValue + 2;
+                ymin = polynome2.calculate(optimum) + yValue - 2;
+            }
+            else {
+                ymin = yValue - 2;
+                ymax = polynome2.calculate(optimum) + yValue + 2;
+            }
+            xmax = Math.max(roots[0], roots[1]) + 1;
+            xmin = Math.min(roots[0], roots[1]) - 1;
+        }
+        if (roots.length === 1) {
+            if (yValue > 0) {
+                ymax = yValue + 5;
+                ymin = yValue - 1;
+            }
+            else {
+                ymin = yValue - 5;
+                ymax = yValue + 1;
+            }
+            xmax = optimum + 5;
+            xmin = optimum - 5;
+        }
+        if (roots.length === 0) {
+            if (yValue > polynome2.calculate(optimum) + yValue) {
+                ymax = yValue + 1;
+                ymin = polynome2.calculate(optimum) + yValue - 3;
+            }
+            else {
+                ymin = yValue - 1;
+                ymax = polynome2.calculate(optimum) + yValue + 3;
+            }
+            xmax = optimum + 5;
+            xmin = optimum - 5;
+        }
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer + '',
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, coinFlip_1.coinFlip)()
+                    ? (0, randint_1.randint)(-9, 10, [polynome1.calculate(xValue)])
+                    : roots.length === 2
+                        ? `\\{${(0, randint_1.randint)(-9, 10)};${(0, randint_1.randint)(-9, 10)} \\}`
+                        : roots.length === 1
+                            ? (0, randint_1.randint)(-9, 10, [roots[0]])
+                            : `\\emptyset`;
+                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 commands = [rand ? polynome1.toString() : polynome2.add(new polynomial_1.Polynomial([yValue])).toString()];
+    const question = {
+        instruction: statement,
+        answer: answer + '',
+        keys: ['S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        commands,
+        coords: [xmin, xmax, ymin, ymax],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getInverseImageFunctionGeogebra = getInverseImageFunctionGeogebra;

package/lib/exercises/geometry/cartesian/leadingCoefficient.d.ts

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

package/lib/exercises/geometry/cartesian/leadingCoefficient.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leadingCoefficient.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/leadingCoefficient.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY3E,eAAO,MAAM,kBAAkB,EAAE,QAShC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAiFxD"}