math-exercises 1.3.41 → 1.3.42

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

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

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

@@ -1,49 +1,49 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getSquarePerimeter = exports.squarePerimeter = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.squarePerimeter = {
-    id: 'squarePerimeter',
-    connector: '=',
-    instruction: '',
-    label: "Calculer le périmètre d'un carré",
-    levels: ['4', '3', '2'],
-    isSingleStep: false,
-    section: 'Géométrie euclidienne',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSquarePerimeter, nb),
-};
-function getSquarePerimeter() {
-    const side = (0, randint_1.randint)(1, 13);
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: side * 4 + '',
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: side * 4 + (0, randint_1.randint)(-side * 4 + 1, 14, [0]) + '',
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction: `Calculer le périmètre d'un carré de $${side}$ cm de côté.`,
-        answer: side * 4 + '',
-        getPropositions,
-    };
-    return question;
-}
-exports.getSquarePerimeter = getSquarePerimeter;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSquarePerimeter = exports.squarePerimeter = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.squarePerimeter = {
+    id: 'squarePerimeter',
+    connector: '=',
+    instruction: '',
+    label: "Calculer le périmètre d'un carré",
+    levels: ['4', '3', '2'],
+    isSingleStep: false,
+    section: 'Géométrie euclidienne',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSquarePerimeter, nb),
+};
+function getSquarePerimeter() {
+    const side = (0, randint_1.randint)(1, 13);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: side * 4 + '',
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: side * 4 + (0, randint_1.randint)(-side * 4 + 1, 14, [0]) + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: `Calculer le périmètre d'un carré de $${side}$ cm de côté.`,
+        answer: side * 4 + '',
+        getPropositions,
+    };
+    return question;
+}
+exports.getSquarePerimeter = getSquarePerimeter;

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

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

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

@@ -1,110 +1,110 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getThales = exports.thales = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.thales = {
-    id: 'thales',
-    connector: '=',
-    instruction: '',
-    label: "Ecrire l'égalité de Thalès",
-    levels: ['5', '4', '3', '2'],
-    isSingleStep: false,
-    section: 'Géométrie euclidienne',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getThales, nb),
-};
-function getThales() {
-    const vertices = [];
-    const code = 65 + (0, randint_1.randint)(0, 22); // Générer un code de caractère majuscule aléatoire (A-Z)
-    for (let i = 0; i < 5; i++)
-        vertices.push(String.fromCharCode(code + i));
-    const [xA, yA] = [(0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11)];
-    let xB, yB, xC, yC;
-    let d1, d2; // distance entre le point A et B
-    let theta = 0; // angle entre AB et AC
-    do {
-        [xB, yB, xC, yC] = [(0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11)];
-        d1 = Math.hypot(xB - xA, yB - yA); // Calculer la distance entre A et B
-        d2 = Math.hypot(xC - xA, yC - yA); // Calculer la distance entre A et C
-        theta = Math.acos(((xB - xA) * (xC - xA) + (yB - yA) * (yC - yA)) / (d1 * d2));
-    } while (!theta || theta < 0.35 || theta > 2.1 || d1 / d2 > 1.3 || d1 / d2 < 0.7);
-    const factor = (0, randint_1.randint)(-5, 6, [-2, -1, 0, 1, 2]) / 10; // facteur = AB/AE, Pour que l'affichage soit acceptable, les valeurs de factor sont +- 0.5 0.4 0.3
-    const [xD, yD] = [xA + factor * (xB - xA), yA + factor * (yB - yA)];
-    const [xE, yE] = [xA + factor * (xC - xA), yA + factor * (yC - yA)];
-    const xMin = Math.min(xA, xB, xC, xD, xE);
-    const xMax = Math.max(xA, xB, xC, xD, xE);
-    const yMin = Math.min(yA, yB, yC, yD, yE);
-    const yMax = Math.max(yA, yB, yC, yD, yE);
-    const commands = [
-        `${vertices[0]} = Point({${xA}, ${yA}})`,
-        `${vertices[1]} = Point({${xB}, ${yB}})`,
-        `${vertices[2]} = Point({${xC}, ${yC}})`,
-        `${vertices[3]} = Point(${vertices[0]}, Vector(${factor}Vector(${vertices[0]},${vertices[1]})))`,
-        `${vertices[4]} = Intersect(Line(${vertices[3]}, Line(${vertices[1]}, ${vertices[2]})) , Line(${vertices[0]}, ${vertices[2]}))`,
-        `l = Segment(${vertices[0]}, ${vertices[1]})`,
-        `i = Segment(${vertices[0]}, ${vertices[2]})`,
-        `j = Segment(${vertices[1]}, ${vertices[2]})`,
-        `k = Segment(${vertices[3]}, ${vertices[4]})`,
-        `If(${factor} < 0, Segment(${vertices[0]}, ${vertices[3]}))`,
-        `If(${factor} < 0, Segment(${vertices[0]}, ${vertices[4]}))`,
-        `ShowAxes(false)`,
-        `ShowGrid(false)`,
-        `ShowLabel(${vertices[0]}, true)`,
-        `ShowLabel(${vertices[1]}, true)`,
-        `ShowLabel(${vertices[2]}, true)`,
-        `ShowLabel(${vertices[3]}, true)`,
-        `ShowLabel(${vertices[4]}, true)`,
-    ];
-    const getPropositions = (n) => {
-        const res = [];
-        const wrongQuotients = [
-            vertices[0] + vertices[3],
-            vertices[0] + vertices[1],
-            vertices[0] + vertices[4],
-            vertices[0] + vertices[2],
-            vertices[3] + vertices[4],
-            vertices[1] + vertices[2],
-            vertices[1] + vertices[3],
-            vertices[2] + vertices[4],
-        ];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: `\\frac{${vertices[0]}${vertices[3]}}{${vertices[0]}${vertices[1]}} = 
-      \\frac{${vertices[0]}${vertices[4]}}{${vertices[0]}${vertices[2]}} = 
-      \\frac{${vertices[3]}${vertices[4]}}{${vertices[1]}${vertices[2]}}`,
-            isRightAnswer: true,
-        });
-        const indexRange = Array.from({ length: 8 }, (_, i) => i);
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const rands = (0, shuffle_1.shuffle)(indexRange).slice(0, 6);
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: `\\frac{${wrongQuotients[rands[0]]}}{${wrongQuotients[rands[1]]}} = 
-          \\frac{${wrongQuotients[rands[2]]}}{${wrongQuotients[rands[3]]}} = 
-          \\frac{${wrongQuotients[rands[4]]}}{${wrongQuotients[rands[5]]}}`,
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction: `En utilisant le théoreme de Thalès, Écrire l'égalité des quotients sachant que :$\\\\$ (${vertices[3]}${vertices[4]})//(${vertices[1]}${vertices[2]})`,
-        answer: `\\frac{${vertices[0]}${vertices[3]}}{${vertices[0]}${vertices[1]}} = 
-    \\frac{${vertices[0]}${vertices[4]}}{${vertices[0]}${vertices[2]}} = 
-    \\frac{${vertices[3]}${vertices[4]}}{${vertices[1]}${vertices[2]}}`,
-        keys: [...vertices, 'equal'],
-        commands,
-        coords: [xMin - 1, xMax + 1, yMin - 1, yMax + 1],
-        getPropositions,
-    };
-    return question;
-}
-exports.getThales = getThales;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getThales = exports.thales = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.thales = {
+    id: 'thales',
+    connector: '=',
+    instruction: '',
+    label: "Ecrire l'égalité de Thalès",
+    levels: ['5', '4', '3', '2'],
+    isSingleStep: false,
+    section: 'Géométrie euclidienne',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getThales, nb),
+};
+function getThales() {
+    const vertices = [];
+    const code = 65 + (0, randint_1.randint)(0, 22); // Générer un code de caractère majuscule aléatoire (A-Z)
+    for (let i = 0; i < 5; i++)
+        vertices.push(String.fromCharCode(code + i));
+    const [xA, yA] = [(0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11)];
+    let xB, yB, xC, yC;
+    let d1, d2; // distance entre le point A et B
+    let theta = 0; // angle entre AB et AC
+    do {
+        [xB, yB, xC, yC] = [(0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11)];
+        d1 = Math.hypot(xB - xA, yB - yA); // Calculer la distance entre A et B
+        d2 = Math.hypot(xC - xA, yC - yA); // Calculer la distance entre A et C
+        theta = Math.acos(((xB - xA) * (xC - xA) + (yB - yA) * (yC - yA)) / (d1 * d2));
+    } while (!theta || theta < 0.35 || theta > 2.1 || d1 / d2 > 1.3 || d1 / d2 < 0.7);
+    const factor = (0, randint_1.randint)(-5, 6, [-2, -1, 0, 1, 2]) / 10; // facteur = AB/AE, Pour que l'affichage soit acceptable, les valeurs de factor sont +- 0.5 0.4 0.3
+    const [xD, yD] = [xA + factor * (xB - xA), yA + factor * (yB - yA)];
+    const [xE, yE] = [xA + factor * (xC - xA), yA + factor * (yC - yA)];
+    const xMin = Math.min(xA, xB, xC, xD, xE);
+    const xMax = Math.max(xA, xB, xC, xD, xE);
+    const yMin = Math.min(yA, yB, yC, yD, yE);
+    const yMax = Math.max(yA, yB, yC, yD, yE);
+    const commands = [
+        `${vertices[0]} = Point({${xA}, ${yA}})`,
+        `${vertices[1]} = Point({${xB}, ${yB}})`,
+        `${vertices[2]} = Point({${xC}, ${yC}})`,
+        `${vertices[3]} = Point(${vertices[0]}, Vector(${factor}Vector(${vertices[0]},${vertices[1]})))`,
+        `${vertices[4]} = Intersect(Line(${vertices[3]}, Line(${vertices[1]}, ${vertices[2]})) , Line(${vertices[0]}, ${vertices[2]}))`,
+        `l = Segment(${vertices[0]}, ${vertices[1]})`,
+        `i = Segment(${vertices[0]}, ${vertices[2]})`,
+        `j = Segment(${vertices[1]}, ${vertices[2]})`,
+        `k = Segment(${vertices[3]}, ${vertices[4]})`,
+        `If(${factor} < 0, Segment(${vertices[0]}, ${vertices[3]}))`,
+        `If(${factor} < 0, Segment(${vertices[0]}, ${vertices[4]}))`,
+        `ShowAxes(false)`,
+        `ShowGrid(false)`,
+        `ShowLabel(${vertices[0]}, true)`,
+        `ShowLabel(${vertices[1]}, true)`,
+        `ShowLabel(${vertices[2]}, true)`,
+        `ShowLabel(${vertices[3]}, true)`,
+        `ShowLabel(${vertices[4]}, true)`,
+    ];
+    const getPropositions = (n) => {
+        const res = [];
+        const wrongQuotients = [
+            vertices[0] + vertices[3],
+            vertices[0] + vertices[1],
+            vertices[0] + vertices[4],
+            vertices[0] + vertices[2],
+            vertices[3] + vertices[4],
+            vertices[1] + vertices[2],
+            vertices[1] + vertices[3],
+            vertices[2] + vertices[4],
+        ];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: `\\frac{${vertices[0]}${vertices[3]}}{${vertices[0]}${vertices[1]}} = 
+      \\frac{${vertices[0]}${vertices[4]}}{${vertices[0]}${vertices[2]}} = 
+      \\frac{${vertices[3]}${vertices[4]}}{${vertices[1]}${vertices[2]}}`,
+            isRightAnswer: true,
+        });
+        const indexRange = Array.from({ length: 8 }, (_, i) => i);
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const rands = (0, shuffle_1.shuffle)(indexRange).slice(0, 6);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `\\frac{${wrongQuotients[rands[0]]}}{${wrongQuotients[rands[1]]}} = 
+          \\frac{${wrongQuotients[rands[2]]}}{${wrongQuotients[rands[3]]}} = 
+          \\frac{${wrongQuotients[rands[4]]}}{${wrongQuotients[rands[5]]}}`,
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: `En utilisant le théoreme de Thalès, Écrire l'égalité des quotients sachant que :$\\\\$ (${vertices[3]}${vertices[4]})//(${vertices[1]}${vertices[2]})`,
+        answer: `\\frac{${vertices[0]}${vertices[3]}}{${vertices[0]}${vertices[1]}} = 
+    \\frac{${vertices[0]}${vertices[4]}}{${vertices[0]}${vertices[2]}} = 
+    \\frac{${vertices[3]}${vertices[4]}}{${vertices[1]}${vertices[2]}}`,
+        keys: [...vertices, 'equal'],
+        commands,
+        coords: [xMin - 1, xMax + 1, yMin - 1, yMax + 1],
+        getPropositions,
+    };
+    return question;
+}
+exports.getThales = getThales;

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

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

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

@@ -1,129 +1,129 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getThales = exports.thalesCalcul = 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 coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.thalesCalcul = {
-    id: 'thalesCalcul',
-    connector: '=',
-    instruction: '',
-    label: 'Utiliser le théoreme de Thalès pour faire des calculs',
-    levels: ['5', '4', '3', '2'],
-    isSingleStep: false,
-    section: 'Géométrie euclidienne',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getThales, nb),
-};
-function getThales() {
-    const vertices = [];
-    const code = 65 + (0, randint_1.randint)(0, 22); // Générer un code de caractère majuscule aléatoire (A-Z)
-    for (let i = 0; i < 5; i++)
-        vertices.push(String.fromCharCode(code + i));
-    const [xA, yA] = [(0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11)];
-    let xB, yB, xC, yC;
-    let d1, d2, d3; // distance entre le point A et B
-    let theta = 0; // angle entre AB et AC
-    do {
-        [xB, yB, xC, yC] = [(0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11)];
-        d1 = Math.hypot(xB - xA, yB - yA); // Calculer la distance entre A et B
-        d2 = Math.hypot(xC - xA, yC - yA); // Calculer la distance entre A et C
-        theta = Math.acos(((xB - xA) * (xC - xA) + (yB - yA) * (yC - yA)) / (d1 * d2));
-    } while (!theta || theta < 0.35 || theta > 2.1 || d1 / d2 > 1.3 || d1 / d2 < 0.7);
-    d3 = Math.sqrt(d1 ** 2 + d2 ** 2 - 2 * d1 * d2 * Math.cos(theta)); // Calculer la distance entre C et B
-    // CB² = AB² * AC² - 2*AB*AC*cos(theta)  : pythagore généralisé
-    const factor = (0, randint_1.randint)(-5, 6, [-2, -1, 0, 1, 2]) / 10; // facteur = AB/AE, Pour que l'affichage soit acceptable, les valeurs de factor sont +- 0.5 0.4 0.3
-    const [xD, yD] = [xA + factor * (xB - xA), yA + factor * (yB - yA)];
-    const [xE, yE] = [xA + factor * (xC - xA), yA + factor * (yC - yA)];
-    const xMin = Math.min(xA, xB, xC, xD, xE);
-    const xMax = Math.max(xA, xB, xC, xD, xE);
-    const yMin = Math.min(yA, yB, yC, yD, yE);
-    const yMax = Math.max(yA, yB, yC, yD, yE);
-    // AB AC BC AD AE
-    const sides = [
-        `${vertices[0]}${vertices[1]}`,
-        `${vertices[0]}${vertices[3]}`,
-        `${vertices[0]}${vertices[2]}`,
-        `${vertices[0]}${vertices[4]}`,
-        `${vertices[1]}${vertices[2]}`,
-        `${vertices[3]}${vertices[4]}`,
-    ];
-    // round pour avoir des valeurs dans N tout en gardant les proportions pour que ça soit cohérent. sides[i] a pour longueur sideLengths[i]
-    const sideLengths = [d1, factor * d1, d2, factor * d2, d3, factor * d3].map((el) => Math.round(Math.abs(el)));
-    const rand = (0, randint_1.randint)(0, 3);
-    let rand2 = (0, randint_1.randint)(0, 3, [rand]);
-    if (sideLengths[2 * rand] === sideLengths[2 * rand2])
-        rand2 = (0, randint_1.randint)(0, 3, [rand, rand2]); // condition pour pas prendre 2 longueurs identiques
-    let instruction = `Dans la figure ci-dessous, nous avons (${vertices[3]}${vertices[4]})//(${vertices[1]}${vertices[2]}), `;
-    let statement;
-    let startStatement;
-    if ((0, coinFlip_1.coinFlip)()) {
-        // a/b = c/d on cherche c
-        instruction += `${sides[2 * rand]} = $${sideLengths[2 * rand]}$, ${sides[2 * rand + 1]} = $${sideLengths[2 * rand + 1]}$, ${sides[2 * rand2]} = $${sideLengths[2 * rand2]}$.$\\\\$Déterminer ${sides[2 * rand2 + 1]}`;
-        startStatement = `${sides[2 * rand2 + 1]}`;
-        statement = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(sideLengths[2 * rand2] * sideLengths[2 * rand + 1]), new numberNode_1.NumberNode(sideLengths[2 * rand])));
-    }
-    else {
-        // a/b = c/d on cherche d
-        instruction += `${sides[2 * rand]} = $${sideLengths[2 * rand]}$, ${sides[2 * rand + 1]} = $${sideLengths[2 * rand + 1]}$, ${sides[2 * rand2 + 1]} = $${sideLengths[2 * rand2 + 1]}$.$\\\\$Déterminer ${sides[2 * rand2]}`;
-        startStatement = `${sides[2 * rand2]}`;
-        statement = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(sideLengths[2 * rand2 + 1] * sideLengths[2 * rand]), new numberNode_1.NumberNode(sideLengths[2 * rand + 1])));
-    }
-    const commands = [
-        `${vertices[0]} = Point({${xA}, ${yA}})`,
-        `${vertices[1]} = Point({${xB}, ${yB}})`,
-        `${vertices[2]} = Point({${xC}, ${yC}})`,
-        `${vertices[3]} = Point(${vertices[0]}, Vector(${factor}Vector(${vertices[0]},${vertices[1]})))`,
-        `${vertices[4]} = Intersect(Line(${vertices[3]}, Line(${vertices[1]}, ${vertices[2]})) , Line(${vertices[0]}, ${vertices[2]}))`,
-        `l = Segment(${vertices[0]}, ${vertices[1]})`,
-        `i = Segment(${vertices[0]}, ${vertices[2]})`,
-        `j = Segment(${vertices[1]}, ${vertices[2]})`,
-        `k = Segment(${vertices[3]}, ${vertices[4]})`,
-        `If(${factor} < 0, Segment(${vertices[0]}, ${vertices[3]}))`,
-        `If(${factor} < 0, Segment(${vertices[0]}, ${vertices[4]}))`,
-        `ShowAxes(false)`,
-        `ShowGrid(false)`,
-        `ShowLabel(${vertices[0]}, true)`,
-        `ShowLabel(${vertices[1]}, true)`,
-        `ShowLabel(${vertices[2]}, true)`,
-        `ShowLabel(${vertices[3]}, true)`,
-        `ShowLabel(${vertices[4]}, true)`,
-    ];
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: statement.toTex(),
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode((0, randint_1.randint)(2, 30)), new numberNode_1.NumberNode((0, randint_1.randint)(2, 30)))).toTex(),
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        instruction,
-        startStatement,
-        answer: statement.toTex(),
-        keys: [],
-        commands,
-        coords: [xMin - 1, xMax + 1, yMin - 1, yMax + 1],
-        getPropositions,
-    };
-    return question;
-}
-exports.getThales = getThales;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getThales = exports.thalesCalcul = 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 coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.thalesCalcul = {
+    id: 'thalesCalcul',
+    connector: '=',
+    instruction: '',
+    label: 'Utiliser le théoreme de Thalès pour faire des calculs',
+    levels: ['5', '4', '3', '2'],
+    isSingleStep: false,
+    section: 'Géométrie euclidienne',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getThales, nb),
+};
+function getThales() {
+    const vertices = [];
+    const code = 65 + (0, randint_1.randint)(0, 22); // Générer un code de caractère majuscule aléatoire (A-Z)
+    for (let i = 0; i < 5; i++)
+        vertices.push(String.fromCharCode(code + i));
+    const [xA, yA] = [(0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11)];
+    let xB, yB, xC, yC;
+    let d1, d2, d3; // distance entre le point A et B
+    let theta = 0; // angle entre AB et AC
+    do {
+        [xB, yB, xC, yC] = [(0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11), (0, randint_1.randint)(-10, 11)];
+        d1 = Math.hypot(xB - xA, yB - yA); // Calculer la distance entre A et B
+        d2 = Math.hypot(xC - xA, yC - yA); // Calculer la distance entre A et C
+        theta = Math.acos(((xB - xA) * (xC - xA) + (yB - yA) * (yC - yA)) / (d1 * d2));
+    } while (!theta || theta < 0.35 || theta > 2.1 || d1 / d2 > 1.3 || d1 / d2 < 0.7);
+    d3 = Math.sqrt(d1 ** 2 + d2 ** 2 - 2 * d1 * d2 * Math.cos(theta)); // Calculer la distance entre C et B
+    // CB² = AB² * AC² - 2*AB*AC*cos(theta)  : pythagore généralisé
+    const factor = (0, randint_1.randint)(-5, 6, [-2, -1, 0, 1, 2]) / 10; // facteur = AB/AE, Pour que l'affichage soit acceptable, les valeurs de factor sont +- 0.5 0.4 0.3
+    const [xD, yD] = [xA + factor * (xB - xA), yA + factor * (yB - yA)];
+    const [xE, yE] = [xA + factor * (xC - xA), yA + factor * (yC - yA)];
+    const xMin = Math.min(xA, xB, xC, xD, xE);
+    const xMax = Math.max(xA, xB, xC, xD, xE);
+    const yMin = Math.min(yA, yB, yC, yD, yE);
+    const yMax = Math.max(yA, yB, yC, yD, yE);
+    // AB AC BC AD AE
+    const sides = [
+        `${vertices[0]}${vertices[1]}`,
+        `${vertices[0]}${vertices[3]}`,
+        `${vertices[0]}${vertices[2]}`,
+        `${vertices[0]}${vertices[4]}`,
+        `${vertices[1]}${vertices[2]}`,
+        `${vertices[3]}${vertices[4]}`,
+    ];
+    // round pour avoir des valeurs dans N tout en gardant les proportions pour que ça soit cohérent. sides[i] a pour longueur sideLengths[i]
+    const sideLengths = [d1, factor * d1, d2, factor * d2, d3, factor * d3].map((el) => Math.round(Math.abs(el)));
+    const rand = (0, randint_1.randint)(0, 3);
+    let rand2 = (0, randint_1.randint)(0, 3, [rand]);
+    if (sideLengths[2 * rand] === sideLengths[2 * rand2])
+        rand2 = (0, randint_1.randint)(0, 3, [rand, rand2]); // condition pour pas prendre 2 longueurs identiques
+    let instruction = `Dans la figure ci-dessous, nous avons (${vertices[3]}${vertices[4]})//(${vertices[1]}${vertices[2]}), `;
+    let statement;
+    let startStatement;
+    if ((0, coinFlip_1.coinFlip)()) {
+        // a/b = c/d on cherche c
+        instruction += `${sides[2 * rand]} = $${sideLengths[2 * rand]}$, ${sides[2 * rand + 1]} = $${sideLengths[2 * rand + 1]}$, ${sides[2 * rand2]} = $${sideLengths[2 * rand2]}$.$\\\\$Déterminer ${sides[2 * rand2 + 1]}`;
+        startStatement = `${sides[2 * rand2 + 1]}`;
+        statement = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(sideLengths[2 * rand2] * sideLengths[2 * rand + 1]), new numberNode_1.NumberNode(sideLengths[2 * rand])));
+    }
+    else {
+        // a/b = c/d on cherche d
+        instruction += `${sides[2 * rand]} = $${sideLengths[2 * rand]}$, ${sides[2 * rand + 1]} = $${sideLengths[2 * rand + 1]}$, ${sides[2 * rand2 + 1]} = $${sideLengths[2 * rand2 + 1]}$.$\\\\$Déterminer ${sides[2 * rand2]}`;
+        startStatement = `${sides[2 * rand2]}`;
+        statement = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(sideLengths[2 * rand2 + 1] * sideLengths[2 * rand]), new numberNode_1.NumberNode(sideLengths[2 * rand + 1])));
+    }
+    const commands = [
+        `${vertices[0]} = Point({${xA}, ${yA}})`,
+        `${vertices[1]} = Point({${xB}, ${yB}})`,
+        `${vertices[2]} = Point({${xC}, ${yC}})`,
+        `${vertices[3]} = Point(${vertices[0]}, Vector(${factor}Vector(${vertices[0]},${vertices[1]})))`,
+        `${vertices[4]} = Intersect(Line(${vertices[3]}, Line(${vertices[1]}, ${vertices[2]})) , Line(${vertices[0]}, ${vertices[2]}))`,
+        `l = Segment(${vertices[0]}, ${vertices[1]})`,
+        `i = Segment(${vertices[0]}, ${vertices[2]})`,
+        `j = Segment(${vertices[1]}, ${vertices[2]})`,
+        `k = Segment(${vertices[3]}, ${vertices[4]})`,
+        `If(${factor} < 0, Segment(${vertices[0]}, ${vertices[3]}))`,
+        `If(${factor} < 0, Segment(${vertices[0]}, ${vertices[4]}))`,
+        `ShowAxes(false)`,
+        `ShowGrid(false)`,
+        `ShowLabel(${vertices[0]}, true)`,
+        `ShowLabel(${vertices[1]}, true)`,
+        `ShowLabel(${vertices[2]}, true)`,
+        `ShowLabel(${vertices[3]}, true)`,
+        `ShowLabel(${vertices[4]}, true)`,
+    ];
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: statement.toTex(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode((0, randint_1.randint)(2, 30)), new numberNode_1.NumberNode((0, randint_1.randint)(2, 30)))).toTex(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction,
+        startStatement,
+        answer: statement.toTex(),
+        keys: [],
+        commands,
+        coords: [xMin - 1, xMax + 1, yMin - 1, yMax + 1],
+        getPropositions,
+    };
+    return question;
+}
+exports.getThales = getThales;

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

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