math-exercises 1.3.39 → 1.3.41

package/lib/exercises/powers/powersProduct.js

@@ -9,7 +9,9 @@ const randint_1 = require("../../math/utils/random/randint");
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
 const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const shuffle_1 = require("../../utils/shuffle");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
 exports.powersOfTenProduct = {
     id: 'powersOfTenProduct',
     connector: '=',
@@ -32,14 +34,40 @@ exports.powersProduct = {
     keys: [],
 };
 function getPowersProductQuestion(useOnlyPowersOfTen = false) {
-    const a = useOnlyPowersOfTen ? 10 : (0, randint_1.randint)(-11, 11);
+    const a = useOnlyPowersOfTen ? 10 : (0, randint_1.randint)(-11, 11, [0]);
     const [b, c] = [1, 2].map((el) => (0, randint_1.randint)(-11, 11));
     const statement = new multiplyNode_1.MultiplyNode(new powerNode_1.PowerNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b)), new powerNode_1.PowerNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(c)));
     const answerTree = new power_1.Power(a, b + c).simplify();
+    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 wrongExponent = b + c + (0, randint_1.randint)(-11, 11, [0, -b - c]);
+                const wrongAnswerTree = new power_1.Power(a === 1 || a === -1 ? (0, randint_1.randint)(-3, 4, [-1, 1]) : a, wrongExponent).simplify();
+                const wrongAnswer = wrongAnswerTree.toTex();
+                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: statement.toTex(),
         answer: answerTree.toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/powers/scientificToDecimal.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"scientificToDecimal.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/scientificToDecimal.ts"],"names":[],"mappings":"AAAA;;MAEM;AAQN,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGjD,eAAO,MAAM,mBAAmB,EAAE,QAWjC,CAAC;AAEF,wBAAgB,8BAA8B,IAAI,QAAQ,CAiBzD"}
+{"version":3,"file":"scientificToDecimal.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/scientificToDecimal.ts"],"names":[],"mappings":"AAAA;;MAEM;AASN,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,mBAAmB,EAAE,QAWjC,CAAC;AAEF,wBAAgB,8BAA8B,IAAI,QAAQ,CAkDzD"}

package/lib/exercises/powers/scientificToDecimal.js

@@ -10,7 +10,9 @@ const randint_1 = require("../../math/utils/random/randint");
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
 const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const shuffle_1 = require("../../utils/shuffle");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
 exports.scientificToDecimal = {
     id: 'scientificToDecimal',
     connector: '=',
@@ -29,10 +31,35 @@ function getScientificToDecimalQuestion() {
     const randDecimal = decimal_1.DecimalConstructor.fromParts(int + '', fracPart);
     const statement = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(randDecimal.value), new powerNode_1.PowerNode(new numberNode_1.NumberNode(10), new numberNode_1.NumberNode(randPower)));
     const answerTree = randDecimal.multiplyByPowerOfTen(randPower).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 wrongAnswerTree = randDecimal.multiplyByPowerOfTen((0, randint_1.randint)(-6, 8, [randPower])).toTree();
+                const wrongAnswer = wrongAnswerTree.toTex();
+                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: statement.toTex(),
         answer: answerTree.toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/proba/conditionalProbability.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"conditionalProbability.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/conditionalProbability.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAIjD,eAAO,MAAM,sBAAsB,EAAE,QAUpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CA8EpD"}
+{"version":3,"file":"conditionalProbability.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/conditionalProbability.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAM9D,eAAO,MAAM,sBAAsB,EAAE,QAUpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CA4GpD"}

package/lib/exercises/proba/conditionalProbability.js

@@ -4,6 +4,8 @@ exports.getConditionalProbability = exports.conditionalProbability = void 0;
 const randint_1 = require("../../math/utils/random/randint");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
 const round_1 = require("../../math/utils/round");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.conditionalProbability = {
     id: 'conditionalProbability',
     connector: '=',
@@ -63,11 +65,34 @@ function getConditionalProbability() {
             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 {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: Math.floor(Math.random() * 100) / 100 + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction,
         startStatement,
         answer,
         keys: ['p', 'cap', 'underscore'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/proba/marginalAndConditionalFrequency.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"marginalAndConditionalFrequency.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/marginalAndConditionalFrequency.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGjD,eAAO,MAAM,+BAA+B,EAAE,QAU7C,CAAC;AAEF,wBAAgB,kCAAkC,IAAI,QAAQ,CAmE7D"}
+{"version":3,"file":"marginalAndConditionalFrequency.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/marginalAndConditionalFrequency.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,+BAA+B,EAAE,QAU7C,CAAC;AAEF,wBAAgB,kCAAkC,IAAI,QAAQ,CAiG7D"}

package/lib/exercises/proba/marginalAndConditionalFrequency.js

@@ -4,7 +4,9 @@ exports.getMarginalAndConditionalFrequency = exports.marginalAndConditionalFrequ
 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 getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
 exports.marginalAndConditionalFrequency = {
     id: 'marginalAndConditionalFrequency',
     connector: '=',
@@ -63,6 +65,28 @@ function getMarginalAndConditionalFrequency() {
         x4 / (x2 + x4),
     ];
     const calculsNodes = Calculs.map((el) => (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(el)));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: calculsNodes[rand].toTex(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: calculsNodes[(0, randint_1.randint)(0, 12, [rand])].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: `On considère le tableau d'effectifs suivant : 
 
@@ -75,6 +99,7 @@ Calculer la fréquence ${freqString[rand]}.`,
         startStatement: `${frequences[rand]}`,
         answer: calculsNodes[rand].toTex(),
         keys: ['f', 'cap', 'underscore'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/proba/probabilityTree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"probabilityTree.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/probabilityTree.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGjD,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AAOF,wBAAgB,kBAAkB,IAAI,QAAQ,CAwF7C"}
+{"version":3,"file":"probabilityTree.d.ts","sourceRoot":"","sources":["../../../src/exercises/proba/probabilityTree.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AAOF,wBAAgB,kBAAkB,IAAI,QAAQ,CAwH7C"}

package/lib/exercises/proba/probabilityTree.js

@@ -5,7 +5,9 @@ const randint_1 = require("../../math/utils/random/randint");
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
 const simplify_1 = require("../../tree/parsers/simplify");
+const shuffle_1 = require("../../utils/shuffle");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
 exports.probabilityTree = {
     id: 'probabilityTree',
     connector: '=',
@@ -36,33 +38,35 @@ function getProbabilityTree() {
     const pB_D = (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(BD / (BC + BD)));
     let instruction = `En utilisant l'arbre de probabilité suivant, `;
     let startStatement = '';
-    let answer = '';
+    let answer;
     const rand = (0, randint_1.randint)(1, 5);
     switch (rand) {
         case 1: {
             instruction += `$\\\\$ Calculer $P(A \\cap C)$`;
             startStatement = `P(A \\cap C)`;
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_C)).toTex();
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_C));
             break;
         }
         case 2: {
             instruction += `$\\\\$ Calculer $P(A \\cap D)$`;
             startStatement = `P(A \\cap D)`;
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_D)).toTex();
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pA, pA_D));
             break;
         }
         case 3: {
             instruction += `$\\\\$ Calculer $P(B \\cap C)$`;
             startStatement = `P(B \\cap C)`;
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_C)).toTex();
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_C));
             break;
         }
         case 4: {
             instruction += `$\\\\$ Calculer $P(B \\cap D)$`;
             startStatement = `P(B \\cap D)`;
-            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_D)).toTex();
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_D));
             break;
         }
+        default:
+            answer = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(pB, pB_D)); // juste pour éviter l'erreur
     }
     let commands = [
         'A = Point({2,2})',
@@ -92,13 +96,36 @@ function getProbabilityTree() {
         'Text("C", (5.5 , -1.1))',
         'Text("D", (5.5 , -3.1))',
     ];
+    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 {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(answer, new numberNode_1.NumberNode((0, randint_1.randint)(2, 11)))).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,
         startStatement,
-        answer,
+        answer: answer.toTex(),
         keys: [],
         commands,
         coords: [-2, 8, -5, 5],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY9D,eAAO,MAAM,8BAA8B,EAAE,QAU5C,CAAC;AAEF,wBAAgB,iCAAiC,IAAI,QAAQ,CAe5D"}
+{"version":3,"file":"arithmeticExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,8BAA8B,EAAE,QAU5C,CAAC;AAEF,wBAAgB,iCAAiC,IAAI,QAAQ,CA6C5D"}

package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.js

@@ -4,6 +4,8 @@ exports.getArithmeticExplicitFormulaUsage = exports.arithmeticExplicitFormulaUsa
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const polynomial_1 = require("../../../math/polynomials/polynomial");
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.arithmeticExplicitFormulaUsage = {
     id: 'arithmeticExplicitFormulaUsage',
     connector: '=',
@@ -20,11 +22,34 @@ function getArithmeticExplicitFormulaUsage() {
     const firstValue = (0, randint_1.randint)(-10, 10);
     const reason = (0, randint_1.randint)(-10, 10, [0]);
     const polynomial = new polynomial_1.Polynomial([firstValue, reason], 'n');
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (firstValue + askedRank * reason).toString(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: ((0, randint_1.randint)(-5, 6, [firstValue]) + askedRank * reason).toString(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: `$(u_n)$ est une suite arithmétique définie par $u_n = ${polynomial.toString()}$. Calculer :`,
         startStatement: `u_{${askedRank}}`,
         answer: (firstValue + askedRank * reason).toString(),
         keys: ['r', 'n', 'u', 'underscore'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY9D,eAAO,MAAM,6BAA6B,EAAE,QAU3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAe3D"}
+{"version":3,"file":"arithmeticFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,6BAA6B,EAAE,QAU3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CA6C3D"}

package/lib/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.js

@@ -4,6 +4,8 @@ exports.getArithmeticFindExplicitFormula = exports.arithmeticFindExplicitFormula
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const polynomial_1 = require("../../../math/polynomials/polynomial");
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.arithmeticFindExplicitFormula = {
     id: 'arithmeticFindExplicitFormula',
     connector: '=',
@@ -20,11 +22,34 @@ function getArithmeticFindExplicitFormula() {
     const firstValue = (0, randint_1.randint)(-10, 10);
     const reason = (0, randint_1.randint)(-10, 10, [0]);
     const formula = new polynomial_1.Polynomial([firstValue, reason], 'n');
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: formula.toString(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: new polynomial_1.Polynomial([firstValue + (0, randint_1.randint)(-3, 4), reason + (0, randint_1.randint)(-3, 4)], 'n').toString(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: `$(u_n)$ est une suite arithmétique de premier terme $u_{${firstRank}} = ${firstValue}$ et de raison $r = ${reason}$. $\\\\$ Donner l'expression de $u_n$ en fonction de $n$.`,
         startStatement: 'u_n',
         answer: formula.toString(),
         keys: ['r', 'n', 'u', 'underscore'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticFindReason.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFindReason.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindReason.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK9D,eAAO,MAAM,oBAAoB,EAAE,QAWlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAclD"}
+{"version":3,"file":"arithmeticFindReason.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticFindReason.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,oBAAoB,EAAE,QAWlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CA4ClD"}

package/lib/exercises/sequences/arithmetic/arithmeticFindReason.js

@@ -3,6 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.getArithmeticFindReason = exports.arithmeticFindReason = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.arithmeticFindReason = {
     id: 'arithmeticFindReason',
     connector: '=',
@@ -20,11 +22,34 @@ function getArithmeticFindReason() {
     const reason = (0, randint_1.randint)(-10, 10, [0]);
     const value1 = (0, randint_1.randint)(-10, 10);
     const value2 = reason + value1;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: reason + '',
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: reason + (0, randint_1.randint)(-5, 6, [0]) + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: `$(u_n)$ est une suite arithmétique. On sait que $u_{${rank1}} = ${value1}$ et $u_{${rank2}} = ${value2}$. Quelle est la raison de la suite $(u_n)$ ?`,
         startStatement: 'r',
         answer: reason.toString(),
         keys: ['r', 'n', 'u', 'underscore'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticReasonUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticReasonUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticReasonUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAI9D,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAYnD"}
+{"version":3,"file":"arithmeticReasonUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticReasonUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CA2CnD"}

package/lib/exercises/sequences/arithmetic/arithmeticReasonUsage.js

@@ -3,6 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.getArithmeticReasonUsage = exports.arithmeticReasonUsage = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.arithmeticReasonUsage = {
     id: 'arithmeticReasonUsage',
     connector: '=',
@@ -19,11 +21,34 @@ function getArithmeticReasonUsage() {
     const startRank = (0, randint_1.randint)(0, 20);
     const askedRank = startRank + 1;
     const startValue = (0, randint_1.randint)(-10, 10);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (startValue + reason).toString(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: startValue + reason + (0, randint_1.randint)(-5, 6, [0]) + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: `$(u_n)$ est une suite arithmétique de raison $r = ${reason}$ et on sait que $u_{${startRank}} = ${startValue}$. Calculer : `,
         startStatement: `u_{${askedRank}}`,
         answer: (startValue + reason).toString(),
         keys: ['r', 'n', 'u', 'underscore'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAoB,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAIhF,eAAO,MAAM,gCAAgC,EAAE,QAU9C,CAAC;AAEF,wBAAgB,mCAAmC,IAAI,QAAQ,CAa9D"}
+{"version":3,"file":"arithmeticRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAiC,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM7F,eAAO,MAAM,gCAAgC,EAAE,QAU9C,CAAC;AAEF,wBAAgB,mCAAmC,IAAI,QAAQ,CA2C9D"}

package/lib/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.js

@@ -3,6 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.getArithmeticRecurrenceFormulaUsage = exports.arithmeticRecurrenceFormulaUsage = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.arithmeticRecurrenceFormulaUsage = {
     id: 'arithmeticRecurrenceFormulaUsage',
     connector: '=',
@@ -19,11 +21,34 @@ function getArithmeticRecurrenceFormulaUsage() {
     const firstValue = (0, randint_1.randint)(-10, 10);
     const reason = (0, randint_1.randint)(-10, 10, [0]);
     const askedRank = firstRank + 1;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (firstValue + reason).toString(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: firstValue + reason + (0, randint_1.randint)(-5, 6, [0]) + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: `$(u_n)$ est une suite définie par $u_{n+1} = ${reason} + u_n$ et $u_{${firstRank}} = ${firstValue}$. Calculer :`,
         startStatement: `u_{${askedRank}}`,
         answer: (firstValue + reason).toString(),
         keys: ['r', 'n', 'u', 'underscore'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/sequences/arithmetic/arithmeticThresholdFind.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticThresholdFind.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticThresholdFind.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAGpD,eAAO,MAAM,uBAAuB,EAAE,QAUrC,CAAC;AAEF,wBAAgB,0BAA0B,IAAI,QAAQ,CAyBrD"}
+{"version":3,"file":"arithmeticThresholdFind.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/arithmetic/arithmeticThresholdFind.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAIjE,eAAO,MAAM,uBAAuB,EAAE,QAUrC,CAAC;AAEF,wBAAgB,0BAA0B,IAAI,QAAQ,CAuDrD"}

package/lib/exercises/sequences/arithmetic/arithmeticThresholdFind.js

@@ -3,7 +3,9 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.getArithmeticThresholdFind = exports.arithmeticThresholdFind = void 0;
 const polynomial_1 = require("../../../math/polynomials/polynomial");
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
 const getDistinctQuestions_1 = require("../../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
 exports.arithmeticThresholdFind = {
     id: 'arithmeticThresholdFind',
     connector: '=',
@@ -29,11 +31,34 @@ function getArithmeticThresholdFind() {
         randValue += (0, randint_1.randint)(-100, reason);
         instruction += `À partir de quel rang a-t-on $u_n < ${randValue}$ ?`;
     }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (Math.floor((randValue - firstValue) / reason) + 1).toString(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: (Math.floor((randValue - firstValue) / reason) + (0, randint_1.randint)(-5, 6, [1])).toString(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction,
         startStatement: `n`,
         answer: (Math.floor((randValue - firstValue) / reason) + 1).toString(),
         keys: ['r', 'n', 'u', 'underscore', 'inf', 'sup', 'approx'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/sequences/geometric/geometricExplicitFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"geometricExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/geometric/geometricExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS9D,eAAO,MAAM,6BAA6B,EAAE,QAU3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAiB3D"}
+{"version":3,"file":"geometricExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/geometric/geometricExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,6BAA6B,EAAE,QAU3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAgD3D"}

package/lib/exercises/sequences/geometric/geometricExplicitFormulaUsage.js

@@ -8,6 +8,8 @@ const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
 const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
 const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
 const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.geometricExplicitFormulaUsage = {
     id: 'geometricExplicitFormulaUsage',
     connector: '=',
@@ -25,11 +27,34 @@ function getGeometricExplicitFormulaUsage() {
     const reason = (0, randint_1.randint)(2, 10);
     const formula = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(firstValue), new powerNode_1.PowerNode(new numberNode_1.NumberNode(reason), new variableNode_1.VariableNode('n')));
     const formulaTex = (0, simplify_1.simplifyNode)(formula).toTex();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (firstValue * Math.pow(reason, askedRank)).toString(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: (firstValue * Math.pow(reason, (0, randint_1.randint)(0, 9, [askedRank]))).toString(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: `$(u_n)$ est une suite géométrique définie par $u_n = ${formulaTex}$. Calculer :`,
         startStatement: `u_{${askedRank}}`,
         answer: (firstValue * Math.pow(reason, askedRank)).toString(),
         keys: ['n', 'u', 'underscore'],
+        getPropositions,
     };
     return question;
 }