math-exercises 1.3.47 → 1.3.52

package/lib/exercises/calculLitteral/equation/equationSimpleSquare.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"equationSimpleSquare.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationSimpleSquare.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAOF,wBAAgB,uBAAuB,IAAI,QAAQ,CA+JlD"}
+{"version":3,"file":"equationSimpleSquare.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationSimpleSquare.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAOF,wBAAgB,uBAAuB,IAAI,QAAQ,CA2JlD"}

package/lib/exercises/calculLitteral/equation/equationSimpleSquare.js

@@ -4,8 +4,11 @@ exports.getEquationSimpleSquare = exports.equationSimpleSquare = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const randint_1 = require("../../../math/utils/random/randint");
 const coinFlip_1 = require("../../../utils/coinFlip");
+const diceFlip_1 = require("../../../utils/diceFlip");
+const random_1 = require("../../../utils/random");
 const shuffle_1 = require("../../../utils/shuffle");
 const uuid_1 = require("uuid");
+const squares = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12].map((el) => el ** 2);
 exports.equationSimpleSquare = {
     id: 'equationSimpleSquare',
     connector: '=',
@@ -24,22 +27,26 @@ const higherFactor = (n) => {
     return 1;
 };
 function getEquationSimpleSquare() {
-    let randNbr = (0, randint_1.randint)(-20, 100);
+    let randNbr = (0, randint_1.randint)(-20, 101);
     let answer;
-    if (randNbr >= 0)
-        while (higherFactor(randNbr) === 1)
-            randNbr = (0, randint_1.randint)(1, 100);
-    const instruction = `Résoudre l'équation suivante : $x^2 = ${randNbr}$`;
+    const rand = (0, diceFlip_1.diceFlip)(3);
+    if (rand === 0)
+        randNbr = (0, randint_1.randint)(-20, 0);
+    else if (rand === 1)
+        randNbr = (0, random_1.random)(squares);
+    else
+        randNbr = (0, randint_1.randint)(2, 100);
+    const instruction = `Résoudre l'équation : $x^2 = ${randNbr}$`;
     const ans = Math.sqrt(randNbr);
-    if (ans === Math.floor(ans))
-        answer = `\\{${ans}\\ ; -${ans}\\}`;
+    if (randNbr < 0)
+        answer = `S=\\emptyset`;
+    else if (ans === Math.floor(ans))
+        answer = `S=\\left\\{${ans}\\ ; -${ans}\\right\\}`;
     else {
         const factor = higherFactor(randNbr);
         const radicand = randNbr / factor ** 2;
-        answer = `\\{${factor}\\sqrt{${radicand}}\\ ; -${factor}\\sqrt{${radicand}} \\}`;
+        answer = `S=\\left\\{${factor === 1 ? '' : factor}\\sqrt{${radicand}}\\ ; -${factor === 1 ? '' : factor}\\sqrt{${radicand}} \\right\\}`;
     }
-    if (randNbr < 0)
-        answer = `\\emptyset`;
     const getPropositions = (n) => {
         const res = [];
         res.push({
@@ -51,25 +58,18 @@ function getEquationSimpleSquare() {
         if (ans === Math.floor(ans)) {
             res.push({
                 id: (0, uuid_1.v4)() + '',
-                statement: `${ans}`,
+                statement: `S=\\left\\{${ans}\\right\\}`,
                 isRightAnswer: false,
                 format: 'tex',
             });
-            if (n > 2)
-                res.push({
-                    id: (0, uuid_1.v4)() + '',
-                    statement: `${ans + (0, randint_1.randint)(-ans + 1, 7, [0])}`,
-                    isRightAnswer: false,
-                    format: 'tex',
-                });
-            for (let i = 0; i < n - 3; i++) {
+            for (let i = 0; i < n - 2; i++) {
                 let isDuplicate;
                 let proposition;
                 do {
                     const tempAns = ans + (0, randint_1.randint)(-ans + 1, 7, [0]);
                     proposition = {
                         id: (0, uuid_1.v4)() + '',
-                        statement: (0, coinFlip_1.coinFlip)() ? `\\{${tempAns}\\ ; -${tempAns}\\}` : `\\emptyset`,
+                        statement: (0, coinFlip_1.coinFlip)() ? `S=\\left\\{${tempAns}\\ ; -${tempAns}\\right\\}` : `S=\\emptyset`,
                         isRightAnswer: false,
                         format: 'tex',
                     };
@@ -123,7 +123,7 @@ function getEquationSimpleSquare() {
         else {
             res.push({
                 id: (0, uuid_1.v4)() + '',
-                statement: `-\\sqrt${-randNbr}`,
+                statement: `-\\sqrt{${-randNbr}}`,
                 isRightAnswer: false,
                 format: 'tex',
             });

package/lib/exercises/calculLitteral/equation/equationType1Exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"equationType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType1Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAiD3D"}
+{"version":3,"file":"equationType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType1Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAoD3D"}

package/lib/exercises/calculLitteral/equation/equationType1Exercise.js

@@ -2,11 +2,9 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getEquationType1ExerciseQuestion = exports.equationType1Exercise = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const integer_1 = require("../../../math/numbers/integer/integer");
 const affine_1 = require("../../../math/polynomials/affine");
-const discreteSet_1 = require("../../../math/sets/discreteSet");
-const intervals_1 = require("../../../math/sets/intervals/intervals");
 const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const equalNode_1 = require("../../../tree/nodes/operators/equalNode");
 const shuffle_1 = require("../../../utils/shuffle");
 const uuid_1 = require("uuid");
@@ -25,13 +23,11 @@ exports.equationType1Exercise = {
     keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
 };
 function getEquationType1ExerciseQuestion() {
-    const interval = new intervals_1.Interval('[[-10; 10]]');
-    const intervalStar = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
-    const b = interval.getRandomElement();
-    const a = intervalStar.getRandomElement();
-    const solution = b.value - a.value;
-    const affine = new affine_1.Affine(1, a.value).toTree();
-    const tree = new equalNode_1.EqualNode(affine, b.toTree());
+    const b = (0, randint_1.randint)(-10, 11);
+    const a = (0, randint_1.randint)(-10, 11, [0]);
+    const solution = b - a;
+    const affine = new affine_1.Affine(1, a).toTree();
+    const tree = new equalNode_1.EqualNode(affine, new numberNode_1.NumberNode(b));
     const getPropositions = (n) => {
         const res = [];
         res.push({
@@ -40,7 +36,13 @@ function getEquationType1ExerciseQuestion() {
             isRightAnswer: true,
             format: 'tex',
         });
-        for (let i = 0; i < n - 1; i++) {
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: `x = ${b + a}`,
+            isRightAnswer: false,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 2; i++) {
             let isDuplicate;
             let proposition;
             do {

package/lib/exercises/calculLitteral/equation/equationType2Exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"equationType2Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType2Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAqD3D"}
+{"version":3,"file":"equationType2Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType2Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAoD3D"}

package/lib/exercises/calculLitteral/equation/equationType2Exercise.js

@@ -2,10 +2,8 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getEquationType2ExerciseQuestion = exports.equationType2Exercise = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const integer_1 = require("../../../math/numbers/integer/integer");
 const rational_1 = require("../../../math/numbers/rationals/rational");
 const affine_1 = require("../../../math/polynomials/affine");
-const discreteSet_1 = require("../../../math/sets/discreteSet");
 const intervals_1 = require("../../../math/sets/intervals/intervals");
 const randint_1 = require("../../../math/utils/random/randint");
 const equalNode_1 = require("../../../tree/nodes/operators/equalNode");
@@ -28,11 +26,10 @@ exports.equationType2Exercise = {
 };
 function getEquationType2ExerciseQuestion() {
     const interval = new intervals_1.Interval('[[-10; 10]]');
-    const intervalStar = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
     const b = interval.getRandomElement();
-    const a = intervalStar.getRandomElement();
-    const solution = new rational_1.Rational(b.value, a.value).simplify();
-    const affine = new affine_1.Affine(a.value, 0).toTree();
+    const a = (0, randint_1.randint)(-9, 10, [0, 1]);
+    const solution = new rational_1.Rational(b.value, a).simplify();
+    const affine = new affine_1.Affine(a, 0).toTree();
     const tree = new equalNode_1.EqualNode(affine, b.toTree());
     const answer = new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), solution.toTree());
     const getPropositions = (n) => {
@@ -47,7 +44,7 @@ function getEquationType2ExerciseQuestion() {
             let isDuplicate;
             let proposition;
             do {
-                const wrongAnswer = new rational_1.Rational(b.value + (0, randint_1.randint)(-7, 8, [0, -b.value]), a.value + (0, randint_1.randint)(-7, 8, [-a.value, 0])).simplify();
+                const wrongAnswer = new rational_1.Rational(b.value + (0, randint_1.randint)(-7, 8, [0, -b.value]), a + (0, randint_1.randint)(-7, 8, [-a, 0])).simplify();
                 proposition = {
                     id: (0, uuid_1.v4)() + '',
                     statement: new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), wrongAnswer.toTree()).toTex(),

package/lib/exercises/calculLitteral/equation/firstDegreeEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"firstDegreeEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/firstDegreeEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CA6CjD"}
+{"version":3,"file":"firstDegreeEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/firstDegreeEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CAoDjD"}

package/lib/exercises/calculLitteral/equation/firstDegreeEquation.js

@@ -25,17 +25,23 @@ function getFirstDegreeEquation() {
         const res = [];
         res.push({
             id: (0, uuid_1.v4)() + '',
-            statement: (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)).toTex(),
+            statement: `x=${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)).toTex()}`,
             isRightAnswer: true,
             format: 'tex',
         });
-        for (let i = 0; i < n - 1; i++) {
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: `x=${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(b / a)).toTex()}`,
+            isRightAnswer: false,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 2; i++) {
             let isDuplicate;
             let proposition;
             do {
                 proposition = {
                     id: (0, uuid_1.v4)() + '',
-                    statement: (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode((a + (0, randint_1.randint)(-7, 8, [-a])) / (b + (0, randint_1.randint)(-7, 8, [-b])))).toTex(),
+                    statement: `x=${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode((a + (0, randint_1.randint)(-7, 8, [-a])) / (b + (0, randint_1.randint)(-7, 8, [-b])))).toTex()}`,
                     isRightAnswer: false,
                     format: 'tex',
                 };
@@ -48,7 +54,7 @@ function getFirstDegreeEquation() {
     const question = {
         instruction: `Résoudre l'équation suivante : $\\frac{${a}}{x} = ${b}$`,
         startStatement: `x`,
-        answer: (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)).toTex(),
+        answer: `x=${(0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)).toTex()}`,
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
         getPropositions,
         answerFormat: 'tex',

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

@@ -0,0 +1,4 @@
+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.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"addComplex.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/addComplex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,UAAU,EAAE,QASxB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAyDhD"}

package/lib/exercises/complex/addComplex.js

@@ -0,0 +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;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"conjugateComplex.ts.d.ts","sourceRoot":"","sources":["../../../src/exercises/complex/conjugateComplex.ts.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,gBAAgB,EAAE,QAS9B,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CA6DtD"}

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

@@ -0,0 +1,73 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getConjugateComplexQuestion = exports.conjugateComplex = 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.conjugateComplex = {
+    id: 'conjugateComplex',
+    connector: '=',
+    instruction: '',
+    label: "Conjugué d'un nombre complexe",
+    levels: ['MathExp'],
+    isSingleStep: true,
+    sections: ['Nombres complexes'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getConjugateComplexQuestion, nb),
+};
+function getConjugateComplexQuestion() {
+    const complex = complex_1.ComplexConstructor.random();
+    const answer = complex.conjugate().toTree().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 conjOpposite = complex.conjugate().opposite().toTree().toTex();
+        if (!res.some((prop) => prop.statement === conjOpposite))
+            res.push({
+                id: (0, uuid_1.v4)(),
+                statement: conjOpposite,
+                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 le conjugué de $z=${complex.toTree().toTex()}$.`,
+        keys: ['i'],
+        getPropositions,
+        answerFormat: 'tex',
+        startStatement: '\\overline z',
+    };
+    return question;
+}
+exports.getConjugateComplexQuestion = getConjugateComplexQuestion;

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"}