math-exercises 3.0.167 → 3.0.169

package/lib/exercises/math/functions/trinoms/equation/secondDegreeEquationWithRightMember.js

@@ -0,0 +1,205 @@
+import { addValidProp, shuffleProps, propWhile, tryToAddWrongProp, GeneratorOptionTarget, GeneratorOptionType, } from "../../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinctQuestions.js";
+import { AffineConstructor } from "../../../../../math/polynomials/affine.js";
+import { Trinom, TrinomConstructor } from "../../../../../math/polynomials/trinom.js";
+import { randint } from "../../../../../math/utils/random/randint.js";
+import { EquationSolutionNode } from "../../../../../tree/nodes/equations/equationSolutionNode.js";
+import { opposite } from "../../../../../tree/nodes/functions/oppositeNode.js";
+import { sqrt } from "../../../../../tree/nodes/functions/sqrtNode.js";
+import { add } from "../../../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../../../tree/nodes/operators/fractionNode.js";
+import { multiply } from "../../../../../tree/nodes/operators/multiplyNode.js";
+import { square } from "../../../../../tree/nodes/operators/powerNode.js";
+import { substract } from "../../../../../tree/nodes/operators/substractNode.js";
+import { DiscreteSetNode } from "../../../../../tree/nodes/sets/discreteSetNode.js";
+import { discreteSetParser } from "../../../../../tree/parsers/discreteSetParser.js";
+import { random } from "../../../../../utils/alea/random.js";
+import { handleVEAError } from "../../../../../utils/errors/handleVEAError.js";
+import { alignTex } from "../../../../../utils/latex/alignTex.js";
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    propWhile(propositions, n, () => {
+        const trinom = TrinomConstructor.randomNiceRoots();
+        const roots = trinom.getRootsNode();
+        tryToAddWrongProp(propositions, new EquationSolutionNode(new DiscreteSetNode(roots)).toTex());
+    });
+    return shuffleProps(propositions, n);
+};
+const getAnswer = (identifiers) => {
+    const { fCoeffs, gCoeffs } = identifiers;
+    const trinom = new Trinom(fCoeffs[2] - (gCoeffs[2] ?? 0), fCoeffs[1] - gCoeffs[1], fCoeffs[0] - gCoeffs[0]);
+    const roots = trinom.getRootsNode();
+    const answer = new EquationSolutionNode(new DiscreteSetNode(roots)).toTex();
+    return answer;
+};
+const getInstruction = (identifiers) => {
+    const { fCoeffs, gCoeffs } = identifiers;
+    const f = TrinomConstructor.fromCoeffs(fCoeffs);
+    const g = gCoeffs.length === 2
+        ? AffineConstructor.fromCoeffs(gCoeffs)
+        : TrinomConstructor.fromCoeffs(gCoeffs);
+    return `Résoudre l'équation : 
+  
+$$
+${f.toTree().toTex()} = ${g.toTree().toTex()}
+$$`;
+};
+const getHint = () => {
+    return `Ramène toi à une équation du type $ax^2 + bx + c = 0$, puis résous cette équation en utilisant le discriminant.`;
+};
+const getCorrection = (identifiers) => {
+    const { fCoeffs, gCoeffs } = identifiers;
+    const f = TrinomConstructor.fromCoeffs(fCoeffs);
+    const g = gCoeffs.length === 2
+        ? AffineConstructor.fromCoeffs(gCoeffs)
+        : TrinomConstructor.fromCoeffs(gCoeffs);
+    const trinom = new Trinom(fCoeffs[2] - (gCoeffs[2] ?? 0), fCoeffs[1] - gCoeffs[1], fCoeffs[0] - gCoeffs[0]);
+    const { a, b, c } = trinom;
+    const delta = substract(square(b), multiply(4, multiply(a, c))).simplify();
+    return `On commence par passer tous les termes dans le membre de gauche : 
+  
+${alignTex([
+        [f.toTree().toTex(), "=", g.toTree().toTex()],
+        [trinom.toTree().toTex(), "=", "0"],
+    ])}
+
+On résout alors cette équation. On calcule le discriminant : 
+
+
+${alignTex([
+        ["\\Delta", "=", "b^2 - 4ac"],
+        ["", "=", substract(square(b), multiply(4, multiply(a, c))).toTex()],
+        ["", "=", delta.toTex()],
+    ])}
+
+${delta.evaluate() === 0
+        ? `Puisque $\\Delta = 0$, cette équation admet une solution $x_0$ : 
+
+${alignTex([
+            ["x_0", "=", "\\frac{-b}{2a}"],
+            ["", "=", frac(opposite(b), multiply(2, a)).toTex()],
+            ["", "=", frac(opposite(b), multiply(2, a)).simplify().toTex()],
+        ])}`
+        : `Puisque $\\Delta > 0$, l'équation $f(x)=0$ admet deux solutions : 
+
+${alignTex([
+            ["x_1", "=", "\\frac{-b-\\sqrt{\\Delta}}{2a}"],
+            ["", "=", frac(substract(opposite(b), sqrt(delta)), multiply(2, a)).toTex()],
+            [
+                "",
+                "=",
+                frac(substract(opposite(b), sqrt(delta)), multiply(2, a))
+                    .simplify()
+                    .toTex(),
+            ],
+        ])}
+
+${alignTex([
+            ["x_2", "=", "\\frac{-b+\\sqrt{\\Delta}}{2a}"],
+            ["", "=", frac(add(opposite(b), sqrt(delta)), multiply(2, a)).toTex()],
+            [
+                "",
+                "=",
+                frac(add(opposite(b), sqrt(delta)), multiply(2, a))
+                    .simplify()
+                    .toTex(),
+            ],
+        ])}`}
+
+L'ensemble des solutions est donc : 
+
+$$
+${getAnswer(identifiers)}
+$$
+`;
+};
+const getKeys = () => {
+    return ["S", "equal", "lbrace", "semicolon", "rbrace", "varnothing"];
+};
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        const parsed = discreteSetParser(ans);
+        if (!parsed)
+            return false;
+        return ("S=" + parsed.simplify({ decimalToFractions: true }).toTex() === answer);
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+const getSecondDegreeEquationWithRightMemberQuestion = (opts) => {
+    const trinom = TrinomConstructor.randomNiceRoots(randint(1, 3));
+    const gType = opts?.gType === "Affine"
+        ? "Affine"
+        : opts?.gType === "Trinôme"
+            ? "Trinôme"
+            : random(["Affine", "Trinôme"]);
+    let fCoeffs;
+    let gCoeffs;
+    if (gType === "Affine") {
+        fCoeffs = [
+            trinom.c + randint(-9, 10, [0]),
+            trinom.b + randint(-9, 10, [0]),
+            trinom.a,
+        ];
+        gCoeffs = [fCoeffs[0] - trinom.c, fCoeffs[1] - trinom.b];
+    }
+    else {
+        fCoeffs = [
+            trinom.c + randint(-9, 10, [0]),
+            trinom.b + randint(-9, 10, [0]),
+            trinom.a + randint(-9, 10, [0, -trinom.a]),
+        ];
+        gCoeffs = [
+            fCoeffs[0] - trinom.c,
+            fCoeffs[1] - trinom.b,
+            fCoeffs[2] - trinom.a,
+        ];
+    }
+    const identifiers = {
+        fCoeffs,
+        gCoeffs,
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    return {
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: getKeys(identifiers),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+};
+const options = [
+    {
+        id: "gType",
+        label: "Type de la fonction $g$",
+        target: GeneratorOptionTarget.generation,
+        type: GeneratorOptionType.select,
+        values: ["Affine", "Trinôme", "L'un ou l'autre"],
+        defaultValue: "L'un ou l'autre",
+    },
+];
+export const secondDegreeEquationWithRightMember = {
+    id: "secondDegreeEquationWithRightMember",
+    connector: "\\iff",
+    label: "Résoudre une équation du second degré du type $f(x)=g(x)$",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getSecondDegreeEquationWithRightMemberQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getInstruction,
+    getHint,
+    getCorrection,
+    getAnswer,
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+    options,
+};

package/lib/exercises/math/functions/trinoms/equation/secondDegreeInequation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"secondDegreeInequation.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/equation/secondDegreeInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAErC,OAAO,EACL,gBAAgB,EAGjB,MAAM,sCAAsC,CAAC;AAe9C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AA4IF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAcxD,CAAC"}
+{"version":3,"file":"secondDegreeInequation.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/equation/secondDegreeInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAErC,OAAO,EACL,gBAAgB,EAGjB,MAAM,sCAAsC,CAAC;AAsB9C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AAiNF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAexD,CAAC"}

package/lib/exercises/math/functions/trinoms/equation/secondDegreeInequation.js

@@ -3,14 +3,21 @@ import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinct
 import { InequationSymbol, InequationSymbolConstructor, } from "../../../../../math/inequations/inequation.js";
 import { Trinom } from "../../../../../math/polynomials/trinom.js";
 import { randint } from "../../../../../math/utils/random/randint.js";
+import { opposite } from "../../../../../tree/nodes/functions/oppositeNode.js";
+import { sqrt } from "../../../../../tree/nodes/functions/sqrtNode.js";
 import { InequationSolutionNode } from "../../../../../tree/nodes/inequations/inequationSolutionNode.js";
 import { MinusInfinityNode, PlusInfinityNode, } from "../../../../../tree/nodes/numbers/infiniteNode.js";
+import { add } from "../../../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../../../tree/nodes/operators/fractionNode.js";
+import { multiply } from "../../../../../tree/nodes/operators/multiplyNode.js";
+import { substract } from "../../../../../tree/nodes/operators/substractNode.js";
 import { Closure, ClosureType } from "../../../../../tree/nodes/sets/closure.js";
 import { IntervalNode } from "../../../../../tree/nodes/sets/intervalNode.js";
 import { UnionIntervalNode } from "../../../../../tree/nodes/sets/unionIntervalNode.js";
 import { unionIntervalParser } from "../../../../../tree/parsers/unionIntervalParser.js";
 import { coinFlip } from "../../../../../utils/alea/coinFlip.js";
 import { handleVEAError } from "../../../../../utils/errors/handleVEAError.js";
+import { alignTex } from "../../../../../utils/latex/alignTex.js";
 const getInstruction = (identifiers) => {
     const { a, b, c, ineqType } = identifiers;
     const ineq = new InequationSymbol(ineqType);
@@ -27,22 +34,82 @@ const getAnswer = (identifiers) => {
     const answer = getAnswerNode(identifiers).toTex();
     return answer;
 };
+const getKeys = () => {
+    return [
+        "S",
+        "equal",
+        "lbracket",
+        "semicolon",
+        "rbracket",
+        "cup",
+        "infty",
+        "varnothing",
+    ];
+};
+const getHint = () => {
+    return `Une fonction polynôme du second degré est du signe de son coefficient $a$, sauf entre ses éventuelles racines.
+  
+Commence donc par déterminer les racines de $f$.`;
+};
+const getCorrection = (identifiers) => {
+    const { a, b, c, ineqType } = identifiers;
+    const trinom = new Trinom(a, b, c);
+    const delta = trinom.getDeltaNode();
+    const roots = trinom.getRootsNode();
+    const ineq = new InequationSymbol(ineqType);
+    return `On commence par déterminer les racines de $f$. 
+
+On calcule le discriminant : 
+
+$$
+\\Delta = b^2-4ac = ${delta.toTex()}
+$$
+
+Puisque $\\Delta>0$, $f$ admet deux racines : 
+
+${alignTex([
+        ["x_1", "=", "\\frac{-b-\\sqrt{\\Delta}}{2a}"],
+        ["", "=", frac(substract(opposite(b), sqrt(delta)), multiply(2, a)).toTex()],
+        [
+            "",
+            "=",
+            frac(substract(opposite(b), sqrt(delta)), multiply(2, a))
+                .simplify()
+                .toTex(),
+        ],
+    ])}
+
+${alignTex([
+        ["x_2", "=", "\\frac{-b+\\sqrt{\\Delta}}{2a}"],
+        ["", "=", frac(add(opposite(b), sqrt(delta)), multiply(2, a)).toTex()],
+        [
+            "",
+            "=",
+            frac(add(opposite(b), sqrt(delta)), multiply(2, a))
+                .simplify()
+                .toTex(),
+        ],
+    ])}
+
+Ensuite, on sait qu'un polynôme du second degré est du signe de son coefficient $a$, sauf entre ses racines. Ici, comme $${a
+        .toTree()
+        .toSignInequationTex()}$, $f$ est ${a > 0 ? "positive" : "négative"} sur l'intervalle $\\left]-\\infty; ${roots[0].toTex()}\\right]$ et sur l'intervalle $\\left[${roots[1].toTex()};+\\infty\\right[$, et ${a > 0 ? "négative" : "positive"} sur l'intervalle $\\left[${roots[0].toTex()},${roots[1].toTex()}\\right]$. 
+
+On en conclut que l'ensemble solution de l'inéquation  $f(x) ${ineq.symbol} 0$ est : 
+
+$$
+${getAnswer(identifiers)}
+$$`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
-        keys: [
-            "S",
-            "equal",
-            "lbracket",
-            "semicolon",
-            "rbracket",
-            "cup",
-            "infty",
-            "varnothing",
-        ],
+        keys: getKeys(identifiers),
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -131,7 +198,5 @@ export const secondDegreeInequation = {
     subject: "Mathématiques",
     pdfOptions: { shouldSpreadPropositions: true },
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };
-// export const reuseSecondDegreeInequation = {
-//   getAnswerNode,
-// };

package/lib/exercises/math/functions/trinoms/equation/solveBisquaredEquation.d.ts

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

package/lib/exercises/math/functions/trinoms/equation/solveBisquaredEquation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"solveBisquaredEquation.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/equation/solveBisquaredEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAmBrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAuNF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAkBxD,CAAC"}

package/lib/exercises/math/functions/trinoms/equation/solveBisquaredEquation.js

@@ -0,0 +1,223 @@
+import { addValidProp, shuffleProps, propWhile, tryToAddWrongProp, } from "../../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinctQuestions.js";
+import { Trinom, TrinomConstructor } from "../../../../../math/polynomials/trinom.js";
+import { randint } from "../../../../../math/utils/random/randint.js";
+import { round } from "../../../../../math/utils/round.js";
+import { EquationSolutionNode } from "../../../../../tree/nodes/equations/equationSolutionNode.js";
+import { opposite } from "../../../../../tree/nodes/functions/oppositeNode.js";
+import { sqrt } from "../../../../../tree/nodes/functions/sqrtNode.js";
+import { add } from "../../../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../../../tree/nodes/operators/fractionNode.js";
+import { multiply } from "../../../../../tree/nodes/operators/multiplyNode.js";
+import { power, square } from "../../../../../tree/nodes/operators/powerNode.js";
+import { substract } from "../../../../../tree/nodes/operators/substractNode.js";
+import { DiscreteSetNode } from "../../../../../tree/nodes/sets/discreteSetNode.js";
+import { discreteSetParser } from "../../../../../tree/parsers/discreteSetParser.js";
+import { handleVEAError } from "../../../../../utils/errors/handleVEAError.js";
+import { alignTex } from "../../../../../utils/latex/alignTex.js";
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    propWhile(propositions, n, () => {
+        const trinom = TrinomConstructor.randomNiceRoots(randint(1, 3));
+        tryToAddWrongProp(propositions, getAnswer({ a: trinom.a, b: trinom.b, c: trinom.c }));
+    });
+    return shuffleProps(propositions, n);
+};
+const getAnswer = (identifiers) => {
+    const { a, b, c } = identifiers;
+    const trinom = new Trinom(a, b, c);
+    const roots = trinom.getRootsNode();
+    const pos = roots.filter((r) => r.evaluate() >= 0);
+    const sqrtRoots = pos
+        .map((root) => root.evaluate() === 0
+        ? [(0).toTree()]
+        : [opposite(sqrt(root)).simplify(), sqrt(root).simplify()])
+        .flat();
+    if (!sqrtRoots.length)
+        return "S=\\varnothing";
+    return new EquationSolutionNode(new DiscreteSetNode(sqrtRoots))
+        .simplify()
+        .toTex();
+};
+const getEquation = (identifiers, withX = false) => {
+    const { a, b, c } = identifiers;
+    if (withX) {
+        return add(add(multiply(a, square("X")), multiply(b, "X")), c);
+    }
+    return add(add(multiply(a, power("x", 4)), multiply(b, square("x"))), c);
+};
+const getInstruction = (identifiers) => {
+    return `En posant $X = x^2$, résoudre : 
+  
+$$
+${getEquation(identifiers).toTex()}=0
+$$`;
+};
+const getHint = () => {
+    return `Réécris l'équation en posant $X = x^2$.
+  
+Cela te donnera une équation du second degré d'inconnue $X$.
+
+Résous cette nouvelle équation, puis retrouve $x$ en résolvant l'équation $x^2 = X$.`;
+};
+const getCorrection = (identifiers) => {
+    const { a, b, c } = identifiers;
+    const delta = round(b ** 2 - 4 * a * c, 5);
+    const roots = new Trinom(a, b, c).getRootsNode();
+    const XOrdered = a < 0 ? [roots[1], roots[0]] : roots;
+    return `On réécris l'équation en posant $X = x^2$ : 
+  
+${alignTex([
+        ["", getEquation(identifiers).toTex() + "=0"],
+        ["\\iff", getEquation(identifiers, true).toTex() + "=0"],
+    ])}
+
+On obtient alors une équation du second degré, qu'on résout avec le discriminant : 
+
+$$
+\\Delta = b^2-4ac = ${delta.frenchify()}
+$$
+
+${delta === 0
+        ? `Puisque $\\Delta = 0$, cette équation admet une solution $X_0$ : 
+
+${alignTex([
+            ["X_0", "=", "\\frac{-b}{2a}"],
+            ["", "=", frac(opposite(b), multiply(2, a)).toTex()],
+            ["", "=", frac(opposite(b), multiply(2, a)).simplify().toTex()],
+        ])}`
+        : `Puisque $\\Delta > 0$, cette équation admet deux solutions : 
+
+${alignTex([
+            ["X_1", "=", "\\frac{-b-\\sqrt{\\Delta}}{2a}"],
+            ["", "=", frac(substract(opposite(b), sqrt(delta)), multiply(2, a)).toTex()],
+            [
+                "",
+                "=",
+                frac(substract(opposite(b), sqrt(delta)), multiply(2, a))
+                    .simplify()
+                    .toTex(),
+            ],
+        ])}
+
+${alignTex([
+            ["X_2", "=", "\\frac{-b+\\sqrt{\\Delta}}{2a}"],
+            ["", "=", frac(add(opposite(b), sqrt(delta)), multiply(2, a)).toTex()],
+            [
+                "",
+                "=",
+                frac(add(opposite(b), sqrt(delta)), multiply(2, a))
+                    .simplify()
+                    .toTex(),
+            ],
+        ])}`}
+
+Pour retrouver les solutions de l'équation initiale, on utilise le fait que $X = x^2$, donc $x = \\sqrt{X}$ ou $x = -\\sqrt{X}$ si $X$ est positif, et il n'y a pas de solution si $X$ est négatif.
+
+${delta === 0
+        ? roots[0].evaluate() < 0
+            ? `Or, puisque $X_0<0$, il n'y a pas de solution.`
+            : roots[0].evaluate() === 0
+                ? `Ici, puisque $X_0=0$, il n'y a qu'une solution : $x = 0$.`
+                : `Cela donne donc deux solutions : 
+  
+$$
+x_0 = \\sqrt{X_0} = ${sqrt(roots[0]).simplify().toTex()}
+$$
+
+$$
+x_1 = -\\sqrt{X_0} = ${opposite(sqrt(roots[0])).simplify().toTex()}
+$$`
+        : ""}
+
+${delta > 0
+        ? XOrdered[0].evaluate() < 0
+            ? `Puisque $X_1<0$, l'équation $x^2 = X_1$ n'a pas de solution.`
+            : XOrdered[0].evaluate() === 0
+                ? `Puisque $X_1 = 0$, l'équation $x^2 = X_1$ admet une solution : $x_1 = 0$.`
+                : `Puisque $X_1>0$, cela donne deux solutions : 
+  
+$$
+x_1 = \\sqrt{X_1} = ${sqrt(XOrdered[0]).simplify().toTex()}
+$$
+
+$$
+x_1' = -\\sqrt{X_1} = ${opposite(sqrt(XOrdered[0])).simplify().toTex()}
+$$
+`
+        : ""}
+
+
+${delta > 0
+        ? XOrdered[1].evaluate() < 0
+            ? `Puisque $X_2<0$, l'équation $x^2 = X_2$ n'a pas de solution.`
+            : XOrdered[1].evaluate() === 0
+                ? `Puisque $X_2 = 0$, l'équation $x^2 = X_2$ admet une solution : $x_2 = 0$.`
+                : `Puisque $X_2>0$, cela donne deux solutions : 
+  
+$$
+x_2 = \\sqrt{X_2} = ${sqrt(XOrdered[1]).simplify().toTex()}
+$$
+
+$$
+x_2' = -\\sqrt{X_2} = ${opposite(sqrt(XOrdered[1])).simplify().toTex()}
+$$
+`
+        : ""}
+
+L'ensemble des solutions est donc : 
+
+$$
+${getAnswer(identifiers)}
+$$
+`;
+};
+const getKeys = () => {
+    return ["S", "equal", "lbrace", "semicolon", "rbrace", "varnothing"];
+};
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        const parsed = discreteSetParser(ans);
+        if (!parsed)
+            return false;
+        return ("S=" + parsed.simplify({ decimalToFractions: true }).toTex() === answer);
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+const getSolveBisquaredEquationQuestion = () => {
+    const trinom = TrinomConstructor.randomNiceRoots(randint(1, 3));
+    const identifiers = { a: trinom.a, b: trinom.b, c: trinom.c };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    return {
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: getKeys(identifiers),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+};
+export const solveBisquaredEquation = {
+    id: "solveBisquaredEquation",
+    connector: "\\iff",
+    label: "Résoudre une équation bicarrée du type $ax^4+bx^2+c = 0$",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getSolveBisquaredEquationQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getInstruction,
+    getHint,
+    getCorrection,
+    getAnswer,
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+};

package/lib/exercises/math/functions/trinoms/equation/trinomSelectEquationWithoutDeltaNeeded.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trinomSelectEquationWithoutDeltaNeeded.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/equation/trinomSelectEquationWithoutDeltaNeeded.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAcrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,EAAE,KAAK,GAAG,MAAM,GAAG,OAAO,CAAC;CAChC,CAAC;AACF,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,WAAW,EAAE,CAAC;CAC1B,CAAC;AA6MF,eAAO,MAAM,sCAAsC,EAAE,QAAQ,CAAC,WAAW,CAqBxE,CAAC"}
+{"version":3,"file":"trinomSelectEquationWithoutDeltaNeeded.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/equation/trinomSelectEquationWithoutDeltaNeeded.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAcrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,EAAE,KAAK,GAAG,MAAM,GAAG,OAAO,CAAC;CAChC,CAAC;AACF,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,WAAW,EAAE,CAAC;CAC1B,CAAC;AA+MF,eAAO,MAAM,sCAAsC,EAAE,QAAQ,CAAC,WAAW,CAqBxE,CAAC"}

package/lib/exercises/math/functions/trinoms/equation/trinomSelectEquationWithoutDeltaNeeded.js

@@ -139,7 +139,9 @@ const getTrinomSelectEquationWithoutDeltaNeededQuestion = () => {
             };
         }
         else {
-            const trinom = TrinomConstructor.randomCanonical();
+            const trinom = TrinomConstructor.randomCanonical(undefined, {
+                excludes: [0],
+            }); //prevents x^2 + b which looks like devform
             return {
                 a: trinom.a,
                 b: trinom.b,

package/lib/exercises/math/functions/trinoms/roots/niceRootsFromDevForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"niceRootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/niceRootsFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAiBrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA0JF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAatD,CAAC"}
+{"version":3,"file":"niceRootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/niceRootsFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAiBrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2JF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAatD,CAAC"}

package/lib/exercises/math/functions/trinoms/roots/niceRootsFromDevForm.js

@@ -111,6 +111,7 @@ ${alignTex([
                     .toTex(),
             ],
         ])}
+
 L'ensemble des solutions est donc : 
 
 $$

package/lib/exercises/math/functions/trinoms/roots/rootsReading.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rootsReading.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAgHF,KAAK,OAAO,GAAG;IACb,YAAY,EAAE,OAAO,CAAC;CACvB,CAAC;AAUF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAcvD,CAAC"}
+{"version":3,"file":"rootsReading.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAmBT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkJF,KAAK,OAAO,GAAG;IACb,YAAY,EAAE,OAAO,CAAC;CACvB,CAAC;AAUF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAevD,CAAC"}

package/lib/exercises/math/functions/trinoms/roots/rootsReading.js

@@ -9,7 +9,7 @@ import { divide } from "../../../../../tree/nodes/operators/divideNode.js";
 import { multiply } from "../../../../../tree/nodes/operators/multiplyNode.js";
 import { probaLawFlip } from "../../../../../utils/alea/probaLawFlip.js";
 const getInstruction = () => {
-    return `Déterminer graphiquement le ou les racine(s) du polynôme du second degré représenté ci-dessous.
+    return `Déterminer graphiquement la ou les racine(s) du polynôme du second degré représenté ci-dessous.
   
 S'il n'y en a pas, on écrira "Aucun".`;
 };
@@ -59,6 +59,29 @@ const getRootsReadingQuestion = (opts) => {
     const identifiers = { a: trinom.a, b: trinom.b, c: trinom.c };
     return getQuestionFromIdentifiers(identifiers);
 };
+const getHint = () => {
+    return `Les racines d'un polynôme du second degré $f$ sont les valeurs de $x$ telles que $f(x) = 0$. 
+  
+Graphiquement, ce sont donc les abscisse à l'intersection de la parabole et de l'axe des abscisses.`;
+};
+const getCorrection = (identifiers) => {
+    const answer = getAnswer(identifiers);
+    const nbRoots = answer === "\\text{Aucun}" ? 0 : answer.includes("et") ? 2 : 1;
+    const roots = getAnswer(identifiers).split("\\text{ et }");
+    return `Les racines d'un polynôme du second degré $f$ sont les valeurs de $x$ telles que $f(x) = 0$. 
+  
+Graphiquement, ce sont donc les abscisse à l'intersection de la parabole et de l'axe des abscisses.
+
+${nbRoots === 0
+        ? `Ici, la parabole ne coupe pas l'axe des abscisses. Ce polynôme n'a donc pas de racine.`
+        : ""}
+${answer.includes("et")
+        ? `Ici, la parabole coupe l'axe des abscisses deux fois : aux abscisses $${roots[0]}$ et $${roots[1]}$. Ce sont donc les deux racines du polynôme.`
+        : ""}
+${nbRoots === 1
+        ? `Ici, la parabole coupe l'axe des abscisses une seule fois, en son sommet : c'est à l'abscisse $${getAnswer(identifiers)}$. C'est donc la seule racine du polynôme.`
+        : ""}`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -67,6 +90,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         answerFormat: "tex",
         ggbOptions: getGGBOptions(identifiers),
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -121,4 +146,5 @@ export const rootsReading = {
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
     options,
+    hasHintAndCorrection: true,
 };