math-exercises 1.3.50 → 1.3.53

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

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const conjugateDivideComplex: Exercise;
+export declare function getConjugateDivideComplexQuestion(): Question;
+//# sourceMappingURL=conjugateDivideComplex.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"conjugateDivideComplex.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/conjugateDivideComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,sBAAsB,EAAE,QASpC,CAAC;AAEF,wBAAgB,iCAAiC,IAAI,QAAQ,CAwD5D"}

package/lib/exercises/complex/conjugateDivideComplex.js

@@ -0,0 +1,65 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getConjugateDivideComplexQuestion = exports.conjugateDivideComplex = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const complex_1 = require("../../math/complex/complex");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.conjugateDivideComplex = {
+    id: 'conjugateDivideComplex',
+    connector: '=',
+    instruction: '',
+    label: "Conjugué d'une fraction de nombres complexes",
+    levels: ['MathExp'],
+    isSingleStep: true,
+    sections: ['Nombres complexes'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getConjugateDivideComplexQuestion, nb),
+};
+function getConjugateDivideComplexQuestion() {
+    const z1 = complex_1.ComplexConstructor.random();
+    let z2;
+    do {
+        z2 = complex_1.ComplexConstructor.random();
+    } while (z1.im === 0 && z2.im === 0);
+    const conjz1 = z1.conjugate();
+    const conjz2 = z2.conjugate();
+    const answerTex = conjz1.divideNode(conjz2).toTex();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answerTex,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = complex_1.ComplexConstructor.random();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTree().toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answerTex,
+        instruction: `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2
+            .toTree()
+            .toTex()}$. Calculer le conjugué de $\\frac{z}{z'}$.`,
+        keys: ['i', 'z', 'quote'],
+        getPropositions,
+        answerFormat: 'tex',
+        startStatement: "\\overline{\\frac{z}{z'}}",
+    };
+    return question;
+}
+exports.getConjugateDivideComplexQuestion = getConjugateDivideComplexQuestion;

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

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const conjugateMultiplyComplex: Exercise;
+export declare function getConjugateMultiplyComplexQuestion(): Question;
+//# sourceMappingURL=conjugateMultiplyComplex.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"conjugateMultiplyComplex.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/conjugateMultiplyComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,wBAAwB,EAAE,QAStC,CAAC;AAEF,wBAAgB,mCAAmC,IAAI,QAAQ,CA4D9D"}

package/lib/exercises/complex/conjugateMultiplyComplex.js

@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getConjugateMultiplyComplexQuestion = exports.conjugateMultiplyComplex = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const complex_1 = require("../../math/complex/complex");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.conjugateMultiplyComplex = {
+    id: 'conjugateMultiplyComplex',
+    connector: '=',
+    instruction: '',
+    label: "Conjugué d'un produit de nombres complexes",
+    levels: ['MathExp'],
+    isSingleStep: true,
+    sections: ['Nombres complexes'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getConjugateMultiplyComplexQuestion, nb),
+};
+function getConjugateMultiplyComplexQuestion() {
+    const z1 = complex_1.ComplexConstructor.random();
+    let z2;
+    do {
+        z2 = complex_1.ComplexConstructor.random();
+    } while (z1.im === 0 && z2.im === 0);
+    const prod = z1.multiply(z2);
+    const conj = prod.conjugate();
+    const answer = conj.toTree();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: prod.toTree().toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = complex_1.ComplexConstructor.random();
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: wrongAnswer.toTree().toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answer.toTex(),
+        instruction: `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2.toTree().toTex()}$. Calculer $\\overline{z\\times z'}$.`,
+        keys: ['i', 'z', 'quote'],
+        getPropositions,
+        answerFormat: 'tex',
+        startStatement: "\\overline{z\\times z'}",
+    };
+    return question;
+}
+exports.getConjugateMultiplyComplexQuestion = getConjugateMultiplyComplexQuestion;

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

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const divideComplex: Exercise;
+export declare function getDivideComplexQuestion(): Question;
+//# sourceMappingURL=divideComplex.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"divideComplex.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/divideComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,aAAa,EAAE,QAS3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAmDnD"}

package/lib/exercises/complex/divideComplex.js

@@ -0,0 +1,61 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getDivideComplexQuestion = exports.divideComplex = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const complex_1 = require("../../math/complex/complex");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.divideComplex = {
+    id: 'divideComplex',
+    connector: '=',
+    instruction: '',
+    label: 'Diviser deux nombres complexes',
+    levels: ['MathExp'],
+    isSingleStep: true,
+    sections: ['Nombres complexes'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDivideComplexQuestion, nb),
+};
+function getDivideComplexQuestion() {
+    const z1 = complex_1.ComplexConstructor.random();
+    let z2;
+    do {
+        z2 = complex_1.ComplexConstructor.random();
+    } while (z1.im === 0 && z2.im === 0);
+    const answerTex = z1.divideNode(z2).toTex();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answerTex,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = complex_1.ComplexConstructor.random();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTree().toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answerTex,
+        instruction: `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2.toTree().toTex()}$. Calculer $\\frac{z}{z'}$.`,
+        keys: ['i', 'z', 'quote'],
+        getPropositions,
+        answerFormat: 'tex',
+        startStatement: "\\frac{z}{z'}",
+    };
+    return question;
+}
+exports.getDivideComplexQuestion = getDivideComplexQuestion;

package/lib/exercises/complex/inverseComplex.d.ts

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const inverseComplex: Exercise;
+export declare function getInverseComplexQuestion(): Question;
+//# sourceMappingURL=inverseComplex.d.ts.map

package/lib/exercises/complex/inverseComplex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inverseComplex.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/inverseComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,cAAc,EAAE,QAS5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CA6DpD"}

package/lib/exercises/complex/inverseComplex.js

@@ -0,0 +1,73 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getInverseComplexQuestion = exports.inverseComplex = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const complex_1 = require("../../math/complex/complex");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.inverseComplex = {
+    id: 'inverseComplex',
+    connector: '=',
+    instruction: '',
+    label: "Inverse d'un nombre complexe",
+    levels: ['MathExp'],
+    isSingleStep: true,
+    sections: ['Nombres complexes'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInverseComplexQuestion, nb),
+};
+function getInverseComplexQuestion() {
+    const complex = complex_1.ComplexConstructor.randomNotReal();
+    const answer = complex.inverseNode().toTex();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const opposite = complex.opposite().toTree().toTex();
+        if (opposite !== answer)
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: opposite,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        const conj = complex.conjugate().toTree().toTex();
+        if (!res.some((prop) => prop.statement === conj))
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: conj,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = complex_1.ComplexConstructor.random();
+                proposition = {
+                    id: (0, uuid_1.v4)() + ``,
+                    statement: wrongAnswer.toTree().toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer,
+        instruction: `Déterminer l'inverse de $z=${complex.toTree().toTex()}$.`,
+        keys: ['i'],
+        getPropositions,
+        answerFormat: 'tex',
+        startStatement: '\\frac{1}{z}',
+    };
+    return question;
+}
+exports.getInverseComplexQuestion = getInverseComplexQuestion;

package/lib/exercises/complex/linearCombinaisonComplex.d.ts

@@ -0,0 +1,4 @@
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const linearCombinaisonComplex: Exercise;
+export declare function getLinearCombinaisonComplexQuestion(): Question;
+//# sourceMappingURL=linearCombinaisonComplex.d.ts.map

package/lib/exercises/complex/linearCombinaisonComplex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"linearCombinaisonComplex.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/linearCombinaisonComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAc3E,eAAO,MAAM,wBAAwB,EAAE,QAStC,CAAC;AAEF,wBAAgB,mCAAmC,IAAI,QAAQ,CA0D9D"}

package/lib/exercises/complex/linearCombinaisonComplex.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLinearCombinaisonComplexQuestion = exports.linearCombinaisonComplex = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const complex_1 = require("../../math/complex/complex");
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.linearCombinaisonComplex = {
+    id: 'linearCombinaisonComplex',
+    connector: '=',
+    instruction: '',
+    label: 'Combinaison linéaire de deux nombres complexes',
+    levels: ['MathExp'],
+    isSingleStep: true,
+    sections: ['Nombres complexes'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLinearCombinaisonComplexQuestion, nb),
+};
+function getLinearCombinaisonComplexQuestion() {
+    const z1 = complex_1.ComplexConstructor.random();
+    const z2 = complex_1.ComplexConstructor.random();
+    const a = (0, randint_1.randint)(-10, 11, [0]);
+    const b = (0, randint_1.randint)(-10, 11, [0]);
+    const statement = (0, simplify_1.simplifyNode)(new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new variableNode_1.VariableNode('z_1')), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(b), new variableNode_1.VariableNode('z_2'))));
+    //   const statement = simplify(`${a}z+${b}z'`);
+    const answer = (0, simplify_1.simplifyComplex)(new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), z1.toTree()), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(b), z2.toTree())));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = complex_1.ComplexConstructor.random();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTree().toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answer.toTex(),
+        instruction: `Soit $z_1=${z1.toTree().toTex()}$ et $z_2=${z2.toTree().toTex()}$. Calculer $${statement.toTex()}$.`,
+        keys: ['i', 'z', 'quote'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLinearCombinaisonComplexQuestion = getLinearCombinaisonComplexQuestion;

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

@@ -1,4 +1,4 @@
-import { Exercise, Question } from '../../exercises/exercise';
-export declare const mutiplyComplex: Exercise;
-export declare function getMutiplyComplexQuestion(): Question;
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const mutiplyComplex: Exercise;
+export declare function getMutiplyComplexQuestion(): Question;
 //# sourceMappingURL=mutiplyComplex.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"mutiplyComplex.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/mutiplyComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,cAAc,EAAE,QAS5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAsDpD"}
+{"version":3,"file":"mutiplyComplex.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/mutiplyComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,cAAc,EAAE,QAS5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CA0DpD"}

package/lib/exercises/complex/mutiplyComplex.js

@@ -1,65 +1,67 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getMutiplyComplexQuestion = exports.mutiplyComplex = void 0;
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const complex_1 = require("../../math/complex/complex");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const simplify_1 = require("../../tree/parsers/simplify");
-const shuffle_1 = require("../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.mutiplyComplex = {
-    id: 'mutiplyComplex',
-    connector: '=',
-    instruction: '',
-    label: 'Multiplier deux nombres complexes',
-    levels: ['MathExp'],
-    isSingleStep: true,
-    sections: ['Nombres complexes'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMutiplyComplexQuestion, nb),
-};
-function getMutiplyComplexQuestion() {
-    const z1 = complex_1.ComplexConstructor.random();
-    const z2 = complex_1.ComplexConstructor.random();
-    const answer = (0, simplify_1.simplifyComplex)(new multiplyNode_1.MultiplyNode(z1.toTree(), z2.toTree()));
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: answer.toTex(),
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        res.push({
-            id: (0, uuid_1.v4)(),
-            statement: answer.toComplex().conjugate().toTree().toTex(),
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        const missing = n - res.length;
-        for (let i = 0; i < missing; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongAnswer = complex_1.ComplexConstructor.random();
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer.toTree().toTex(),
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        answer: answer.toTex(),
-        instruction: `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2.toTree().toTex()}$. Calculer $z\\times z'$.`,
-        keys: ['i', 'z', 'quote'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getMutiplyComplexQuestion = getMutiplyComplexQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getMutiplyComplexQuestion = exports.mutiplyComplex = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const complex_1 = require("../../math/complex/complex");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.mutiplyComplex = {
+    id: 'mutiplyComplex',
+    connector: '=',
+    instruction: '',
+    label: 'Multiplier deux nombres complexes',
+    levels: ['MathExp'],
+    isSingleStep: true,
+    sections: ['Nombres complexes'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getMutiplyComplexQuestion, nb),
+};
+function getMutiplyComplexQuestion() {
+    const z1 = complex_1.ComplexConstructor.random();
+    let z2;
+    do {
+        z2 = complex_1.ComplexConstructor.random();
+    } while (z1.im === 0 && z2.im === 0);
+    const answer = z1.multiply(z2).toTree();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer.toComplex().conjugate().toTree().toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = complex_1.ComplexConstructor.random();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTree().toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answer.toTex(),
+        instruction: `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2.toTree().toTex()}$. Calculer $z\\times z'$.`,
+        keys: ['i', 'z', 'quote'],
+        getPropositions,
+        answerFormat: 'tex',
+        startStatement: "z\\times z'",
+    };
+    return question;
+}
+exports.getMutiplyComplexQuestion = getMutiplyComplexQuestion;

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

@@ -1,4 +1,4 @@
-import { Exercise, Question } from '../../exercises/exercise';
-export declare const reAndIm: Exercise;
-export declare function getReAndImQuestion(): Question;
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const reAndIm: Exercise;
+export declare function getReAndImQuestion(): Question;
 //# sourceMappingURL=reAndIm.d.ts.map