math-exercises 1.3.39 → 1.3.41

package/lib/exercises/calcul/mentalCaluls.ts/mentalAddAndSub.js

@@ -7,6 +7,8 @@ const round_1 = require("../../../math/utils/round");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const addNode_1 = require("../../../tree/nodes/operators/addNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.mentalAddAndSub = {
     id: 'mentalAddAndSub',
     connector: '=',
@@ -36,10 +38,38 @@ function getMentalAddAndSub() {
     for (let i = 2; i < nbrOperations; i++)
         statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
     statementTree.shuffle();
+    const getPropositions = (n) => {
+        const res = [];
+        // Ajout de la réponse correcte
+        const answer = (0, round_1.round)(sum, 2);
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toString(),
+            isRightAnswer: true,
+        });
+        // Ajout des propositions incorrectes
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const incorrectSum = (0, round_1.round)(sum + ((0, coinFlip_1.coinFlip)() ? 1 : -1) * Math.random() * 10, 2);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: incorrectSum.toString(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        // Mélange des propositions
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         startStatement: statementTree.toTex(),
         answer: (0, round_1.round)(sum, 2) + '',
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/mentalCaluls.ts/mentalDivisions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mentalDivisions.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/mentalCaluls.ts/mentalDivisions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,eAAe,EAAE,QAU7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CAuD7C"}
+{"version":3,"file":"mentalDivisions.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/mentalCaluls.ts/mentalDivisions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,eAAe,EAAE,QAU7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CAyF7C"}

package/lib/exercises/calcul/mentalCaluls.ts/mentalDivisions.js

@@ -7,6 +7,8 @@ const round_1 = require("../../../math/utils/round");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const divideNode_1 = require("../../../tree/nodes/operators/divideNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.mentalDivisions = {
     id: 'mentalDivisions',
     connector: '=',
@@ -54,10 +56,37 @@ function getMentalDivisions() {
         ? new divideNode_1.DivideNode(allNumbersNodes[0], new divideNode_1.DivideNode(allNumbersNodes[1], allNumbersNodes[2]))
         : new divideNode_1.DivideNode(allNumbersNodes[0], allNumbersNodes[1]);
     const answer = rand === 6 ? a / (b / c) : a / b;
+    const getPropositions = (n) => {
+        const propositions = [];
+        // Ajout de la réponse correcte
+        propositions.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toString(),
+            isRightAnswer: true,
+        });
+        // Ajout des propositions incorrectes
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const incorrectAnswer = (0, round_1.round)(answer + ((0, coinFlip_1.coinFlip)() ? 1 : -1) * Math.random() * 10, 2);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: incorrectAnswer.toString(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        // Mélange des propositions
+        return (0, shuffle_1.shuffle)(propositions);
+    };
     const question = {
         startStatement: statementTree.toTex(),
         answer: (0, round_1.round)(answer, 2) + '',
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/mentalCaluls.ts/mentalMultiplications.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mentalMultiplications.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/mentalCaluls.ts/mentalMultiplications.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAmCnD"}
+{"version":3,"file":"mentalMultiplications.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/mentalCaluls.ts/mentalMultiplications.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAkEnD"}

package/lib/exercises/calcul/mentalCaluls.ts/mentalMultiplications.js

@@ -7,6 +7,8 @@ const round_1 = require("../../../math/utils/round");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.mentalMultiplications = {
     id: 'mentalMultiplications',
     connector: '=',
@@ -41,10 +43,34 @@ function getMentalMultiplications() {
         answer = numbers[2] * numbers[3] * numbers[4];
     }
     statementTree.shuffle();
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toString(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                let incorrectAnswer = (0, round_1.round)(answer + ((0, coinFlip_1.coinFlip)() ? 1 : -1) * Math.random() * 10, 2);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: incorrectAnswer.toString(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
     const question = {
         startStatement: statementTree.toTex(),
         answer: (0, round_1.round)(answer, 2) + '',
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/mentalCaluls.ts/mentalPercentage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mentalPercentage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/mentalCaluls.ts/mentalPercentage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK9D,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CA6D9C"}
+{"version":3,"file":"mentalPercentage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/mentalCaluls.ts/mentalPercentage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CA2I9C"}

package/lib/exercises/calcul/mentalCaluls.ts/mentalPercentage.js

@@ -4,6 +4,8 @@ exports.getMentalPercentage = exports.mentalPercentage = 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.mentalPercentage = {
     id: 'mentalPercentage',
     connector: '=',
@@ -57,10 +59,73 @@ function getMentalPercentage() {
             b = 1000;
             break;
     }
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (a * b) / 100 + '',
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                switch (rand) {
+                    case 1: // 10% de 70%
+                        a = 10 * (0, randint_1.randint)(1, 3);
+                        b = (0, randint_1.randint)(1, 200);
+                        break;
+                    case 2: // 30% de 9
+                        a = (0, randint_1.randint)(1, 10);
+                        b = (0, randint_1.randint)(1, 10) * a;
+                        a *= 10;
+                        break;
+                    case 3: // 32% de 10
+                        a = (0, randint_1.randint)(1, 100);
+                        b = 10 ** (0, randint_1.randint)(1, 3);
+                        break;
+                    case 4: // 14% de 50 ou 230% de 20
+                        a = (0, coinFlip_1.coinFlip)() ? (0, randint_1.randint)(1, 100) : (0, randint_1.randint)(11, 30) * 10;
+                        b = (0, coinFlip_1.coinFlip)() ? 20 : 50;
+                        break;
+                    case 5: // 12.5% de 72
+                        a = (0, coinFlip_1.coinFlip)() ? 12.5 : 12.5 + 100;
+                        b = 8 * (0, randint_1.randint)(1, 25);
+                        break;
+                    case 6: // 15% de 90
+                        a = (0, coinFlip_1.coinFlip)() ? 15 * (0, randint_1.randint)(1, 6) : 30 * (0, randint_1.randint)(1, 4, [2]) + 100;
+                        b = 3 * (0, randint_1.randint)(1, 10) * 10;
+                        break;
+                    case 7: // 20% de x
+                        a = 20 * (0, randint_1.randint)(1, 12, [5]);
+                        b = 5 * (0, randint_1.randint)(1, 21);
+                        break;
+                    case 8: // 75% de x
+                        a = 25 * (0, randint_1.randint)(1, 8, [4]);
+                        b = 4 * (0, randint_1.randint)(1, 75);
+                        break;
+                    case 9: //0.5 % de 1000
+                        a = (0, randint_1.randint)(1, 10) / 10;
+                        b = 1000;
+                        break;
+                }
+                let incorrectAnswer = (a * b) / 100;
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: incorrectAnswer.toString(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
     const question = {
         instruction: `Calculer : $${String(a).replace('.', ',')}\\%$ de $${b}$.`,
         answer: (a * b) / 100 + '',
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/operations/operationsPriorities.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"operationsPriorities.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/operations/operationsPriorities.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,oBAAoB,IAAI,QAAQ,CA+F/C"}
+{"version":3,"file":"operationsPriorities.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/operations/operationsPriorities.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,oBAAoB,IAAI,QAAQ,CA6H/C"}

package/lib/exercises/calcul/operations/operationsPriorities.js

@@ -15,6 +15,8 @@ const addNode_1 = require("../../../tree/nodes/operators/addNode");
 const divideNode_1 = require("../../../tree/nodes/operators/divideNode");
 const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.operationsPriorities = {
     id: 'operationsPriorities',
     connector: '=',
@@ -90,10 +92,33 @@ function getPriorityQuestions() {
             answer = (a * b * c + d).toString();
             break;
     }
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.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: (0, randint_1.randint)(-100, 100) + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
     const question = {
         startStatement,
         answer,
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/operations/operationsPrioritiesWithoutRelative.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"operationsPrioritiesWithoutRelative.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/operations/operationsPrioritiesWithoutRelative.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS9D,eAAO,MAAM,mCAAmC,EAAE,QAUjD,CAAC;AAEF,wBAAgB,sCAAsC,IAAI,QAAQ,CAiOjE"}
+{"version":3,"file":"operationsPrioritiesWithoutRelative.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/operations/operationsPrioritiesWithoutRelative.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,mCAAmC,EAAE,QAUjD,CAAC;AAEF,wBAAgB,sCAAsC,IAAI,QAAQ,CA+PjE"}

package/lib/exercises/calcul/operations/operationsPrioritiesWithoutRelative.js

@@ -15,6 +15,8 @@ const addNode_1 = require("../../../tree/nodes/operators/addNode");
 const divideNode_1 = require("../../../tree/nodes/operators/divideNode");
 const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.operationsPrioritiesWithoutRelative = {
     id: 'operationsPrioritiesWithoutRelative',
     connector: '=',
@@ -171,10 +173,33 @@ function getOperationsPrioritiesWithoutRelative() {
             }
             break;
     }
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.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: (0, randint_1.randint)(1, 50) + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
     const question = {
         startStatement,
         answer,
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/proportionality/proportionalityTable.d.ts

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

package/lib/exercises/calcul/proportionality/proportionalityTable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proportionalityTable.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/proportionality/proportionalityTable.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAsElD"}

package/lib/exercises/calcul/proportionality/proportionalityTable.js

@@ -0,0 +1,80 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getProportionalityTable = exports.proportionalityTable = 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.proportionalityTable = {
+    id: 'proportionalityTable',
+    connector: '=',
+    instruction: '',
+    label: 'Calcul dans un tableau de proportionnalité',
+    levels: ['5', '4', '3'],
+    isSingleStep: false,
+    section: 'Proportionnalité',
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getProportionalityTable, nb),
+    keys: [],
+};
+function getProportionalityTable() {
+    const fact = (0, randint_1.randint)(2, 10);
+    let [x1, x2] = [1, 2].map((el) => (0, randint_1.randint)(1, 100 / fact));
+    let [x3, x4] = [x1 * fact, x2 * fact];
+    let answer;
+    const randQuation = (0, randint_1.randint)(0, 4);
+    switch (randQuation) {
+        case 0:
+            answer = x1;
+            x1 = '?';
+            break;
+        case 1:
+            answer = x2;
+            x2 = '?';
+            break;
+        case 2:
+            answer = x3;
+            x3 = '?';
+            break;
+        case 3:
+            answer = x4;
+            x4 = '?';
+            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: answer + (0, randint_1.randint)(-answer + 1, 20, [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: `On considère le tableau de proportionnalité suivant : 
+
+| | |
+|-|-|
+|${x1}|${x3}|
+|${x2}|${x4}|
+
+Déterminer le nombre manquant.`,
+        answer: answer + '',
+        keys: [],
+        getPropositions,
+    };
+    return question;
+}
+exports.getProportionalityTable = getProportionalityTable;

package/lib/exercises/calcul/rounding/rounding.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rounding.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/rounding/rounding.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK9D;;GAEG;AACH,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AACF;;GAEG;AACH,eAAO,MAAM,cAAc,EAAE,QAS5B,CAAC;AACF;;GAEG;AACH,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AACF;;GAEG;AACH,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AAEF,eAAO,MAAM,YAAY,EAAE,QAS1B,CAAC;AASF,wBAAgB,iBAAiB,CAAC,cAAc,GAAE,MAAU,GAAG,QAAQ,CAUtE"}
+{"version":3,"file":"rounding.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/rounding/rounding.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E;;GAEG;AACH,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AACF;;GAEG;AACH,eAAO,MAAM,cAAc,EAAE,QAS5B,CAAC;AACF;;GAEG;AACH,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AACF;;GAEG;AACH,eAAO,MAAM,eAAe,EAAE,QAS7B,CAAC;AAEF,eAAO,MAAM,YAAY,EAAE,QAS1B,CAAC;AASF,wBAAgB,iBAAiB,CAAC,cAAc,GAAE,MAAU,GAAG,QAAQ,CAoEtE"}

package/lib/exercises/calcul/rounding/rounding.js

@@ -4,6 +4,9 @@ exports.getRoundQuestions = exports.allRoundings = exports.roundToMillieme = exp
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const decimal_1 = require("../../../math/numbers/decimals/decimal");
 const randint_1 = require("../../../math/utils/random/randint");
+const round_1 = require("../../../math/utils/round");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 /**
  * arrondi à l'unité
  */
@@ -76,11 +79,57 @@ const instructions = [
 function getRoundQuestions(precisionAsked = 0) {
     const precision = (0, randint_1.randint)(precisionAsked + 1, precisionAsked + 5);
     const dec = decimal_1.DecimalConstructor.random(0, 1000, precision);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: dec.round(precisionAsked).toTree().toTex(),
+            isRightAnswer: true,
+        });
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (0, round_1.round)(dec.value, precisionAsked) === (0, round_1.round)(dec.value + 0.5 * 10 ** -precisionAsked, precisionAsked)
+                ? (0, round_1.round)(dec.value - 0.5 * 10 ** -precisionAsked, precisionAsked) + ''
+                : (0, round_1.round)(dec.value + 0.5 * 10 ** -precisionAsked, precisionAsked) + '',
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: dec.toTree().toTex(),
+                isRightAnswer: false,
+            });
+        if (n > 3 && dec.decimalPart.length !== precisionAsked + 1)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: dec
+                    .round(precisionAsked + 1)
+                    .toTree()
+                    .toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; dec.decimalPart.length !== precisionAsked + 1 ? i < n - 4 : i < n - 3; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: decimal_1.DecimalConstructor.random(0, 1000, precision).toTree().toTex(),
+                    isRightAnswer: false,
+                };
+                console.log(proposition);
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: instructions[precisionAsked],
         startStatement: dec.toTree().toTex(),
         answer: dec.round(precisionAsked).toTree().toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"doubleDistributivity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/doubleDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAY1D"}
+{"version":3,"file":"doubleDistributivity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/doubleDistributivity.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,CAgE1D"}

package/lib/exercises/calculLitteral/distributivity/doubleDistributivity.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.doubleDistributivity = {
     id: 'doubleDistri',
     connector: '=',
@@ -23,10 +26,52 @@ function getDoubleDistributivityQuestion() {
     const affines = affine_1.AffineConstructor.differentRandoms(2, interval, interval);
     const statementTree = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].toTree());
     const answerTree = affines[0].multiply(affines[1]).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: affines[0]
+                .multiply(new affine_1.Affine(-affines[1].a, (0, randint_1.randint)(-9, 10, [affines[1].b])))
+                .toTree()
+                .toTex(),
+            isRightAnswer: false,
+        });
+        if (n > 2)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: affines[1]
+                    .multiply(new affine_1.Affine((0, randint_1.randint)(-9, 10, [affines[0].a]), affines[0].b))
+                    .toTree()
+                    .toTex(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < n - 3; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const affinesTemps = affine_1.AffineConstructor.differentRandoms(2, interval, interval);
+                const wrongAnswer = affinesTemps[0].multiply(affinesTemps[1]).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.getDoubleDistributivityQuestion = getDoubleDistributivityQuestion;

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

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

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

@@ -4,10 +4,13 @@ exports.getFirstIdentityQuestion = exports.firstIdentity = 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.firstIdentity = {
     id: 'idRmq1',
     connector: '=',
@@ -24,10 +27,52 @@ function getFirstIdentityQuestion() {
     const affine = affine_1.AffineConstructor.random(interval, interval);
     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(interval, interval);
+                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.getFirstIdentityQuestion = getFirstIdentityQuestion;

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

@@ -1 +1 @@
-{"version":3,"file":"secondIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/secondIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAapD"}
+{"version":3,"file":"secondIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/secondIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY3E,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAiEpD"}