math-exercises 2.1.25 → 2.1.26-beta.2

package/lib/exercises/limits/sequencePolynomProductLimit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC;AAkEF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/limits/sequencePolynomProductLimit.js

@@ -0,0 +1,70 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequencePolynomProductLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../math/numbers/rationals/rational");
+const monom_1 = require("../../math/polynomials/monom");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const shuffle_1 = require("../../utils/shuffle");
+const getSequencePolynomProductLimitQuestion = () => {
+    const polyNum = polynomial_1.PolynomialConstructor.randomWithLength(3, 2, "n");
+    const polyDenum = polynomial_1.PolynomialConstructor.randomWithLength(3, 2, "n");
+    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
+    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
+    const product = new monom_1.Monom(polyNum.degree + polyDenum.degree, numLeadingCoeff * denumLeadingCoeff, "n");
+    const to = "+\\infty";
+    let answer = product.getLimit(to);
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    const question = {
+        answer,
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = (${polyNum
+            .toTree()
+            .toTex()})(${polyDenum.toTree().toTex()})$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: {
+            polyDenumCoeffs: polyDenum.coefficients,
+            polyNumCoeffs: polyNum.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, polyDenumCoeffs, polyNumCoeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const numLeadingCoeff = polyNumCoeffs[polyNumCoeffs.length - 1];
+    const denumLeadingCoeff = polyDenumCoeffs[polyDenumCoeffs.length - 1];
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
+    (0, exercise_1.tryToAddWrongProp)(propositions, leadingCoeffsRational);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.sequencePolynomProductLimit = {
+    id: "sequencePolynomProductLimit",
+    connector: "=",
+    label: "Limite d'un produit de suites polynomiales",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites", "Suites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomProductLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/limits/sequenceRationalFracLimit.d.ts

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

package/lib/exercises/limits/sequenceRationalFracLimit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAmGF,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,WAAW,CAa/D,CAAC"}

package/lib/exercises/limits/sequenceRationalFracLimit.js

@@ -0,0 +1,100 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequenceRationalFracLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../math/numbers/rationals/rational");
+const monom_1 = require("../../math/polynomials/monom");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const shuffle_1 = require("../../utils/shuffle");
+const getSequenceRationalFracLimitQuestion = () => {
+    const polyNum = polynomial_1.PolynomialConstructor.random(4, "n");
+    const polyDenum = polynomial_1.PolynomialConstructor.random(4, "n");
+    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
+    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
+    const to = "+\\infty";
+    let answer;
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    if (polyDenum.degree === polyNum.degree) {
+        answer = leadingCoeffsRational;
+    }
+    else if (polyDenum.degree > polyNum.degree) {
+        answer = "0";
+    }
+    else {
+        const tempPoly = new monom_1.Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1, "n");
+        answer = tempPoly.getLimit(to);
+    }
+    const question = {
+        answer,
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = \\dfrac{${polyNum
+            .toTree()
+            .toTex()}}{${polyDenum.toTree().toTex()}}$.`,
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers: {
+            numCoeffs: polyNum.coefficients,
+            denumCoeffs: polyDenum.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, numCoeffs, denumCoeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const numLeadingCoeff = numCoeffs[numCoeffs.length - 1];
+    const denumLeadingCoeff = denumCoeffs[denumCoeffs.length - 1];
+    const to = "+\\infty";
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    (0, exercise_1.tryToAddWrongProp)(propositions, "+\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "-\\infty");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "0");
+    (0, exercise_1.tryToAddWrongProp)(propositions, leadingCoeffsRational);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { denumCoeffs, numCoeffs }) => {
+    const numDegree = numCoeffs.length - 1;
+    const denumDegree = denumCoeffs.length - 1;
+    const numLeadingCoeff = numCoeffs[numDegree];
+    const denumLeadingCoeff = denumCoeffs[denumDegree];
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    let answer;
+    if (denumDegree === numDegree) {
+        answer = leadingCoeffsRational;
+    }
+    else if (denumDegree > numDegree) {
+        answer = new numberNode_1.NumberNode(0);
+    }
+    else {
+        const tempPoly = new monom_1.Monom(numDegree - denumDegree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
+        answer = tempPoly.getLimitNode("+\\infty");
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.sequenceRationalFracLimit = {
+    id: "sequenceRationalFracLimit",
+    connector: "=",
+    label: "Limite d'une suite rationnelle",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Limites", "Suites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/limits/sequenceSimpleElementsSumLimit.d.ts

@@ -0,0 +1,9 @@
+import { MathExercise } from '../../exercises/exercise';
+type QCMProps = {
+    answer: string;
+    coeffs: number[];
+};
+type VEAProps = {};
+export declare const sequenceSimpleElementsSumLimit: MathExercise<QCMProps, VEAProps>;
+export {};
+//# sourceMappingURL=sequenceSimpleElementsSumLimit.d.ts.map

package/lib/exercises/limits/sequenceSimpleElementsSumLimit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceSimpleElementsSumLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceSimpleElementsSumLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAiCnB,eAAO,MAAM,8BAA8B,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW3E,CAAC"}

package/lib/exercises/limits/sequenceSimpleElementsSumLimit.js

@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequenceSimpleElementsSumLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const shuffle_1 = require("../../utils/shuffle");
+const getSequencePolynomLimitQuestion = () => {
+    const poly = polynomial_1.PolynomialConstructor.random(4, 'n');
+    const to = '+\\infty';
+    const answer = poly.getLimit(to);
+    const question = {
+        answer: answer,
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly.toTree().toTex()}$.`,
+        keys: ['infty'],
+        answerFormat: 'tex',
+        qcmGeneratorProps: { answer, coeffs: poly.coefficients },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, coeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, '+\\infty');
+    (0, exercise_1.tryToAddWrongProp)(propositions, '-\\infty');
+    (0, exercise_1.tryToAddWrongProp)(propositions, '0');
+    (0, exercise_1.tryToAddWrongProp)(propositions, coeffs[coeffs.length - 1] + '');
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + '');
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+exports.sequenceSimpleElementsSumLimit = {
+    id: 'sequenceSimpleElementsSumLimit',
+    connector: '=',
+    label: "Limite d'une suite de sommes",
+    levels: ['TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Limites'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+};

package/lib/exercises/math/functions/basics/inverseImageFunctionTable.js

@@ -9,7 +9,7 @@ const coinFlip_1 = require("../../../../utils/coinFlip");
 const random_1 = require("../../../../utils/random");
 const getInverseImageFunctionTableQuestion = () => {
     const exercise = generateExercise();
-    const instruction = `Soit un tableau de valeurs représentant la fonction $f$. Déterminer ${exercise.isAskingImage ? `l'image de` : `le ou les antécédents de`} $${exercise.questionValue}$ par $f$
+    const instruction = `Ci-dessous est donné le tableau de valeurs d'une fonction $f$. Déterminer ${exercise.isAskingImage ? `l'image de` : `le ou les antécédents de`} $${exercise.questionValue}$ par $f$
     ${exercise.exoTable.table}`;
     const question = {
         answer: `${exercise.answer}`,
@@ -91,7 +91,7 @@ const generatePropositions = (xValues, imageValues, answer) => {
 };
 exports.inverseImageFunctionTable = {
     id: "inverseImageFunctionTable",
-    label: "Déterminer l'image ou l'antécédent d'un nombre à partir d'un tableau de valeurs d'une fonction",
+    label: "Déterminer une image ou un antécédent à partir d'un tableau de valeurs",
     levels: ["3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
     isSingleStep: true,
     sections: ["Fonctions"],

package/lib/exercises/math/geometry/cartesian/drawAlineInGGB.d.ts

@@ -0,0 +1,8 @@
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {
+    correctA: number;
+    correctB: number;
+};
+export declare const drawAlineInGGB: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=drawAlineInGGB.d.ts.map

package/lib/exercises/math/geometry/cartesian/drawAlineInGGB.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"drawAlineInGGB.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/cartesian/drawAlineInGGB.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAIT,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AAmDF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAahD,CAAC"}

package/lib/exercises/math/geometry/cartesian/drawAlineInGGB.js

@@ -0,0 +1,66 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.drawAlineInGGB = void 0;
+const isGGBLine_1 = require("../../../../exercises/utils/geogebra/isGGBLine");
+const isGGBPoint_1 = require("../../../../exercises/utils/geogebra/isGGBPoint");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const toolBarConstructor_1 = require("../../../../exercises/utils/geogebra/toolBarConstructor");
+const point_1 = require("../../../../math/geometry/point");
+const affine_1 = require("../../../../math/polynomials/affine");
+const arrayEqual_1 = require("../../../../utils/arrayEqual");
+const getDrawAlineInGgbQuestion = () => {
+    const f = affine_1.AffineConstructor.random({ min: -3, max: 3 });
+    const yA = f.b;
+    const yB = f.a + f.b;
+    const yMax = Math.max(yA, yB, 0);
+    const yMin = Math.min(yA, yB, 0);
+    const question = {
+        ggbAnswer: [`(0,${yA})`, `(1,${yB})`, `Line(A, B)`],
+        instruction: `Tracer la droite $d$ d'équation $y=${f.toTex()}$.`,
+        keys: [],
+        answerFormat: "tex",
+        studentGgbOptions: {
+            customToolBar: (0, toolBarConstructor_1.toolBarConstructor)({
+                join: true,
+            }),
+            xAxisSteps: 1,
+            yAxisSteps: 1,
+            coords: [-6, 6, yMin - 5, yMax + 5],
+            isGridSimple: true,
+        },
+        identifiers: { correctA: f.a, correctB: f.b },
+    };
+    return question;
+};
+const isGGBAnswerValid = (ans, { ggbAnswer, correctA, correctB }) => {
+    if ((0, arrayEqual_1.arrayEqual)(ans, ggbAnswer))
+        return true;
+    if (ans.length !== 3)
+        return false;
+    if (!(0, isGGBPoint_1.isGGBPoint)(ans[0]) || !(0, isGGBPoint_1.isGGBPoint)(ans[1]) || !(0, isGGBLine_1.isGGBLine)(ans[2]))
+        return false;
+    const A = getPoint(ans[0], "A");
+    const B = getPoint(ans[1], "B");
+    const a = (B.getYnumber() - A.getYnumber()) / (B.getXnumber() - A.getXnumber());
+    const b = A.getYnumber() - a * A.getXnumber();
+    return a === correctA && b === correctB;
+};
+const getPoint = (command, pointName) => {
+    const splitted = command.split(",");
+    const x = +splitted[0].replace("(", "");
+    const y = +splitted[1].replace(")", "");
+    return new point_1.Point(pointName, x.toTree(), y.toTree());
+};
+exports.drawAlineInGGB = {
+    id: "drawAlineInGGB",
+    label: "Tracer une droite à partir de son équation réduite",
+    levels: ["2nde"],
+    isSingleStep: true,
+    answerType: "GGB",
+    sections: ["Géométrie cartésienne"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDrawAlineInGgbQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    isGGBAnswerValid,
+    subject: "Mathématiques",
+};

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

@@ -4,4 +4,6 @@ export * from "./cartesianEquationOfLine";
 export * from "./pointCoordinates";
 export * from "./directionVector";
 export * from "./directionVectorEquation";
+export * from "./drawAlineInGGB";
+export * from "./placeAPoint";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/cartesian/index.ts"],"names":[],"mappings":"AAAA,cAAc,4BAA4B,CAAC;AAC3C,cAAc,YAAY,CAAC;AAC3B,cAAc,2BAA2B,CAAC;AAC1C,cAAc,oBAAoB,CAAC;AACnC,cAAc,mBAAmB,CAAC;AAClC,cAAc,2BAA2B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/cartesian/index.ts"],"names":[],"mappings":"AAAA,cAAc,4BAA4B,CAAC;AAC3C,cAAc,YAAY,CAAC;AAC3B,cAAc,2BAA2B,CAAC;AAC1C,cAAc,oBAAoB,CAAC;AACnC,cAAc,mBAAmB,CAAC;AAClC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC"}

package/lib/exercises/math/geometry/cartesian/index.js

@@ -20,3 +20,5 @@ __exportStar(require("./cartesianEquationOfLine"), exports);
 __exportStar(require("./pointCoordinates"), exports);
 __exportStar(require("./directionVector"), exports);
 __exportStar(require("./directionVectorEquation"), exports);
+__exportStar(require("./drawAlineInGGB"), exports);
+__exportStar(require("./placeAPoint"), exports);

package/lib/exercises/math/geometry/cartesian/placeAPoint.d.ts

@@ -0,0 +1,5 @@
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {};
+export declare const testGGBAnswer: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=placeAPoint.d.ts.map

package/lib/exercises/math/geometry/cartesian/placeAPoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"placeAPoint.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/cartesian/placeAPoint.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAIT,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG,EAAE,CAAC;AAgCtB,eAAO,MAAM,aAAa,EAAE,QAAQ,CAAC,WAAW,CAY/C,CAAC"}

package/lib/exercises/math/geometry/cartesian/placeAPoint.js

@@ -0,0 +1,46 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.testGGBAnswer = void 0;
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const toolBarConstructor_1 = require("../../../../exercises/utils/geogebra/toolBarConstructor");
+const point_1 = require("../../../../math/geometry/point");
+const arrayHasSameElement_1 = require("../../../../utils/arrayHasSameElement");
+const getPlaceAPointQuestion = () => {
+    const point = point_1.PointConstructor.random("A");
+    const xMax = point.getXnumber() + 2;
+    const xMin = point.getXnumber() - 2;
+    const yMin = point.getYnumber() - 2;
+    const yMax = point.getYnumber() + 2;
+    const question = {
+        ggbAnswer: [`(${point.getXnumber()},${point.getYnumber()})`],
+        instruction: `Placer le point $A$ de coordonnées $${point.toTexWithCoords()}$.`,
+        keys: [],
+        studentGgbOptions: {
+            customToolBar: (0, toolBarConstructor_1.toolBarConstructor)({
+                point: true,
+            }),
+            coords: [-11, 11, -11, 11],
+            isGridSimple: false,
+            isXAxesNatural: true,
+            enableShiftDragZoom: true,
+        },
+        identifiers: {},
+    };
+    return question;
+};
+const isGGBAnswerValid = (ans, { ggbAnswer }) => {
+    return (0, arrayHasSameElement_1.arrayHasSameElements)(ans, ggbAnswer);
+};
+exports.testGGBAnswer = {
+    id: "placeAPoint",
+    label: "Placer un point dans un repère orthonormé",
+    levels: ["2nde"],
+    isSingleStep: true,
+    sections: ["Géométrie euclidienne"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPlaceAPointQuestion, nb),
+    answerType: "GGB",
+    qcmTimer: 60,
+    freeTimer: 60,
+    isGGBAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/geometry/vectors/drawAVectorInGGB.d.ts

@@ -0,0 +1,5 @@
+import { Exercise } from "../../../../exercises/exercise";
+type Identifiers = {};
+export declare const drawAVectorInGGB: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=drawAVectorInGGB.d.ts.map

package/lib/exercises/math/geometry/vectors/drawAVectorInGGB.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"drawAVectorInGGB.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/vectors/drawAVectorInGGB.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAIT,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG,EAAE,CAAC;AA8BtB,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,CAalD,CAAC"}

package/lib/exercises/math/geometry/vectors/drawAVectorInGGB.js

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.drawAVectorInGGB = void 0;
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const toolBarConstructor_1 = require("../../../../exercises/utils/geogebra/toolBarConstructor");
+const vector_1 = require("../../../../math/geometry/vector");
+const randint_1 = require("../../../../math/utils/random/randint");
+const getDrawAVectorInGgbQuestion = () => {
+    const x = (0, randint_1.randint)(-3, 3);
+    const y = x === 0 ? (0, randint_1.randint)(-3, 3, [0]) : (0, randint_1.randint)(-3, 3);
+    const vector = new vector_1.Vector("u", x.toTree(), y.toTree());
+    const question = {
+        ggbAnswer: [``, ``, `(${x},${y})`],
+        instruction: `Tracer le vecteur $${vector.toTex()}${vector.toInlineCoordsTex()}$`,
+        keys: [],
+        studentGgbOptions: {
+            customToolBar: (0, toolBarConstructor_1.toolBarConstructor)({
+                vector: true,
+            }),
+            isGridSimple: true,
+            coords: [-5, 5, -6, 6],
+            enableShiftDragZoom: true,
+        },
+        answerFormat: "tex",
+        identifiers: {},
+    };
+    return question;
+};
+const isGGBAnswerValid = (ans, { ggbAnswer }) => {
+    return ans.length === 3 && ans.includes(ggbAnswer[2]);
+};
+exports.drawAVectorInGGB = {
+    id: "drawAVectorInGGB",
+    label: "Tracer un vecteur",
+    levels: ["2nde"],
+    isSingleStep: true,
+    sections: ["Géométrie cartésienne"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDrawAVectorInGgbQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    answerType: "GGB",
+    isGGBAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/geometry/vectors/index.d.ts

@@ -13,4 +13,5 @@ export * from "./equalCaracteristicFromGraph";
 export * from "./vectorLinearCombination";
 export * from "./vectorNormCalculation";
 export * from "./lineFromDirectorVector";
+export * from "./drawAVectorInGGB";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/geometry/vectors/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/vectors/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC;AAC1B,cAAc,sBAAsB,CAAC;AACrC,cAAc,eAAe,CAAC;AAC9B,cAAc,0BAA0B,CAAC;AACzC,cAAc,kCAAkC,CAAC;AACjD,cAAc,uBAAuB,CAAC;AACtC,cAAc,eAAe,CAAC;AAC9B,cAAc,4BAA4B,CAAC;AAC3C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,yBAAyB,CAAC;AACxC,cAAc,0BAA0B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/vectors/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC;AAC1B,cAAc,sBAAsB,CAAC;AACrC,cAAc,eAAe,CAAC;AAC9B,cAAc,0BAA0B,CAAC;AACzC,cAAc,kCAAkC,CAAC;AACjD,cAAc,uBAAuB,CAAC;AACtC,cAAc,eAAe,CAAC;AAC9B,cAAc,4BAA4B,CAAC;AAC3C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,yBAAyB,CAAC;AACxC,cAAc,0BAA0B,CAAC;AACzC,cAAc,oBAAoB,CAAC"}

package/lib/exercises/math/geometry/vectors/index.js

@@ -29,3 +29,4 @@ __exportStar(require("./equalCaracteristicFromGraph"), exports);
 __exportStar(require("./vectorLinearCombination"), exports);
 __exportStar(require("./vectorNormCalculation"), exports);
 __exportStar(require("./lineFromDirectorVector"), exports);
+__exportStar(require("./drawAVectorInGGB"), exports);

package/lib/exercises/matrices/index.d.ts

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

package/lib/exercises/matrices/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/matrices/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,eAAe,CAAC"}

package/lib/exercises/matrices/index.js

@@ -0,0 +1,19 @@
+"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("./matrixInversibilityDomain"), exports);
+__exportStar(require("./productCell"), exports);
+// export * from "./matrixGeneralTerm";

package/lib/exercises/matrices/matrixGeneralTerm.d.ts

@@ -0,0 +1,10 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    n: number;
+    p: number;
+    alpha: number;
+    beta: number;
+};
+export declare const matrixGeneralTerm: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=matrixGeneralTerm.d.ts.map

package/lib/exercises/matrices/matrixGeneralTerm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrixGeneralTerm.d.ts","sourceRoot":"","sources":["../../../src/exercises/matrices/matrixGeneralTerm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAsDF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAavD,CAAC"}

package/lib/exercises/matrices/matrixGeneralTerm.js

@@ -0,0 +1,57 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.matrixGeneralTerm = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const matrix_1 = require("../../math/matrices/matrix");
+const randint_1 = require("../../math/utils/random/randint");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const doWhile_1 = require("../../utils/doWhile");
+//A d'ordre nxp avec a_(i,j) = alpha*i + beta*j
+const getMatrixGeneralTermQuestion = () => {
+    const n = (0, randint_1.randint)(1, 5);
+    const p = (0, doWhile_1.doWhile)(() => (0, randint_1.randint)(1, 5), (res) => n === 1 && res === 1);
+    const alpha = (0, randint_1.randint)(-5, 6, [0]);
+    const beta = (0, randint_1.randint)(-5, 6, [0]);
+    const aij = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(alpha.toTree(), new variableNode_1.VariableNode("i")), new multiplyNode_1.MultiplyNode(beta.toTree(), new variableNode_1.VariableNode("j"))).simplify();
+    const elements = Array.from(Array(n), (_, rowIndex) => Array.from(Array(p), (__, colIndex) => (alpha * (rowIndex + 1) + beta * (colIndex + 1)).toTree()));
+    const matrix = new matrix_1.Matrix(elements);
+    const answer = matrix.toTex();
+    const question = {
+        answer,
+        instruction: `Soit $A = (a_{i,j})$ une matrice d'ordre $n \\times p$ telle que : $n = ${n}$, $p = ${p}$ et pour tout $1\\leq i \\leq n$ et $1\\leq j \\leq p$, $a_{i,j} = ${aij.toTex()}$. Quelle est l'expression de la matrice $A$ ? `,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { n, p, alpha, beta },
+    };
+    return question;
+};
+const getPropositions = (nb, { answer, n, p, alpha, beta }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const transposedElements = Array.from(Array(p), (_, rowIndex) => Array.from(Array(n), (__, colIndex) => (alpha * (rowIndex + 1) + beta * (colIndex + 1)).toTree()));
+    const matrix = new matrix_1.Matrix(transposedElements);
+    (0, exercise_1.tryToAddWrongProp)(propositions, matrix.toTex());
+    while (propositions.length < nb) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, matrix_1.MatrixConstructor.random(n, p).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, nb);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.matrixGeneralTerm = {
+    id: "matrixGeneralTerm",
+    label: "Déterminer l'expression d'une matrice",
+    levels: ["MathExp"],
+    isSingleStep: true,
+    sections: ["Matrices"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMatrixGeneralTermQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    answerType: "QCM",
+};

package/lib/exercises/matrices/matrixInversibilityDomain.d.ts

@@ -0,0 +1,10 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    a: string;
+    b: string;
+    c: string;
+    d: string;
+};
+export declare const matrixInversibilityDomain: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=matrixInversibilityDomain.d.ts.map

package/lib/exercises/matrices/matrixInversibilityDomain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrixInversibilityDomain.d.ts","sourceRoot":"","sources":["../../../src/exercises/matrices/matrixInversibilityDomain.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AA0BlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA0FF,eAAO,MAAM,yBAAyB,EAAE,YAAY,CAAC,WAAW,CAY/D,CAAC"}