math-exercises 3.0.197 → 3.0.199

package/lib/exercises/math/calculLitteral/equation/exp/expOfTrinomEquals1Equation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"expOfTrinomEquals1Equation.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/calculLitteral/equation/exp/expOfTrinomEquals1Equation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAoBT,MAAM,6BAA6B,CAAC;AAmCrC;;GAEG;AACH,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA0YF,KAAK,OAAO,GAAG;IACb,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;AAgBF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAoBrE,CAAC"}
+{"version":3,"file":"expOfTrinomEquals1Equation.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/calculLitteral/equation/exp/expOfTrinomEquals1Equation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAoBT,MAAM,6BAA6B,CAAC;AAmCrC;;GAEG;AACH,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA0YF,KAAK,OAAO,GAAG;IACb,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;AAgBF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAuBrE,CAAC"}

package/lib/exercises/math/calculLitteral/equation/exp/expOfTrinomEquals1Equation.js

@@ -368,4 +368,7 @@ export const expOfTrinomEquals1Equation = {
     getStartStatement,
     getQuestionFromIdentifiers,
     options,
+    pdfOptions: {
+        shouldSpreadPropositions: true,
+    },
 };

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType3.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"firstDegreeInequationsType3.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/inequations/firstDegreeInequationsType3.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,gBAAgB,EAGjB,MAAM,sCAAsC,CAAC;AAY9C,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA4LF,KAAK,OAAO,GAAG;IACb,wBAAwB,EAAE,MAAM,CAAC;CAClC,CAAC;AAGF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CActE,CAAC"}
+{"version":3,"file":"firstDegreeInequationsType3.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/calculLitteral/inequations/firstDegreeInequationsType3.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,gBAAgB,EAGjB,MAAM,sCAAsC,CAAC;AAe9C,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkOF,KAAK,OAAO,GAAG;IACb,wBAAwB,EAAE,MAAM,CAAC;CAClC,CAAC;AAGF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAetE,CAAC"}

package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType3.js

@@ -7,6 +7,9 @@ import { Affine } from "../../../../math/polynomials/affine.js";
 import { randint } from "../../../../math/utils/random/randint.js";
 import { InequationNode } from "../../../../tree/nodes/inequations/inequationNode.js";
 import { InequationSolutionNode } from "../../../../tree/nodes/inequations/inequationSolutionNode.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
+import { substract } from "../../../../tree/nodes/operators/substractNode.js";
 import { inequationParser } from "../../../../tree/parsers/inequationParser.js";
 import { intervalParser } from "../../../../tree/parsers/intervalParser.js";
 import { coinFlip } from "../../../../utils/alea/coinFlip.js";
@@ -41,37 +44,59 @@ const getAnswerNode = (identifiers, opts) => {
 const getAnswer = (identifiers, opts) => {
     return getAnswerNode(identifiers, opts).toTex();
 };
-// const getHint: GetHint<Identifiers, Options> = (identifiers, opts) => {
-//   return `Isole le terme $x$ dans le membre de gauche de l'inéquation. Attention : lorsqu'on multiplie (ou divise) les deux membres d'une inéquation par un nombre négatif, le sens de l'inéquation est inversé.`;
-// };
-// const getCorrection: GetHint<Identifiers, Options> = (identifiers, opts) => {
-//   const { a, b, c, d,ineqType } = identifiers;
-//   const isInterval =
-//     opts?.inequationSolutionFormat === "Intervalle (S = [a;b])";
-//   const answer = getAnswer(identifiers, opts);
-//   return `On isole $x$ dans le membre de gauche de l'inéquation :
-// $$
-// ${firstDegreeInequationResolutionTex(new Affine(a, b), ineqType, new Affine(c,d))}
-// $$
-// ${
-//   identifiers.a < 0
-//     ? `On a changé le sens de l'inéquation, car $${a}$ est négatif.`
-//     : ""
-// }
-// ${
-//   isInterval
-//     ? `On traduit ensuite cette inéquation en intervalle :
-// $$
-// ${answer}
-// $$
-// `
-//     : ""
-// }
-// `;
-// };
+const getHint = () => {
+    return `Commence par regrouper les termes en $x$ d'un même côté de l'inéquation. Puis isole $x$ en effectuant les bonnes opérations.
+  
+Attention, lorsqu'on divise ou multiplie les deux membres d'une inéquation par un nombre négatif, l'inéquation change de sens. `;
+};
+const getCorrection = (identifiers, opts) => {
+    const { a, b, c, d, ineqType } = identifiers;
+    const affine1 = new Affine(a, b);
+    const affine2 = new Affine(c, d);
+    const isInterval = opts?.inequationSolutionFormat === "Intervalle (S = [a;b])";
+    return `On doit résoudre l'inéquation : 
+  
+$$
+${affine1.toTex()} ${ineqType} ${affine2.toTex()}
+$$
+
+On ${c < 0 ? "ajoute" : "enlève"} $${multiply(Math.abs(c), "x").toTex()}$ des deux côtés :
+
+$$
+${add(multiply(substract(a, c).simplify(), "x"), b).toTex()} ${ineqType} ${d.frenchify()}
+$$
+
+On ${b < 0 ? "ajoute" : "enlève"} $${Math.abs(b).frenchify()}$ des deux côtés :
+
+$$
+${multiply(substract(a, c).simplify(), "x").toTex()} ${ineqType} ${substract(d, b)
+        .simplify()
+        .toTex()}
+$$
+
+On divise ensuite par $${substract(a, c)
+        .simplify()
+        .toTex()}$. Puisque $${substract(a, c).simplify().toTex()}$ est ${a > c ? "positif" : "négatif"}, l'inéquation ${a > c ? "ne change pas" : "change"} de sens :
+
+$$
+${getAnswer(identifiers, {
+        inequationSolutionFormat: "Inégalité (x>a)",
+    })}
+$$
+
+${isInterval
+        ? `On traduit cette inégalité par un intervalle : 
+  
+$$
+${getAnswer(identifiers, opts)}
+$$`
+        : ""}
+`;
+};
 const getFirstDegreeInequationsQuestion = (opts) => {
-    const affine1 = new Affine(randint(-10, 10, [0]), randint(-10, 10));
-    const affine2 = new Affine(randint(-10, 10, [0, affine1.a]), randint(-10, 10));
+    // ax+b < cx+d
+    const affine1 = new Affine(randint(-10, 10, [0, 1]), randint(-10, 10, [0]));
+    const affine2 = new Affine(randint(-10, 10, [0, affine1.a, 1, affine1.a - 1]), randint(-10, 10, [0]));
     const coeff = affine1.a - affine2.a;
     const ineqType = InequationSymbolConstructor.random();
     const identifiers = {
@@ -91,6 +116,8 @@ const getQuestionFromIdentifiers = (identifiers, opts) => {
         keys: getKeys(identifiers, opts),
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers, opts),
+        correction: getCorrection(identifiers, opts),
     };
     return question;
 };
@@ -157,6 +184,7 @@ export const firstDegreeInequationsType3 = {
     subject: "Mathématiques",
     options,
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };
 // export const reuseFirstDegreeInequationsType3 = {
 //   getAnswerNode,

package/lib/exercises/math/complex/addComplex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"addComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/addComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAKrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AA4EF,eAAO,MAAM,UAAU,EAAE,QAAQ,CAAC,WAAW,CAY5C,CAAC"}
+{"version":3,"file":"addComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/addComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAwHF,eAAO,MAAM,UAAU,EAAE,QAAQ,CAAC,WAAW,CAa5C,CAAC"}

package/lib/exercises/math/complex/addComplex.js

@@ -1,7 +1,11 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Complex, ComplexConstructor } from "../../../math/complex/complex.js";
+import { add } from "../../../tree/nodes/operators/addNode.js";
+import { multiply } from "../../../tree/nodes/operators/multiplyNode.js";
+import { parseAlgebraic } from "../../../tree/parsers/latexParser.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
+import { alignTex } from "../../../utils/latex/alignTex.js";
 const getInstruction = (identifiers) => {
     const z1 = new Complex(identifiers.z1Re, identifiers.z1Im);
     const z2 = new Complex(identifiers.z2Re, identifiers.z2Im);
@@ -15,14 +19,47 @@ const getAnswer = (identifiers) => {
     const answer = z1.add(z2).toTree().toTex();
     return answer;
 };
+const getHint = () => {
+    return `Soient deux nombres complexes $z = a+ib$ et $z' = a'+ib'$. Alors :
+  
+$$
+z+z' = (a+a') + i(b+b')
+$$`;
+};
+const getCorrection = (identifiers) => {
+    const { z1Re, z1Im, z2Re, z2Im } = identifiers;
+    const z1 = add(z1Re, multiply(z1Im, "i")).simplify({
+        forbidFactorize: true,
+        noAddOrder: true,
+    });
+    const z2 = add(z2Re, multiply(z2Im, "i")).simplify({
+        forbidFactorize: true,
+        noAddOrder: true,
+    });
+    return `Soient deux nombres complexes $z = a+ib$ et $z' = a'+ib'$. Alors :
+  
+$$
+z+z' = (a+a') + i(b+b')
+$$
+
+Ici, on a donc :
+  
+${alignTex([
+        ["z+ z'", "=", add(z1, z2).toTex()],
+        ["", "=", add(add(z1Re, z2Re), multiply("i", add(z1Im, z2Im))).toTex()],
+        ["", "=", getAnswer(identifiers)],
+    ])}`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
-        keys: ["i", "z", "quote"],
+        keys: ["i"],
         answerFormat: "tex",
         startStatement: "z+z'",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -57,12 +94,20 @@ const getPropositions = (n, { answer, z1Re, z1Im, z2Re, z2Im }) => {
     });
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { z1Im, z1Re, z2Im, z2Re }) => {
-    const z1 = new Complex(z1Re, z1Im);
-    const z2 = new Complex(z2Re, z2Im);
-    const answer = z1.add(z2).toTree();
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
+const isAnswerValid = (ans, { answer }) => {
+    const parsed = parseAlgebraic(ans);
+    if (!parsed)
+        return false;
+    return (parsed
+        .simplify({
+        forbidFactorize: true,
+    })
+        .toTex() ===
+        parseAlgebraic(answer)
+            .simplify({
+            forbidFactorize: true,
+        })
+            .toTex());
 };
 export const addComplex = {
     id: "addComplex",
@@ -76,4 +121,5 @@ export const addComplex = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/complex/conjugateComplex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"conjugateComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/conjugateComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAKrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AA4DF,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,CAalD,CAAC"}
+{"version":3,"file":"conjugateComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/conjugateComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;CACZ,CAAC;AAqGF,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,CAclD,CAAC"}

package/lib/exercises/math/complex/conjugateComplex.js

@@ -1,11 +1,16 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Complex, ComplexConstructor } from "../../../math/complex/complex.js";
+import { parseAlgebraic } from "../../../tree/parsers/latexParser.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
 const getInstruction = (identifiers) => {
     const { re, im } = identifiers;
     const complex = new Complex(re, im);
-    return `Déterminer le conjugué de $z=${complex.toTree().toTex()}$.`;
+    return `Déterminer le conjugué $\\overline{z}$ de :
+  
+$$
+z=${complex.toTree().toTex()}
+$$`;
 };
 const getAnswer = (identifiers) => {
     const { re, im } = identifiers;
@@ -13,14 +18,40 @@ const getAnswer = (identifiers) => {
     const answer = complex.conjugate().toTree().toTex();
     return answer;
 };
+const getHint = () => {
+    return `Soit $z = a+ib$ un nombre complexe.
+  
+Le conjugué $\\overline{z}$ de $z$ est le nombre : 
+
+$$
+\\overline{z} = a-ib
+$$`;
+};
+const getCorrection = (identifiers) => {
+    return `Soit $z = a+ib$ un nombre complexe.
+  
+Le conjugué $\\overline{z}$ de $z$ est le nombre : 
+
+$$
+\\overline{z} = a-ib
+$$
+
+Ici, on a donc : 
+
+$$
+\\overline{z} = ${getAnswer(identifiers)}
+$$`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
-        keys: ["i", "overline"],
+        keys: ["i"],
         answerFormat: "tex",
         startStatement: "\\overline z",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -43,11 +74,20 @@ const getPropositions = (n, { answer, re, im }) => {
     });
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { im, re }) => {
-    const complex = new Complex(re, im);
-    const answer = complex.conjugate().toTree();
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
+const isAnswerValid = (ans, { answer }) => {
+    const parsed = parseAlgebraic(ans);
+    if (!parsed)
+        return false;
+    return (parsed
+        .simplify({
+        forbidFactorize: true,
+    })
+        .toTex() ===
+        parseAlgebraic(answer)
+            .simplify({
+            forbidFactorize: true,
+        })
+            .toTex());
 };
 export const conjugateComplex = {
     id: "conjugateComplex",
@@ -61,4 +101,5 @@ export const conjugateComplex = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/complex/mutiplyComplex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mutiplyComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/mutiplyComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAKrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;CACd,CAAC;AAmEF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAahD,CAAC"}
+{"version":3,"file":"mutiplyComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/mutiplyComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;CACd,CAAC;AA2GF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAchD,CAAC"}

package/lib/exercises/math/complex/mutiplyComplex.js

@@ -1,7 +1,12 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Complex, ComplexConstructor } from "../../../math/complex/complex.js";
+import { randTupleInt } from "../../../math/utils/random/randTupleInt.js";
+import { add } from "../../../tree/nodes/operators/addNode.js";
+import { multiply } from "../../../tree/nodes/operators/multiplyNode.js";
+import { parseAlgebraic } from "../../../tree/parsers/latexParser.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
+import { alignTex } from "../../../utils/latex/alignTex.js";
 const getInstruction = (identifiers) => {
     const z1 = new Complex(identifiers.z1[0], identifiers.z1[1]);
     const z2 = new Complex(identifiers.z2[0], identifiers.z2[1]);
@@ -15,29 +20,48 @@ const getAnswer = (identifiers) => {
     const answer = z1.multiply(z2).toTree().toTex();
     return answer;
 };
+const getHint = () => {
+    return `Pour multiplier deux nombres complexes, on utilise la distributivité double, ainsi que le fait que $i^2 = -1$.`;
+};
+const getCorrection = (identifiers) => {
+    const { z1, z2 } = identifiers;
+    const [a, b] = z1;
+    const [c, d] = z2;
+    const zA = add(a, multiply(b, "i"));
+    const zB = add(c, multiply(d, "i"));
+    return `On distribue comme pour des nombres réels, puis on utilise le fait que $i^2=-1$ :
+  
+${alignTex([
+        ["z\\times z'", "=", multiply(zA, zB).toTex()],
+        [
+            "",
+            "=",
+            add(add(multiply(a, c), multiply(a, multiply(d, "i"))), add(multiply(multiply(b, "i"), c), multiply(multiply(b, "i"), multiply(d, "i")))).toTex(),
+        ],
+        [
+            "",
+            "=",
+            add(add(multiply(a, c).simplify(), multiply(a * d + b * c, "i")), multiply(multiply(b, d).simplify(), -1)).toTex(),
+        ],
+        ["", "=", getAnswer(identifiers)],
+    ])}`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
-        keys: ["i", "z", "quote"],
+        keys: ["i"],
         answerFormat: "tex",
         startStatement: "z\\times z'",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
 const getMutiplyComplexQuestion = () => {
-    const z1 = ComplexConstructor.random();
-    let z2;
-    let counter = 0;
-    do {
-        counter++;
-        if (counter > 1000) {
-            throw new Error("multiply complex too many iterations");
-        }
-        z2 = ComplexConstructor.random();
-    } while (z1.im === 0 && z2.im === 0);
-    const identifiers = { z1: [z1.re, z1.im], z2: [z2.re, z2.im] };
+    const [a, b, c, d] = randTupleInt(4, { from: -9, to: 10, elExcludes: [0] });
+    const identifiers = { z1: [a, b], z2: [c, d] };
     return getQuestionFromIdentifiers(identifiers);
 };
 const getPropositions = (n, { answer, z1, z2 }) => {
@@ -51,12 +75,20 @@ const getPropositions = (n, { answer, z1, z2 }) => {
     });
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { z1, z2 }) => {
-    const complex1 = new Complex(z1[0], z1[1]);
-    const complex2 = new Complex(z2[0], z2[1]);
-    const answer = complex1.multiply(complex2).toTree();
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
+const isAnswerValid = (ans, { answer }) => {
+    const parsed = parseAlgebraic(ans);
+    if (!parsed)
+        return false;
+    return (parsed
+        .simplify({
+        forbidFactorize: true,
+    })
+        .toTex() ===
+        parseAlgebraic(answer)
+            .simplify({
+            forbidFactorize: true,
+        })
+            .toTex());
 };
 export const mutiplyComplex = {
     id: "mutiplyComplex",
@@ -70,4 +102,5 @@ export const mutiplyComplex = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/complex/reAndIm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reAndIm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/reAndIm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,OAAO,CAAC;CACf,CAAC;AA6DF,eAAO,MAAM,OAAO,EAAE,QAAQ,CAAC,WAAW,CAYzC,CAAC"}
+{"version":3,"file":"reAndIm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/reAndIm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,OAAO,CAAC;CACf,CAAC;AA2FF,eAAO,MAAM,OAAO,EAAE,QAAQ,CAAC,WAAW,CAazC,CAAC"}

package/lib/exercises/math/complex/reAndIm.js

@@ -1,13 +1,17 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
+import { numberVEA } from "../../../exercises/vea/numberVEA.js";
 import { Complex, ComplexConstructor } from "../../../math/complex/complex.js";
 import { randint } from "../../../math/utils/random/randint.js";
 import { coinFlip } from "../../../utils/alea/coinFlip.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
+import { doWhile } from "../../../utils/doWhile.js";
 const getInstruction = (identifiers) => {
     const { re, im, isRe } = identifiers;
     const z1 = new Complex(re, im);
-    return `Soit $z=${z1.toTree().toTex()}$. Quelle est la partie ${isRe ? "réelle" : "imaginaire"} de $z$ ?`;
+    return `Soit $z=${z1.toTree().toTex()}$. 
+  
+Quelle est la partie ${isRe ? "réelle" : "imaginaire"} de $z$ ?`;
 };
 const getAnswer = (identifiers) => {
     const { re, im, isRe } = identifiers;
@@ -15,6 +19,30 @@ const getAnswer = (identifiers) => {
     const answer = (isRe ? z1.re : z1.im) + "";
     return answer;
 };
+const getHint = () => {
+    return `Si $z$ est un nombre complexe tel que : 
+  
+$$
+z = a+ib
+$$
+
+alors $a$ est la partie réelle de $z$, et $b$ et sa partie imaginaire.`;
+};
+const getCorrection = (identifiers) => {
+    const { re, im } = identifiers;
+    const z1 = new Complex(re, im);
+    return `Si $z$ est un nombre complexe tel que : 
+  
+$$
+z = a+ib
+$$
+
+alors $a$ est la partie réelle de $z$, et $b$ et sa partie imaginaire.
+
+Ici, on a $z = ${z1
+        .toTree()
+        .toTex()}$, donc la partie réelle de $z$ est $${re}$ et sa partie imaginaire est $${im}$. `;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -22,11 +50,13 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["i", "z"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
 const getReAndImQuestion = () => {
-    const z1 = ComplexConstructor.random();
+    const z1 = doWhile(() => ComplexConstructor.random(), (z) => z.re === z.im);
     const isRe = coinFlip();
     const identifiers = { re: z1.re, im: z1.im, isRe };
     return getQuestionFromIdentifiers(identifiers);
@@ -44,13 +74,13 @@ const getPropositions = (n, { answer, re, im, isRe }) => {
     return shuffle(propositions);
 };
 const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
+    return numberVEA(ans, answer);
 };
 export const reAndIm = {
     id: "getReAndImQuestion",
     connector: "=",
     getPropositions,
-    label: "Identifier partie réelle et partie imaginaire",
+    label: "Identifier partie réelle et partie imaginaire d'un nombre complexe",
     isSingleStep: true,
     generator: (nb) => getDistinctQuestions(getReAndImQuestion, nb),
     qcmTimer: 60,
@@ -58,4 +88,5 @@ export const reAndIm = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/derivation/convexity/convexityQuadrinomials.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"convexityQuadrinomials.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/convexity/convexityQuadrinomials.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAoBrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB,CAAC;AAwIF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAcxD,CAAC"}
+{"version":3,"file":"convexityQuadrinomials.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/derivation/convexity/convexityQuadrinomials.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAsBrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB,CAAC;AAqLF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAexD,CAAC"}

package/lib/exercises/math/derivation/convexity/convexityQuadrinomials.js

@@ -1,7 +1,9 @@
 import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { Affine } from "../../../../math/polynomials/affine.js";
 import { Polynomial, PolynomialConstructor, } from "../../../../math/polynomials/polynomial.js";
 import { randint } from "../../../../math/utils/random/randint.js";
+import { firstDegreeInequationResolutionTex } from "../../../../tree/nodes/inequations/inequationNode.js";
 import { MinusInfinityNode, PlusInfinityNode, } from "../../../../tree/nodes/numbers/infiniteNode.js";
 import { NumberNode } from "../../../../tree/nodes/numbers/numberNode.js";
 import { FractionNode } from "../../../../tree/nodes/operators/fractionNode.js";
@@ -21,7 +23,7 @@ $$
 f(x) = ${quadrinomial.toTex()}
 $$
 
-Sur quelle intervalle $f$ est-elle ${questionType} ?`;
+Sur quel intervalle $f$ est-elle ${questionType} ?`;
 };
 const getAnswer = (identifiers) => {
     const { askConvex, quadcoeffs } = identifiers;
@@ -45,6 +47,7 @@ const getAnswer = (identifiers) => {
     return interval;
 };
 const getConvexityQuadrinomialsQuestion = () => {
+    //b/3a nice
     const quadrinomial = PolynomialConstructor.randomWithOrder(3);
     const quadcoeffs = quadrinomial.coefficients;
     const askConvex = coinFlip();
@@ -58,6 +61,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["rbracket", "lbracket", "semicolon", "infty", "reals"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -71,16 +76,52 @@ const getPropositions = (n, { answer, quadcoeffs }) => {
     const wrongInterval1 = new IntervalNode(inflexionPoint, PlusInfinityNode, ClosureType.OO).toTex();
     const wrongInterval2 = new IntervalNode(MinusInfinityNode, inflexionPoint, ClosureType.OO).toTex();
     const wrongInterval3 = new IntervalNode(MinusInfinityNode, PlusInfinityNode, ClosureType.OO).toTex();
-    const wrongInterval4 = new IntervalNode(new NumberNode(randint(-1, 2)), PlusInfinityNode, ClosureType.FO).toTex();
+    const wrongInterval4 = new IntervalNode(new NumberNode(randint(-10, 10)), PlusInfinityNode, ClosureType.OO).toTex();
     tryToAddWrongProp(propositions, wrongInterval1);
     tryToAddWrongProp(propositions, wrongInterval2);
     tryToAddWrongProp(propositions, wrongInterval3);
     tryToAddWrongProp(propositions, wrongInterval4);
     return shuffleProps(propositions, n);
 };
+const getHint = () => `Soit $f$ une fonction deux fois dérivable et soit $f''$ sa dérivée seconde. 
+
+Alors : 
+
+- $f$ est convexe sur un intervalle $I$ si et seulement si $f''$ est positive sur $I$ ; 
+- $f$ est concave sur un intervalle $I$ si et seulement si $f''$ est négative sur $I$.
+
+Ici, il faut donc calculer $f''$, puis étudier son signe.`;
+const getCorrection = (identifiers) => {
+    const { quadcoeffs, askConvex } = identifiers;
+    const poly = new Polynomial(quadcoeffs);
+    const deriv = poly.derivate().toTree().simplify();
+    const second = poly.secondDerivate().toTree().simplify();
+    const secondAffine = new Affine(6 * quadcoeffs[3], 2 * quadcoeffs[2]); // 6a + 2b
+    const questionType = askConvex ? "convexe" : "concave";
+    return `On calcule la dérivée seconde $f''$ de $f$. On a, pour tout $x\\in \\mathbb{R}$ :
+  
+$$
+f'(x) = ${deriv.toTex()}
+$$
+
+Donc :
+
+$$
+f''(x) = ${second.toTex()}
+$$
+
+On étudie le signe de $f''$ : 
+
+$$
+${firstDegreeInequationResolutionTex(secondAffine, "\\ge", (0).toTree())}
+$$
+
+On en conclut donc que $f$ est ${questionType} sur $${getAnswer(identifiers)}$. 
+`;
+};
 const isAnswerValid = (ans, { answer }) => {
     try {
-        const parsed = intervalParser(ans);
+        const parsed = intervalParser(ans, { expectedClosure: ClosureType.OO });
         if (!parsed)
             return false;
         return parsed.simplify().toTex() === answer;
@@ -91,7 +132,7 @@ const isAnswerValid = (ans, { answer }) => {
 };
 export const convexityQuadrinomials = {
     id: "convexityQuadrinomials",
-    label: "Convexité des fonctions polynomiales de degré $3$",
+    label: "Déterminer la convexité d'une fonction polynôme de degré $3$",
     isSingleStep: true,
     generator: (nb) => getDistinctQuestions(getConvexityQuadrinomialsQuestion, nb),
     qcmTimer: 60,
@@ -102,4 +143,5 @@ export const convexityQuadrinomials = {
     getAnswer,
     getInstruction,
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/derivation/convexity/convexityQuadrinomialsGeo.d.ts

@@ -0,0 +1,9 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+type Identifiers = {
+    askConvex: boolean;
+    quadcoeffs: number[];
+    inflexionPoint: number;
+};
+export declare const convexityQuadrinomialsGeo: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=convexityQuadrinomialsGeo.d.ts.map