math-exercises 2.1.25 → 2.1.26

package/lib/exercises/functions/absolute/absoluteValueInequations.js

@@ -0,0 +1,73 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.absoluteValueInequations = 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 inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const closure_1 = require("../../../tree/nodes/sets/closure");
+const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const getAbsoluteValueInequationsQuestion = () => {
+    const poly = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10, [0]), 1]);
+    const a = (0, randint_1.randint)(1, 10);
+    //|x-b| <= a
+    const b = -poly.coefficients[0];
+    const isStrict = (0, coinFlip_1.coinFlip)();
+    const diff = new numberNode_1.NumberNode(b - a);
+    const add = new numberNode_1.NumberNode(b + a);
+    const answer = new inequationSolutionNode_1.InequationSolutionNode(new intervalNode_1.IntervalNode(diff, add, isStrict ? closure_1.ClosureType.OO : closure_1.ClosureType.FF)).toTex();
+    const question = {
+        answer,
+        instruction: `Résoudre l'inéquation $|${poly.toTree().toTex()}|${isStrict ? "<" : "\\le"}${a}$.`,
+        keys: [
+            "S",
+            "equal",
+            "lbracket",
+            "semicolon",
+            "rbracket",
+            "varnothing",
+            "x",
+            "leq",
+            "geq",
+            "sup",
+            "inf",
+        ],
+        answerFormat: "tex",
+        identifiers: { a, b, isStrict },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const diff = new numberNode_1.NumberNode(b - a);
+    const add = new numberNode_1.NumberNode(b + a);
+    (0, exercise_1.tryToAddWrongProp)(propositions, new inequationSolutionNode_1.InequationSolutionNode(new intervalNode_1.IntervalNode(diff, add, closure_1.ClosureType.OO)).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new inequationSolutionNode_1.InequationSolutionNode(new intervalNode_1.IntervalNode(diff, add, closure_1.ClosureType.FF)).toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{${b - a};${b + a}\\right\\}`);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new inequationSolutionNode_1.InequationSolutionNode(new intervalNode_1.IntervalNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 0)), new numberNode_1.NumberNode((0, randint_1.randint)(0, 10)), closure_1.ClosureType.FF)).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { a, b, isStrict }) => {
+    const answer = new inequationSolutionNode_1.InequationSolutionNode(new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(b - a), new numberNode_1.NumberNode(b + a), isStrict ? closure_1.ClosureType.OO : closure_1.ClosureType.FF));
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.absoluteValueInequations = {
+    id: "absoluteValueInequations",
+    connector: "\\iff",
+    label: "Résoudre une inéquation avec valeur absolue",
+    levels: ["2nde", "1reESM"],
+    isSingleStep: true,
+    sections: ["Valeur absolue", "Inéquations", "Ensembles et intervalles"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAbsoluteValueInequationsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/absolute/index.d.ts

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

package/lib/exercises/functions/absolute/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/absolute/index.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC"}

package/lib/exercises/functions/absolute/index.js

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

package/lib/exercises/functions/affines/affineExpressionReading.d.ts

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

package/lib/exercises/functions/affines/affineExpressionReading.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"affineExpressionReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/affineExpressionReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAelC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AA+GF,eAAO,MAAM,uBAAuB,EAAE,YAAY,CAAC,WAAW,CAc7D,CAAC"}

package/lib/exercises/functions/affines/affineExpressionReading.js

@@ -0,0 +1,97 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.affineExpressionReading = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const colors_1 = require("../../../geogebra/colors");
+const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+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 getAffineExpressionReadingQuestion = () => {
+    const b = (0, randint_1.randint)(-5, 6);
+    const secondPoint = [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6)];
+    const leadingCoeff = new rational_1.Rational(secondPoint[1] - b, secondPoint[0])
+        .simplify()
+        .toTree();
+    const answer = new equalNode_1.EqualNode(new variableNode_1.VariableNode("f(x)"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(leadingCoeff, new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(b)).simplify({ forceDistributeFractions: true, forbidFactorize: true })).toTex();
+    let xMin = Math.min(0, secondPoint[0]);
+    let xMax = Math.max(0, secondPoint[0]);
+    let yMin = Math.min(b, secondPoint[1]);
+    let yMax = Math.max(b, secondPoint[1]);
+    const commands = [
+        `l = Line((0, ${b}), (${secondPoint[0]}, ${secondPoint[1]}))`,
+        `SetColor(l, "${(0, colors_1.randomColor)()}")`,
+    ];
+    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
+        gridDistance: [1, 1],
+        isGridSimple: true,
+    });
+    const question = {
+        answer,
+        instruction: `Ci-dessous est tracée la courbe représentative d'une fonction affine $f$. Déterminer graphiquement l'expression algébrique de $f(x)$.`,
+        keys: ["fx", "equal", "x"],
+        commands: ggb.commands,
+        coords: ggb.getAdaptedCoords({ xMin, xMax, yMin, yMax }),
+        options: ggb.getOptions(),
+        answerFormat: "tex",
+        identifiers: { b, secondPoint },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, b, secondPoint }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const wrongAs = [];
+    if (secondPoint[1] - b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] - b).simplify().toTree());
+    if (secondPoint[0] !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[1] + b, secondPoint[0]).simplify().toTree());
+    if (secondPoint[1] + b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] + b).simplify().toTree());
+    if (b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[1] - secondPoint[0], b).simplify().toTree());
+    const fx = new variableNode_1.VariableNode("f(x)");
+    const x = new variableNode_1.VariableNode("x");
+    wrongAs.forEach((coeff) => {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(fx, new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(coeff, x), new numberNode_1.NumberNode(b)).simplify({
+            forceDistributeFractions: true,
+            forbidFactorize: true,
+        })).toTex());
+    });
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equalNode_1.EqualNode(fx, affine_1.AffineConstructor.random().toTree()).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, secondPoint, b }) => {
+    const leadingCoeff = new rational_1.Rational(secondPoint[1] - b, secondPoint[0])
+        .simplify()
+        .toTree();
+    const tree = new equalNode_1.EqualNode(new variableNode_1.VariableNode("f(x)"), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(leadingCoeff, new variableNode_1.VariableNode("x")), new numberNode_1.NumberNode(b)).simplify({ forceDistributeFractions: true, forbidFactorize: true }), {
+        allowFractionToDecimal: true,
+        allowMinusAnywhereInFraction: true,
+        allowRawRightChildAsSolution: true,
+    });
+    const texs = tree.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.affineExpressionReading = {
+    id: "affineExpressionReading",
+    connector: "=",
+    label: "Lire graphiquement l'expression d'une fonction affine",
+    levels: ["2nde", "1reESM", "1rePro", "1reSpé", "1reTech"],
+    isSingleStep: true,
+    sections: ["Droites", "Fonctions affines"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAffineExpressionReadingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    hasGeogebra: true,
+};

package/lib/exercises/functions/affines/index.d.ts

@@ -0,0 +1,7 @@
+export * from "./leadingCoefficient";
+export * from "./leadingCoefficientCalculV1";
+export * from "./leadingCoefficientCalculV2";
+export * from "./signFunction";
+export * from "./affineExpressionReading";
+export * from "./interceptReading";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/affines/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,8BAA8B,CAAC;AAC7C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,gBAAgB,CAAC;AAC/B,cAAc,2BAA2B,CAAC;AAC1C,cAAc,oBAAoB,CAAC"}

package/lib/exercises/functions/affines/index.js

@@ -0,0 +1,22 @@
+"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("./leadingCoefficient"), exports);
+__exportStar(require("./leadingCoefficientCalculV1"), exports);
+__exportStar(require("./leadingCoefficientCalculV2"), exports);
+__exportStar(require("./signFunction"), exports);
+__exportStar(require("./affineExpressionReading"), exports);
+__exportStar(require("./interceptReading"), exports);

package/lib/exercises/functions/affines/interceptReading.d.ts

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

package/lib/exercises/functions/affines/interceptReading.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interceptReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/interceptReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAwDF,eAAO,MAAM,gBAAgB,EAAE,YAAY,CAAC,WAAW,CActD,CAAC"}

package/lib/exercises/functions/affines/interceptReading.js

@@ -0,0 +1,68 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.interceptReading = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const colors_1 = require("../../../geogebra/colors");
+const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
+const frenchify_1 = require("../../../math/utils/latex/frenchify");
+const randint_1 = require("../../../math/utils/random/randint");
+const round_1 = require("../../../math/utils/round");
+const getInterceptReadingQuestion = () => {
+    const b = (0, randint_1.randint)(-5, 6);
+    const secondPoint = [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6)];
+    const answer = b + "";
+    let xMin = Math.min(0, secondPoint[0]);
+    let xMax = Math.max(0, secondPoint[0]);
+    let yMin = Math.min(b, secondPoint[1]);
+    let yMax = Math.max(b, secondPoint[1]);
+    const commands = [
+        `l = Line((0, ${b}), (${secondPoint[0]}, ${secondPoint[1]}))`,
+        `SetColor(l, "${(0, colors_1.randomColor)()}")`,
+    ];
+    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
+        gridDistance: [1, 1],
+        isGridSimple: true,
+    });
+    const question = {
+        answer,
+        instruction: `Ci-dessous est tracée la courbe représentative d'une fonction affine $f$. Déterminer graphiquement l'ordonnée à l'origine $b$ de la fonction $f$.`,
+        keys: [],
+        commands: ggb.commands,
+        coords: ggb.getAdaptedCoords({ xMin, xMax, yMin, yMax }),
+        options: ggb.getOptions(),
+        answerFormat: "tex",
+        identifiers: { b, secondPoint },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, b, secondPoint }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const a = (secondPoint[1] - b) / secondPoint[0];
+    if (a !== 0) {
+        const root = -b / a;
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, frenchify_1.frenchify)((0, round_1.round)(root, 2)));
+    }
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-5, 6) + "");
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, secondPoint, b }) => {
+    return ans === answer;
+};
+exports.interceptReading = {
+    id: "interceptReading",
+    connector: "=",
+    label: "Lire graphiquement l'ordonnée à l'origine",
+    levels: ["2nde", "1reESM", "1rePro", "1reSpé", "1reTech"],
+    isSingleStep: true,
+    sections: ["Droites", "Fonctions affines"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInterceptReadingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    hasGeogebra: true,
+};

package/lib/exercises/functions/affines/leadingCoefficient.d.ts

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

package/lib/exercises/functions/affines/leadingCoefficient.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leadingCoefficient.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/leadingCoefficient.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,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;CACZ,CAAC;AAuEF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAcxD,CAAC"}

package/lib/exercises/functions/affines/leadingCoefficient.js

@@ -0,0 +1,79 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.leadingCoefficient = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const colors_1 = require("../../../geogebra/colors");
+const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
+const integer_1 = require("../../../math/numbers/integer/integer");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getLeadingCoefficientQuestion = () => {
+    let xA, yA, xB, yB;
+    [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-5, 6));
+    xB = xA > 0 ? (0, randint_1.randint)(xA - 4, 6, [xA]) : (0, randint_1.randint)(-4, xA + 5, [xA]); // 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);
+    const a = new rational_1.Rational(yB - yA, xB - xA).simplify();
+    const b = a.opposite().multiply(new integer_1.Integer(xA)).add(new integer_1.Integer(yA));
+    const aTree = a.toTree();
+    const bTree = b.toTree();
+    const aString = aTree.toMathString();
+    const bString = bTree.toMathString();
+    const xMin = Math.min(xA, xB);
+    const xMax = Math.max(xA, xB);
+    const yMin = Math.min(yA, yB);
+    const yMax = Math.max(yA, yB);
+    const commands = [
+        `f(x) = (${aString}) * x + (${bString})`,
+        `SetColor(f, "${(0, colors_1.randomColor)()}")`,
+    ];
+    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
+        isGridSimple: true,
+    });
+    const answer = aTree.toTex();
+    const question = {
+        instruction: "Déterminer le coefficient directeur de la droite représentée ci-dessous : ",
+        answer,
+        keys: [],
+        commands: ggb.commands,
+        coords: ggb.getAdaptedCoords({ xMin, xMax, yMin, yMax }),
+        options: ggb.getOptions(),
+        answerFormat: "tex",
+        identifiers: { xA, xB, yA, yB },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    if (yB - yA !== 0)
+        (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(xB - xA, yB - yA).simplify().toTree().toTex());
+    while (propositions.length < n) {
+        const wrongAnswer = new numberNode_1.NumberNode((0, randint_1.randint)(-4, 5, [0]));
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
+    const leadingCoeff = new rational_1.Rational(yB - yA, xB - xA)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    const texs = leadingCoeff.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.leadingCoefficient = {
+    id: "leadingCoefficient",
+    connector: "=",
+    label: "Lire le coefficient directeur",
+    levels: ["3ème", "2nde", "1reESM", "2ndPro", "1rePro", "1reTech"],
+    isSingleStep: false,
+    sections: ["Droites", "Fonctions affines"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    hasGeogebra: true,
+};

package/lib/exercises/functions/affines/leadingCoefficientCalculV1.d.ts

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

package/lib/exercises/functions/affines/leadingCoefficientCalculV1.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leadingCoefficientCalculV1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/leadingCoefficientCalculV1.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAgDF,eAAO,MAAM,0BAA0B,EAAE,YAAY,CAAC,WAAW,CAahE,CAAC"}

package/lib/exercises/functions/affines/leadingCoefficientCalculV1.js

@@ -0,0 +1,55 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.leadingCoefficientCalculV1 = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const 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 answer = new rational_1.Rational(yB - yA, xB - xA).simplify().toTree().toTex();
+    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,
+        answerFormat: "tex",
+        keys: [],
+        identifiers: { xA, xB, yA, yB },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = new rational_1.Rational(yB - yA + (0, randint_1.randint)(-3, 4, [0]), xB - xA + (0, randint_1.randint)(-3, 4, [xA - xB]))
+            .simplify()
+            .toTree()
+            .toTex();
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
+    const answer = new rational_1.Rational(yB - yA, xB - xA)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.leadingCoefficientCalculV1 = {
+    id: "leadingCoefficientCalculV1",
+    connector: "=",
+    label: "Calculer le coefficient directeur d'une fonction affine",
+    levels: ["3ème", "2nde", "2ndPro", "1rePro", "1reTech"],
+    isSingleStep: true,
+    sections: ["Fonctions affines", "Droites"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/affines/leadingCoefficientCalculV2.d.ts

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

package/lib/exercises/functions/affines/leadingCoefficientCalculV2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leadingCoefficientCalculV2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/leadingCoefficientCalculV2.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAgDF,eAAO,MAAM,0BAA0B,EAAE,YAAY,CAAC,WAAW,CAahE,CAAC"}

package/lib/exercises/functions/affines/leadingCoefficientCalculV2.js

@@ -0,0 +1,54 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.leadingCoefficientCalculV2 = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const 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 answer = new rational_1.Rational(yB - yA, xB - xA).simplify().toTree().toTex();
+    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: answer,
+        answerFormat: "tex",
+        keys: [],
+        identifiers: { xA, xB, yA, yB },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, xA, xB, yA, yB }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const wrongAnswer = new rational_1.Rational(yB - yA + (0, randint_1.randint)(-3, 4, [0]), xB - xA + (0, randint_1.randint)(-3, 4, [xA - xB]))
+            .simplify()
+            .toTree()
+            .toTex();
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { xA, xB, yA, yB }) => {
+    const answer = new rational_1.Rational(yB - yA, xB - xA)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.leadingCoefficientCalculV2 = {
+    id: "leadingCoefficientCalculV2",
+    connector: "=",
+    label: "Coefficient directeur à l'aide de deux points",
+    levels: ["3ème", "2nde", "2ndPro", "1rePro", "1reTech"],
+    isSingleStep: false,
+    sections: ["Droites", "Fonctions affines"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLeadingCoefficientCalculV1Question, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/affines/signFunction.d.ts

@@ -0,0 +1,9 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    b: number;
+    askingPositive: boolean;
+};
+export declare const signFunction: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=signFunction.d.ts.map

package/lib/exercises/functions/affines/signFunction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"signFunction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/signFunction.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAelC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,cAAc,EAAE,OAAO,CAAC;CACzB,CAAC;AAyFF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAYlD,CAAC"}