math-exercises 3.0.177 → 3.0.178

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

@@ -165,10 +165,10 @@ export const readExtremaAbscissFromDerivativeCurve = {
     subject: "Mathématiques",
     getHint,
     getCorrection,
+    hasHintAndCorrection: true,
     getInstruction,
     getAnswer,
     getGGBOptions,
     hasGeogebra: true,
     getQuestionFromIdentifiers,
-    hasHintAndCorrection: true,
 };

package/lib/exercises/math/functions/trinoms/sign/index.d.ts

@@ -2,4 +2,5 @@ export * from "./trinomSignFromRoots.js";
 export * from "./trinomSignFromFacto.js";
 export * from "./trinomSignTableFromAlgebraicForm.js";
 export * from "./parabolaSignTable.js";
+export * from "./signOfProductOfAffineAndTrinom.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/functions/trinoms/sign/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/sign/index.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC;AACzC,cAAc,0BAA0B,CAAC;AACzC,cAAc,uCAAuC,CAAC;AACtD,cAAc,wBAAwB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/sign/index.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC;AACzC,cAAc,0BAA0B,CAAC;AACzC,cAAc,uCAAuC,CAAC;AACtD,cAAc,wBAAwB,CAAC;AACvC,cAAc,qCAAqC,CAAC"}

package/lib/exercises/math/functions/trinoms/sign/index.js

@@ -2,3 +2,4 @@ export * from "./trinomSignFromRoots.js";
 export * from "./trinomSignFromFacto.js";
 export * from "./trinomSignTableFromAlgebraicForm.js";
 export * from "./parabolaSignTable.js";
+export * from "./signOfProductOfAffineAndTrinom.js";

package/lib/exercises/math/functions/trinoms/sign/signOfProductOfAffineAndTrinom.d.ts

@@ -0,0 +1,8 @@
+import { Exercise } from "../../../../../exercises/exercise.js";
+type Identifiers = {
+    affineCoeffs: number[];
+    trinomCoeffs: number[];
+};
+export declare const signOfProductOfAffineAndTrinom: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=signOfProductOfAffineAndTrinom.d.ts.map

package/lib/exercises/math/functions/trinoms/sign/signOfProductOfAffineAndTrinom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"signOfProductOfAffineAndTrinom.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/sign/signOfProductOfAffineAndTrinom.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AAerC,KAAK,WAAW,GAAG;IACjB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB,CAAC;AA2PF,eAAO,MAAM,8BAA8B,EAAE,QAAQ,CAAC,WAAW,CAqBhE,CAAC"}

package/lib/exercises/math/functions/trinoms/sign/signOfProductOfAffineAndTrinom.js

@@ -0,0 +1,233 @@
+import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinctQuestions.js";
+import { signTableVEA } from "../../../../../exercises/vea/signTableVEA.js";
+import { Affine, AffineConstructor } from "../../../../../math/polynomials/affine.js";
+import { Trinom, TrinomConstructor } from "../../../../../math/polynomials/trinom.js";
+import { firstDegreeInequationResolutionTex } from "../../../../../tree/nodes/inequations/inequationNode.js";
+import { MinusInfinityNode, PlusInfinityNode, } from "../../../../../tree/nodes/numbers/infiniteNode.js";
+import { multiply } from "../../../../../tree/nodes/operators/multiplyNode.js";
+import { ClosureType } from "../../../../../tree/nodes/sets/closure.js";
+import { IntervalNode } from "../../../../../tree/nodes/sets/intervalNode.js";
+import { handleVEAError } from "../../../../../utils/errors/handleVEAError.js";
+const getAnswerTable = (identifiers) => {
+    const fcts = buildFcts(identifiers);
+    const roots = [
+        fcts.affine.getRoot().toTree(),
+        ...fcts.trinom.getRootsNode(),
+    ].sort((a, b) => a.evaluate() - b.evaluate());
+    const affineRootIndex = roots.findIndex((r) => r.evaluate() === fcts.affine.getRoot().toTree().evaluate());
+    const startAffSign = fcts.affine.a > 0 ? "-" : "+";
+    const endAffSign = startAffSign === "+" ? "-" : "+";
+    const trinomSigns = fcts.trinom.a > 0 ? ["+", "-", "+"] : ["-", "+", "-"];
+    const partial = [
+        [
+            "$x$",
+            "-\\infty",
+            "\\ ",
+            roots[0].toTex(),
+            "\\ ",
+            roots[1].toTex(),
+            "\\ ",
+            roots[2].toTex(),
+            "\\ ",
+            "+\\infty",
+        ],
+        [
+            `$${fcts.affine.toTree().toTex()}$`,
+            "\\ ",
+            startAffSign,
+            affineRootIndex === 0 ? "0" : startAffSign,
+            affineRootIndex === 0 ? endAffSign : startAffSign,
+            affineRootIndex === 1
+                ? "0"
+                : affineRootIndex === 0
+                    ? endAffSign
+                    : startAffSign,
+            affineRootIndex < 2 ? endAffSign : startAffSign,
+            affineRootIndex === 2 ? "0" : endAffSign,
+            endAffSign,
+            "\\ ",
+        ],
+        [
+            `$${fcts.trinom.toTree().toTex()}$`,
+            "\\ ",
+            trinomSigns[0],
+            affineRootIndex === 0 ? trinomSigns[0] : "0",
+            affineRootIndex === 0 ? trinomSigns[0] : trinomSigns[1],
+            affineRootIndex === 1 ? trinomSigns[1] : "0",
+            affineRootIndex === 2 ? trinomSigns[2] : trinomSigns[1],
+            affineRootIndex === 2 ? trinomSigns[2] : "0",
+            trinomSigns[2],
+            "\\ ",
+        ],
+    ];
+    const buildSign = (sign1, sign2) => {
+        if (sign1 === sign2)
+            return "+";
+        return "-";
+    };
+    const thirdLine = [
+        `$${buildF(identifiers).toTex()}$`,
+        "\\ ",
+        buildSign(partial[1][2], partial[2][2]),
+        "0",
+        buildSign(partial[1][4], partial[2][4]),
+        "0",
+        buildSign(partial[1][6], partial[2][6]),
+        "0",
+        buildSign(partial[1][8], partial[2][8]),
+        "\\ ",
+    ];
+    return [...partial, thirdLine];
+};
+const buildF = (identifiers) => {
+    const { affineCoeffs, trinomCoeffs } = identifiers;
+    const affine = new Affine(affineCoeffs[1], affineCoeffs[0]);
+    const trinom = new Trinom(trinomCoeffs[2], trinomCoeffs[1], trinomCoeffs[0]);
+    return multiply(affine.toTree(), trinom.toTree());
+};
+const buildFcts = (identifiers) => {
+    const { affineCoeffs, trinomCoeffs } = identifiers;
+    const affine = new Affine(affineCoeffs[1], affineCoeffs[0]);
+    const trinom = new Trinom(trinomCoeffs[2], trinomCoeffs[1], trinomCoeffs[0]);
+    return { affine, trinom };
+};
+const getInstruction = (identifiers) => {
+    const fcts = buildFcts(identifiers);
+    return `Soit $f$ la fonction définie sur $\\mathbb{R}$ par : 
+
+$$
+f(x) = ${multiply(fcts.affine.toTree(), fcts.trinom.toTree()).toTex()}
+$$
+
+Dresser le tableau de signes de $f$.`;
+};
+const getHint = () => {
+    return `$f(x)$ est un produit de deux fonctions : une fonction affine $g$ et une fonction polynôme du second degré $h$. 
+  
+Détermine le signe de la fonction affine en résolvant l'inéquation $g(x)\\geq 0$. 
+
+Puis détermine le signe de la fonction polynôme du second degré $g$ en trouvant ses racines.
+
+Enfin, entre tes résultats dans le tableau. Le signe de $f(x)$ s'obtiendra alors en utilisant la règle des signes.`;
+};
+const getCorrection = (identifiers) => {
+    const fcts = buildFcts(identifiers);
+    const trinomRoots = fcts.trinom.getRootsNode();
+    const affRoot = fcts.affine.getRoot().toTree();
+    const allRoots = [affRoot, ...trinomRoots].sort((a, b) => a.evaluate() - b.evaluate());
+    const firstSign = fcts.affine.a * fcts.trinom.a > 0 ? "négative" : "positive";
+    const alternateSign = fcts.affine.a * fcts.trinom.a > 0 ? "positive" : "négative";
+    return `On commence par déterminer le signe de $${fcts.affine
+        .toTree()
+        .toTex()}$ : 
+  
+$$
+${firstDegreeInequationResolutionTex(fcts.affine, "\\ge", (0).toTree())}
+$$
+
+Puis, on détermine le signe de $${fcts.trinom
+        .toTree()
+        .toTex()}$. Pour cela, on calcule ses racines. On trouve $\\Delta = ${fcts.trinom
+        .getDeltaNode()
+        .toTex()}$, donc cette fonction admet deux racines : 
+
+$$
+x_1 = ${trinomRoots[0].toTex()} 
+$$
+
+et 
+
+$$
+x_2 = ${trinomRoots[1].toTex()}
+$$
+
+Cette fonction est donc ${fcts.trinom.a > 0 ? "négative" : "positive"} sur $${new IntervalNode(trinomRoots[0], trinomRoots[1], ClosureType.FF).toTex()}$, et ${fcts.trinom.a > 0 ? "positive" : "négative"} sur le reste de $\\mathbb{R}$.
+
+On note toutes ces informations dans un tableau de signes. On applique enfin la règle des signes pour trouver le signe de $f$.
+
+On en conclut que $f$ est ${firstSign} sur $${new IntervalNode(MinusInfinityNode, allRoots[0], ClosureType.OF).toTex()}$ et sur $${new IntervalNode(allRoots[1], allRoots[2], ClosureType.FF).toTex()}$, et elle est ${alternateSign} sur $${new IntervalNode(allRoots[0], allRoots[1], ClosureType.FF).toTex()}$ et sur $${new IntervalNode(allRoots[2], PlusInfinityNode, ClosureType.FO).toTex()}$.`;
+};
+const getKeys = () => {
+    return ["infty"];
+};
+const isAnswerTableValid = (ans, { answerTable }) => {
+    try {
+        return signTableVEA(ans, answerTable);
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+const getSignOfProductOfAffineAndTrinomQuestion = () => {
+    let affine;
+    let trinom;
+    do {
+        affine = AffineConstructor.randomNiceRoot();
+        trinom = TrinomConstructor.randomNiceRoots(2);
+    } while (trinom
+        .getRootsNode()
+        .some((root) => root.evaluate() === affine.getRoot().toTree().evaluate()));
+    const identifiers = {
+        affineCoeffs: affine.coefficients,
+        trinomCoeffs: trinom.coefficients,
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    const fcts = buildFcts(identifiers);
+    const f = buildF(identifiers);
+    return {
+        answerTable: getAnswerTable(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: getKeys(identifiers),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+        initTable: [
+            ["$x$", "", "\\ ", "", "\\ ", "", "\\ ", "", "\\ ", "+\\infty"],
+            [
+                `$${fcts.affine.toTree().toTex()}$`,
+                "\\ ",
+                "",
+                "",
+                "",
+                "",
+                "",
+                "",
+                "",
+                "\\ ",
+            ],
+            [
+                `$${fcts.trinom.toTree().toTex()}$`,
+                "\\ ",
+                "",
+                "",
+                "",
+                "",
+                "",
+                "",
+                "",
+                "\\ ",
+            ],
+            [`$${f.toTex()}$`, "\\ ", "", "", "", "", "", "", "", "\\ "],
+        ],
+    };
+};
+export const signOfProductOfAffineAndTrinom = {
+    id: "signOfProductOfAffineAndTrinom",
+    label: "Dresser le tableau de signes du produit d'une fonction affine et d'une fonction polynôme du second degré",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getSignOfProductOfAffineAndTrinomQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    isAnswerTableValid,
+    subject: "Mathématiques",
+    getInstruction,
+    getHint,
+    getCorrection,
+    getAnswerTable,
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+    answerType: "signTable",
+};

package/lib/exercises/math/geometry/angles/parallelogramFourthAngle.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"parallelogramFourthAngle.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/angles/parallelogramFourthAngle.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC;AA4FF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAkB1D,CAAC"}
+{"version":3,"file":"parallelogramFourthAngle.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/angles/parallelogramFourthAngle.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC;AAyFF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAkB1D,CAAC"}

package/lib/exercises/math/geometry/angles/parallelogramFourthAngle.js

@@ -6,21 +6,21 @@ import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
 const getPropositions = (n, { answer, singleAngle, doubleAngle }) => {
     const propositions = [];
     addValidProp(propositions, answer);
-    tryToAddWrongProp(propositions, `${singleAngle}^{\\circ}`);
-    tryToAddWrongProp(propositions, `${doubleAngle}^{\\circ}`);
-    tryToAddWrongProp(propositions, `${360 - singleAngle}^{\\circ}`);
-    tryToAddWrongProp(propositions, `${360 - doubleAngle}^{\\circ}`);
-    tryToAddWrongProp(propositions, `${360 - singleAngle - doubleAngle}^{\\circ}`);
-    tryToAddWrongProp(propositions, `${Math.abs(180 - 2 * singleAngle - doubleAngle)}^{\\circ}`);
+    tryToAddWrongProp(propositions, `${singleAngle}^\\circ`);
+    tryToAddWrongProp(propositions, `${doubleAngle}^\\circ`);
+    tryToAddWrongProp(propositions, `${360 - singleAngle}^\\circ`);
+    tryToAddWrongProp(propositions, `${360 - doubleAngle}^\\circ`);
+    tryToAddWrongProp(propositions, `${360 - singleAngle - doubleAngle}^\\circ`);
+    tryToAddWrongProp(propositions, `${Math.abs(180 - 2 * singleAngle - doubleAngle)}^\\circ`);
     return shuffleProps(propositions, n);
 };
 const getAnswer = (identifiers) => {
     const { singleAngle, doubleAngle } = identifiers;
     const fourthAngle = 360 - singleAngle - 2 * doubleAngle;
-    return `${fourthAngle}^{\\circ}`;
+    return `${fourthAngle}^\\circ`;
 };
 const getInstruction = (identifiers) => {
-    return `Un parallélogramme a deux angles de mesure $${identifiers.doubleAngle}^{\\circ}$ et un angle de mesure $${identifiers.singleAngle}^{\\circ}$. 
+    return `Un parallélogramme a deux angles de mesure $${identifiers.doubleAngle}^\\circ$ et un angle de mesure $${identifiers.singleAngle}^\\circ$. 
 
 Quelle est la mesure de son quatrième angle ?`;
 };
@@ -33,13 +33,13 @@ const getCorrection = (identifiers) => {
     return `La somme des angles d'un parallélogramme est égale à $360°$. Ici, la somme des trois angles connus vaut : 
   
 $$
-${singleAngle}^{\\circ} + 2\\times ${doubleAngle}^{\\circ} = ${sum}^{\\circ}
+${singleAngle}^\\circ + 2\\times ${doubleAngle}^\\circ = ${sum}^\\circ
 $$
 
 Le quatrième angle vaut donc : 
 
 $$
-360^{\\circ} - ${sum}^{\\circ} = ${singleAngle} ^{\\circ}
+360^\\circ - ${sum}^\\circ = ${singleAngle} ^\\circ
 $$`;
 };
 const isAnswerValid = (ans, { answer }) => {

package/lib/exercises/math/geometry/quadrilaterals/parallelogramAngles.js

@@ -12,11 +12,11 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     const para = ParallelogramConstructor.fromIdentifiers(identifiers.paraIdentifiers);
     const value = round(para.angles[identifiers.givenAngleIndex].evaluate(), 0);
     addValidProp(propositions, answer);
-    tryToAddWrongProp(propositions, "180^{\\circ}");
-    tryToAddWrongProp(propositions, (180 - value).frenchify() + "^{\\circ}");
-    tryToAddWrongProp(propositions, value.frenchify() + "^{\\circ}");
+    tryToAddWrongProp(propositions, "180^\\circ");
+    tryToAddWrongProp(propositions, (180 - value).frenchify() + "^\\circ");
+    tryToAddWrongProp(propositions, value.frenchify() + "^\\circ");
     propWhile(propositions, n, () => {
-        tryToAddWrongProp(propositions, randint(20, 160) + "^{\\circ}");
+        tryToAddWrongProp(propositions, randint(20, 160) + "^\\circ");
     });
     return shuffleProps(propositions, n);
 };
@@ -24,19 +24,19 @@ const getAnswer = (identifiers) => {
     const para = ParallelogramConstructor.fromIdentifiers(identifiers.paraIdentifiers);
     const value = round(para.angles[identifiers.givenAngleIndex].evaluate(), 0);
     const isOpposite = identifiers.askedAngleIndex === (identifiers.givenAngleIndex + 2) % 4;
-    return (isOpposite ? value : 180 - value).frenchify() + "^{\\circ}";
+    return (isOpposite ? value : 180 - value).frenchify() + "^\\circ";
 };
 const getInstruction = (identifiers) => {
     const para = ParallelogramConstructor.fromIdentifiers(identifiers.paraIdentifiers);
     const value = round(para.angles[identifiers.givenAngleIndex].evaluate(), 0);
     return `On considère le parallélogramme $ABCD$ ci-dessous. 
   
-L'angle $${para.angles[identifiers.givenAngleIndex].toTex()}$ vaut $${value}^{\\circ}$.
+L'angle $${para.angles[identifiers.givenAngleIndex].toTex()}$ vaut $${value}^\\circ$.
 
 Que vaut l'angle $${para.angles[identifiers.askedAngleIndex].toTex()}$ ?`;
 };
 const getHint = () => {
-    return "Dans un parallélogramme, la somme totale des angles vaut $360^{\\circ}$. Les angles opposés sont égaux, et la somme de deux angles consécutifs est égale à $180^{\\circ}$.";
+    return "Dans un parallélogramme, la somme totale des angles vaut $360^\\circ$. Les angles opposés sont égaux, et la somme de deux angles consécutifs est égale à $180^\\circ$.";
 };
 const getCorrection = (identifiers) => {
     const para = ParallelogramConstructor.fromIdentifiers(identifiers.paraIdentifiers);
@@ -51,7 +51,7 @@ On a donc :
 $$
 ${askedAngle.toTex()} = ${getAnswer(identifiers)}
 $$`
-        : `Dans un parallélogramme, la somme de deux angles consécutifs vaut $180^{\\circ}$.
+        : `Dans un parallélogramme, la somme de deux angles consécutifs vaut $180^\\circ$.
 
 Ainsi, 
 

package/lib/exercises/math/geometry/triangles/similar/isSimilarTrianglesWithAngles.js

@@ -24,8 +24,8 @@ const getInstruction = (identifiers) => {
     const { firstAngleValue, sameAngleValue, secondAngleValue, triangleNames } = identifiers;
     return `On considère deux triangles : 
   
-- le triangle $${triangleNames[0]}$, dans lequel l'angle $\\widehat{${triangleNames[0][0]}}$ a une mesure de $${sameAngleValue.frenchify()}^{\\circ}$ et l'angle $\\widehat{${triangleNames[0][1]}}$ a une mesure de $${firstAngleValue.frenchify()}^{\\circ}$ ;
-- le triangle $${triangleNames[1]}$, dans lequel l'angle $\\widehat{${triangleNames[1][0]}}$ a une mesure de $${sameAngleValue.frenchify()}^{\\circ}$ et l'angle $\\widehat{${triangleNames[1][1]}}$ a une mesure de $${secondAngleValue.frenchify()}^{\\circ}$.
+- le triangle $${triangleNames[0]}$, dans lequel l'angle $\\widehat{${triangleNames[0][0]}}$ a une mesure de $${sameAngleValue.frenchify()}^\\circ$ et l'angle $\\widehat{${triangleNames[0][1]}}$ a une mesure de $${firstAngleValue.frenchify()}^\\circ$ ;
+- le triangle $${triangleNames[1]}$, dans lequel l'angle $\\widehat{${triangleNames[1][0]}}$ a une mesure de $${sameAngleValue.frenchify()}^\\circ$ et l'angle $\\widehat{${triangleNames[1][1]}}$ a une mesure de $${secondAngleValue.frenchify()}^\\circ$.
 
 Les triangles $${triangleNames[0]}$ et $${triangleNames[1]}$ sont-ils semblables ?`;
 };
@@ -42,25 +42,25 @@ On calcule donc la mesure du troisième angle de chacun des triangles. Pour cela
 - pour le triangle $${triangleNames[0]}$, la somme des deux angles connus vaut : 
 
 $$
-${sameAngleValue.frenchify()}^{\\circ} + ${firstAngleValue.frenchify()}^{\\circ} = ${round(sameAngleValue + firstAngleValue, 4).frenchify()}^{\\circ}
+${sameAngleValue.frenchify()}^\\circ + ${firstAngleValue.frenchify()}^\\circ = ${round(sameAngleValue + firstAngleValue, 4).frenchify()}^\\circ
 $$
 
 donc le troisième angle vaut : 
 
 $$
-180 - ${round(sameAngleValue + firstAngleValue, 4).frenchify()} = ${round(180 - (sameAngleValue + firstAngleValue), 4).frenchify()}^{\\circ}
+180 - ${round(sameAngleValue + firstAngleValue, 4).frenchify()} = ${round(180 - (sameAngleValue + firstAngleValue), 4).frenchify()}^\\circ
 $$
 
 - pour le triangle $${triangleNames[1]}$, la somme des deux angles connus vaut : 
 
 $$
-${sameAngleValue.frenchify()}^{\\circ} + ${secondAngleValue.frenchify()}^{\\circ} = ${round(sameAngleValue + secondAngleValue, 4).frenchify()}^{\\circ}
+${sameAngleValue.frenchify()}^\\circ + ${secondAngleValue.frenchify()}^\\circ = ${round(sameAngleValue + secondAngleValue, 4).frenchify()}^\\circ
 $$
 
 donc le troisième angle vaut : 
 
 $$
-180 - ${round(sameAngleValue + secondAngleValue, 4).frenchify()} = ${round(180 - (sameAngleValue + secondAngleValue), 4).frenchify()}^{\\circ}
+180 - ${round(sameAngleValue + secondAngleValue, 4).frenchify()} = ${round(180 - (sameAngleValue + secondAngleValue), 4).frenchify()}^\\circ
 $$
 
 ${isSimilar

package/lib/exercises/math/geometry/triangles/triangleThirdAngleValue.js

@@ -18,10 +18,10 @@ const getPropositions = (n, { answer, angleAsked, triangleIdentifiers }) => {
         triangle.angles[(angleAsked + 2) % 3].getValueNode(true),
     ];
     const addAnglesEv = add(angles[0], angles[1]).evaluate();
-    tryToAddWrongProp(propositions, "180^{\\circ}");
-    tryToAddWrongProp(propositions, addAnglesEv.frenchify() + "^{\\circ}");
+    tryToAddWrongProp(propositions, "180^\\circ");
+    tryToAddWrongProp(propositions, addAnglesEv.frenchify() + "^\\circ");
     propWhile(propositions, n, () => {
-        tryToAddWrongProp(propositions, randint(20, 160) + "^{\\circ}");
+        tryToAddWrongProp(propositions, randint(20, 160) + "^\\circ");
     });
     return shuffleProps(propositions, n);
 };
@@ -34,7 +34,7 @@ const getAnswer = (identifiers) => {
     ];
     const addAngles = add(angles[0], angles[1]);
     const simp = addAngles.simplify();
-    return substract(180, simp).simplify().toTex() + "^{\\circ}";
+    return substract(180, simp).simplify().toTex() + "^\\circ";
 };
 const getInstruction = (identifiers) => {
     const { triangleIdentifiers, angleAsked } = identifiers;
@@ -42,10 +42,10 @@ const getInstruction = (identifiers) => {
     const angles = [
         `${triangle.angles[(angleAsked + 1) % 3].toTex()}=${triangle.angles[(angleAsked + 1) % 3]
             .getValueNode(true)
-            .toTex()}^{\\circ}`,
+            .toTex()}^\\circ`,
         `${triangle.angles[(angleAsked + 2) % 3].toTex()}=${triangle.angles[(angleAsked + 2) % 3]
             .getValueNode(true)
-            .toTex()}^{\\circ}`,
+            .toTex()}^\\circ`,
     ];
     return `Dans le triangle $${triangle.name}$ ci-dessous, on a $${angles[0]}$ et $${angles[1]}$.
     
@@ -68,13 +68,13 @@ const getCorrection = (identifiers) => {
 En additionnant les deux angles donnés dans l'énoncé, on obtient :
 
 $$
-${angles[0].toTex()}^{\\circ}  + ${angles[1].toTex()}^{\\circ} =${simp.toTex()}^{\\circ}
+${angles[0].toTex()}^\\circ  + ${angles[1].toTex()}^\\circ =${simp.toTex()}^\\circ
 $$
 
 L'angle recherché a donc une mesure de : 
 
 $$
-180^{\\circ} - ${simp.toTex()}^{\\circ}=${getAnswer(identifiers)}
+180^\\circ - ${simp.toTex()}^\\circ=${getAnswer(identifiers)}
 $$`;
 };
 const getGGBOptions = (identifiers) => {

package/lib/exercises/math/geometry/vectors/scalarProduct/alKashi/scalarProductAlKashiAngle.js

@@ -198,7 +198,7 @@ const getKeys = () => {
 };
 const isAnswerValid = (ans, { answer, ...identifiers }) => {
     const strForKeyIdDegreeReceivedFromTests = "^\\circ";
-    const strForKeyIdDegreeReceivedFromFront = "^{\\circ}"; //different from strForKeyIdDegreeSent: "^\\circ"
+    const strForKeyIdDegreeReceivedFromFront = "^\\circ"; //different from strForKeyIdDegreeSent: "^\\circ"
     const ansRefined = ans
         .replace(strForKeyIdDegreeReceivedFromTests, "")
         .replace(strForKeyIdDegreeReceivedFromFront, "");

package/lib/exercises/math/geometry/vectors/scalarProduct/alKashi/scalarProductAlKashiSideLength.js

@@ -62,7 +62,7 @@ ${triangle.sides
 
 - $${triangle.angles[indexAngle].toTexMini()} = ${triangle.angles[indexAngle]
         .evaluate()
-        .frenchify()} {}^{\\circ} $
+        .frenchify()} {}^\\circ $
   
 Calculer la longueur $${triangle.sides[indexSide].toTex()}$ (donner une valeur arrondie à $${precision}$ décimales).`;
 };
@@ -73,7 +73,7 @@ const getAnswerStuff = (identifiers) => {
     const nodeAngleInDegrees = triangle.angles[indexAngle].evaluate().toTree();
     const nodeAngleInRadians = multiply(nodeAngleInDegrees, frac(PiNode, 180));
     //"nodeStr"
-    const nodeStrLengthSquared = substract(add(power(sides[1].getLengthNode(), 2), power(sides[2].getLengthNode(), 2)), multiply(2, multiply(multiply(sides[1].getLengthNode(), sides[2].getLengthNode()), cos(multiply(nodeAngleInDegrees, "{}^{\\circ}".toTree())))));
+    const nodeStrLengthSquared = substract(add(power(sides[1].getLengthNode(), 2), power(sides[2].getLengthNode(), 2)), multiply(2, multiply(multiply(sides[1].getLengthNode(), sides[2].getLengthNode()), cos(multiply(nodeAngleInDegrees, "{}^\\circ".toTree())))));
     const nodeStrLength = sqrt(nodeStrLengthSquared.simplify());
     //"true" nodes
     const nodeLengthSquared = substract(add(power(sides[1].getLengthNode(), 2), power(sides[2].getLengthNode(), 2)), multiply(2, multiply(multiply(sides[1].getLengthNode(), sides[2].getLengthNode()), cos(nodeAngleInRadians))));

package/lib/exercises/math/geometry/vectors/scalarProduct/angleFromScalarProduct.js

@@ -17,7 +17,7 @@ const getPropositions = (n, { answer }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     propWhile(propositions, n, () => {
-        tryToAddWrongProp(propositions, randint(0, 180) + "^{\\circ}");
+        tryToAddWrongProp(propositions, randint(0, 180) + "^\\circ");
     });
     return shuffleProps(propositions, n);
 };
@@ -30,7 +30,7 @@ const getAnswer = (identifiers) => {
     const normV = v.getNorm();
     const cos = frac(ps, multiply(normU, normV)).simplify();
     const arc = round((180 * Math.acos(cos.evaluate())) / Math.PI, 0);
-    return arc.frenchify() + "^{\\circ}";
+    return arc.frenchify() + "^\\circ";
 };
 const getInstruction = (identifiers) => {
     const points = getPoints(identifiers);

package/lib/exercises/math/probaStat/randomVariable/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/probaStat/randomVariable/index.ts"],"names":[],"mappings":"AAAA,cAAc,4BAA4B,CAAC;AAC3C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,sCAAsC,CAAC;AAErD,cAAc,4CAA4C,CAAC;AAC3D,cAAc,mCAAmC,CAAC;AAClD,cAAc,oCAAoC,CAAC;AACnD,cAAc,gDAAgD,CAAC;AAC/D,cAAc,qCAAqC,CAAC;AACpD,cAAc,sCAAsC,CAAC;AACrD,cAAc,+CAA+C,CAAC;AAC9D,cAAc,6CAA6C,CAAC;AAC5D,cAAc,4CAA4C,CAAC;AAE3D,cAAc,iDAAiD,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/probaStat/randomVariable/index.ts"],"names":[],"mappings":"AAAA,cAAc,4BAA4B,CAAC;AAC3C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,sCAAsC,CAAC;AAGrD,cAAc,4CAA4C,CAAC;AAC3D,cAAc,mCAAmC,CAAC;AAClD,cAAc,oCAAoC,CAAC;AACnD,cAAc,gDAAgD,CAAC;AAC/D,cAAc,qCAAqC,CAAC;AACpD,cAAc,sCAAsC,CAAC;AACrD,cAAc,+CAA+C,CAAC;AAC9D,cAAc,6CAA6C,CAAC;AAC5D,cAAc,4CAA4C,CAAC;AAE3D,cAAc,iDAAiD,CAAC"}

package/lib/exercises/math/probaStat/randomVariable/index.js

@@ -3,6 +3,7 @@ export * from "./randomVariableVariance.js";
 export * from "./isTableProbabilityLaw.js";
 export * from "./randomVariableStandardDeviation.js";
 // export * from "./findValueForFairRandomVariable.js";
+// export * from "./findValueToMatchRandomVariableAverage.js";
 export * from "./findValueToMatchRandomVariableAverage.js";
 export * from "./calculateProbaFromVATableLaw.js";
 export * from "./randomVariableSituationValues.js";

package/lib/exercises/math/python/index.d.ts

@@ -18,4 +18,5 @@ export * from "./pythonWhileStatementCompletion.js";
 export * from "./pythonWhileStatementOperationCompletion.js";
 export * from "./pythonForLoopInstructionCompletion.js";
 export * from "./pythonSimpleFunctionInstructionCompletion.js";
+export * from "./sequences/index.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/python/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/python/index.ts"],"names":[],"mappings":"AAAA,cAAc,yBAAyB,CAAC;AACxC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,kBAAkB,CAAC;AACjC,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,2BAA2B,CAAC;AAC1C,cAAc,kBAAkB,CAAC;AACjC,cAAc,8BAA8B,CAAC;AAC7C,cAAc,wBAAwB,CAAC;AACvC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,0BAA0B,CAAC;AACzC,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,kCAAkC,CAAC;AACjD,cAAc,qCAAqC,CAAC;AACpD,cAAc,8CAA8C,CAAC;AAC7D,cAAc,yCAAyC,CAAC;AACxD,cAAc,gDAAgD,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/python/index.ts"],"names":[],"mappings":"AAAA,cAAc,yBAAyB,CAAC;AACxC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,kBAAkB,CAAC;AACjC,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,2BAA2B,CAAC;AAC1C,cAAc,kBAAkB,CAAC;AACjC,cAAc,8BAA8B,CAAC;AAC7C,cAAc,wBAAwB,CAAC;AACvC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,0BAA0B,CAAC;AACzC,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,kCAAkC,CAAC;AACjD,cAAc,qCAAqC,CAAC;AACpD,cAAc,8CAA8C,CAAC;AAC7D,cAAc,yCAAyC,CAAC;AACxD,cAAc,gDAAgD,CAAC;AAC/D,cAAc,sBAAsB,CAAC"}

package/lib/exercises/math/python/index.js

@@ -18,3 +18,4 @@ export * from "./pythonWhileStatementCompletion.js";
 export * from "./pythonWhileStatementOperationCompletion.js";
 export * from "./pythonForLoopInstructionCompletion.js";
 export * from "./pythonSimpleFunctionInstructionCompletion.js";
+export * from "./sequences/index.js";

package/lib/exercises/math/python/sequences/pySequenceThresholdInstructionCompletion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pySequenceThresholdInstructionCompletion.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/python/sequences/pySequenceThresholdInstructionCompletion.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAEL,sBAAsB,EACvB,MAAM,mDAAmD,CAAC;AAC3D,OAAO,EAEL,oBAAoB,EACrB,MAAM,iDAAiD,CAAC;AAKzD,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAkB7C,KAAK,WAAW,GAAG;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,kBAAkB,EAAE,eAAe,CAAC;IACpC,aAAa,EAAE,MAAM,CAAC;CACvB,CAAC;AAykBF,KAAK,OAAO,GAAG,sBAAsB,GACnC,oBAAoB,GAAG;IACrB,eAAe,EAAE,OAAO,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAoCJ,eAAO,MAAM,wCAAwC,EAAE,QAAQ,CAC7D,WAAW,EACX,OAAO,CAkBR,CAAC"}
+{"version":3,"file":"pySequenceThresholdInstructionCompletion.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/python/sequences/pySequenceThresholdInstructionCompletion.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAEL,sBAAsB,EACvB,MAAM,mDAAmD,CAAC;AAC3D,OAAO,EAEL,oBAAoB,EACrB,MAAM,iDAAiD,CAAC;AAKzD,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAkB7C,KAAK,WAAW,GAAG;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,kBAAkB,EAAE,eAAe,CAAC;IACpC,aAAa,EAAE,MAAM,CAAC;CACvB,CAAC;AA4kBF,KAAK,OAAO,GAAG,sBAAsB,GACnC,oBAAoB,GAAG;IACrB,eAAe,EAAE,OAAO,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAoCJ,eAAO,MAAM,wCAAwC,EAAE,QAAQ,CAC7D,WAAW,EACX,OAAO,CAkBR,CAAC"}

package/lib/exercises/math/python/sequences/pySequenceThresholdInstructionCompletion.js

@@ -122,7 +122,7 @@ const getInstruction = (identifiers, optsIn) => {
     const firstRank = opts.firstTermRankOne ? 1 : 0;
     const { isUsePythonList, typeSequence } = opts;
     const { valueLimit } = identifiers;
-    return `On considère une suite $(u_{n})$ positive, strictement croissante et ${typeSequence}.
+    return `On considère une suite $(u_{n})$ positive et strictement croissante.
 ${typeSequence === "convergente"
         ? `Sa limite vaut $${valueLimit.frenchify()}$.`
         : ``}
@@ -420,16 +420,19 @@ const getPropositions = (n, { answer, ...identifiers }, optsIn) => {
     }
     return shuffleProps(propositions, n);
 };
-const createRandomIdentifiers = (_opts) => {
+const createRandomIdentifiers = (opts) => {
     const valueThreshold = randfloat(100, 200, 1);
     const valueLimit = randfloat(0, 200, 1, [0]);
     const nodeDistanceMax = power(10, randint(-8, -1));
-    const keyIncomplete = random([
-        "strInitialization",
-        "strWhile",
-        "strLoopBody",
-        "strPrint",
-    ]);
+    // const keyIncomplete = random([
+    //   "strInitialization",
+    //   "strWhile",
+    //   "strLoopBody",
+    //   "strPrint",
+    // ]);
+    const keyIncomplete = opts.isUsePythonDef
+        ? random(["strWhile", "strPrint"])
+        : "strWhile";
     const identifiers = {
         valueThreshold,
         valueLimit,

package/lib/exercises/math/sequences/arithmetic/arithmeticFindExplicitFormulaFromTwoTerms.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFindExplicitFormulaFromTwoTerms.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticFindExplicitFormulaFromTwoTerms.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAEL,sBAAsB,EACvB,MAAM,mDAAmD,CAAC;AAiB3D,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAwOF,KAAK,OAAO,GAAG,sBAAsB,CAAC;AAMtC,eAAO,MAAM,yCAAyC,EAAE,QAAQ,CAC9D,WAAW,EACX,OAAO,CAoBR,CAAC"}
+{"version":3,"file":"arithmeticFindExplicitFormulaFromTwoTerms.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticFindExplicitFormulaFromTwoTerms.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAEL,sBAAsB,EACvB,MAAM,mDAAmD,CAAC;AAiB3D,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AA4OF,KAAK,OAAO,GAAG,sBAAsB,CAAC;AAMtC,eAAO,MAAM,yCAAyC,EAAE,QAAQ,CAC9D,WAAW,EACX,OAAO,CAoBR,CAAC"}

package/lib/exercises/math/sequences/arithmetic/arithmeticFindExplicitFormulaFromTwoTerms.js

@@ -117,10 +117,12 @@ const getPropositions = (n, { answer, ...identifiers }, optsIn) => {
 const isAnswerValid = (ans, { answer, ...identifiers }, optsIn) => {
     const opts = optsIn ?? optsDefault;
     try {
+        //TODO faire fonctionner parseAlgebraic("u_n=3+2n") (token _ not implemented)
+        const nodeAnswer = getAnswerNode(identifiers, opts);
         if (!ans.includes("=")) {
-            return false;
+            // return false;
+            ans = nodeAnswer.leftChild.toTex() + "=" + ans;
         }
-        //TODO faire fonctionner parseAlgebraic("u_n=3+2n") (token _ not implemented)
         // const nodeAns = parseAlgebraic(ans);
         const nodeAns = (() => {
             const [lhs, rhs] = ans.split("=");
@@ -131,7 +133,6 @@ const isAnswerValid = (ans, { answer, ...identifiers }, optsIn) => {
         if (!isEqualNode(nodeAns)) {
             return false;
         }
-        const nodeAnswer = getAnswerNode(identifiers, opts);
         const isValidLhs = () => nodeAns.leftChild.toTex() === nodeAnswer.leftChild.toTex();
         const isValidRhs = () => {
             const nodeAnsRhs = nodeAns.rightChild;