math-exercises 1.3.41 → 1.3.43

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/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.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

@@ -59,6 +59,7 @@ function getLeadingCoefficientQuestion() {
             id: (0, uuid_1.v4)() + '',
             statement: droite.getLeadingCoefficient(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -71,6 +72,7 @@ function getLeadingCoefficientQuestion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -84,6 +86,7 @@ function getLeadingCoefficientQuestion() {
         commands: [`f(x) = (${a}) * x + (${b})`],
         coords: [xmin, xmax, ymin, ymax],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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

@@ -28,6 +28,7 @@ function getLeadingCoefficientCalculV1Question() {
             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;
@@ -38,6 +39,7 @@ function getLeadingCoefficientCalculV1Question() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -50,6 +52,7 @@ function getLeadingCoefficientCalculV1Question() {
         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;
 }

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

@@ -28,6 +28,7 @@ function getLeadingCoefficientCalculV1Question() {
             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;
@@ -38,6 +39,7 @@ function getLeadingCoefficientCalculV1Question() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -49,6 +51,7 @@ function getLeadingCoefficientCalculV1Question() {
         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;
 }

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"}

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

@@ -28,6 +28,7 @@ function getMidpointQuestion() {
             id: (0, uuid_1.v4)() + '',
             statement: A.midpoint(B).toTexWithCoords(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -41,6 +42,7 @@ function getMidpointQuestion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer.toTexWithCoords(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -54,6 +56,7 @@ function getMidpointQuestion() {
         answer: A.midpoint(B).toTexWithCoords(),
         keys: ['semicolon'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"signFunction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/signFunction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAEF,wBAAgB,eAAe,IAAI,QAAQ,CAuE1C"}

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

@@ -0,0 +1,84 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSignFunction = exports.signFunction = 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 numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.signFunction = {
+    id: 'signFunction',
+    connector: '=',
+    instruction: '',
+    label: "Signe d'une fonction affine",
+    levels: ['4', '3', '2'],
+    section: 'Fonctions affines',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSignFunction, nb),
+    keys: ['S', 'equal', 'lbracket', 'rbracket', 'semicolon', 'infty'],
+};
+function 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 = '';
+    switch ((0, coinFlip_1.coinFlip)()) {
+        case true:
+            instruction += 'positive ?';
+            answer =
+                a > 0
+                    ? `\\left[${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()};+\\infty\\right[`
+                    : `\\left]-\\infty;${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()}\\right]`;
+            break;
+        case false:
+            instruction += 'négative ?';
+            answer =
+                a > 0
+                    ? `\\left]-\\infty;${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()}\\right]`
+                    : `\\left[${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()};+\\infty\\left[`;
+            break;
+    }
+    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 a = (0, randint_1.randint)(-9, 10, [0]);
+                const b = (0, randint_1.randint)(-9, 10);
+                const wrongAnswer = (0, coinFlip_1.coinFlip)()
+                    ? `\\left[${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()};+\\infty\\right[`
+                    : `\\left]-\\infty;${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(-b / a)).toTex()}\\right]`;
+                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,
+        startStatement: 'S',
+        answer,
+        keys: ['S', 'equal', 'lbracket', 'rbracket', 'semicolon', 'infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSignFunction = getSignFunction;

package/lib/exercises/geometry/euclidean/circleArea.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"circleArea.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/circleArea.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAe,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,UAAU,EAAE,QASxB,CAAC;AAEF,wBAAgB,aAAa,IAAI,QAAQ,CA4CxC"}
+{"version":3,"file":"circleArea.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/circleArea.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAe,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,UAAU,EAAE,QASxB,CAAC;AAEF,wBAAgB,aAAa,IAAI,QAAQ,CA+CxC"}

package/lib/exercises/geometry/euclidean/circleArea.js

@@ -28,6 +28,7 @@ function getCircleArea() {
             id: (0, uuid_1.v4)() + '',
             statement: correctAnswer,
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -38,6 +39,7 @@ function getCircleArea() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -49,6 +51,7 @@ function getCircleArea() {
         instruction: `Calculer l'aire d'un cercle de ${coin ? 'rayon ' + radius : 'diamètre ' + diametre} cm.`,
         answer: correctAnswer,
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/geometry/euclidean/circleCircumference.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"circleCircumference.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/circleCircumference.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAe,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,mBAAmB,EAAE,QASjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CA4CjD"}
+{"version":3,"file":"circleCircumference.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/circleCircumference.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAe,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,mBAAmB,EAAE,QASjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CA+CjD"}