math-exercises 1.3.52 → 1.3.54

package/lib/exercises/calculLitteral/simplifying/logSimplifiying.js

@@ -1,78 +1,78 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getExpSimplifiying = exports.logSimplifiying = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const logNode_1 = require("../../../tree/nodes/functions/logNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
-const simplify_1 = require("../../../tree/parsers/simplify");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.logSimplifiying = {
-    id: 'logSimplifiying',
-    connector: '\\iff',
-    instruction: '',
-    label: 'Simplifier des expressions avec $\\ln$',
-    levels: ['1reSpé', 'TermSpé', 'MathComp'],
-    sections: ['Logarithme népérien'],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
-    keys: ['ln'],
-};
-function getExpSimplifiying() {
-    const a = (0, randint_1.randint)(1, 10);
-    const b = (0, randint_1.randint)(1, 10);
-    let expression;
-    let simplifiedExpression;
-    let pm = 0;
-    if ((0, coinFlip_1.coinFlip)()) {
-        expression = new addNode_1.AddNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a)), new logNode_1.LogNode(new numberNode_1.NumberNode(b)));
-        simplifiedExpression = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
-        pm = 1;
-    }
-    else {
-        expression = new substractNode_1.SubstractNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a)), new logNode_1.LogNode(new numberNode_1.NumberNode(b)));
-        simplifiedExpression = new logNode_1.LogNode((0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)));
-        pm = -1;
-    }
-    const getPropositions = (numOptions) => {
-        const propositions = [];
-        propositions.push({
-            id: (0, uuid_1.v4)(),
-            statement: simplifiedExpression.toTex(),
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < numOptions - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const a = (0, randint_1.randint)(1, 10);
-                const b = (0, randint_1.randint)(1, 10);
-                proposition = {
-                    id: (0, uuid_1.v4)(),
-                    statement: pm > 0
-                        ? new logNode_1.LogNode(new numberNode_1.NumberNode(a * b)).toTex()
-                        : new logNode_1.LogNode((0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b))).toTex(),
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            propositions.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(propositions);
-    };
-    const question = {
-        instruction: `Simplifier l'expression $${expression.toTex()}$.`,
-        answer: simplifiedExpression.toTex(),
-        keys: ['ln'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getExpSimplifiying = getExpSimplifiying;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getExpSimplifiying = exports.logSimplifiying = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const logNode_1 = require("../../../tree/nodes/functions/logNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.logSimplifiying = {
+    id: 'logSimplifiying',
+    connector: '\\iff',
+    instruction: '',
+    label: 'Simplifier des expressions avec $\\ln$',
+    levels: ['1reSpé', 'TermSpé', 'MathComp'],
+    sections: ['Logarithme népérien'],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
+    keys: ['ln'],
+};
+function getExpSimplifiying() {
+    const a = (0, randint_1.randint)(1, 10);
+    const b = (0, randint_1.randint)(1, 10);
+    let expression;
+    let simplifiedExpression;
+    let pm = 0;
+    if ((0, coinFlip_1.coinFlip)()) {
+        expression = new addNode_1.AddNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a)), new logNode_1.LogNode(new numberNode_1.NumberNode(b)));
+        simplifiedExpression = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
+        pm = 1;
+    }
+    else {
+        expression = new substractNode_1.SubstractNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a)), new logNode_1.LogNode(new numberNode_1.NumberNode(b)));
+        simplifiedExpression = new logNode_1.LogNode((0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)));
+        pm = -1;
+    }
+    const getPropositions = (numOptions) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: simplifiedExpression.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < numOptions - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const a = (0, randint_1.randint)(1, 10);
+                const b = (0, randint_1.randint)(1, 10);
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: pm > 0
+                        ? new logNode_1.LogNode(new numberNode_1.NumberNode(a * b)).toTex()
+                        : new logNode_1.LogNode((0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b))).toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    const question = {
+        instruction: `Simplifier l'expression $${expression.toTex()}$.`,
+        answer: simplifiedExpression.toTex(),
+        keys: ['ln'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getExpSimplifiying = getExpSimplifiying;

package/lib/exercises/calculLitteral/simplifying/reduceExpression.d.ts

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

package/lib/exercises/calculLitteral/simplifying/reduceExpression.js

@@ -1,121 +1,121 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getReduceExpression = exports.reduceExpression = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const randint_1 = require("../../../math/utils/random/randint");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.reduceExpression = {
-    id: 'reduceExpression',
-    connector: '=',
-    instruction: "Réduire l'expression suivante :",
-    isSingleStep: false,
-    label: 'Réduire une expression',
-    levels: ['4ème', '3ème', '2nde'],
-    sections: ['Calcul littéral'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getReduceExpression, nb),
-    keys: ['x'],
-};
-function getReduceExpression() {
-    const rand = (0, randint_1.randint)(0, 7);
-    let statement;
-    let polynome1;
-    let polynome2;
-    let answer;
-    switch (rand) {
-        case 0: // ax + b + cx + d
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 1:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 2:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 3:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 4:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, 0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 5:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        case 6:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-        default:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(new polynomial_1.Polynomial([1, 2]).toTree(), new polynomial_1.Polynomial([3, 4]).toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
-    }
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                polynome2 = new polynomial_1.Polynomial(rand < 3
-                    ? [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]
-                    : [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]);
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: polynome1.add(polynome2).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 = {
-        startStatement: statement.toTex(),
-        answer,
-        keys: ['x'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getReduceExpression = getReduceExpression;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getReduceExpression = exports.reduceExpression = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../../math/polynomials/polynomial");
+const randint_1 = require("../../../math/utils/random/randint");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.reduceExpression = {
+    id: 'reduceExpression',
+    connector: '=',
+    instruction: "Réduire l'expression suivante :",
+    isSingleStep: false,
+    label: 'Réduire une expression',
+    levels: ['4ème', '3ème', '2nde'],
+    sections: ['Calcul littéral'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getReduceExpression, nb),
+    keys: ['x'],
+};
+function getReduceExpression() {
+    const rand = (0, randint_1.randint)(0, 7);
+    let statement;
+    let polynome1;
+    let polynome2;
+    let answer;
+    switch (rand) {
+        case 0: // ax + b + cx + d
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 1:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 2:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 3:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 4:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, 0, (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 5:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        case 6:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+        default:
+            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
+            statement = new addNode_1.AddNode(new polynomial_1.Polynomial([1, 2]).toTree(), new polynomial_1.Polynomial([3, 4]).toTree());
+            statement.shuffle();
+            answer = polynome1.add(polynome2).toTree().toTex();
+            break;
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                polynome2 = new polynomial_1.Polynomial(rand < 3
+                    ? [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]
+                    : [(0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0]), (0, randint_1.randint)(-5, 6, [0])]);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: polynome1.add(polynome2).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 = {
+        startStatement: statement.toTex(),
+        answer,
+        keys: ['x'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getReduceExpression = getReduceExpression;

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

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

package/lib/exercises/complex/addComplex.js

@@ -1,70 +1,70 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getAddComplexQuestion = exports.addComplex = void 0;
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const complex_1 = require("../../math/complex/complex");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const substractNode_1 = require("../../tree/nodes/operators/substractNode");
-const simplify_1 = require("../../tree/parsers/simplify");
-const shuffle_1 = require("../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.addComplex = {
-    id: 'addComplex',
-    connector: '=',
-    instruction: '',
-    label: 'Additionner deux nombres complexes',
-    levels: ['MathExp'],
-    isSingleStep: true,
-    sections: ['Nombres complexes'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddComplexQuestion, nb),
-};
-function getAddComplexQuestion() {
-    const z1 = complex_1.ComplexConstructor.random();
-    let z2;
-    do {
-        z2 = complex_1.ComplexConstructor.random();
-    } while (z1.im === 0 && z2.im === 0);
-    const answer = (0, simplify_1.simplifyComplex)(new addNode_1.AddNode(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: (0, simplify_1.simplifyComplex)(new substractNode_1.SubstractNode(z1.toTree(), z2.toTree())).toTex(),
-            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: answer.toTex(),
-        instruction: `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2.toTree().toTex()}$. Calculer $z + z'$.`,
-        keys: ['i', 'z', 'quote'],
-        getPropositions,
-        answerFormat: 'tex',
-        startStatement: "z+z'",
-    };
-    return question;
-}
-exports.getAddComplexQuestion = getAddComplexQuestion;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getAddComplexQuestion = exports.addComplex = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const complex_1 = require("../../math/complex/complex");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const substractNode_1 = require("../../tree/nodes/operators/substractNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.addComplex = {
+    id: 'addComplex',
+    connector: '=',
+    instruction: '',
+    label: 'Additionner deux nombres complexes',
+    levels: ['MathExp'],
+    isSingleStep: true,
+    sections: ['Nombres complexes'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddComplexQuestion, nb),
+};
+function getAddComplexQuestion() {
+    const z1 = complex_1.ComplexConstructor.random();
+    let z2;
+    do {
+        z2 = complex_1.ComplexConstructor.random();
+    } while (z1.im === 0 && z2.im === 0);
+    const answer = (0, simplify_1.simplifyComplex)(new addNode_1.AddNode(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: (0, simplify_1.simplifyComplex)(new substractNode_1.SubstractNode(z1.toTree(), z2.toTree())).toTex(),
+            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: answer.toTex(),
+        instruction: `Soit $z=${z1.toTree().toTex()}$ et $z'=${z2.toTree().toTex()}$. Calculer $z + z'$.`,
+        keys: ['i', 'z', 'quote'],
+        getPropositions,
+        answerFormat: 'tex',
+        startStatement: "z+z'",
+    };
+    return question;
+}
+exports.getAddComplexQuestion = getAddComplexQuestion;

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

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