math-exercises 1.3.42 → 1.3.43

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

@@ -1,4 +1,4 @@
-import { Exercise, Question } from '../../../exercises/exercise';
-export declare const leadingCoefficient: Exercise;
-export declare function getLeadingCoefficientQuestion(): Question;
+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

@@ -1 +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,CA8ExD"}
+{"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"}

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

@@ -1,90 +1,93 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getLeadingCoefficientQuestion = exports.leadingCoefficient = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const droite_1 = require("../../../math/geometry/droite");
-const point_1 = require("../../../math/geometry/point");
-const randint_1 = require("../../../math/utils/random/randint");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const simplify_1 = require("../../../tree/parsers/simplify");
-const shuffle_1 = require("../../../utils/shuffle");
-const mathjs_1 = require("mathjs");
-const uuid_1 = require("uuid");
-exports.leadingCoefficient = {
-    id: 'leadingCoefficient',
-    connector: '=',
-    instruction: 'Déterminer le coefficient directeur de la droite représentée ci-dessous :',
-    label: 'Déterminer le coefficient directeur',
-    levels: ['3', '2', '1'],
-    isSingleStep: false,
-    section: 'Droites',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientQuestion, nb),
-};
-function getLeadingCoefficientQuestion() {
-    let xA, yA, xB, yB;
-    let pointA, pointB;
-    do {
-        [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-5, 6));
-        xB = xA > 0 ? (0, randint_1.randint)(xA - 4, 6) : (0, randint_1.randint)(-4, xA + 5); // l'écart entre les deux points ne soit pas grand
-        yB = yA > 0 ? (0, randint_1.randint)(yA - 4, 6) : (0, randint_1.randint)(-4, yA + 5);
-        pointA = new point_1.Point('A', new numberNode_1.NumberNode(xA), new numberNode_1.NumberNode(yA));
-        pointB = new point_1.Point('B', new numberNode_1.NumberNode(xB), new numberNode_1.NumberNode(yB));
-    } while (xB - xA === 0);
-    const droite = droite_1.DroiteConstructor.fromTwoPoints(pointA, pointB, 'D');
-    const a = droite.a.toMathString();
-    const b = droite.b.toMathString();
-    const aValue = (0, mathjs_1.evaluate)(a);
-    const bValue = (0, mathjs_1.evaluate)(b);
-    let xmin, xmax, ymin, ymax;
-    if (bValue > 0) {
-        ymax = bValue + 1;
-        ymin = -1;
-    }
-    else {
-        ymin = bValue - 1;
-        ymax = 1;
-    }
-    if (-bValue / aValue > 0) {
-        xmax = -bValue / aValue + 1;
-        xmin = -1;
-    }
-    else {
-        xmin = -bValue / aValue - 1;
-        xmax = 1;
-    }
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: droite.getLeadingCoefficient(),
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = droite.getLeadingCoefficient() !== '0'
-                    ? (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(droite.a, new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0, 1]))))
-                    : new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0]));
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer.toTex(),
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        answer: droite.getLeadingCoefficient(),
-        keys: [],
-        commands: [`f(x) = (${a}) * x + (${b})`],
-        coords: [xmin, xmax, ymin, ymax],
-        getPropositions,
-    };
-    return question;
-}
-exports.getLeadingCoefficientQuestion = getLeadingCoefficientQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLeadingCoefficientQuestion = exports.leadingCoefficient = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const droite_1 = require("../../../math/geometry/droite");
+const point_1 = require("../../../math/geometry/point");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const mathjs_1 = require("mathjs");
+const uuid_1 = require("uuid");
+exports.leadingCoefficient = {
+    id: 'leadingCoefficient',
+    connector: '=',
+    instruction: 'Déterminer le coefficient directeur de la droite représentée ci-dessous :',
+    label: 'Déterminer le coefficient directeur',
+    levels: ['3', '2', '1'],
+    isSingleStep: false,
+    section: 'Droites',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientQuestion, nb),
+};
+function getLeadingCoefficientQuestion() {
+    let xA, yA, xB, yB;
+    let pointA, pointB;
+    do {
+        [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-5, 6));
+        xB = xA > 0 ? (0, randint_1.randint)(xA - 4, 6) : (0, randint_1.randint)(-4, xA + 5); // l'écart entre les deux points ne soit pas grand
+        yB = yA > 0 ? (0, randint_1.randint)(yA - 4, 6) : (0, randint_1.randint)(-4, yA + 5);
+        pointA = new point_1.Point('A', new numberNode_1.NumberNode(xA), new numberNode_1.NumberNode(yA));
+        pointB = new point_1.Point('B', new numberNode_1.NumberNode(xB), new numberNode_1.NumberNode(yB));
+    } while (xB - xA === 0);
+    const droite = droite_1.DroiteConstructor.fromTwoPoints(pointA, pointB, 'D');
+    const a = droite.a.toMathString();
+    const b = droite.b.toMathString();
+    const aValue = (0, mathjs_1.evaluate)(a);
+    const bValue = (0, mathjs_1.evaluate)(b);
+    let xmin, xmax, ymin, ymax;
+    if (bValue > 0) {
+        ymax = bValue + 1;
+        ymin = -1;
+    }
+    else {
+        ymin = bValue - 1;
+        ymax = 1;
+    }
+    if (-bValue / aValue > 0) {
+        xmax = -bValue / aValue + 1;
+        xmin = -1;
+    }
+    else {
+        xmin = -bValue / aValue - 1;
+        xmax = 1;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: droite.getLeadingCoefficient(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = droite.getLeadingCoefficient() !== '0'
+                    ? (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(droite.a, new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0, 1]))))
+                    : new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0]));
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    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: droite.getLeadingCoefficient(),
+        keys: [],
+        commands: [`f(x) = (${a}) * x + (${b})`],
+        coords: [xmin, xmax, ymin, ymax],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLeadingCoefficientQuestion = getLeadingCoefficientQuestion;

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

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

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

@@ -1 +1 @@
-{"version":3,"file":"leadingCoefficientCalculV1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/leadingCoefficientCalculV1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CAgDhE"}
+{"version":3,"file":"leadingCoefficientCalculV1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/leadingCoefficientCalculV1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CAmDhE"}

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

@@ -1,56 +1,59 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getLeadingCoefficientCalculV1Question = exports.leadingCoefficientCalculV1 = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const simplify_1 = require("../../../tree/parsers/simplify");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.leadingCoefficientCalculV1 = {
-    id: 'leadingCoefficientCalculV1',
-    connector: '=',
-    instruction: '',
-    label: "Calculer le coefficient directeur d'une fonction affine",
-    levels: ['3', '2', '1'],
-    isSingleStep: true,
-    section: 'Fonctions affines',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
-};
-function getLeadingCoefficientCalculV1Question() {
-    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
-    const xB = (0, randint_1.randint)(-9, 10, [xA]);
-    const yB = (0, randint_1.randint)(-9, 10);
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA + (0, randint_1.randint)(-3, 4, [0])), new numberNode_1.NumberNode(xB - xA + (0, randint_1.randint)(-3, 4, [0])))).toTex();
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer,
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction: `Soit $f$ une fonction affine telle que $f(${xA})$ = $${yA}$ et $f(${xB})$ = $${yB}$.$\\\\$Quel est le coefficient directeur de $f$ ?`,
-        startStatement: 'a',
-        answer: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
-        getPropositions,
-    };
-    return question;
-}
-exports.getLeadingCoefficientCalculV1Question = getLeadingCoefficientCalculV1Question;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLeadingCoefficientCalculV1Question = exports.leadingCoefficientCalculV1 = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.leadingCoefficientCalculV1 = {
+    id: 'leadingCoefficientCalculV1',
+    connector: '=',
+    instruction: '',
+    label: "Calculer le coefficient directeur d'une fonction affine",
+    levels: ['3', '2', '1'],
+    isSingleStep: true,
+    section: 'Fonctions affines',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
+};
+function getLeadingCoefficientCalculV1Question() {
+    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
+    const xB = (0, randint_1.randint)(-9, 10, [xA]);
+    const yB = (0, randint_1.randint)(-9, 10);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA + (0, randint_1.randint)(-3, 4, [0])), new numberNode_1.NumberNode(xB - xA + (0, randint_1.randint)(-3, 4, [0])))).toTex();
+                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: `Soit $f$ une fonction affine telle que $f(${xA})$ = $${yA}$ et $f(${xB})$ = $${yB}$.$\\\\$Quel est le coefficient directeur de $f$ ?`,
+        startStatement: 'a',
+        answer: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLeadingCoefficientCalculV1Question = getLeadingCoefficientCalculV1Question;

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

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

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

@@ -1 +1 @@
-{"version":3,"file":"leadingCoefficientCalculV2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/leadingCoefficientCalculV2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CA+ChE"}
+{"version":3,"file":"leadingCoefficientCalculV2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/leadingCoefficientCalculV2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CAkDhE"}

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

@@ -1,55 +1,58 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getLeadingCoefficientCalculV1Question = exports.leadingCoefficientCalculV2 = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const simplify_1 = require("../../../tree/parsers/simplify");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.leadingCoefficientCalculV2 = {
-    id: 'leadingCoefficientCalculV2',
-    connector: '=',
-    instruction: '',
-    label: "Coefficient directeur à l'aide de deux points",
-    levels: ['3', '2', '1'],
-    isSingleStep: false,
-    section: 'Droites',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
-};
-function getLeadingCoefficientCalculV1Question() {
-    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
-    const xB = (0, randint_1.randint)(-9, 10, [xA]);
-    const yB = (0, randint_1.randint)(-9, 10);
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA + (0, randint_1.randint)(-3, 4, [0])), new numberNode_1.NumberNode(xB - xA + (0, randint_1.randint)(-3, 4, [0])))).toTex();
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer,
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction: `Soit $d$ une droite passant par les points $A(${xA};${yA})$ et $B(${xB};${yB})$.$\\\\$Déterminer le coefficient directeur de $d$.`,
-        answer: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
-        getPropositions,
-    };
-    return question;
-}
-exports.getLeadingCoefficientCalculV1Question = getLeadingCoefficientCalculV1Question;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLeadingCoefficientCalculV1Question = exports.leadingCoefficientCalculV2 = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.leadingCoefficientCalculV2 = {
+    id: 'leadingCoefficientCalculV2',
+    connector: '=',
+    instruction: '',
+    label: "Coefficient directeur à l'aide de deux points",
+    levels: ['3', '2', '1'],
+    isSingleStep: false,
+    section: 'Droites',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
+};
+function getLeadingCoefficientCalculV1Question() {
+    const [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-9, 10));
+    const xB = (0, randint_1.randint)(-9, 10, [xA]);
+    const yB = (0, randint_1.randint)(-9, 10);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA + (0, randint_1.randint)(-3, 4, [0])), new numberNode_1.NumberNode(xB - xA + (0, randint_1.randint)(-3, 4, [0])))).toTex();
+                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: `Soit $d$ une droite passant par les points $A(${xA};${yA})$ et $B(${xB};${yB})$.$\\\\$Déterminer le coefficient directeur de $d$.`,
+        answer: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(yB - yA), new numberNode_1.NumberNode(xB - xA))).toTex(),
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLeadingCoefficientCalculV1Question = getLeadingCoefficientCalculV1Question;

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

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

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

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