math-exercises 1.3.31 → 1.3.33

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

@@ -1,91 +1,91 @@
-"use strict";
-/*import { Exercise, Question } from '../../../exercises/exercise';
-import { getDistinctQuestions } from '../../../exercises/utils/getDistinctQuestions';
-import { DroiteConstructor } from '../../../math/geometry/droite';
-import { Point } from '../../../math/geometry/point';
-import { Polynomial } from '../../../math/polynomials/polynomial';
-import { randint } from '../../../math/utils/random/randint';
-import { NumberNode } from '../../../tree/nodes/numbers/numberNode';
-import { evaluate } from 'mathjs';
-
-export const derivativeNumberReading2: Exercise = {
-  id: 'derivativeNumberReading2',
-  connector: '=',
-  instruction: '',
-  label: 'Lecture de nombre dérivé 2',
-  levels: ['3', '2', '1'],
-  isSingleStep: false,
-  section: 'Géométrie cartésienne',
-  generator: (nb: number) => getDistinctQuestions(getDerivativeNumberReading, nb),
-};
-
-export function getDerivativeNumberReading(): Question {
-  function computePolynomial(
-    x0: number,
-    y0: number,
-    m: number,
-    x1: number,
-    y1: number,
-    x2: number,
-    y2: number,
-    x3: number,
-    y3: number,
-  ): [number, number, number, number] {
-    const a = (-2 * x0 * x1 * x2 + x0 * x1 * x3 + x0 * x2 * x3 + x1 * x2 * x3) / ((x0 - x1) * (x0 - x2) * (x0 - x3));
-    const b =
-      ((y0 - y1) / ((x0 - x1) * (x0 - x1)) -
-        (y0 - y2) / ((x0 - x2) * (x0 - x2)) +
-        (y0 - y3) / ((x0 - x3) * (x0 - x3))) /
-      (x0 - x1);
-    const c =
-      ((m - 2 * a * x0 - b) * (x0 - x1) * (x0 - x2) * (x0 - x3) -
-        (y0 - y1) / ((x0 - x1) * (x0 - x1)) +
-        a * (x1 * x1 * (x0 - x2) + x2 * x2 * (x0 - x1) - 2 * x1 * x2 * x0) +
-        b * (x1 + x2 - 2 * x0)) /
-      ((x0 - x2) * (x0 - x3));
-    const d = y0 - a * x0 * x0 * x0 - b * x0 * x0 - c * x0;
-    return [a, b, c, d];
-  }
-
-  function generatePolynomial(
-    x0: number,
-    y0: number,
-    m: number,
-    x1: number,
-    y1: number,
-    x2: number,
-    y2: number,
-    x3: number,
-    y3: number,
-  ): Polynomial {
-    const [a, b, c, d] = computePolynomial(x0, y0, m, x1, y1, x2, y2, x3, y3);
-    return new Polynomial([d, c, b, a]);
-  }
-
-  const [x1, y1, x2, y2, x3, y3] = [1, 2, 3, 4, 5, 6].map((el) => randint(-5, 6));
-
-  let xA: number, yA, xB, yB: number;
-  let pointA, pointB: Point;
-  do {
-    [xA, yA] = [1, 2].map((el) => randint(-5, 6));
-    xB = xA > 0 ? randint(xA - 4, 6) : randint(-4, xA + 5); // l'écart entre les deux points ne soit pas grand
-    yB = yA > 0 ? randint(yA - 4, 6) : randint(-4, yA + 5);
-    pointA = new Point('A', new NumberNode(xA), new NumberNode(yA));
-    pointB = new Point('B', new NumberNode(xB), new NumberNode(yB));
-  } while (xB - xA === 0);
-
-  const droite = DroiteConstructor.fromTwoPoints(pointA, pointB, 'D');
-
-  const polynome = generatePolynomial(xA, yA, evaluate(droite.a.toMathString()), x1, y1, x2, y2, x3, y3);
-
-  let instruction = `$f(x) = ${polynome.toTex()}$, $${pointA.toTexWithCoords()}$, $${pointB.toTexWithCoords()}$, $f'(${xA}) = ${droite.getLeadingCoefficient()}$`;
-
-  const question: Question = {
-    instruction,
-    //startStatement: pointA.toTexWithCoords() + ' ' + pointB.toTexWithCoords(),
-    answer: droite.a.toTex(),
-  };
-
-  return question;
-}
-*/
+"use strict";
+/*import { Exercise, Question } from '../../../exercises/exercise';
+import { getDistinctQuestions } from '../../../exercises/utils/getDistinctQuestions';
+import { DroiteConstructor } from '../../../math/geometry/droite';
+import { Point } from '../../../math/geometry/point';
+import { Polynomial } from '../../../math/polynomials/polynomial';
+import { randint } from '../../../math/utils/random/randint';
+import { NumberNode } from '../../../tree/nodes/numbers/numberNode';
+import { evaluate } from 'mathjs';
+
+export const derivativeNumberReading2: Exercise = {
+  id: 'derivativeNumberReading2',
+  connector: '=',
+  instruction: '',
+  label: 'Lecture de nombre dérivé 2',
+  levels: ['3', '2', '1'],
+  isSingleStep: false,
+  section: 'Géométrie cartésienne',
+  generator: (nb: number) => getDistinctQuestions(getDerivativeNumberReading, nb),
+};
+
+export function getDerivativeNumberReading(): Question {
+  function computePolynomial(
+    x0: number,
+    y0: number,
+    m: number,
+    x1: number,
+    y1: number,
+    x2: number,
+    y2: number,
+    x3: number,
+    y3: number,
+  ): [number, number, number, number] {
+    const a = (-2 * x0 * x1 * x2 + x0 * x1 * x3 + x0 * x2 * x3 + x1 * x2 * x3) / ((x0 - x1) * (x0 - x2) * (x0 - x3));
+    const b =
+      ((y0 - y1) / ((x0 - x1) * (x0 - x1)) -
+        (y0 - y2) / ((x0 - x2) * (x0 - x2)) +
+        (y0 - y3) / ((x0 - x3) * (x0 - x3))) /
+      (x0 - x1);
+    const c =
+      ((m - 2 * a * x0 - b) * (x0 - x1) * (x0 - x2) * (x0 - x3) -
+        (y0 - y1) / ((x0 - x1) * (x0 - x1)) +
+        a * (x1 * x1 * (x0 - x2) + x2 * x2 * (x0 - x1) - 2 * x1 * x2 * x0) +
+        b * (x1 + x2 - 2 * x0)) /
+      ((x0 - x2) * (x0 - x3));
+    const d = y0 - a * x0 * x0 * x0 - b * x0 * x0 - c * x0;
+    return [a, b, c, d];
+  }
+
+  function generatePolynomial(
+    x0: number,
+    y0: number,
+    m: number,
+    x1: number,
+    y1: number,
+    x2: number,
+    y2: number,
+    x3: number,
+    y3: number,
+  ): Polynomial {
+    const [a, b, c, d] = computePolynomial(x0, y0, m, x1, y1, x2, y2, x3, y3);
+    return new Polynomial([d, c, b, a]);
+  }
+
+  const [x1, y1, x2, y2, x3, y3] = [1, 2, 3, 4, 5, 6].map((el) => randint(-5, 6));
+
+  let xA: number, yA, xB, yB: number;
+  let pointA, pointB: Point;
+  do {
+    [xA, yA] = [1, 2].map((el) => randint(-5, 6));
+    xB = xA > 0 ? randint(xA - 4, 6) : randint(-4, xA + 5); // l'écart entre les deux points ne soit pas grand
+    yB = yA > 0 ? randint(yA - 4, 6) : randint(-4, yA + 5);
+    pointA = new Point('A', new NumberNode(xA), new NumberNode(yA));
+    pointB = new Point('B', new NumberNode(xB), new NumberNode(yB));
+  } while (xB - xA === 0);
+
+  const droite = DroiteConstructor.fromTwoPoints(pointA, pointB, 'D');
+
+  const polynome = generatePolynomial(xA, yA, evaluate(droite.a.toMathString()), x1, y1, x2, y2, x3, y3);
+
+  let instruction = `$f(x) = ${polynome.toTex()}$, $${pointA.toTexWithCoords()}$, $${pointB.toTexWithCoords()}$, $f'(${xA}) = ${droite.getLeadingCoefficient()}$`;
+
+  const question: Question = {
+    instruction,
+    //startStatement: pointA.toTexWithCoords() + ' ' + pointB.toTexWithCoords(),
+    answer: droite.a.toTex(),
+  };
+
+  return question;
+}
+*/

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

@@ -1,60 +1,60 @@
-"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 mathjs_1 = require("mathjs");
-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: 'Géométrie cartésienne',
-    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 question = {
-        answer: droite.getLeadingCoefficient(),
-        keys: [],
-        commands: [`f(x) = (${a}) * x + (${b})`],
-        coords: [xmin, xmax, ymin, ymax],
-    };
-    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 mathjs_1 = require("mathjs");
+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: 'Géométrie cartésienne',
+    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 question = {
+        answer: droite.getLeadingCoefficient(),
+        keys: [],
+        commands: [`f(x) = (${a}) * x + (${b})`],
+        coords: [xmin, xmax, ymin, ymax],
+    };
+    return question;
+}
+exports.getLeadingCoefficientQuestion = getLeadingCoefficientQuestion;

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

@@ -0,0 +1,4 @@
+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

@@ -0,0 +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;AAO9D,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CAWhE"}

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

@@ -0,0 +1,30 @@
+"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");
+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 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(),
+    };
+    return question;
+}
+exports.getLeadingCoefficientCalculV1Question = getLeadingCoefficientCalculV1Question;

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

@@ -0,0 +1,4 @@
+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

@@ -0,0 +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;AAO9D,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,qCAAqC,IAAI,QAAQ,CAUhE"}

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

@@ -0,0 +1,29 @@
+"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");
+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 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(),
+    };
+    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.js

@@ -1,31 +1,31 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getMidpointQuestion = exports.midpoint = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const point_1 = require("../../../math/geometry/point");
-const randTupleInt_1 = require("../../../math/utils/random/randTupleInt");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-exports.midpoint = {
-    id: 'midpoint',
-    connector: '=',
-    instruction: '',
-    label: 'Coordonnées du milieu',
-    levels: ['3', '2', '1'],
-    isSingleStep: false,
-    section: 'Géométrie cartésienne',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMidpointQuestion, nb),
-    keys: ['semicolon'],
-};
-function getMidpointQuestion() {
-    const [coords1, coords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, { from: -9, to: 10 });
-    const A = new point_1.Point('A', new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
-    const B = new point_1.Point('B', new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
-    const question = {
-        instruction: `Soit $${A.toTexWithCoords()}$ et $${B.toTexWithCoords()}$. Quelles sont les coordonnées du milieu $I$ de $[AB]$ ?`,
-        startStatement: 'I',
-        answer: A.midpoint(B).toTexWithCoords(),
-        keys: ['semicolon'],
-    };
-    return question;
-}
-exports.getMidpointQuestion = getMidpointQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getMidpointQuestion = exports.midpoint = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const point_1 = require("../../../math/geometry/point");
+const randTupleInt_1 = require("../../../math/utils/random/randTupleInt");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+exports.midpoint = {
+    id: 'midpoint',
+    connector: '=',
+    instruction: '',
+    label: 'Coordonnées du milieu',
+    levels: ['3', '2', '1'],
+    isSingleStep: false,
+    section: 'Géométrie cartésienne',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMidpointQuestion, nb),
+    keys: ['semicolon'],
+};
+function getMidpointQuestion() {
+    const [coords1, coords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, { from: -9, to: 10 });
+    const A = new point_1.Point('A', new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
+    const B = new point_1.Point('B', new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
+    const question = {
+        instruction: `Soit $${A.toTexWithCoords()}$ et $${B.toTexWithCoords()}$. Quelles sont les coordonnées du milieu $I$ de $[AB]$ ?`,
+        startStatement: 'I',
+        answer: A.midpoint(B).toTexWithCoords(),
+        keys: ['semicolon'],
+    };
+    return question;
+}
+exports.getMidpointQuestion = getMidpointQuestion;

package/lib/exercises/geometry/euclidean/TriangleArea.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"TriangleArea.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/TriangleArea.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM9D,eAAO,MAAM,YAAY,EAAE,QAS1B,CAAC;AAEF,wBAAgB,eAAe,IAAI,QAAQ,CA4C1C"}

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

@@ -0,0 +1,53 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getTriangleArea = exports.triangleArea = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const triangles_1 = require("../../../math/geometry/triangles");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+exports.triangleArea = {
+    id: 'triangleArea',
+    connector: '=',
+    instruction: '',
+    label: "Calculer l'aire d'un triangle",
+    levels: ['4', '3', '2'],
+    isSingleStep: false,
+    section: 'Géométrie euclidienne',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getTriangleArea, nb),
+};
+function getTriangleArea() {
+    const vertices = [];
+    const code = 65 + (0, randint_1.randint)(0, 24); // Générer un code de caractère majuscule aléatoire (A-Z)
+    for (let i = 0; i < 3; i++)
+        vertices.push(String.fromCharCode(code + i));
+    const triangle = triangles_1.TriangleConstructor.createRandomTriangle({ minAngle: 0.69, maxAngle: 1.5, names: vertices });
+    const sides = [triangle.getSideAName(), triangle.getSideBName(), triangle.getSideCName()];
+    const sidesLength = [triangle.getSideAnumber(), triangle.getSideBnumber(), triangle.getSideCnumber()].map((el) => Math.round(el / 2));
+    const angles = [triangle.getAngleA(), triangle.getAngleB(), triangle.getAngleC()];
+    const randoms = (0, shuffle_1.shuffle)([0, 1, 2]);
+    const height = Math.round(sidesLength[randoms[1]] * Math.sin(angles[randoms[2]]));
+    const commands = [
+        ...triangle.generateCommands({
+            showLabels: [sides[randoms[0]]],
+            setCaptions: [sidesLength[randoms[0]] + ''],
+        }),
+        `poi = Intersect(PerpendicularLine(${vertices[randoms[0]]},${sides[randoms[0]]}),${sides[randoms[0]]})`,
+        `ShowLabel(poi, true)`,
+        `SetCaption(poi, "${String.fromCharCode(code + 3)}")`,
+        `seg = Segment(${vertices[randoms[0]]}, poi)`,
+        `ShowLabel(seg, true)`,
+        `SetCaption(seg, "${height}")`,
+        `SetLineStyle(seg, 1)`,
+        `alpha = Angle(${vertices[randoms[0]]},poi ,${vertices[randoms[1]]}, Line(${vertices[randoms[0]]},poi))`,
+        `ShowLabel(alpha, false)`,
+    ];
+    const question = {
+        instruction: `Calculer l'aire du triangle ${triangle.getTriangleName()} sachant que ${sides[randoms[0]]} = $${sidesLength[randoms[0]]}$ cm et la hauteur ${vertices[randoms[0]]}${String.fromCharCode(code + 3)} = $${height}$ cm.`,
+        answer: (sidesLength[randoms[0]] * height) / 2 + '',
+        keys: [...vertices, 'equal', 'cm2'],
+        commands,
+        coords: triangle.generateCoords(),
+    };
+    return question;
+}
+exports.getTriangleArea = getTriangleArea;

package/lib/exercises/geometry/euclidean/pythagore.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"pythagore.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/pythagore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK9D,eAAO,MAAM,SAAS,EAAE,QASvB,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CAevC"}

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

@@ -0,0 +1,31 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getPythagore = exports.pythagore = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const triangles_1 = require("../../../math/geometry/triangles");
+const randint_1 = require("../../../math/utils/random/randint");
+exports.pythagore = {
+    id: 'pythagore',
+    connector: '=',
+    instruction: "Écrire l'égalité de Pythagore pour la figure suivante : ",
+    label: "Ecrire l'égalité de Pythagore",
+    levels: ['4', '3', '2'],
+    isSingleStep: false,
+    section: 'Géométrie euclidienne',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPythagore, nb),
+};
+function getPythagore() {
+    const vertices = [];
+    const code = 65 + (0, randint_1.randint)(0, 24); // Générer un code de caractère majuscule aléatoire (A-Z)
+    for (let i = 0; i < 3; i++)
+        vertices.push(String.fromCharCode(code + i));
+    const triangle = triangles_1.TriangleConstructor.createRandomRightTriangle({ minRapport: 0.7, maxRapport: 1.3, names: vertices });
+    const question = {
+        answer: `${triangle.getSideAName()}^2 = ${triangle.getSideBName()}^2 + ${triangle.getSideCName()}^2`,
+        keys: [...vertices, 'equal'],
+        commands: triangle.generateCommands({}),
+        coords: triangle.generateCoords(),
+    };
+    return question;
+}
+exports.getPythagore = getPythagore;

package/lib/exercises/geometry/euclidean/pythagoreCalcul.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"pythagoreCalcul.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/pythagoreCalcul.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO9D,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CAoD7C"}