math-exercises 3.0.190 → 3.0.191

package/lib/exercises/math/dataRepresentations/scatterPlot/scatterPlotInterpreting.js

@@ -0,0 +1,403 @@
+import { tryToAddWrongProp, addValidProp, propWhile, shuffleProps, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { numberVEA } from "../../../../exercises/vea/numberVEA.js";
+import { greenMain, orange, red } from "../../../../geogebra/colors.js";
+import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js";
+import { Point, PointConstructor, } from "../../../../math/geometry/point.js";
+import { randint } from "../../../../math/utils/random/randint.js";
+import { NodeConstructor, } from "../../../../tree/nodes/nodeConstructor.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { ClosureType } from "../../../../tree/nodes/sets/closure.js";
+import { IntervalNode } from "../../../../tree/nodes/sets/intervalNode.js";
+import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
+import { coinFlip } from "../../../../utils/alea/coinFlip.js";
+import { probaFlip } from "../../../../utils/alea/probaFlip.js";
+import { probaLawFlip } from "../../../../utils/alea/probaLawFlip.js";
+import { random } from "../../../../utils/alea/random.js";
+import { shuffle } from "../../../../utils/alea/shuffle.js";
+import { getCartesiansProducts } from "../../../../utils/arrays/cartesianProducts.js";
+const getComponentOfPointForStrGroupBy = (point, strGroupBy) => {
+    switch (strGroupBy) {
+        case "x":
+            return point.x;
+        case "y":
+            return point.y;
+        default:
+            throw new Error("Unsupported strGroupBy: " + strGroupBy);
+    }
+};
+const getTexCondition = (strGroupBy, nodeDataClass) => {
+    if (NodeComparator.isEqualViaSub(nodeDataClass.a, nodeDataClass.b)) {
+        return `${strGroupBy} = ${nodeDataClass.a.toTex()}`;
+    }
+    else {
+        switch (nodeDataClass.closure) {
+            case ClosureType.FF:
+                return `${nodeDataClass.a.toTex()} \\leq ${strGroupBy} \\leq ${nodeDataClass.b.toTex()}`;
+            case ClosureType.FO:
+                return `${nodeDataClass.a.toTex()} \\leq ${strGroupBy} < ${nodeDataClass.b.toTex()}`;
+            case ClosureType.OF:
+                return `${nodeDataClass.a.toTex()} < ${strGroupBy} \\leq ${nodeDataClass.b.toTex()}`;
+            case ClosureType.OO:
+                return `${nodeDataClass.a.toTex()} < ${strGroupBy} < ${nodeDataClass.b.toTex()}`;
+        }
+    }
+};
+const getInstruction = (identifiers) => {
+    const { strGroupBy, nodeIdsDataClass } = identifiers;
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    return `Si l'on considère le nuage de points ci-dessous, 
+combien y a-t-il d'éléments avec $${getTexCondition(strGroupBy, nodeDataClass)}$ ?`;
+};
+const getAnswerNode = (identifiers) => {
+    const { pointIds, strGroupBy, nodeIdsDataClass } = identifiers;
+    const arrPoint = pointIds.map((pointIds) => PointConstructor.fromIdentifiers(pointIds));
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    const count = arrPoint.filter((point) => {
+        const nodeComponent = getComponentOfPointForStrGroupBy(point, strGroupBy);
+        return nodeDataClass.includes(nodeComponent);
+    }).length;
+    return count.toTree();
+};
+const getAnswer = (identifiers) => {
+    return getAnswerNode(identifiers).toTex();
+};
+const getHint = (identifiers) => {
+    const { strGroupBy, nodeIdsDataClass } = identifiers;
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    return `Compte le nombre de points qui ont $${getTexCondition(strGroupBy, nodeDataClass)}$.`;
+};
+const getCorrection = (identifiers) => {
+    const { strGroupBy, nodeIdsDataClass } = identifiers;
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    return `On compte le nombre de points qui ont $${getTexCondition(strGroupBy, nodeDataClass)}$.
+
+Il y en a $${getAnswer(identifiers)}$.
+`;
+};
+const getCorrectionGGBOptions = (identifiers) => {
+    const { pointIds, strGroupBy, nodeIdsDataClass } = identifiers;
+    const arrPoint = pointIds.map((pointIds) => PointConstructor.fromIdentifiers(pointIds));
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    const [arrPointFiltered, arrPointDropped] = arrPoint.reduce((acc, point) => {
+        const nodeComponent = getComponentOfPointForStrGroupBy(point, strGroupBy);
+        if (nodeDataClass.includes(nodeComponent)) {
+            acc[0].push(point);
+        }
+        else {
+            acc[1].push(point);
+        }
+        return acc;
+    }, [[], []]);
+    const commands = [
+        ...[arrPointFiltered, arrPointDropped].flatMap((arrPoint, i) => arrPoint.flatMap((point) => point.toGGBCommand({
+            isFixed: true,
+            isSelectionnable: true,
+            showLabel: false,
+            size: 6,
+            style: 3,
+            color: i % 2 === 0 ? greenMain : "#000000",
+        }))),
+        ...(() => {
+            switch (strGroupBy) {
+                case "x":
+                    return [nodeDataClass].flatMap((nodeInterval, i) => {
+                        return [
+                            ...(() => {
+                                const value = nodeInterval.a.evaluate();
+                                return [
+                                    `l${i}l = Line((${value}, 0),(${value}, 1))`,
+                                    `SetColor(l${i}l, "${(() => {
+                                        switch (nodeInterval.closure) {
+                                            case ClosureType.FF:
+                                            case ClosureType.FO:
+                                                return orange;
+                                            case ClosureType.OF:
+                                            case ClosureType.OO:
+                                                return red;
+                                        }
+                                    })()}")`,
+                                ];
+                            })(),
+                            ...(() => {
+                                const value = nodeInterval.b.evaluate();
+                                return [
+                                    `l${i}h = Line((${value}, 0),(${value}, 1))`,
+                                    `SetColor(l${i}h, "${(() => {
+                                        switch (nodeInterval.closure) {
+                                            case ClosureType.FF:
+                                            case ClosureType.OF:
+                                                return orange;
+                                            case ClosureType.FO:
+                                            case ClosureType.OO:
+                                                return red;
+                                        }
+                                    })()}")`,
+                                ];
+                            })(),
+                        ];
+                    });
+                case "y":
+                    return [nodeDataClass].flatMap((nodeInterval, i) => {
+                        return [
+                            ...(() => {
+                                const value = nodeInterval.a.evaluate();
+                                return [
+                                    `l${i}l = Line((0, ${value}),(1,${value}))`,
+                                    `SetColor(l${i}l, "${(() => {
+                                        switch (nodeInterval.closure) {
+                                            case ClosureType.FF:
+                                            case ClosureType.FO:
+                                                return orange;
+                                            case ClosureType.OF:
+                                            case ClosureType.OO:
+                                                return red;
+                                        }
+                                    })()}")`,
+                                ];
+                            })(),
+                            ...(() => {
+                                const value = nodeInterval.b.evaluate();
+                                return [
+                                    `l${i}h = Line((0, ${value}),(1,${value}))`,
+                                    `SetColor(l${i}h, "${(() => {
+                                        switch (nodeInterval.closure) {
+                                            case ClosureType.FF:
+                                            case ClosureType.OF:
+                                                return orange;
+                                            case ClosureType.FO:
+                                            case ClosureType.OO:
+                                                return red;
+                                        }
+                                    })()}")`,
+                                ];
+                            })(),
+                        ];
+                    });
+                default:
+                    throw new Error("Unsupported strGroupBy: " + strGroupBy);
+            }
+        })(),
+    ];
+    const ggb = new GeogebraConstructor({
+        commands,
+        hideGrid: true,
+        fontSize: 16,
+        xAxis: {
+            showPositive: true,
+            label: "x",
+            steps: 1,
+        },
+        yAxis: {
+            showPositive: true,
+            label: "y",
+            steps: 1,
+        },
+    });
+    return ggb.getOptions({
+        coords: ggb.getAdaptedCoords({
+            xMin: -1,
+            xMax: 6,
+            yMin: -1,
+            yMax: 6,
+        }),
+    });
+};
+const getGGBOptions = (identifiers) => {
+    const { pointIds } = identifiers;
+    const arrPoint = pointIds.map((pointIds) => PointConstructor.fromIdentifiers(pointIds));
+    const commands = [
+        ...arrPoint.flatMap((point) => point.toGGBCommand({
+            isFixed: true,
+            isSelectionnable: true,
+            showLabel: false,
+            size: 5,
+            style: 3,
+        })),
+    ];
+    const ggb = new GeogebraConstructor({
+        commands,
+        hideGrid: false,
+        fontSize: 16,
+        xAxis: {
+            showPositive: true,
+            label: "x",
+            steps: 1,
+        },
+        yAxis: {
+            showPositive: true,
+            label: "y",
+            steps: 1,
+        },
+    });
+    return ggb.getOptions({
+        coords: ggb.getAdaptedCoords({
+            xMin: -1,
+            xMax: 6,
+            yMin: -1,
+            yMax: 6,
+        }),
+    });
+};
+const getPropositions = (n, { answer, ...identifiers }) => {
+    const { strGroupBy, nodeIdsDataClass } = identifiers;
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    const propositions = [];
+    addValidProp(propositions, answer);
+    const arrTerror = [answer];
+    //student: wrong groupBy
+    {
+        const identifiersWrong = {
+            ...identifiers,
+            strGroupBy: strGroupBy === "x" ? "y" : "x",
+        };
+        const texWrong = getAnswer(identifiersWrong);
+        tryToAddWrongProp(propositions, texWrong);
+        arrTerror.push(texWrong);
+    }
+    //student: wrong closure
+    {
+        [ClosureType.FF, ClosureType.FO, ClosureType.OF].forEach((closure) => {
+            const nodeDataClassWrong = new IntervalNode(nodeDataClass.a, nodeDataClass.b, closure);
+            const identifiersWrong = {
+                ...identifiers,
+                nodeIdsDataClass: nodeDataClassWrong.toIdentifiers(),
+            };
+            const texWrong = getAnswer(identifiersWrong);
+            tryToAddWrongProp(propositions, texWrong);
+            arrTerror.push(texWrong);
+        });
+    }
+    //filler
+    {
+        propWhile(propositions, n, () => {
+            const vTerrorTarget = parseInt(random(arrTerror));
+            const vTerrorAround = vTerrorTarget + randint(-5, 5);
+            if (vTerrorAround >= 0) {
+                tryToAddWrongProp(propositions, vTerrorAround.frenchify());
+            }
+        });
+    }
+    return shuffleProps(propositions, n);
+};
+const getKeys = () => {
+    return [];
+};
+const isAnswerValid = (ans, { answer }) => {
+    return numberVEA(ans, answer);
+};
+const getScatterPlotInterpretingQuestion = () => {
+    const length = 6;
+    const height = 6;
+    const arrArrDict1 = getCartesiansProducts([
+        [...Array(length).keys()].map((i) => i + 1),
+        [...Array(height).keys()].map((i) => i + 1),
+    ]).map(([x, y]) => {
+        return {
+            x,
+            y,
+            isActivated: probaFlip(0.14),
+        };
+    });
+    const arrArrDict2 = getCartesiansProducts([
+        [...Array(length - 1).keys()].map((i) => i + 1),
+        [...Array(height - 1).keys()].map((i) => i + 1),
+    ]).map(([x, y]) => {
+        return {
+            x: x + 0.333,
+            y: y + 0.333,
+            isActivated: probaFlip(0.14),
+        };
+    });
+    const arrArrDict3 = getCartesiansProducts([
+        [...Array(length - 1).keys()].map((i) => i + 1),
+        [...Array(height - 1).keys()].map((i) => i + 1),
+    ]).map(([x, y]) => {
+        return {
+            x: x + 0.666,
+            y: y + 0.666,
+            isActivated: probaFlip(0.14),
+        };
+    });
+    //at least one point should be activated
+    {
+        const dictRandom = random(arrArrDict1);
+        dictRandom.isActivated = true;
+    }
+    const arrPoint = [...arrArrDict1, ...arrArrDict2, ...arrArrDict3]
+        .filter(({ isActivated }) => isActivated)
+        .map(({ x, y }, i) => new Point(`P${i}`, x, y));
+    const strGroupBy = coinFlip() ? "x" : "y";
+    const nodeDataClass = (() => {
+        if (coinFlip()) {
+            const nodeV = randint(1, 1 + length).toTree();
+            return new IntervalNode(nodeV, nodeV, ClosureType.FF);
+        }
+        else {
+            const templateArrLengthDataClass = probaLawFlip([
+                [[1, 1, 1, 2], 0.2],
+                [[1, 2, 2], 0.4],
+                [[1, 1, 3], 0.3],
+                [[2, 3], 0.1],
+            ]);
+            const arrLengthDataClass = shuffle(templateArrLengthDataClass);
+            const arrDataClass = arrLengthDataClass.reduce((acc, lengthDataClass) => {
+                const nodeBoundLow = acc.nodeBoundLowWork;
+                const nodeBoundHigh = add(nodeBoundLow, lengthDataClass).simplify({
+                    towardsDistribute: true,
+                });
+                const closure = random([
+                    ClosureType.FF,
+                    ClosureType.FO,
+                    ClosureType.OF,
+                ]);
+                const nodeDataClass = new IntervalNode(nodeBoundLow, nodeBoundHigh, closure);
+                acc.dataClasses.push(nodeDataClass);
+                acc.nodeBoundLowWork = nodeBoundHigh;
+                return acc;
+            }, {
+                nodeBoundLowWork: (1).toTree(),
+                dataClasses: [],
+            }).dataClasses;
+            return random(arrDataClass);
+        }
+    })();
+    const identifiers = {
+        pointIds: arrPoint.map((point) => point.toIdentifiers()),
+        strGroupBy,
+        nodeIdsDataClass: nodeDataClass.toIdentifiers(),
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    return {
+        instruction: getInstruction(identifiers),
+        answer: getAnswer(identifiers),
+        answerFormat: "tex",
+        keys: getKeys(identifiers),
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+        correctionGgbOptions: getCorrectionGGBOptions(identifiers),
+        ggbOptions: getGGBOptions(identifiers),
+    };
+};
+export const scatterPlotInterpreting = {
+    id: "scatterPlotInterpreting",
+    label: "Interpréter un nuage de points",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getScatterPlotInterpretingQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    subject: "Mathématiques",
+    getAnswer,
+    isAnswerValid,
+    getPropositions,
+    getInstruction,
+    getGGBOptions,
+    hasGeogebra: true,
+    getQuestionFromIdentifiers,
+    getHint,
+    getCorrection,
+    hasHintAndCorrection: true,
+};

package/lib/exercises/math/derivation/tangent/tangentEquationFromFunctionExpression.js

@@ -254,7 +254,7 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     ]);
 };
 const getKeys = () => {
-    return [];
+    return ["x", "y", "equal"];
 };
 const isAnswerValid = (ans, { answer }) => {
     try {

package/lib/exercises/math/derivation/variations/signVarTableFromFunctionExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"signVarTableFromFunctionExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/variations/signVarTableFromFunctionExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAarC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAgM7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAkXF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAyCF,eAAO,MAAM,kCAAkC,EAAE,QAAQ,CACvD,WAAW,EACX,OAAO,CAuBR,CAAC"}
+{"version":3,"file":"signVarTableFromFunctionExpression.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/variations/signVarTableFromFunctionExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAarC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAgM7C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,eAAe,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAqXF,KAAK,OAAO,GAAG;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAyCF,eAAO,MAAM,kCAAkC,EAAE,QAAQ,CACvD,WAAW,EACX,OAAO,CAuBR,CAAC"}

package/lib/exercises/math/derivation/variations/signVarTableFromFunctionExpression.js

@@ -266,7 +266,10 @@ const getAnswerTable = (identifiers) => {
         [
             "$f'(x)$",
             "\\ ",
-            ...arrSignOutsideRoots.flatMap((sign) => [sign > 0 ? "+" : "-", "\\ "]),
+            ...arrSignOutsideRoots.flatMap((sign, i, arr) => [
+                sign > 0 ? "+" : "-",
+                i === arr.length - 1 ? "\\ " : "0",
+            ]),
         ],
         [
             "$\\ $",

package/lib/exercises/math/functions/affines/affineCompareTwoImagesFromVariations.d.ts

@@ -0,0 +1,13 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { NodeIdentifiers } from "../../../../tree/nodes/nodeConstructor.js";
+type Identifiers = {
+    nodeIdsAbscissa: NodeIdentifiers[];
+    nodeIdsSlope: NodeIdentifiers;
+    typeAbscissa: string;
+};
+type Options = {
+    typeAbscissa: string;
+};
+export declare const affineCompareTwoImagesFromVariations: Exercise<Identifiers, Options>;
+export {};
+//# sourceMappingURL=affineCompareTwoImagesFromVariations.d.ts.map

package/lib/exercises/math/functions/affines/affineCompareTwoImagesFromVariations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"affineCompareTwoImagesFromVariations.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/affines/affineCompareTwoImagesFromVariations.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAKrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAiB7C,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,eAAe,EAAE,CAAC;IACnC,YAAY,EAAE,eAAe,CAAC;IAC9B,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAwNF,KAAK,OAAO,GAAG;IACb,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAiBF,eAAO,MAAM,oCAAoC,EAAE,QAAQ,CACzD,WAAW,EACX,OAAO,CAoBR,CAAC"}

package/lib/exercises/math/functions/affines/affineCompareTwoImagesFromVariations.js

@@ -0,0 +1,205 @@
+import { GeneratorOptionTarget, GeneratorOptionType, addValidProp, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { randfloat } from "../../../../math/utils/random/randfloat.js";
+import { randint } from "../../../../math/utils/random/randint.js";
+import { NodeConstructor, } from "../../../../tree/nodes/nodeConstructor.js";
+import { substract } from "../../../../tree/nodes/operators/substractNode.js";
+import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
+import { probaLawFlip } from "../../../../utils/alea/probaLawFlip.js";
+import { zip } from "../../../../utils/arrays/arrayZip.js";
+const strTypeFFromNodeSlope = (nodeSlope) => {
+    const valueSlope = nodeSlope.evaluate();
+    if (valueSlope === 0) {
+        return "Constante";
+    }
+    else if (valueSlope > 0) {
+        return "Strictement croissante";
+    }
+    else {
+        return "Strictement décroissante";
+    }
+};
+const getInstruction = (identifiers) => {
+    const { nodeIdsAbscissa, nodeIdsSlope, typeAbscissa } = identifiers;
+    const [nodeX1, nodeX2] = nodeIdsAbscissa.map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    const [nodeX1Display, nodeX2Display] = typeAbscissa === "Nombres"
+        ? [nodeX1, nodeX2]
+        : ["a", "b"].map((varName) => new VariableNode(varName));
+    const nodeSlope = NodeConstructor.fromIdentifiers(nodeIdsSlope);
+    const strVariationsF = strTypeFFromNodeSlope(nodeSlope);
+    return `Soit $f$ une fonction affine ${strVariationsF.toLocaleLowerCase()}.
+
+${(() => {
+        switch (typeAbscissa) {
+            case "Lettres": {
+                const [nodeXDisplaySmall, nodeXDisplayBig] = zip([nodeX1Display, nodeX2Display], [nodeX1, nodeX2])
+                    .toSorted(([, node1], [_, node2]) => substract(node1, node2).evaluate())
+                    .map(([nodeXDisplay]) => nodeXDisplay);
+                return `Soient deux nombres $${nodeX1Display.toTex()}$ et $${nodeX2Display.toTex()}$ tels que : 
+
+$$
+${nodeXDisplaySmall.toTex()} < ${nodeXDisplayBig.toTex()}
+$$
+
+`;
+            }
+            default:
+                return "";
+        }
+    })()}
+    
+Comparer $f(${nodeX1Display.toTex()})$ et $f(${nodeX2Display.toTex()})$.`;
+};
+const getAnswer = (identifiers) => {
+    const { nodeIdsAbscissa, nodeIdsSlope, typeAbscissa } = identifiers;
+    const [nodeX1, nodeX2] = nodeIdsAbscissa.map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    const [nodeX1Display, nodeX2Display] = typeAbscissa === "Nombres"
+        ? [nodeX1, nodeX2]
+        : ["a", "b"].map((varName) => new VariableNode(varName));
+    const nodeSlope = NodeConstructor.fromIdentifiers(nodeIdsSlope);
+    const strVariationsF = strTypeFFromNodeSlope(nodeSlope);
+    const [nodeXDisplaySmall, nodeXDisplayBig] = zip([nodeX1Display, nodeX2Display], [nodeX1, nodeX2])
+        .toSorted(([, node1], [_, node2]) => substract(node1, node2).evaluate())
+        .map(([nodeXDisplay]) => nodeXDisplay);
+    switch (strVariationsF) {
+        case "Constante":
+            return `f(${nodeXDisplaySmall.toTex()}) = f(${nodeXDisplayBig.toTex()})`;
+        case "Strictement croissante":
+            return `f(${nodeXDisplaySmall.toTex()}) < f(${nodeXDisplayBig.toTex()})`;
+        case "Strictement décroissante":
+            return `f(${nodeXDisplaySmall.toTex()}) > f(${nodeXDisplayBig.toTex()})`;
+        default:
+            throw new Error("Unsupported strVariationsF: " + strVariationsF);
+    }
+};
+const getHint = () => {
+    return `Soit $f$ une fonction affine et $x_{1}$ et $x_{2}$ deux réels distincts tels que :
+  
+$$
+x_{1}<x_{2}
+$$
+
+Si la fonction $f$ est strictement croissante alors :
+
+$$
+f(x_{1})<f(x_{2})
+$$
+
+Si la fonction $f$ est strictement décroissante alors :
+
+$$
+f(x_{1})>f(x_{2})
+$$
+
+Si la fonction $f$ est constante alors :
+
+$$
+f(x_{1})=f(x_{2})
+$$
+
+`;
+};
+const getCorrection = (identifiers) => {
+    const { nodeIdsAbscissa, nodeIdsSlope, typeAbscissa } = identifiers;
+    const [nodeX1, nodeX2] = nodeIdsAbscissa.map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    const [nodeX1Display, nodeX2Display] = typeAbscissa === "Nombres"
+        ? [nodeX1, nodeX2]
+        : ["a", "b"].map((varName) => new VariableNode(varName));
+    const nodeSlope = NodeConstructor.fromIdentifiers(nodeIdsSlope);
+    const strVariationsF = strTypeFFromNodeSlope(nodeSlope);
+    const [nodeXDisplaySmall, nodeXDisplayBig] = zip([nodeX1Display, nodeX2Display], [nodeX1, nodeX2])
+        .toSorted(([, node1], [_, node2]) => substract(node1, node2).evaluate())
+        .map(([nodeXDisplay]) => nodeXDisplay);
+    return `$f$ est une fonction affine ${strVariationsF.toLocaleLowerCase()}.
+  
+On a : 
+
+$$
+${nodeXDisplaySmall.toTex()} < ${nodeXDisplayBig.toTex()}
+$$
+
+Par conséquent : 
+
+$$
+${getAnswer(identifiers)}
+$$
+
+`;
+};
+const getPropositions = (_n, { answer, ...identifiers }) => {
+    const { nodeIdsAbscissa, typeAbscissa } = identifiers;
+    const [nodeX1, nodeX2] = nodeIdsAbscissa.map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    const [nodeX1Display, nodeX2Display] = typeAbscissa === "Nombres"
+        ? [nodeX1, nodeX2]
+        : ["a", "b"].map((varName) => new VariableNode(varName));
+    const [nodeXDisplaySmall, nodeXDisplayBig] = zip([nodeX1Display, nodeX2Display], [nodeX1, nodeX2])
+        .toSorted(([, node1], [_, node2]) => substract(node1, node2).evaluate())
+        .map(([nodeXDisplay]) => nodeXDisplay);
+    const propositions = [];
+    ["<", ">", "="].map((strSymbol) => {
+        const tex = `f(${nodeXDisplaySmall.toTex()}) ${strSymbol} f(${nodeXDisplayBig.toTex()})`;
+        if (tex === answer) {
+            addValidProp(propositions, answer);
+        }
+        else {
+            tryToAddWrongProp(propositions, tex);
+        }
+    });
+    return propositions;
+};
+const getAffineCompareTwoImagesFromVariationsQuestion = (optsIn) => {
+    const opts = optsIn ?? optsDefault;
+    const { typeAbscissa } = opts;
+    const xA = randint(-9, 10);
+    const xB = randint(-9, 10, [xA]);
+    const slope = probaLawFlip([
+        [randfloat(0, 3, 2, [0]), 0.45],
+        [randfloat(-3, 0, 2, [0]), 0.45],
+        [0, 0.1],
+    ]);
+    const identifiers = {
+        nodeIdsAbscissa: [xA, xB].map((v) => v.toTree().toIdentifiers()),
+        nodeIdsSlope: slope.toTree().toIdentifiers(),
+        typeAbscissa,
+    };
+    return getQuestionFromIdentifiers(identifiers, opts);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    const question = {
+        instruction: getInstruction(identifiers),
+        answer: getAnswer(identifiers),
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+        answerFormat: "tex",
+        identifiers,
+    };
+    return question;
+};
+const optsDefault = {
+    typeAbscissa: "Nombres",
+};
+const options = [
+    {
+        id: "typeAbscissa",
+        label: "Type d'abscisses :",
+        target: GeneratorOptionTarget.generation,
+        type: GeneratorOptionType.select,
+        values: ["Nombres", "Lettres"],
+        defaultValue: optsDefault.typeAbscissa,
+    },
+];
+export const affineCompareTwoImagesFromVariations = {
+    id: "affineCompareTwoImagesFromVariations",
+    connector: "=",
+    label: "Comparer deux images d'une fonction affine dont on connaît le sens de variation",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getAffineCompareTwoImagesFromVariationsQuestion(opts), nb),
+    options,
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    subject: "Mathématiques",
+    hasHintAndCorrection: true,
+    getQuestionFromIdentifiers,
+    answerType: "QCU",
+};

package/lib/exercises/math/functions/affines/affineVarTableOnBoundedInterval.d.ts

@@ -0,0 +1,9 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { NodeIdentifiers } from "../../../../tree/nodes/nodeConstructor.js";
+type Identifiers = {
+    nodeIdsBounds: NodeIdentifiers[];
+    nodeIdsF: NodeIdentifiers;
+};
+export declare const affineVarTableOnBoundedInterval: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=affineVarTableOnBoundedInterval.d.ts.map

package/lib/exercises/math/functions/affines/affineVarTableOnBoundedInterval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"affineVarTableOnBoundedInterval.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/affines/affineVarTableOnBoundedInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAK7C,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,eAAe,EAAE,CAAC;IACjC,QAAQ,EAAE,eAAe,CAAC;CAC3B,CAAC;AA8KF,eAAO,MAAM,+BAA+B,EAAE,QAAQ,CAAC,WAAW,CAqBjE,CAAC"}