math-exercises 2.2.6 → 2.2.8

package/lib/exercises/math/sets/intervals/inequalityToInterval.js

@@ -4,22 +4,14 @@ exports.inequalityToInterval = void 0;
 const exercise_1 = require("../../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
 const intervals_1 = require("../../../../math/sets/intervals/intervals");
-const inequationNode_1 = require("../../../../tree/nodes/inequations/inequationNode");
-const numberNode_1 = require("../../../../tree/nodes/numbers/numberNode");
 const belongsNode_1 = require("../../../../tree/nodes/sets/belongsNode");
 const variableNode_1 = require("../../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../../utils/coinFlip");
 const shuffle_1 = require("../../../../utils/shuffle");
 const getInequalityToIntervalQuestion = () => {
-    const isIntervalToInequality = (0, coinFlip_1.coinFlip)();
     const interval = intervals_1.IntervalConstructor.random();
     const inequalityString = interval.toInequality();
-    const answer = isIntervalToInequality
-        ? inequalityString
-        : `x\\in${interval.toTex()}`;
-    const instruction = isIntervalToInequality
-        ? `Soit $x \\in ${interval.toTex()}$. Traduire cette appartenance en une inégalité.`
-        : `Soit $${inequalityString}$. Traduire cette inégalité en appartenance à un intervalle.`;
+    const answer = `x\\in${interval.toTex()}`;
+    const instruction = `Soit $${inequalityString}$. Traduire cette inégalité en appartenance à un intervalle.`;
     const question = {
         answer,
         instruction: instruction,
@@ -37,100 +29,40 @@ const getInequalityToIntervalQuestion = () => {
         ],
         answerFormat: "tex",
         identifiers: {
-            isIntervalToInequality: isIntervalToInequality,
-            intervalMin: interval.min,
-            intervalMax: interval.max,
+            intervalMin: interval.min === -Infinity ? "-infty" : interval.min,
+            intervalMax: interval.max === Infinity ? "infty" : interval.max,
             intervalClosure: interval.closure,
         },
     };
     return question;
 };
-const getPropositions = (n, { answer, isIntervalToInequality, intervalClosure, intervalMax, intervalMin }) => {
+const getPropositions = (n, { answer, intervalClosure, intervalMax, intervalMin }) => {
     const reverseBracket = (bracket) => {
         return bracket === "[" ? "]" : "[";
     };
-    const switchInclusion = (symbol) => {
-        if (symbol === "\\le")
-            return "<";
-        if (symbol === "<")
-            return "\\le";
-        if (symbol === ">")
-            return "\\ge";
-        return ">";
-    };
-    const reverseInequality = (symbol) => {
-        if (symbol === "\\le")
-            return "\\ge";
-        if (symbol === "<")
-            return ">";
-        if (symbol === ">")
-            return "<";
-        return "\\le";
-    };
-    const interval = new intervals_1.Interval(intervalMin.toTree(), intervalMax.toTree(), intervalClosure);
+    const min = intervalMin === "-infty" ? -Infinity : intervalMin;
+    const max = intervalMax === "infty" ? Infinity : intervalMax;
+    const interval = new intervals_1.Interval(min.toTree(), max.toTree(), intervalClosure);
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    const xNode = new variableNode_1.VariableNode("x");
-    if (isIntervalToInequality) {
-        let wrongIneqs = [];
-        if (interval.min === -Infinity) {
-            wrongIneqs = [
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], switchInclusion(interval.rightInequalitySymbol)),
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(switchInclusion(interval.rightInequalitySymbol))),
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(interval.rightInequalitySymbol)),
-            ];
-        }
-        else if (interval.max === Infinity) {
-            wrongIneqs = [
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], switchInclusion(interval.leftInequalitySymbol)),
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(switchInclusion(interval.leftInequalitySymbol))),
-                new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(interval.leftInequalitySymbol)),
-            ];
-        }
-        else {
-            wrongIneqs = [
-                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
-                    switchInclusion(interval.leftInequalitySymbol),
-                    interval.rightInequalitySymbol,
-                ]),
-                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
-                    interval.leftInequalitySymbol,
-                    switchInclusion(interval.rightInequalitySymbol),
-                ]),
-                new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
-                    switchInclusion(interval.leftInequalitySymbol),
-                    switchInclusion(interval.rightInequalitySymbol),
-                ]),
-            ];
-        }
-        wrongIneqs.forEach((ineq) => {
-            (0, exercise_1.addWrongProp)(propositions, ineq.toTex());
-        });
-    }
-    else {
-        const wrongStatements = [
-            `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${interval.rightBracket}`,
-            `x\\in${interval.leftBracket}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
-            `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
-        ];
-        wrongStatements.forEach((ineq) => {
-            (0, exercise_1.addWrongProp)(propositions, ineq);
-        });
-    }
+    const wrongStatements = [
+        `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${interval.rightBracket}`,
+        `x\\in${interval.leftBracket}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
+        `x\\in${reverseBracket(interval.leftBracket)}${interval.insideToTex()}${reverseBracket(interval.rightBracket)}`,
+    ];
+    wrongStatements.forEach((ineq) => {
+        (0, exercise_1.addWrongProp)(propositions, ineq);
+    });
     return (0, shuffle_1.shuffle)(propositions);
 };
-const isAnswerValid = (ans, { intervalClosure, intervalMax, intervalMin, isIntervalToInequality }) => {
-    const interval = new intervals_1.Interval(intervalMin.toTree(), intervalMax.toTree(), intervalClosure).toTree();
-    console.log("int", interval.toTex());
-    const inequality = interval.toInequality();
-    const answer = isIntervalToInequality
-        ? inequality
-        : new belongsNode_1.BelongsNode(new variableNode_1.VariableNode("x"), interval, {
-            allowRawRightChildAsSolution: true,
-        });
-    console.log("ans", answer);
+const isAnswerValid = (ans, { intervalClosure, intervalMax, intervalMin }) => {
+    const min = intervalMin === "-infty" ? -Infinity : intervalMin;
+    const max = intervalMax === "infty" ? Infinity : intervalMax;
+    const interval = new intervals_1.Interval(min.toTree(), max.toTree(), intervalClosure).toTree();
+    const answer = new belongsNode_1.BelongsNode(new variableNode_1.VariableNode("x"), interval, {
+        allowRawRightChildAsSolution: true,
+    });
     const texs = answer.toAllValidTexs();
-    console.log("texs", texs);
     return texs.includes(ans);
 };
 exports.inequalityToInterval = {

package/lib/exercises/math/sets/intervals/intervalToInequality.d.ts

@@ -0,0 +1,10 @@
+import { Exercise } from "../../../../exercises/exercise";
+import { ClosureType } from "../../../../tree/nodes/sets/closure";
+type Identifiers = {
+    intervalMin: number | string;
+    intervalMax: number | string;
+    intervalClosure: ClosureType;
+};
+export declare const inequalityToInterval: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=intervalToInequality.d.ts.map

package/lib/exercises/math/sets/intervals/intervalToInequality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intervalToInequality.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalToInequality.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,0BAA0B,CAAC;AASlC,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAK5D,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,GAAG,MAAM,CAAC;IAC7B,WAAW,EAAE,MAAM,GAAG,MAAM,CAAC;IAC7B,eAAe,EAAE,WAAW,CAAC;CAC9B,CAAC;AAkIF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CActD,CAAC"}

package/lib/exercises/math/sets/intervals/intervalToInequality.js

@@ -0,0 +1,112 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.inequalityToInterval = void 0;
+const exercise_1 = require("../../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
+const intervals_1 = require("../../../../math/sets/intervals/intervals");
+const inequationNode_1 = require("../../../../tree/nodes/inequations/inequationNode");
+const numberNode_1 = require("../../../../tree/nodes/numbers/numberNode");
+const variableNode_1 = require("../../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../../utils/shuffle");
+const getIntervalToInequalityQuestion = () => {
+    const interval = intervals_1.IntervalConstructor.random();
+    const inequalityString = interval.toInequality();
+    const answer = inequalityString;
+    const instruction = `Soit $x \\in ${interval.toTex()}$. Traduire cette appartenance en une inégalité.`;
+    const question = {
+        answer,
+        instruction: instruction,
+        keys: ["x", "inf", "sup", "geq", "leq", "infty"],
+        answerFormat: "tex",
+        identifiers: {
+            intervalMin: interval.min === -Infinity ? "-infty" : interval.min,
+            intervalMax: interval.max === Infinity ? "infty" : interval.max,
+            intervalClosure: interval.closure,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, intervalClosure, intervalMax, intervalMin }) => {
+    const switchInclusion = (symbol) => {
+        if (symbol === "\\le")
+            return "<";
+        if (symbol === "<")
+            return "\\le";
+        if (symbol === ">")
+            return "\\ge";
+        return ">";
+    };
+    const reverseInequality = (symbol) => {
+        if (symbol === "\\le")
+            return "\\ge";
+        if (symbol === "<")
+            return ">";
+        if (symbol === ">")
+            return "<";
+        return "\\le";
+    };
+    const min = intervalMin === "-infty" ? -Infinity : intervalMin;
+    const max = intervalMax === "infty" ? Infinity : intervalMax;
+    const interval = new intervals_1.Interval(min.toTree(), max.toTree(), intervalClosure);
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const xNode = new variableNode_1.VariableNode("x");
+    let wrongIneqs = [];
+    if (interval.min === -Infinity) {
+        wrongIneqs = [
+            new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], switchInclusion(interval.rightInequalitySymbol)),
+            new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(switchInclusion(interval.rightInequalitySymbol))),
+            new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.max)], reverseInequality(interval.rightInequalitySymbol)),
+        ];
+    }
+    else if (interval.max === Infinity) {
+        wrongIneqs = [
+            new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], switchInclusion(interval.leftInequalitySymbol)),
+            new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], reverseInequality(switchInclusion(interval.leftInequalitySymbol))),
+            new inequationNode_1.InequationNode([xNode, new numberNode_1.NumberNode(interval.min)], interval.leftInequalitySymbol),
+        ];
+    }
+    else {
+        wrongIneqs = [
+            new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                switchInclusion(interval.leftInequalitySymbol),
+                interval.rightInequalitySymbol,
+            ]),
+            new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                interval.leftInequalitySymbol,
+                switchInclusion(interval.rightInequalitySymbol),
+            ]),
+            new inequationNode_1.InequationNode([new numberNode_1.NumberNode(interval.min), xNode, new numberNode_1.NumberNode(interval.max)], [
+                switchInclusion(interval.leftInequalitySymbol),
+                switchInclusion(interval.rightInequalitySymbol),
+            ]),
+        ];
+    }
+    wrongIneqs.forEach((ineq) => {
+        (0, exercise_1.addWrongProp)(propositions, ineq.toTex());
+    });
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { intervalClosure, intervalMax, intervalMin }) => {
+    const min = intervalMin === "-infty" ? -Infinity : intervalMin;
+    const max = intervalMax === "infty" ? Infinity : intervalMax;
+    const interval = new intervals_1.Interval(min.toTree(), max.toTree(), intervalClosure).toTree();
+    const inequality = interval.toInequality();
+    const answer = inequality;
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.inequalityToInterval = {
+    id: "intervalToInequality",
+    connector: "=",
+    label: "Traduire un intervalle en inégalité",
+    levels: ["2ndPro", "2nde", "CAP", "1reESM"],
+    isSingleStep: true,
+    sections: ["Ensembles et intervalles"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getIntervalToInequalityQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/spaceGeometry/vectors/spaceVectorCoordinatesFromPoints.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"spaceVectorCoordinatesFromPoints.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/vectors/spaceVectorCoordinatesFromPoints.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG,EAAE,CAAC;AA6CtB,eAAO,MAAM,gCAAgC,EAAE,QAAQ,CAAC,WAAW,CAelE,CAAC"}
+{"version":3,"file":"spaceVectorCoordinatesFromPoints.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/vectors/spaceVectorCoordinatesFromPoints.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG,EAAE,CAAC;AAmEtB,eAAO,MAAM,gCAAgC,EAAE,QAAQ,CAAC,WAAW,CAgBlE,CAAC"}

package/lib/exercises/math/spaceGeometry/vectors/spaceVectorCoordinatesFromPoints.js

@@ -5,6 +5,8 @@ const exercise_1 = require("../../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQuestions");
 const spacePoint_1 = require("../../../../math/geometry/spacePoint");
 const spaceVector_1 = require("../../../../math/geometry/spaceVector");
+const substractNode_1 = require("../../../../tree/nodes/operators/substractNode");
+const alignTex_1 = require("../../../../utils/alignTex");
 const getSpaceVectorCoordinatesFromPointsQuestion = () => {
     const points = spacePoint_1.SpacePointConstructor.randomDifferent(["A", "B"]);
     const vector = spaceVector_1.SpaceVectorConstructor.fromPoints(points[0], points[1]);
@@ -22,6 +24,18 @@ const getSpaceVectorCoordinatesFromPointsQuestion = () => {
             by: points[1].y.evaluate({}),
             bz: points[1].z.evaluate({}),
         },
+        hint: `Soient deux points $M(x_M;y_M;z_M)$ et $N(x_N;y_N;z_N)$, alors le vecteur $\\overrightarrow{MN}$ a pour coordonnées :
+    
+$\\overrightarrow{MN} \\begin{pmatrix} x_N - x_M \\\\ y_N - y_M \\\\ z_N - z_M \\end{pmatrix}$`,
+        correction: `Les coordonnées du vecteur $\\overrightarrow{AB}$ sont : 
+
+${(0, alignTex_1.alignTex)([
+            [
+                `\\begin{pmatrix} ${new substractNode_1.SubstractNode(points[1].x, points[0].x).toTex()} \\\\ ${new substractNode_1.SubstractNode(points[1].y, points[0].y).toTex()} \\\\ ${new substractNode_1.SubstractNode(points[1].z, points[0].z).toTex()} \\end{pmatrix}`,
+                "=",
+                vector.toCoordsTex(),
+            ],
+        ])}`,
     };
     return question;
 };
@@ -49,4 +63,5 @@ exports.spaceVectorCoordinatesFromPoints = {
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/spaceGeometry/vectors/spaceVectorNormCalculation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"spaceVectorNormCalculation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/vectors/spaceVectorNormCalculation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAWlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2CF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAa5D,CAAC"}
+{"version":3,"file":"spaceVectorNormCalculation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/vectors/spaceVectorNormCalculation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAwEF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAc5D,CAAC"}

package/lib/exercises/math/spaceGeometry/vectors/spaceVectorNormCalculation.js

@@ -6,11 +6,15 @@ const getDistinctQuestions_1 = require("../../../../exercises/utils/getDistinctQ
 const spaceVector_1 = require("../../../../math/geometry/spaceVector");
 const real_1 = require("../../../../math/numbers/reals/real");
 const sqrtNode_1 = require("../../../../tree/nodes/functions/sqrtNode");
+const addNode_1 = require("../../../../tree/nodes/operators/addNode");
+const powerNode_1 = require("../../../../tree/nodes/operators/powerNode");
+const alignTex_1 = require("../../../../utils/alignTex");
 const getSpaceVectorNormCalculationQuestion = () => {
     const u = spaceVector_1.SpaceVectorConstructor.random("u", false);
     const correctAnswer = u.getNorm();
+    const answer = correctAnswer.simplify().toTex();
     const question = {
-        answer: correctAnswer.simplify().toTex(),
+        answer,
         instruction: `Cacluler la norme du vecteur $${u.toTexWithCoords()}$`,
         keys: [],
         answerFormat: "tex",
@@ -19,6 +23,26 @@ const getSpaceVectorNormCalculationQuestion = () => {
             y: u.y.evaluate({}),
             z: u.z.evaluate({}),
         },
+        hint: "La norme d'un vecteur de l'espace est la racine carrée de la somme des carrés de ses coordonnées.",
+        correction: `La norme d'un vecteur de l'espace est la racine carrée de la somme des carrés de ses coordonnées. Ici, on a donc : 
+ 
+${(0, alignTex_1.alignTex)([
+            [
+                "\\lVert \\overrightarrow u \\rVert",
+                "=",
+                new sqrtNode_1.SqrtNode(new addNode_1.AddNode(new powerNode_1.SquareNode(u.x), new addNode_1.AddNode(new powerNode_1.SquareNode(u.y), new powerNode_1.SquareNode(u.z)))).toTex(),
+            ],
+            [
+                "",
+                "=",
+                new sqrtNode_1.SqrtNode((u.x.evaluate({}) ** 2 +
+                    u.y.evaluate({}) ** 2 +
+                    u.z.evaluate({}) ** 2).toTree()).toTex(),
+            ],
+        ])}
+
+Donc $\\lVert \\overrightarrow u \\rVert = ${answer}$.
+`,
     };
     return question;
 };
@@ -51,4 +75,5 @@ exports.spaceVectorNormCalculation = {
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/squareRoots/squareRootsSum.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"squareRootsSum.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/squareRoots/squareRootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AA+EF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAchD,CAAC"}
+{"version":3,"file":"squareRootsSum.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/squareRoots/squareRootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AA8EF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAchD,CAAC"}

package/lib/exercises/math/squareRoots/squareRootsSum.js

@@ -62,7 +62,6 @@ const isAnswerValid = (ans, { answer, a, b, c, d, y, x, z }) => {
     }
     const tree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b))).simplify();
     const texs = tree.toAllValidTexs();
-    console.log("vea SumSQRT answer: ", answer, "texs : ", texs);
     return texs.includes(ans);
 };
 exports.squareRootsSum = {

package/lib/exercises/math/suites/sequenceEvaluation.js

@@ -130,7 +130,7 @@ const isAnswerValid = (ans, { affine, termeid, termeAdd, termeMult }) => {
 };
 exports.sequenceEvaluation = {
     id: "sequenceEvaluation",
-    label: "Évaluer un terme d'une suite",
+    label: "Exprimer $u_{f(n)}$ en connaissant $u_n$",
     levels: ["1reSpé"],
     isSingleStep: true,
     sections: ["Suites"],

package/lib/exercises/math/suites/sequencePlot.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequencePlot.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/suites/sequencePlot.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,YAAY,EAAE,OAAO,CAAC;CACvB,CAAC;AAqFF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAc9C,CAAC"}
+{"version":3,"file":"sequencePlot.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/suites/sequencePlot.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,YAAY,EAAE,OAAO,CAAC;CACvB,CAAC;AA2FF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAe9C,CAAC"}

package/lib/exercises/math/suites/sequencePlot.js

@@ -16,11 +16,11 @@ const getSequencePlotQuestion = () => {
     for (let n = 0; n <= nMax; n++) {
         let u_n;
         if (isArithmetic) {
-            const noise = (0, randfloat_1.randfloat)(-1, 1, 1);
+            const noise = (0, randfloat_1.randfloat)(-2, 2, 1);
             u_n = a * n + b + noise;
         }
         else {
-            const noise = (0, randfloat_1.randfloat)(-1, 1, 1);
+            const noise = (0, randfloat_1.randfloat)(-2, 2, 1);
             u_n = b * Math.pow(a, n) + noise;
         }
         points.push([n, Math.round(u_n)]);
@@ -41,8 +41,9 @@ const getSequencePlotQuestion = () => {
         isXAxesNatural: true,
         isGridSimple: true,
     });
+    const answer = u_nValue.toString();
     const question = {
-        answer: u_nValue.toString(),
+        answer,
         instruction: `Ci-dessous est tracé un nuage de points représentant les valeurs d'une suite $(u_n)$. Quelle est la valeur de $u_{${nValue}}$ ?`,
         commands: ggb.commands,
         options: ggb.getOptions(),
@@ -55,6 +56,11 @@ const getSequencePlotQuestion = () => {
         keys: [],
         answerFormat: "raw",
         identifiers: { nValue, points, isArithmetic },
+        hint: `$u_{${nValue}}$ est l'ordonnée du point d'absicsse $${nValue}$ dans le nuage de points.`,
+        correction: `$u_{${nValue}}$ est l'ordonnée du point d'absicsse $${nValue}$ dans le nuage de points.
+
+On lit donc : $u_{${nValue}}=${answer}$.
+    `,
     };
     return question;
 };
@@ -84,4 +90,5 @@ exports.sequencePlot = {
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
+    hasHintAndCorrection: true,
 };

package/lib/exercises/pc/chemicalElements/findAtomEntitiesNumberFromMass.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"findAtomEntitiesNumberFromMass.d.ts","sourceRoot":"","sources":["../../../../src/exercises/pc/chemicalElements/findAtomEntitiesNumberFromMass.ts"],"names":[],"mappings":"AACA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAOlC,OAAO,EAAE,WAAW,EAAE,MAAM,mDAAmD,CAAC;AAMhF,KAAK,WAAW,GAAG;IACjB,UAAU,EAAE,WAAW,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAuEF,eAAO,MAAM,8BAA8B,EAAE,QAAQ,CAAC,WAAW,CAahE,CAAC"}
+{"version":3,"file":"findAtomEntitiesNumberFromMass.d.ts","sourceRoot":"","sources":["../../../../src/exercises/pc/chemicalElements/findAtomEntitiesNumberFromMass.ts"],"names":[],"mappings":"AACA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAOlC,OAAO,EAAE,WAAW,EAAE,MAAM,mDAAmD,CAAC;AAMhF,KAAK,WAAW,GAAG;IACjB,UAAU,EAAE,WAAW,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAsEF,eAAO,MAAM,8BAA8B,EAAE,QAAQ,CAAC,WAAW,CAahE,CAAC"}

package/lib/exercises/pc/chemicalElements/findAtomEntitiesNumberFromMass.js

@@ -18,7 +18,6 @@ const getFindAtomEntitiesNumberFromMassQuestion = () => {
     const sampleMassMeasure = new measure_1.Measure(sampleMass, 0, massUnits_1.MassUnit.kg);
     const atomMass = atoms_1.nucleonMass.value.times(atom.masseAtomique).toSignificant(2);
     const entitiesNumber = sampleMassMeasure.divide(atomMass).toSignificant(2);
-    console.log("entitiesNumber", entitiesNumber);
     const instruction = `Un échantillon a une masse $m = ${sampleMassMeasure.toTex()}$ ${(0, requiresApostropheBefore_1.requiresApostropheBefore)(atom.name) ? "d'" : "de "}${atom.name}. La masse d'un atome ${(0, requiresApostropheBefore_1.requiresApostropheBefore)(atom.name) ? "d'" : "de "}${atom.name} est de $${atomMass.toTex({ scientific: 2 })}$.
   Déterminer le nombre d'atomes ${(0, requiresApostropheBefore_1.requiresApostropheBefore)(atom.name) ? "d'" : "de "}${atom.name} composant l'échantillon.`;
     const question = {

package/lib/exercises/pc/energy/energyTransfer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"energyTransfer.d.ts","sourceRoot":"","sources":["../../../../src/exercises/pc/energy/energyTransfer.ts"],"names":[],"mappings":"AACA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAiEF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAahD,CAAC"}
+{"version":3,"file":"energyTransfer.d.ts","sourceRoot":"","sources":["../../../../src/exercises/pc/energy/energyTransfer.ts"],"names":[],"mappings":"AACA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAgEF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAahD,CAAC"}

package/lib/exercises/pc/energy/energyTransfer.js

@@ -49,7 +49,6 @@ const isAnswerValid = (ans, { answer, energy }) => {
     const validanswer2 = energy.toTree().toAllValidTexs();
     let latexs = [];
     latexs.push(validanswer1, ...validanswer2);
-    console.log(latexs);
     return latexs.includes(ans);
 };
 exports.energyTransfer = {

package/lib/exercises/pc/forces/gravitationalAttractionObjectHeight.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"gravitationalAttractionObjectHeight.d.ts","sourceRoot":"","sources":["../../../../src/exercises/pc/forces/gravitationalAttractionObjectHeight.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAiIF,eAAO,MAAM,mCAAmC,EAAE,QAAQ,CAAC,WAAW,CAerE,CAAC"}
+{"version":3,"file":"gravitationalAttractionObjectHeight.d.ts","sourceRoot":"","sources":["../../../../src/exercises/pc/forces/gravitationalAttractionObjectHeight.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAgIF,eAAO,MAAM,mCAAmC,EAAE,QAAQ,CAAC,WAAW,CAerE,CAAC"}

package/lib/exercises/pc/forces/gravitationalAttractionObjectHeight.js

@@ -112,7 +112,6 @@ const isAnswerValid = (ans, { answer, h }) => {
         validanswer2.toSignificant(2).toTex({ hideUnit: true }),
         validanswer3.toSignificant(2).toTex({ hideUnit: true }),
     ];
-    console.log(latexs);
     return latexs.includes(ans);
 };
 exports.gravitationalAttractionObjectHeight = {

package/lib/exercises/pc/mecanicalWaves/elongationReading.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"elongationReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/pc/mecanicalWaves/elongationReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AA6FF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAanD,CAAC"}
+{"version":3,"file":"elongationReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/pc/mecanicalWaves/elongationReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AA4FF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAanD,CAAC"}

package/lib/exercises/pc/mecanicalWaves/elongationReading.js

@@ -54,7 +54,6 @@ const isAnswerValid = (ans, { answer, amplitude, period }) => {
     const node = new multiplyNode_1.MultiplyNode(amplitude.toTree(), new cosNode_1.CosNode(new multiplyNode_1.MultiplyNode(frac, new variableNode_1.VariableNode("t"))));
     const equal = new equalNode_1.EqualNode(new variableNode_1.VariableNode("y\\left(t\\right)"), node);
     const texs = equal.toAllValidTexs({ allowRawRightChildAsSolution: true });
-    console.log(texs);
     return texs.includes(ans);
 };
 exports.elongationReading = {