math-exercises 2.1.21 → 2.1.23

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

@@ -1,72 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.pythagore = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const triangles_1 = require("../../../math/geometry/triangles");
-const randint_1 = require("../../../math/utils/random/randint");
-const lengthNode_1 = require("../../../tree/nodes/geometry/lengthNode");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
-const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
-const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
-const 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 sideA = triangle.getSideAName();
-    const sideB = triangle.getSideBName();
-    const sideC = triangle.getSideCName();
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(triangle.generateCommands({}), {
-        hideAxes: true,
-        hideGrid: true,
-    });
-    const answer = `${sideA}^2=${sideB}^2+${sideC}^2`;
-    const question = {
-        instruction: "Écrire l'égalité de Pythagore pour le triangle rectangle suivant : ",
-        answer,
-        keys: [...vertices, "equal"],
-        commands: ggb.commands,
-        coords: triangle.generateCoords(),
-        options: ggb.getOptions(),
-        answerFormat: "tex",
-        identifiers: { sideA, sideB, sideC },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, sideA, sideB, sideC }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `${sideA} = ${sideB} + ${sideC}`);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `${sideA}^2 = ${sideB}^2 - ${sideC}^2`);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `${sideB}^2 = ${sideA}^2 + ${sideC}^2`);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `${sideC}^2 = ${sideA}^2 + ${sideB}^2`);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `${sideA}^2 = ${sideB} + ${sideC}^2`);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `${sideA}^2 = ${sideB}^2 + ${sideC}`);
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { sideA, sideB, sideC }) => {
-    const answer = new equalNode_1.EqualNode(new powerNode_1.SquareNode(new lengthNode_1.LengthNode(sideA)), new addNode_1.AddNode(new powerNode_1.SquareNode(new lengthNode_1.LengthNode(sideB)), new powerNode_1.SquareNode(new lengthNode_1.LengthNode(sideC))));
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.pythagore = {
-    id: "pythagore",
-    connector: "=",
-    label: "Écrire l'égalité de Pythagore",
-    levels: ["4ème", "3ème", "2nde"],
-    isSingleStep: false,
-    sections: ["Théorème de Pythagore", "Géométrie euclidienne"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPythagore, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"pythagoreCalcul.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/pythagore/pythagoreCalcul.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAkGF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAarD,CAAC"}

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

@@ -1,109 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.pythagoreCalcul = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
-const triangles_1 = require("../../../math/geometry/triangles");
-const real_1 = require("../../../math/numbers/reals/real");
-const randint_1 = require("../../../math/utils/random/randint");
-const sqrtNode_1 = require("../../../tree/nodes/functions/sqrtNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const isInt_1 = require("../../../utils/isInt");
-const shuffle_1 = require("../../../utils/shuffle");
-const getPythagoreCalcul = () => {
-    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 sides = [
-        triangle.getSideCName(),
-        triangle.getSideBName(),
-        triangle.getSideAName(),
-    ];
-    const sideLengths = [
-        triangle.getSideCnumber(),
-        triangle.getSideBnumber(),
-        triangle.getSideAnumber(),
-    ].map((el) => Math.round(el / 2));
-    const zeroOrOne = (0, shuffle_1.shuffle)([0, 1]);
-    const randoms = (0, coinFlip_1.coinFlip)() ? [...zeroOrOne, 2] : [2, ...zeroOrOne];
-    // le but est d'avoir une chance sur 2 d'avoir un hépoténus et une 1 chance sur 2 d'avoir un a des 2 autres cote
-    let answer;
-    let square;
-    if (randoms[2] === 2) {
-        // cas de l'hypoténus
-        square = sideLengths[0] ** 2 + sideLengths[1] ** 2;
-    }
-    else {
-        // les deux autres cotés
-        square = sideLengths[randoms[0]] ** 2 - sideLengths[randoms[1]] ** 2;
-    }
-    const sqrt = Math.sqrt(square);
-    answer = (0, isInt_1.isInt)(sqrt) ? sqrt + "" : `\\sqrt{${square}}`;
-    const commands = [
-        ...triangle.generateCommands({
-            showLabels: [...sides, sides[randoms[2]]],
-            setCaptions: [...sideLengths.map((el) => el + ""), "?"],
-            highlightedSide: sides[randoms[2]],
-        }),
-    ];
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        hideAxes: true,
-        hideGrid: true,
-    });
-    answer = answer + "";
-    const question = {
-        instruction: `Dans le triangle $${triangle.getTriangleName()}$ rectangle en $${triangle.getRightAngle()}$, on sait que $${sides[randoms[0]]} = ${sideLengths[randoms[0]]}$ et que $${sides[randoms[1]]} = ${sideLengths[randoms[1]]}$. Calculer la longueur exacte $${sides[randoms[2]]}$.`,
-        answer,
-        keys: [...vertices, "equal"],
-        commands: ggb.commands,
-        coords: triangle.generateCoords(),
-        options: ggb.getOptions(),
-        answerFormat: "tex",
-        identifiers: { square, sideLengths },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const temp = (0, randint_1.randint)(2, 300);
-        const squareRoot = new real_1.SquareRoot(temp);
-        const wrongAnswer = Math.sqrt(temp) === Math.floor(Math.sqrt(temp))
-            ? Math.sqrt(temp).toString()
-            : squareRoot.toTree().toTex();
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { square }) => {
-    const sqrt = Math.sqrt(square);
-    const answer = (0, isInt_1.isInt)(sqrt)
-        ? new numberNode_1.NumberNode(sqrt)
-        : new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(square), { allowSimplifySqrt: true });
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.pythagoreCalcul = {
-    id: "pythagoreCalcul",
-    connector: "=",
-    label: "Utiliser le théoreme de Pythagore pour faire des calculs",
-    levels: ["4ème", "3ème", "2nde"],
-    isSingleStep: false,
-    sections: ["Théorème de Pythagore", "Géométrie euclidienne"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPythagoreCalcul, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

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

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

package/lib/exercises/geometry/thales/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/thales/index.ts"],"names":[],"mappings":"AAAA,cAAc,UAAU,CAAC;AACzB,cAAc,gBAAgB,CAAC"}

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

@@ -1,18 +0,0 @@
-"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("./thales"), exports);
-__exportStar(require("./thalesCalcul"), exports);

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

@@ -1,7 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    vertices: string[];
-};
-export declare const thales: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=thales.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"thales.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/thales/thales.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB,CAAC;AA0IF,eAAO,MAAM,MAAM,EAAE,YAAY,CAAC,WAAW,CAa5C,CAAC"}

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

@@ -1,135 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.thales = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
-const randint_1 = require("../../../math/utils/random/randint");
-const multiEqualNode_1 = require("../../../tree/nodes/equations/multiEqualNode");
-const lengthNode_1 = require("../../../tree/nodes/geometry/lengthNode");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const 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]}))`,
-        `ShowLabel(${vertices[0]}, true)`,
-        `ShowLabel(${vertices[1]}, true)`,
-        `ShowLabel(${vertices[2]}, true)`,
-        `ShowLabel(${vertices[3]}, true)`,
-        `ShowLabel(${vertices[4]}, true)`,
-    ];
-    const 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]}}`;
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        hideAxes: true,
-        hideGrid: true,
-    });
-    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,
-        keys: [...vertices, "equal"],
-        commands: ggb.commands,
-        coords: [xMin - 1, xMax + 1, yMin - 1, yMax + 1],
-        options: ggb.getOptions(),
-        answerFormat: "tex",
-        identifiers: { vertices },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, vertices }) => {
-    const propositions = [];
-    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],
-    ];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const indexRange = Array.from({ length: 8 }, (_, i) => i);
-    while (propositions.length < n) {
-        const rands = (0, shuffle_1.shuffle)(indexRange).slice(0, 6);
-        (0, exercise_1.tryToAddWrongProp)(propositions, `\\frac{${wrongQuotients[rands[0]]}}{${wrongQuotients[rands[1]]}} = 
-    \\frac{${wrongQuotients[rands[2]]}}{${wrongQuotients[rands[3]]}} = 
-    \\frac{${wrongQuotients[rands[4]]}}{${wrongQuotients[rands[5]]}}`);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { vertices }) => {
-    const lengths = [
-        new lengthNode_1.LengthNode(`${vertices[0]}${vertices[3]}`),
-        new lengthNode_1.LengthNode(`${vertices[0]}${vertices[1]}`),
-        new lengthNode_1.LengthNode(`${vertices[0]}${vertices[4]}`),
-        new lengthNode_1.LengthNode(`${vertices[0]}${vertices[2]}`),
-        new lengthNode_1.LengthNode(`${vertices[3]}${vertices[4]}`),
-        new lengthNode_1.LengthNode(`${vertices[1]}${vertices[2]}`),
-    ];
-    const fractions = [
-        new fractionNode_1.FractionNode(lengths[0], lengths[1]),
-        new fractionNode_1.FractionNode(lengths[2], lengths[3]),
-        new fractionNode_1.FractionNode(lengths[4], lengths[5]),
-    ];
-    const answers = [
-        new multiEqualNode_1.MultiEqualNode(fractions),
-        new multiEqualNode_1.MultiEqualNode(fractions.map((frac) => frac.toInversed())),
-    ];
-    const texs = [...answers[0].toAllValidTexs(), ...answers[1].toAllValidTexs()];
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.thales = {
-    id: "thales",
-    connector: "=",
-    label: "Ecrire l'égalité de Thalès",
-    levels: ["5ème", "4ème", "3ème", "2nde"],
-    isSingleStep: false,
-    sections: ["Théorème de Thalès", "Géométrie euclidienne"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getThales, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

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

@@ -1,10 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    sideLengths: number[];
-    rand: number;
-    rand2: number;
-    isAskingC: boolean;
-};
-export declare const thalesCalcul: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=thalesCalcul.d.ts.map

package/lib/exercises/geometry/thales/thalesCalcul.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"thalesCalcul.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/thales/thalesCalcul.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC;AAmLF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAalD,CAAC"}

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

@@ -1,150 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.thalesCalcul = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const randint_1 = require("../../../math/utils/random/randint");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const 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, on a $(${vertices[3]}${vertices[4]})//(${vertices[1]}${vertices[2]})$, `;
-    let statement;
-    let startStatement;
-    const isAskingC = (0, coinFlip_1.coinFlip)();
-    if (isAskingC) {
-        // 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 = new rational_1.Rational(sideLengths[2 * rand2] * sideLengths[2 * rand + 1], sideLengths[2 * rand])
-            .simplify()
-            .toTree();
-    }
-    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 = new rational_1.Rational(sideLengths[2 * rand2 + 1] * sideLengths[2 * rand], sideLengths[2 * rand + 1])
-            .simplify()
-            .toTree();
-    }
-    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]}))`,
-        `ShowLabel(${vertices[0]}, true)`,
-        `ShowLabel(${vertices[1]}, true)`,
-        `ShowLabel(${vertices[2]}, true)`,
-        `ShowLabel(${vertices[3]}, true)`,
-        `ShowLabel(${vertices[4]}, true)`,
-    ];
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        hideAxes: true,
-        hideGrid: true,
-    });
-    const answer = statement.toTex();
-    const question = {
-        instruction,
-        startStatement,
-        answer,
-        keys: [],
-        commands: ggb.commands,
-        options: ggb.getOptions(),
-        coords: [xMin - 1, xMax + 1, yMin - 1, yMax + 1],
-        answerFormat: "tex",
-        identifiers: { isAskingC, rand, rand2, sideLengths },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational((0, randint_1.randint)(2, 30), (0, randint_1.randint)(2, 30)).simplify().toTree().toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { isAskingC, rand, rand2, sideLengths }) => {
-    let answer;
-    if (isAskingC)
-        answer = new rational_1.Rational(sideLengths[2 * rand2] * sideLengths[2 * rand + 1], sideLengths[2 * rand])
-            .simplify()
-            .toTree();
-    else
-        answer = new rational_1.Rational(sideLengths[2 * rand2 + 1] * sideLengths[2 * rand], sideLengths[2 * rand + 1])
-            .simplify()
-            .toTree();
-    const texs = answer.toAllValidTexs({ allowFractionToDecimal: true });
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.thalesCalcul = {
-    id: "thalesCalcul",
-    connector: "=",
-    label: "Utiliser le théoreme de Thalès pour faire des calculs",
-    levels: ["5ème", "4ème", "3ème", "2nde"],
-    isSingleStep: false,
-    sections: ["Théorème de Thalès", "Géométrie euclidienne"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getThales, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    hasGeogebra: true,
-};

package/lib/exercises/geometry/vectors/alignementViaColinearity.d.ts

@@ -1,12 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    xA: number;
-    xB: number;
-    xC: number;
-    yA: number;
-    yB: number;
-    yC: number;
-};
-export declare const alignementViaColinearity: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=alignementViaColinearity.d.ts.map

package/lib/exercises/geometry/vectors/alignementViaColinearity.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"alignementViaColinearity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/alignementViaColinearity.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAkDF,eAAO,MAAM,wBAAwB,EAAE,YAAY,CAAC,WAAW,CAY9D,CAAC"}

package/lib/exercises/geometry/vectors/alignementViaColinearity.js

@@ -1,64 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.alignementViaColinearity = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const point_1 = require("../../../math/geometry/point");
-const vector_1 = require("../../../math/geometry/vector");
-const randint_1 = require("../../../math/utils/random/randint");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const getAlignementViaColinearityQuestion = () => {
-    const points = point_1.PointConstructor.randomDifferent(["A", "B"]);
-    const AB = vector_1.VectorConstructor.fromPoints(points[0], points[1]);
-    let C;
-    const isAligned = (0, coinFlip_1.coinFlip)();
-    const coeff = new numberNode_1.NumberNode((0, randint_1.randint)(-4, 4, [0, 1]));
-    if (isAligned) {
-        console.log("1");
-        C = AB.times(coeff).getEndPoint(points[0], "C");
-    }
-    else {
-        do {
-            console.log(`2 : ${AB.x.toTex()} et ${AB.y.toTex()}`);
-            C = point_1.PointConstructor.random("C");
-        } while (AB.isColinear(vector_1.VectorConstructor.fromPoints(points[0], C)));
-    }
-    const answer = isAligned ? "Oui" : "Non";
-    const question = {
-        answer,
-        instruction: `Soient trois points $${points[0].toTexWithCoords()}$, $${points[1].toTexWithCoords()}$ et $${C.toTexWithCoords()}$. Les points $A$, $B$ et $C$ sont-ils alignés ?`,
-        keys: [],
-        answerFormat: "raw",
-        identifiers: {
-            xA: points[0].x.evaluate({}),
-            xB: points[1].x.evaluate({}),
-            xC: C.x.evaluate({}),
-            yA: points[0].y.evaluate({}),
-            yB: points[1].y.evaluate({}),
-            yC: C.y.evaluate({}),
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer, "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "Oui", "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "Non", "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "On ne peut pas savoir", "raw");
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.alignementViaColinearity = {
-    id: "alignementViaColinearity",
-    label: "Utiliser la colinéarité pour déterminer un alignement",
-    levels: ["2nde", "1reSpé"],
-    isSingleStep: true,
-    sections: ["Vecteurs", "Droites"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAlignementViaColinearityQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    answerType: "QCM",
-};

package/lib/exercises/geometry/vectors/chasles.d.ts

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

package/lib/exercises/geometry/vectors/chasles.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"chasles.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/vectors/chasles.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AAuDF,eAAO,MAAM,OAAO,EAAE,YAAY,CAAC,WAAW,CAY7C,CAAC"}