math-exercises 3.0.212 → 3.0.214

package/lib/exercises/math/arithmetic/hasDiophantianEquationSolution.js

@@ -10,10 +10,10 @@ import { random } from "../../../utils/alea/random.js";
 import { doWhile } from "../../../utils/doWhile.js";
 const getPropositions = (n, { answer }) => {
     const propositions = [];
-    addValidProp(propositions, answer);
-    tryToAddWrongProp(propositions, "Oui");
-    tryToAddWrongProp(propositions, "Non");
-    tryToAddWrongProp(propositions, "On ne peut pas savoir");
+    addValidProp(propositions, answer, "raw");
+    tryToAddWrongProp(propositions, "Oui", "raw");
+    tryToAddWrongProp(propositions, "Non", "raw");
+    tryToAddWrongProp(propositions, "On ne peut pas savoir", "raw");
     return shuffleProps(propositions, n);
 };
 const getAnswer = (identifiers) => {

package/lib/exercises/math/arithmetic/pgcdFromPrimeDecomposition.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pgcdFromPrimeDecomposition.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/arithmetic/pgcdFromPrimeDecomposition.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AAiJF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAmB5D,CAAC"}
+{"version":3,"file":"pgcdFromPrimeDecomposition.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/arithmetic/pgcdFromPrimeDecomposition.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AAsJF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAmB5D,CAAC"}

package/lib/exercises/math/arithmetic/pgcdFromPrimeDecomposition.js

@@ -6,6 +6,8 @@ import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
 import { power } from "../../../tree/nodes/operators/powerNode.js";
 import { parseAlgebraic } from "../../../tree/parsers/latexParser.js";
 import { operatorComposition } from "../../../tree/utilities/operatorComposition.js";
+import { randomMany } from "../../../utils/alea/random.js";
+import { doWhile } from "../../../utils/doWhile.js";
 import { handleVEAError } from "../../../utils/errors/handleVEAError.js";
 const getPropositions = (n, { answer, ...identifiers }) => {
     const propositions = [];
@@ -83,23 +85,23 @@ const isAnswerValid = (ans, { answer }) => {
     }
 };
 const getPgcdFromPrimeDecompositionQuestion = () => {
-    const aPowers = randTupleInt(randint(3, 6), {
-        from: 0,
+    const primes = [2, 3, 5, 7, 11, 13];
+    const aPrimes = randomMany(primes, randint(3, 6)).sort((a, b) => a - b);
+    const bPrimes = doWhile(() => randomMany(primes, randint(3, 6)), (list) => list.every((p) => !aPrimes.includes(p))).sort((a, b) => a - b);
+    const aPowers = randTupleInt(aPrimes.length, {
+        from: 1,
         to: 7,
     });
-    const bPowers = randTupleInt(randint(3, 6), {
-        from: 0,
+    const bPowers = randTupleInt(bPrimes.length, {
+        from: 1,
         to: 7,
         excludes: [aPowers],
     });
-    const primes = [2, 3, 5, 7, 11, 13, 17];
-    const aPrimes = primes.filter((_p, i) => aPowers[i] > 0);
-    const bPrimes = primes.filter((_p, i) => bPowers[i] > 0);
     const identifiers = {
         aPrimes,
         bPrimes,
-        aPowers: aPowers.filter((p) => p > 0),
-        bPowers: bPowers.filter((p) => p > 0),
+        aPowers,
+        bPowers,
     };
     return getQuestionFromIdentifiers(identifiers);
 };

package/lib/exercises/math/complex/argumentFromAlgebraicComplex.d.ts

@@ -1,7 +1,10 @@
 import { Exercise } from "../../../exercises/exercise.js";
+import { NodeIdentifiers } from "../../../tree/nodes/nodeConstructor.js";
 type Identifiers = {
     arg: number;
     zTex: string;
+    reIds: NodeIdentifiers;
+    imIds: NodeIdentifiers;
 };
 export declare const argumentFromAlgebraicComplex: Exercise<Identifiers>;
 export {};

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

@@ -1 +1 @@
-{"version":3,"file":"argumentFromAlgebraicComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/argumentFromAlgebraicComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAgEF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAa9D,CAAC"}
+{"version":3,"file":"argumentFromAlgebraicComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/argumentFromAlgebraicComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAQrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAS7C,KAAK,WAAW,GAAG;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,eAAe,CAAC;IACvB,KAAK,EAAE,eAAe,CAAC;CACxB,CAAC;AAoJF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAc9D,CAAC"}

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

@@ -5,13 +5,22 @@ import { RationalConstructor } from "../../../math/numbers/rationals/rational.js
 import { mainTrigoValues } from "../../../math/trigonometry/remarkableValues.js";
 import { randint } from "../../../math/utils/random/randint.js";
 import { ComplexNode } from "../../../tree/nodes/complex/complexNode.js";
-import { SqrtNode } from "../../../tree/nodes/functions/sqrtNode.js";
+import { sqrt, SqrtNode } from "../../../tree/nodes/functions/sqrtNode.js";
+import { reifyAlgebraic, } from "../../../tree/nodes/nodeConstructor.js";
 import { NumberNode } from "../../../tree/nodes/numbers/numberNode.js";
+import { add } from "../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../tree/nodes/operators/fractionNode.js";
 import { MultiplyNode } from "../../../tree/nodes/operators/multiplyNode.js";
+import { square } from "../../../tree/nodes/operators/powerNode.js";
 import { random } from "../../../utils/alea/random.js";
+import { alignTex } from "../../../utils/latex/alignTex.js";
 const getInstruction = (identifiers) => {
     const zTex = identifiers.zTex;
-    return `Soit $z=${zTex}$. 
+    return `Soit le nombre complexe : 
+  
+$$
+z=${zTex}
+$$ 
   
 Déterminer l'argument principal de $z$.`;
 };
@@ -20,6 +29,78 @@ const getAnswer = (identifiers) => {
     const answer = arg.angle.toTex();
     return answer;
 };
+const getHint = () => {
+    return `Soit $z$ un nombre complexe non nul.
+  
+- Si la partie réelle de $z$ est nulle, alors tout argument de $z$ est congru à $0$ modulo $\\pi$.
+- Si la partie imaginaire de $z$ est nulle, alors tout argument de $z$ est congru à $\\frac{\\pi}{2}$ modulo $\\pi$.
+- Dans les autres cas, on peut déterminer un argument $\\theta$ de $z$ en calculant $|z|$, puis en résolvant le système : 
+
+$$
+ \\left\\{\\begin{matrix}
+\\cos(\\theta) = \\frac{x}{|z|} \\\\
+\\sin(\\theta) = \\frac{y}{|z|}
+\\end{matrix}\\right.
+$$
+`;
+};
+const getCorrection = (identifiers) => {
+    const { reIds, imIds } = identifiers;
+    const re = reifyAlgebraic(reIds);
+    const im = reifyAlgebraic(imIds);
+    const answer = getAnswer(identifiers);
+    const module = sqrt(add(square(re), square(im))).simplify();
+    const arg = mainTrigoValues.find((point) => point.angle.evaluate({}) === identifiers.arg);
+    const argCos = arg.cos.toTex();
+    const argSin = arg.sin.toTex();
+    const cosinus = frac(re, module).simplify();
+    const sinus = frac(im, module).simplify();
+    const cosSimp = frac(re, module).toSimplificationTex();
+    const sinSimp = frac(im, module).toSimplificationTex();
+    if (re.evaluate() === 0) {
+        const sign = im.evaluate() > 0 ? "positive" : "négative";
+        return `$z$ est un imaginaire pur dont la partie imaginaire est strictement ${sign}, donc l'argument principal de $z$ est : 
+    
+$$
+${answer}
+$$`;
+    }
+    else if (im.evaluate() === 0) {
+        const sign = re.evaluate() > 0 ? "positive" : "négative";
+        return `$z$ est un réel strictement ${sign}, donc l'argument principal de $z$ est : 
+    
+$$
+${answer}
+$$`;
+    }
+    else {
+        return `On commence par calculer le module de $z$ : 
+    
+${alignTex([
+            ["|z|", "=", sqrt(add(square(re), square(im))).toTex()],
+            ["", "=", sqrt(add(square(re), square(im)).simplify()).toTex()],
+            ["", "=", module.toTex()],
+        ])}
+
+Tout argument $\\theta$ de $z$ vérifie alors : 
+
+$$
+\\cos(\\theta) = ${cosSimp} ${argCos !== cosinus.toTex() ? `= ${argCos}` : ""}
+$$
+
+et 
+
+$$
+\\sin(\\theta) = ${sinSimp} ${argSin !== sinus.toTex() ? `= ${argSin}` : ""}
+$$
+
+On en déduit que l'argument principal de $z$ est : 
+
+$$
+${answer}
+$$`;
+    }
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -27,6 +108,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["pi"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -41,7 +124,12 @@ const getArgumentFromAlgebraicComplexQuestion = () => {
     const im = new MultiplyNode(factor, arg.sin).simplify();
     const z = new ComplexNode(re, im);
     const zTex = z.toTex();
-    const identifiers = { arg: arg.angle.evaluate({}), zTex };
+    const identifiers = {
+        arg: arg.angle.evaluate({}),
+        zTex,
+        reIds: re.toIdentifiers(),
+        imIds: im.toIdentifiers(),
+    };
     return getQuestionFromIdentifiers(identifiers);
 };
 const getPropositions = (n, { answer }) => {
@@ -70,4 +158,5 @@ export const argumentFromAlgebraicComplex = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

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

@@ -1 +1 @@
-{"version":3,"file":"conjugateDivideComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/conjugateDivideComplex.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;AA6EF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAaxD,CAAC"}
+{"version":3,"file":"conjugateDivideComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/conjugateDivideComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;CACd,CAAC;AAyIF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAcxD,CAAC"}

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

@@ -1,7 +1,10 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Complex, ComplexConstructor } from "../../../math/complex/complex.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { frac } from "../../../tree/nodes/operators/fractionNode.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]);
@@ -17,19 +20,75 @@ const getAnswer = (identifiers) => {
     const answerTex = conjz1.divideNode(conjz2).toTex();
     return answerTex;
 };
+const getHint = () => {
+    return `Pour calculer un quotient dans $\\mathbb{C}$, on multiplie le numérateur et le dénominateur par le conjugué du dénominateur.
+
+On rappelle que le conjugué d'un nombre complexe $z$ est le nombre complexe de même partie réelle et de partie imaginaire opposée.
+  `;
+};
+const getCorrection = (identifiers) => {
+    const z1 = new Complex(identifiers.z1[0], identifiers.z1[1]);
+    const z2 = new Complex(identifiers.z2[0], identifiers.z2[1]);
+    const z1Tree = z1.toTree();
+    const z2Tree = z2.toTree();
+    const conj = z2.conjugate().toTree();
+    const num = z1.multiply(z2.conjugate()).toTree();
+    const denum = z2.multiply(z2.conjugate()).toTree();
+    //   const zTree = z.toTree();
+    //   const conj = z.conjugate().toTree();
+    return `On a 
+
+$$
+z = ${z1Tree.toTex()}
+$$
+
+$$
+z' = ${z2Tree.toTex()}
+$$
+
+et on veut calculer le conjugué de $\\frac{z}{z'}$.
+
+On commence par calculer $\\frac{z}{z'}$. Pour cela, on multiplie le numérateur et le dénominateur par le conjugué de $z'$, c'est à dire par :
+
+$$
+${conj.toTex()}
+$$
+
+Cela donne : 
+
+
+${alignTex([
+        ["", ` \\frac{${z1Tree.toTex()}}{${z2Tree.toTex()}} `],
+        [
+            "=",
+            `\\frac{(${z1Tree.toTex()})(${conj.toTex()})}{(${z2Tree.toTex()})(${conj.toTex()})}`,
+        ],
+        ["=", frac(num, denum).toTex()],
+        ["=", z1.divideNode(z2).toTex()],
+    ])}
+  
+Il suffit maintenant de prendre le conjugué de ce résultat : on obtient
+
+$$
+${getAnswer(identifiers)}
+$$
+`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
-        keys: ["i", "z", "overline", "quote"],
+        keys: ["i"],
         answerFormat: "tex",
         startStatement: "\\overline{\\frac{z}{z'}}",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
 const getConjugateDivideComplexQuestion = () => {
-    const z1 = ComplexConstructor.random();
+    let z1;
     let z2;
     let counter = 0;
     do {
@@ -37,11 +96,12 @@ const getConjugateDivideComplexQuestion = () => {
         if (counter > 1000) {
             throw new Error("conjugate divide complex too many iterations");
         }
-        z2 = ComplexConstructor.random();
-    } while (z1.im === 0 && z2.im === 0);
+        z1 = [randint(-10, 11, [0]), randint(-10, 11, [0])];
+        z2 = [randint(-10, 11, [0]), randint(-10, 11, [0])];
+    } while (z1[0] / z2[0] === z1[1] / z2[1]);
     const identifiers = {
-        z1: [z1.re, z1.im],
-        z2: [z2.re, z2.im],
+        z1,
+        z2,
     };
     return getQuestionFromIdentifiers(identifiers);
 };
@@ -73,4 +133,5 @@ export const conjugateDivideComplex = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

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

@@ -1 +1 @@
-{"version":3,"file":"conjugateMultiplyComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/conjugateMultiplyComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAIrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;CACd,CAAC;AA4EF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAa1D,CAAC"}
+{"version":3,"file":"conjugateMultiplyComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/conjugateMultiplyComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;CACd,CAAC;AA4HF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAc1D,CAAC"}

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

@@ -1,13 +1,17 @@
 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 { 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]);
-    return `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2
-        .toTree()
-        .toTex()}$. Calculer $\\overline{z\\times z'}$.`;
+    return `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2.toTree().toTex()}$. 
+    
+Calculer $\\overline{z\\times z'}$.`;
 };
 const getAnswer = (identifiers) => {
     const z1 = new Complex(identifiers.z1[0], identifiers.z1[1]);
@@ -17,29 +21,63 @@ const getAnswer = (identifiers) => {
     const answer = conj.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$.
+  
+On rappelle que le conjugué $\\overline{z}$ d'un nombre complexe $z$ est le nombre complexe de même partie réelle et de partie imaginaire opposée.`;
+};
+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(),
+        ],
+        [
+            "",
+            "=",
+            add(add(multiply(a, c), multiply(a * d + b * c, "i")), multiply(multiply(b, d), -1))
+                .simplify({ noAddOrder: true })
+                .toTex(),
+        ],
+    ])}
+
+Il suffit alors de prendre le conjugué de ce résultat, on obtient : 
+
+$$
+${getAnswer(identifiers)}
+$$
+`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
-        keys: ["i", "z", "overline", "quote"],
+        keys: ["i"],
         answerFormat: "tex",
         startStatement: "\\overline{z\\times z'}",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
 const getConjugateMultiplyComplexQuestion = () => {
-    const z1 = ComplexConstructor.random();
-    let z2;
-    let counter = 0;
-    do {
-        counter++;
-        if (counter > 1000) {
-            throw new Error("conjugate 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 }) => {
@@ -74,4 +112,5 @@ export const conjugateMultiplyComplex = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

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

@@ -1 +1 @@
-{"version":3,"file":"divideComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/divideComplex.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;AAoEF,eAAO,MAAM,aAAa,EAAE,QAAQ,CAAC,WAAW,CAY/C,CAAC"}
+{"version":3,"file":"divideComplex.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/complex/divideComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;CACd,CAAC;AAyHF,eAAO,MAAM,aAAa,EAAE,QAAQ,CAAC,WAAW,CAa/C,CAAC"}

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

@@ -1,7 +1,10 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Complex, ComplexConstructor } from "../../../math/complex/complex.js";
+import { randint } from "../../../math/utils/random/randint.js";
+import { frac } from "../../../tree/nodes/operators/fractionNode.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,19 +18,68 @@ const getAnswer = (identifiers) => {
     const answerTex = z1.divideNode(z2).toTex();
     return answerTex;
 };
+const getHint = () => {
+    return `Pour calculer un quotient dans $\\mathbb{C}$, on multiplie le numérateur et le dénominateur par le conjugué du dénominateur.
+
+On rappelle que le conjugué d'un nombre complexe $z$ est le nombre complexe de même partie réelle et de partie imaginaire opposée.
+  `;
+};
+const getCorrection = (identifiers) => {
+    const z1 = new Complex(identifiers.z1[0], identifiers.z1[1]);
+    const z2 = new Complex(identifiers.z2[0], identifiers.z2[1]);
+    const z1Tree = z1.toTree();
+    const z2Tree = z2.toTree();
+    const conj = z2.conjugate().toTree();
+    const num = z1.multiply(z2.conjugate()).toTree();
+    const denum = z2.multiply(z2.conjugate()).toTree();
+    //   const zTree = z.toTree();
+    //   const conj = z.conjugate().toTree();
+    return `On a 
+
+$$
+z = ${z1Tree.toTex()}
+$$
+
+$$
+z' = ${z2Tree.toTex()}
+$$
+
+et on veut calculer $\\frac{z}{z'}$.
+
+Pour cela, on multiplie le numérateur et le dénominateur par le conjugué de $z'$, c'est à dire par :
+
+$$
+${conj.toTex()}
+$$
+
+Cela donne : 
+
+
+  ${alignTex([
+        ["", ` \\frac{${z1Tree.toTex()}}{${z2Tree.toTex()}} `],
+        [
+            "=",
+            `\\frac{(${z1Tree.toTex()})(${conj.toTex()})}{(${z2Tree.toTex()})(${conj.toTex()})}`,
+        ],
+        ["=", frac(num, denum).toTex()],
+        ["=", getAnswer(identifiers)],
+    ])}`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
-        keys: ["i", "z", "quote"],
+        keys: ["i"],
         answerFormat: "tex",
         startStatement: "\\frac{z}{z'}",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
 const getDivideComplexQuestion = () => {
-    const z1 = ComplexConstructor.random();
+    let z1;
     let z2;
     let counter = 0;
     do {
@@ -35,11 +87,12 @@ const getDivideComplexQuestion = () => {
         if (counter > 1000) {
             throw new Error("divide complex too many iterations");
         }
-        z2 = ComplexConstructor.random();
-    } while (z1.im === 0 && z2.im === 0);
+        z1 = [randint(-10, 11, [0]), randint(-10, 11, [0])];
+        z2 = [randint(-10, 11, [0]), randint(-10, 11, [0])];
+    } while (z1[0] / z2[0] === z1[1] / z2[1]);
     const identifiers = {
-        z1: [z1.re, z1.im],
-        z2: [z2.re, z2.im],
+        z1,
+        z2,
     };
     return getQuestionFromIdentifiers(identifiers);
 };
@@ -71,4 +124,5 @@ export const divideComplex = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/complex/exp/complexAlgebraicFromExpForm.d.ts

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

package/lib/exercises/math/complex/exp/complexAlgebraicFromExpForm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexAlgebraicFromExpForm.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/complex/exp/complexAlgebraicFromExpForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAQ7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,QAAQ,EAAE,eAAe,CAAC;CAC3B,CAAC;AAiLF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAsB7D,CAAC"}