math-exercises 1.3.39 → 1.3.41

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

@@ -1 +1 @@
-{"version":3,"file":"addAndSub.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSub.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGjD;;GAEG;AACH,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAkBhD"}
+{"version":3,"file":"addAndSub.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSub.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D;;GAEG;AACH,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAmDhD"}

package/lib/exercises/calcul/addAndSub.js

@@ -4,7 +4,9 @@ exports.getAddAndSubQuestions = exports.addAndSubExercise = void 0;
 const randint_1 = require("../../math/utils/random/randint");
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const addNode_1 = require("../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../utils/shuffle");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
 /**
  * a±b±c±d
  */
@@ -30,11 +32,36 @@ function getAddAndSubQuestions() {
     for (let i = 2; i < allNumbersNodes.length; i++) {
         statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
     }
-    const answer = numbers.reduce((a, b) => a + b) + '';
+    const answer = numbers.reduce((a, b) => a + b);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toString(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const randomOffset = (0, randint_1.randint)(-9, 10, [0]);
+                const wrongAnswer = answer + randomOffset;
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toString(),
+                    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: answer,
+        answer: answer + '',
         keys: [],
+        getPropositions,
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"addAndSubWithoutRelatives.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSubWithoutRelatives.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGjD;;GAEG;AACH,eAAO,MAAM,yBAAyB,EAAE,QAUvC,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CAiCvD"}
+{"version":3,"file":"addAndSubWithoutRelatives.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSubWithoutRelatives.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D;;GAEG;AACH,eAAO,MAAM,yBAAyB,EAAE,QAUvC,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CAgEvD"}

package/lib/exercises/calcul/addAndSubWithoutRelatives.js

@@ -4,7 +4,9 @@ exports.getAddAndSubWithoutRelatives = exports.addAndSubWithoutRelatives = void
 const randint_1 = require("../../math/utils/random/randint");
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const addNode_1 = require("../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../utils/shuffle");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
 /**
  * a±b±c±d
  */
@@ -41,10 +43,34 @@ function getAddAndSubWithoutRelatives() {
         }
         answer = numbers.reduce((a, b) => a + b);
     }
+    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 {
+                const incorrectAnswer = answer + (0, randint_1.randint)(-5, 6, [0]);
+                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: answer.toString(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/arithmetics/primeNumbers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"primeNumbers.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/primeNumbers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAGpD;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAEF,wBAAgB,eAAe,IAAI,QAAQ,CAgC1C"}
+{"version":3,"file":"primeNumbers.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/primeNumbers.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAGjE;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAQF,wBAAgB,eAAe,IAAI,QAAQ,CAyE1C"}

package/lib/exercises/calcul/arithmetics/primeNumbers.js

@@ -2,6 +2,8 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getPrimeNumbers = exports.primeNumbers = void 0;
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 const getDistinctQuestions_1 = require("../../utils/getDistinctQuestions");
 /**
  * a±b±c±d
@@ -17,10 +19,16 @@ exports.primeNumbers = {
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPrimeNumbers, nb),
     keys: [],
 };
+function prodNumbers(tab) {
+    let temp = 1;
+    for (let i = 0; i < tab.length; i++)
+        temp *= tab[i];
+    return temp;
+}
 function getPrimeNumbers() {
     const primes = [2, 3, 5, 7, 11];
     const rand = (0, randint_1.randint)(3, 5);
-    let choosenNumebrs = [];
+    let choosenNumbers = [];
     let elevenCount = 0;
     for (let i = 0; i < rand; i++) {
         let temp = (0, randint_1.randint)(0, 5);
@@ -28,20 +36,51 @@ function getPrimeNumbers() {
             elevenCount++;
         while (elevenCount >= 2 && temp === 4)
             temp = (0, randint_1.randint)(0, 5);
-        choosenNumebrs.push(primes[temp]);
+        choosenNumbers.push(primes[temp]);
     }
-    let prod = 1;
-    for (let i = 0; i < choosenNumebrs.length; i++)
-        prod *= choosenNumebrs[i];
-    choosenNumebrs = choosenNumebrs.sort((a, b) => a - b);
-    let answer = `${prod} = ${choosenNumebrs[0]}`;
-    for (let i = 1; i < choosenNumebrs.length; i++) {
-        answer += `\\times` + choosenNumebrs[i];
+    const prod = prodNumbers(choosenNumbers);
+    choosenNumbers = choosenNumbers.sort((a, b) => a - b);
+    let answer = `${prod} = ${choosenNumbers[0]}`;
+    for (let i = 1; i < choosenNumbers.length; i++) {
+        answer += `\\times` + choosenNumbers[i];
     }
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+        });
+        const wrongFactors = [...choosenNumbers];
+        for (let i = 0; i < n - 1; i++) {
+            let wrongFactor, newFactor, randomIndex, wrongAnswer;
+            do {
+                randomIndex = (0, randint_1.randint)(0, wrongFactors.length);
+                wrongFactor = wrongFactors[randomIndex];
+                newFactor = wrongFactor;
+                while (newFactor === wrongFactor) {
+                    const temp = (0, randint_1.randint)(0, primes.length);
+                    newFactor = primes[temp];
+                }
+                wrongFactors[randomIndex] = newFactor;
+                wrongAnswer = `${prod} = ${wrongFactors[0]}`;
+                for (let j = 1; j < wrongFactors.length; j++) {
+                    wrongAnswer += `\\times` + wrongFactors[j];
+                }
+            } while (res.find((el) => el.statement === wrongAnswer));
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+            });
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
-        startStatement: `${prod} = ?`,
+        startStatement: `${prod}`,
         answer,
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/fractions/fractionAndIntegerDivision.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionAndIntegerDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,0BAA0B,EAAE,QAUxC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAiBxD"}
+{"version":3,"file":"fractionAndIntegerDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,0BAA0B,EAAE,QAUxC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAqDxD"}

package/lib/exercises/calcul/fractions/fractionAndIntegerDivision.js

@@ -7,6 +7,8 @@ const rational_1 = require("../../../math/numbers/rationals/rational");
 const randint_1 = require("../../../math/utils/random/randint");
 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.fractionAndIntegerDivision = {
     id: 'fractionAndIntegerDivision',
     connector: '=',
@@ -26,11 +28,38 @@ function getFractionAndIntegerDivision() {
         ? new divideNode_1.DivideNode(integer.toTree(), rational.toTree())
         : new divideNode_1.DivideNode(rational.toTree(), integer.toTree());
     const answerTree = integerFirst ? integer.divide(rational).toTree() : rational.divide(integer).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 wrongRational = rational_1.RationalConstructor.randomIrreductible();
+                const wrongAnswerTree = integerFirst
+                    ? integer.divide(wrongRational).toTree()
+                    : wrongRational.divide(integer).toTree();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswerTree.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: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/fractions/fractionAndIntegerProduct.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionAndIntegerProduct.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerProduct.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO9D,eAAO,MAAM,yBAAyB,EAAE,QAUvC,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CAcvD"}
+{"version":3,"file":"fractionAndIntegerProduct.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerProduct.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,yBAAyB,EAAE,QAUvC,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CA6CvD"}

package/lib/exercises/calcul/fractions/fractionAndIntegerProduct.js

@@ -6,6 +6,8 @@ const integer_1 = require("../../../math/numbers/integer/integer");
 const rational_1 = require("../../../math/numbers/rationals/rational");
 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.fractionAndIntegerProduct = {
     id: 'fractionAndIntegerProduct',
     connector: '=',
@@ -23,11 +25,36 @@ function getFractionAndIntegerProduct() {
     const statementTree = new multiplyNode_1.MultiplyNode(rational.toTree(), integer.toTree());
     statementTree.shuffle();
     const answerTree = rational.multiply(integer).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 randomMultiplier = (0, randint_1.randint)(-10, 10);
+                const wrongAnswerTree = rational.multiply(new integer_1.Integer(randomMultiplier)).toTree();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswerTree.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: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/fractions/fractionAndIntegerSum.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionAndIntegerSum.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerSum.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO9D,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAanD"}
+{"version":3,"file":"fractionAndIntegerSum.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionAndIntegerSum.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CA8CnD"}

package/lib/exercises/calcul/fractions/fractionAndIntegerSum.js

@@ -6,6 +6,8 @@ const integer_1 = require("../../../math/numbers/integer/integer");
 const rational_1 = require("../../../math/numbers/rationals/rational");
 const randint_1 = require("../../../math/utils/random/randint");
 const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.fractionAndIntegerSum = {
     id: 'fractionAndIntegerSum',
     connector: '=',
@@ -23,11 +25,36 @@ function getFractionAndIntegerSum() {
     const statementTree = new addNode_1.AddNode(rational.toTree(), integer.toTree());
     statementTree.shuffle();
     const answerTree = rational.add(integer).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 rational = rational_1.RationalConstructor.randomIrreductible();
+                const wrongAnswerTree = rational.add(integer).toTree();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswerTree.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: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/fractions/fractionToPercentToDecimal.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionToPercentToDecimal.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionToPercentToDecimal.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAqDxD"}
+{"version":3,"file":"fractionToPercentToDecimal.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionToPercentToDecimal.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAqHxD"}

package/lib/exercises/calcul/fractions/fractionToPercentToDecimal.js

@@ -7,6 +7,8 @@ const round_1 = require("../../../math/utils/round");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
 const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.fractionToPercentToDecimal = {
     id: 'fractionToPercentToDecimal',
     connector: '\\iff',
@@ -58,11 +60,56 @@ function getFractionToPercentToDecimal() {
             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 {
+                let statement = '';
+                switch (rand) {
+                    case 1:
+                        const temp1 = (0, randint_1.randint)(-5, 3, [0]);
+                        statement = `${(0, round_1.round)(percent * 10 ** temp1, -temp1 + 2)}\\%`;
+                        break;
+                    case 2:
+                        statement = `${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(numerator * (0, randint_1.randint)(1, 20, [0, 1])), new numberNode_1.NumberNode(denominator * (0, randint_1.randint)(1, 20, [0, 1])))).toTex()}`;
+                        break;
+                    case 3:
+                        const temp3 = (0, randint_1.randint)(-5, 3, [0]);
+                        statement = `${(0, round_1.round)(percent * 10 ** temp3, -temp3 + 2)}`;
+                        break;
+                    case 4:
+                        statement = `${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(numerator * (0, randint_1.randint)(1, 20, [0, 1])), new numberNode_1.NumberNode(denominator * (0, randint_1.randint)(1, 20, [0, 1])))).toTex()}`;
+                        break;
+                    case 5:
+                        statement = `${(0, round_1.round)(decimal + Math.random() * 10, 2)}`;
+                        break;
+                    case 6:
+                        statement = `${(0, round_1.round)(percent + Math.random() * 10, 2)}\\%`;
+                        break;
+                }
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement,
+                    isRightAnswer: false,
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
     const question = {
         instruction,
-        //startStatement: `${numerator} et ${denominator}`,
         answer,
         keys: ['percent'],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/fractions/fractionsDivision.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionsDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionsDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK9D,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,oBAAoB,IAAI,QAAQ,CAY/C"}
+{"version":3,"file":"fractionsDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionsDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,oBAAoB,IAAI,QAAQ,CA6C/C"}

package/lib/exercises/calcul/fractions/fractionsDivision.js

@@ -4,6 +4,8 @@ exports.getFractionsDivision = exports.fractionsDivision = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const rational_1 = require("../../../math/numbers/rationals/rational");
 const divideNode_1 = require("../../../tree/nodes/operators/divideNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.fractionsDivision = {
     id: 'fractionsDivision',
     connector: '=',
@@ -20,11 +22,36 @@ function getFractionsDivision() {
     const rational2 = rational_1.RationalConstructor.randomIrreductible();
     const statementTree = new divideNode_1.DivideNode(rational.toTree(), rational2.toTree());
     const answerTree = rational.divide(rational2).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 randomRational = rational_1.RationalConstructor.randomIrreductible();
+                const wrongAnswerTree = randomRational.divide(rational2).toTree();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswerTree.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: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/fractions/fractionsProduct.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionsProduct.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionsProduct.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,CAW9C"}
+{"version":3,"file":"fractionsProduct.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionsProduct.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,CA4C9C"}

package/lib/exercises/calcul/fractions/fractionsProduct.js

@@ -4,6 +4,8 @@ exports.getFractionsProduct = exports.fractionsProduct = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const rational_1 = require("../../../math/numbers/rationals/rational");
 const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.fractionsProduct = {
     id: 'fractionsProduct',
     connector: '=',
@@ -20,10 +22,35 @@ function getFractionsProduct() {
     const rational2 = rational_1.RationalConstructor.randomIrreductible();
     const statementTree = new multiplyNode_1.MultiplyNode(rational.toTree(), rational2.toTree());
     const answerTree = rational.multiply(rational2).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 randomRational = rational_1.RationalConstructor.randomIrreductible();
+                const wrongAnswerTree = randomRational.multiply(rational2).toTree();
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswerTree.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: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/fractions/fractionsSum.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionsSum.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAK9D,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAEF,wBAAgB,eAAe,IAAI,QAAQ,CAW1C"}
+{"version":3,"file":"fractionsSum.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/fractionsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAEF,wBAAgB,eAAe,IAAI,QAAQ,CA4C1C"}

package/lib/exercises/calcul/fractions/fractionsSum.js

@@ -4,6 +4,8 @@ exports.getFractionsSum = exports.fractionsSum = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const rational_1 = require("../../../math/numbers/rationals/rational");
 const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.fractionsSum = {
     id: 'fractionsSum',
     connector: '=',
@@ -20,10 +22,35 @@ function getFractionsSum() {
     const rational2 = rational_1.RationalConstructor.randomIrreductible();
     const statementTree = new addNode_1.AddNode(rational.toTree(), rational2.toTree());
     const answerTree = rational.add(rational2).toTree();
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.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 incorrectRational = rational_1.RationalConstructor.randomIrreductible();
+                const incorrectRational2 = rational_1.RationalConstructor.randomIrreductible();
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: incorrectRational.add(incorrectRational2).toTree().toTex(),
+                    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: answerTree.toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/exercises/calcul/fractions/simplifyFraction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"simplifyFraction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/simplifyFraction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAI9D,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAQ9C"}
+{"version":3,"file":"simplifyFraction.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/fractions/simplifyFraction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAwC9C"}

package/lib/exercises/calcul/fractions/simplifyFraction.js

@@ -3,6 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.getSimplifyFraction = exports.simplifyFraction = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const rational_1 = require("../../../math/numbers/rationals/rational");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.simplifyFraction = {
     id: 'simplifyFrac',
     connector: '=',
@@ -16,10 +18,34 @@ exports.simplifyFraction = {
 };
 function getSimplifyFraction() {
     const rational = rational_1.RationalConstructor.randomSimplifiable(10);
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: rational.simplify().toTree().toTex(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const incorrectRational = rational_1.RationalConstructor.randomSimplifiable(10);
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: incorrectRational.simplify().toTree().toTex(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
     const question = {
         startStatement: rational.toTree().toTex(),
         answer: rational.simplify().toTree().toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"mentalAddAndSub.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/mentalCaluls.ts/mentalAddAndSub.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,CA4B7C"}
+{"version":3,"file":"mentalAddAndSub.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/mentalCaluls.ts/mentalAddAndSub.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,CA+D7C"}