math-exercises 1.3.39 → 1.3.41

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

@@ -5,6 +5,8 @@ const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQues
 const randint_1 = require("../../../math/utils/random/randint");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.firstDegreeEquation = {
     id: 'firstDegreeEquation',
     connector: '=',
@@ -19,11 +21,34 @@ exports.firstDegreeEquation = {
 function getFirstDegreeEquation() {
     const a = (0, randint_1.randint)(-30, 30, [0]);
     const b = (0, randint_1.randint)(-30, 30, [0]);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)).toTex(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; 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(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     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(),
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        getPropositions,
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"fractionEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/fractionEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAuB9C"}
+{"version":3,"file":"fractionEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/fractionEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CA8D9C"}

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

@@ -7,6 +7,8 @@ const randint_1 = require("../../../math/utils/random/randint");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
 const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.fractionEquation = {
     id: 'fractionEquation',
     connector: '\\iff',
@@ -29,10 +31,40 @@ function getFractionEquation() {
     const answer = -d / c === -b / a
         ? `S = \\emptyset`
         : `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()}\\right\\}`;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const a = (0, randint_1.randint)(-9, 10, [0]);
+                const b = (0, randint_1.randint)(-9, 10, [0]);
+                const c = (0, randint_1.randint)(-9, 10, [0]);
+                const d = (0, randint_1.randint)(-9, 10, [0]);
+                const wrongAnswer = -d / c === -b / a
+                    ? `S = \\emptyset`
+                    : `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()}\\right\\}`;
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         startStatement: `\\frac{${polynome1.toTex()}}{${polynome2.toTex()}} = 0`,
         answer,
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou', 'emptyset'],
+        getPropositions,
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"multiplicationEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/multiplicationEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,sBAAsB,EAAE,QAUpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAsBpD"}
+{"version":3,"file":"multiplicationEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/multiplicationEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,sBAAsB,EAAE,QAUpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAsEpD"}

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

@@ -7,6 +7,8 @@ const randint_1 = require("../../../math/utils/random/randint");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
 const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.multiplicationEquation = {
     id: 'multiplicationEquation',
     connector: '\\iff',
@@ -29,10 +31,43 @@ function getMultiplicationEquation() {
     } while (a / c === b / d);
     const polynome1 = new polynomial_1.Polynomial([b, a]);
     const polynome2 = new polynomial_1.Polynomial([d, c]);
+    const answer = `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                do {
+                    a = (0, randint_1.randint)(-9, 10, [0]);
+                    b = (0, randint_1.randint)(-9, 10, [0]);
+                    c = (0, randint_1.randint)(-9, 10, [0]);
+                    d = (0, randint_1.randint)(-9, 10, [0]);
+                } while (a / c === b / d);
+                const polynome1 = new polynomial_1.Polynomial([b, a]);
+                const polynome2 = new polynomial_1.Polynomial([d, c]);
+                const wrongAnswer = `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`;
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         startStatement: `(${polynome1.toTex()})(${polynome2.toTex()}) = 0`,
         answer: `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`,
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calculLitteral/factorisation/factoIdRmq1.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAc9D,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAWhD"}
+{"version":3,"file":"factoIdRmq1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAuDhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq1.js

@@ -6,8 +6,11 @@ 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 powerNode_1 = require("../../../tree/nodes/operators/powerNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.factoIdRmq1 = {
     id: 'factoIdRmq1',
     connector: '=',
@@ -24,10 +27,39 @@ function getFactoType1Question() {
     const affine = affine_1.AffineConstructor.random(interval, interval);
     const statementTree = affine.multiply(affine).toTree();
     const answerTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new powerNode_1.PowerNode(new affine_1.Affine(affine.b, affine.a).toTree(), new numberNode_1.NumberNode(2)).toTex(),
+            isRightAnswer: false,
+        });
+        for (let i = 0; i < n - 2; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new powerNode_1.PowerNode(new affine_1.Affine(affine.a + (0, randint_1.randint)(-affine.a + 1, 10 - affine.a), affine.b + (0, randint_1.randint)(-affine.b + 1, 10 - affine.b)).toTree(), new numberNode_1.NumberNode(2));
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calculLitteral/factorisation/factoIdRmq2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAc9D,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAahD"}
+{"version":3,"file":"factoIdRmq2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAgEhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq2.js

@@ -6,8 +6,11 @@ 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 powerNode_1 = require("../../../tree/nodes/operators/powerNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.factoIdRmq2 = {
     id: 'factoIdRmq2',
     connector: '=',
@@ -25,10 +28,45 @@ function getFactoType1Question() {
     const affine = affine_1.AffineConstructor.random(intervalA, intervalB);
     const statementTree = affine.multiply(affine).toTree();
     const answerTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new powerNode_1.PowerNode(new affine_1.Affine(-affine.b, -affine.a).toTree(), new numberNode_1.NumberNode(2)).toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new powerNode_1.PowerNode(new affine_1.Affine(-affine.a, affine.b).toTree(), new numberNode_1.NumberNode(2)).toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 3; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new powerNode_1.PowerNode(new affine_1.Affine(affine.a + (0, randint_1.randint)(-affine.a + 1, 10 - affine.a), affine.b + (0, randint_1.randint)(-9 - affine.b, -affine.b)).toTree(), new numberNode_1.NumberNode(2));
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calculLitteral/factorisation/factoIdRmq3.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq3.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAc9D,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAahD"}
+{"version":3,"file":"factoIdRmq3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq3.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAqEhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq3.js

@@ -6,7 +6,10 @@ 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 multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.factoIdRmq3 = {
     id: 'factoIdRmq3',
     connector: '=',
@@ -24,10 +27,51 @@ function getFactoType1Question() {
     const affine2 = new affine_1.Affine(affine.a, -affine.b);
     const statementTree = affine.multiply(affine2).toTree();
     const answerTree = new multiplyNode_1.MultiplyNode(affine.toTree(), affine2.toTree());
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new multiplyNode_1.MultiplyNode(affine.toTree(), affine.toTree()).toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), affine2.toTree()).toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), new affine_1.Affine(-affine.b, affine.a).toTree()).toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new multiplyNode_1.MultiplyNode(new affine_1.Affine((0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10, [0])).toTree(), new affine_1.Affine((0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10, [0])).toTree());
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoType1Exercise.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS9D,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA6BhD"}
+{"version":3,"file":"factoType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoType1Exercise.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA6FhD"}

package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.js

@@ -11,6 +11,7 @@ const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
 const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
 const random_1 = require("../../../utils/random");
 const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.factoType1Exercise = {
     id: 'facto1',
     connector: '=',
@@ -30,10 +31,51 @@ function getFactoType1Question() {
         ? new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(permut[0][0].toTree(), permut[0][1].toTree()), new multiplyNode_1.MultiplyNode(permut[1][0].toTree(), permut[1][1].toTree()))
         : new substractNode_1.SubstractNode(new multiplyNode_1.MultiplyNode(permut[0][0].toTree(), permut[0][1].toTree()), new multiplyNode_1.MultiplyNode(permut[1][0].toTree(), permut[1][1].toTree()));
     const answerTree = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree());
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(operation !== 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affines[1].toTree(), affines[0].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new multiplyNode_1.MultiplyNode(affines[2].toTree(), affines[0].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(affine_1.AffineConstructor.differentRandoms(1)[0]).toTree());
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],
+        getPropositions,
     };
     return question;
 }

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

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

package/lib/exercises/calculLitteral/simplifying/evaluateExpression.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluateExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/evaluateExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAiDhD"}

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

@@ -0,0 +1,61 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getEvaluateExpression = exports.evaluateExpression = 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 coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.evaluateExpression = {
+    id: 'evaluateExpression',
+    connector: '=',
+    instruction: '',
+    label: 'Evaluer une expression',
+    levels: ['4', '3', '2'],
+    section: 'Calcul littéral',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEvaluateExpression, nb),
+    keys: ['x'],
+};
+function getEvaluateExpression() {
+    const rand = (0, coinFlip_1.coinFlip)();
+    const polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-5, 6, [0])]);
+    const polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-4, 5, [0])]);
+    const xValue = (0, randint_1.randint)(-9, 10);
+    const statement = rand
+        ? `Calculer $${polynome1.toTree().toTex()}$ pour $x = ${xValue}$`
+        : `Calculer $${polynome2.toTree().toTex()}$ pour $x = ${xValue}$`;
+    const answer = rand ? polynome1.calculate(xValue) : polynome2.calculate(xValue);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer + '',
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = answer + (0, randint_1.randint)(-10, 11, [0]);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: statement,
+        answer: answer + '',
+        keys: ['x'],
+        getPropositions,
+    };
+    return question;
+}
+exports.getEvaluateExpression = getEvaluateExpression;

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"reduceExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/reduceExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAgI9C"}

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

@@ -0,0 +1,118 @@
+"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', '3', '2'],
+    section: '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,
+        });
+        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,
+                };
+                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,
+    };
+    return question;
+}
+exports.getReduceExpression = getReduceExpression;

package/lib/exercises/conversion/aeraConversion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aeraConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/aeraConversion.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGjD,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CAmB5C"}
+{"version":3,"file":"aeraConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/aeraConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CAoD5C"}