math-exercises 1.3.38 → 1.3.40

package/lib/exercises/calculLitteral/distributivity/secondIdentity.js

@@ -4,10 +4,13 @@ exports.getSecondIdentityQuestion = exports.secondIdentity = 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 polynomial_1 = require("../../../math/polynomials/polynomial");
 const discreteSet_1 = require("../../../math/sets/discreteSet");
 const intervals_1 = require("../../../math/sets/intervals/intervals");
 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.secondIdentity = {
     id: 'idRmq2',
     connector: '=',
@@ -25,10 +28,52 @@ function getSecondIdentityQuestion() {
     const affine = affine_1.AffineConstructor.random(intervalA, intervalB);
     const statementTree = new powerNode_1.PowerNode(affine.toTree(), new numberNode_1.NumberNode(2));
     const answerTree = affine.multiply(affine).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 polynomial_1.Polynomial([-(affine.b ** 2), 0, affine.a ** 2]).toTree().toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a * affine.b, affine.a ** 2]).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new polynomial_1.Polynomial([-(affine.b ** 2), -(affine.a ** 2 + affine.b ** 2), affine.a ** 2]).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const affineTemp = affine_1.AffineConstructor.random(intervalA, intervalB);
+                const wrongAnswer = affine.multiply(affineTemp).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);
+    };
     return {
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],
+        getPropositions,
     };
 }
 exports.getSecondIdentityQuestion = getSecondIdentityQuestion;

package/lib/exercises/calculLitteral/distributivity/simpleDistributivity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"simpleDistributivity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/simpleDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAY1D"}
+{"version":3,"file":"simpleDistributivity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/simpleDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAkE1D"}

package/lib/exercises/calculLitteral/distributivity/simpleDistributivity.js

@@ -8,6 +8,8 @@ const discreteSet_1 = require("../../../math/sets/discreteSet");
 const intervals_1 = require("../../../math/sets/intervals/intervals");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.simpleDistributivity = {
     id: 'simpleDistri',
     connector: '=',
@@ -20,15 +22,57 @@ exports.simpleDistributivity = {
     keys: ['x'],
 };
 function getSimpleDistributivityQuestion() {
-    const interval = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(0)]));
+    const excludeNbrs = [new integer_1.Integer(-1), new integer_1.Integer(0), new integer_1.Integer(1)];
+    const interval = new intervals_1.Interval('[[-10; 10]]').difference(new discreteSet_1.DiscreteSet(excludeNbrs));
     const affine = affine_1.AffineConstructor.random(interval, interval);
     const coeff = interval.getRandomElement();
     const statementTree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff.value), affine.toTree());
     const answerTree = affine.times(coeff.value).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 affine_1.Affine(coeff.value * affine.a, affine.b).toTree().toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: new affine_1.Affine(affine.a, coeff.value * affine.b).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: affine.times(-coeff.value).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = affine_1.AffineConstructor.random(interval, interval).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);
+    };
     return {
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],
+        getPropositions,
     };
 }
 exports.getSimpleDistributivityQuestion = getSimpleDistributivityQuestion;

package/lib/exercises/calculLitteral/distributivity/thirdIdentity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"thirdIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/thirdIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAYnD"}
+{"version":3,"file":"thirdIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/thirdIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAkEnD"}

package/lib/exercises/calculLitteral/distributivity/thirdIdentity.js

@@ -7,6 +7,8 @@ const affine_1 = require("../../../math/polynomials/affine");
 const discreteSet_1 = require("../../../math/sets/discreteSet");
 const intervals_1 = require("../../../math/sets/intervals/intervals");
 const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.thirdIdentity = {
     id: 'idRmq3',
     connector: '=',
@@ -24,10 +26,53 @@ function getThirdIdentityQuestion() {
     const affine2 = new affine_1.Affine(affine.a, -affine.b);
     const statementTree = new multiplyNode_1.MultiplyNode(affine.toTree(), affine2.toTree());
     const answerTree = affine.multiply(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: affine.multiply(affine2.opposite()).toTree().toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: affine.multiply(affine).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: affine2.multiply(affine2.opposite()).toTree().toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 4; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const affineTemp = affine_1.AffineConstructor.random(interval, interval);
+                const affineTemp2 = new affine_1.Affine(affineTemp.a, -affineTemp.b);
+                const wrongAnswer = affineTemp.multiply(affineTemp2).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);
+    };
     return {
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],
+        getPropositions,
     };
 }
 exports.getThirdIdentityQuestion = getThirdIdentityQuestion;

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;AAI9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAOF,wBAAgB,uBAAuB,IAAI,QAAQ,CAyBlD"}
+{"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,CAmJlD"}

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

@@ -3,6 +3,9 @@ Object.defineProperty(exports, "__esModule", { value: true });
 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 shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.equationSimpleSquare = {
     id: 'equationSimpleSquare',
     connector: '=',
@@ -37,10 +40,113 @@ function getEquationSimpleSquare() {
     }
     if (randNbr < 0)
         answer = `\\emptyset`;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+        });
+        if (ans === Math.floor(ans)) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: `${ans}`,
+                isRightAnswer: false,
+            });
+            if (n > 2)
+                res.push({
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `${ans + (0, randint_1.randint)(-ans + 1, 7, [0])}`,
+                    isRightAnswer: false,
+                });
+            for (let i = 0; i < n - 3; 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`,
+                        isRightAnswer: false,
+                    };
+                    isDuplicate = res.some((p) => p.statement === proposition.statement);
+                } while (isDuplicate);
+                res.push(proposition);
+            }
+        }
+        else if (randNbr >= 0 && ans !== Math.floor(ans)) {
+            const factor = higherFactor(randNbr);
+            const radicand = randNbr / factor ** 2;
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: `${factor}\\sqrt{${radicand}}`,
+                isRightAnswer: false,
+            });
+            if (n > 2)
+                res.push({
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `${radicand}\\sqrt{${factor}}`,
+                    isRightAnswer: false,
+                });
+            if (n > 3)
+                res.push({
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `${Math.floor(ans)}`,
+                    isRightAnswer: false,
+                });
+            for (let i = 0; i < n - 4; i++) {
+                let isDuplicate;
+                let proposition;
+                do {
+                    const tempFactor = factor + (0, randint_1.randint)(-factor + 1, 7, [0]);
+                    const tempRadicand = radicand + (0, randint_1.randint)(-radicand + 1, 7, [0]);
+                    proposition = {
+                        id: (0, uuid_1.v4)() + '',
+                        statement: (0, coinFlip_1.coinFlip)()
+                            ? `\\{${tempFactor}\\sqrt{${tempRadicand}}\\ ; -${tempFactor}\\sqrt{${tempRadicand}} \\}`
+                            : `\\emptyset`,
+                        isRightAnswer: false,
+                    };
+                    isDuplicate = res.some((p) => p.statement === proposition.statement);
+                } while (isDuplicate);
+                res.push(proposition);
+            }
+        }
+        else {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: `-\\sqrt${-randNbr}`,
+                isRightAnswer: false,
+            });
+            if (n > 2)
+                res.push({
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `${Math.floor(Math.sqrt(-randNbr))}`,
+                    isRightAnswer: false,
+                });
+            for (let i = 0; i < n - 3; i++) {
+                let isDuplicate;
+                let proposition;
+                do {
+                    const factor = (0, randint_1.randint)(2, 5);
+                    const radicand = (0, randint_1.randint)(2, -randNbr);
+                    proposition = {
+                        id: (0, uuid_1.v4)() + '',
+                        statement: `\\{${factor}\\sqrt{${radicand}}\\ ; -${factor}\\sqrt{${radicand}} \\}`,
+                        isRightAnswer: false,
+                    };
+                    isDuplicate = res.some((p) => p.statement === proposition.statement);
+                } while (isDuplicate);
+                res.push(proposition);
+            }
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction,
         answer,
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        getPropositions,
     };
     return question;
 }

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;AAQ9D;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAe3D"}
+{"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,CA8C3D"}

package/lib/exercises/calculLitteral/equation/equationType1Exercise.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 equalNode_1 = require("../../../tree/nodes/operators/equalNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 /**
  *  type x+a=b
  */
@@ -29,10 +32,34 @@ function getEquationType1ExerciseQuestion() {
     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 getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: `x = ${solution}`,
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = solution + (0, randint_1.randint)(-3, 4, [0]);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: `x = ${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: tree.toTex(),
         answer: `x = ${solution}`,
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        getPropositions,
     };
     return question;
 }

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;AAU9D;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAe3D"}
+{"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,CAkD3D"}

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

@@ -7,8 +7,11 @@ 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");
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 /**
  *  type ax=b
  */
@@ -32,10 +35,34 @@ function getEquationType2ExerciseQuestion() {
     const affine = new affine_1.Affine(a.value, 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) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toTex(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            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();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), wrongAnswer.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: tree.toTex(),
         answer: answer.toTex(),
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        getPropositions,
     };
     return question;
 }

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

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

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

@@ -7,8 +7,11 @@ 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");
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 /**
  *  type ax+b=c
  */
@@ -33,10 +36,34 @@ function getEquationType3ExerciseQuestion() {
     const solution = new rational_1.Rational(c.value - b.value, a.value).simplify();
     const statementTree = new equalNode_1.EqualNode(affine, c.toTree());
     const answerTree = new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), solution.toTree());
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new rational_1.Rational(c.value - b.value + (0, randint_1.randint)(-7, 8, [0, -c.value + b.value]), a.value + (0, randint_1.randint)(-7, 8, [-a.value, 0])).simplify();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), wrongAnswer.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: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        getPropositions,
     };
     return question;
 }

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

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

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

@@ -7,8 +7,11 @@ 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");
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 /**
  *  type ax+b=cx+d
  */
@@ -35,10 +38,34 @@ function getEquationType4ExerciseQuestion() {
     const solution = new rational_1.Rational(d.value - b.value, a.value - c.value).simplify();
     const statementTree = new equalNode_1.EqualNode(affines[0].toTree(), affines[1].toTree());
     const answerTree = new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), solution.toTree());
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answerTree.toTex(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new rational_1.Rational(d.value - b.value + (0, randint_1.randint)(-7, 8, [0, -d.value + b.value]), a.value - c.value + (0, randint_1.randint)(-7, 8, [-a.value + c.value, 0])).simplify();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), wrongAnswer.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: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calculLitteral/equation/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/equation/evaluateExpression.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluateExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/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/equation/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: 'Équations',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEvaluateExpression, nb),
+    keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+};
+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', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
+        getPropositions,
+    };
+    return question;
+}
+exports.getEvaluateExpression = getEvaluateExpression;

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;AAM9D,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CAYjD"}
+{"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,CA0CjD"}