math-exercises 1.3.41 → 1.3.43

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":"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"}
+{"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,CAsDhD"}

package/lib/exercises/calcul/addAndSub.js

@@ -39,6 +39,7 @@ function getAddAndSubQuestions() {
             id: (0, uuid_1.v4)() + '',
             statement: answer.toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -50,6 +51,7 @@ function getAddAndSubQuestions() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer.toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -62,6 +64,7 @@ function getAddAndSubQuestions() {
         answer: answer + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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":"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"}
+{"version":3,"file":"addAndSubWithoutRelatives.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSubWithoutRelatives.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D;;GAEG;AACH,eAAO,MAAM,yBAAyB,EAAE,QAUvC,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CAmEvD"}

package/lib/exercises/calcul/addAndSubWithoutRelatives.js

@@ -49,6 +49,7 @@ function getAddAndSubWithoutRelatives() {
             id: (0, uuid_1.v4)() + '',
             statement: answer.toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -59,6 +60,7 @@ function getAddAndSubWithoutRelatives() {
                     id: (0, uuid_1.v4)() + '',
                     statement: incorrectAnswer.toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -71,6 +73,7 @@ function getAddAndSubWithoutRelatives() {
         answer: answer.toString(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/calcul/arithmetics/euclideanDivision.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"euclideanDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/euclideanDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAgExD"}

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

@@ -0,0 +1,70 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getEuclideanDivisionQuestions = exports.euclideanDivision = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+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 equalNode_1 = require("../../../tree/nodes/operators/equalNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.euclideanDivision = {
+    id: 'euclideanDivision',
+    connector: '=',
+    instruction: '',
+    label: 'Ecrire une division euclidienne',
+    levels: ['6', '5', '4'],
+    section: 'Arithmétique',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEuclideanDivisionQuestions, nb),
+    keys: ['equal'],
+};
+function getEuclideanDivisionQuestions() {
+    let dividend = (0, randint_1.randint)(5, 100);
+    let divisor = (0, randint_1.randint)(2, 11);
+    while (dividend % divisor === 0) {
+        dividend = (0, randint_1.randint)(5, 100);
+        divisor = (0, randint_1.randint)(2, 11);
+    }
+    const quotient = Math.floor(dividend / divisor);
+    const remainder = dividend % divisor;
+    const answer = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const divisor = (0, randint_1.randint)(2, 11);
+                const quotient = Math.floor((0, randint_1.randint)(5, 100) / divisor);
+                const remainder = (0, randint_1.randint)(5, 100) % divisor;
+                const wrongAnswer = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)));
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: `Ecrire la division euclidienne de ${dividend} par ${divisor}`,
+        answer: answer.toTex(),
+        keys: ['equal'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getEuclideanDivisionQuestions = getEuclideanDivisionQuestions;

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":"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"}
+{"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,CA4E1C"}

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

@@ -14,7 +14,7 @@ exports.primeNumbers = {
     instruction: 'Donner la décomposition en nombre premiers',
     label: 'Décomposition en nombres premiers',
     levels: ['5', '4', '3', '2'],
-    section: 'Arithmétiques',
+    section: 'Arithmétique',
     isSingleStep: false,
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPrimeNumbers, nb),
     keys: [],
@@ -50,6 +50,7 @@ function getPrimeNumbers() {
             id: (0, uuid_1.v4)() + '',
             statement: answer,
             isRightAnswer: true,
+            format: 'tex',
         });
         const wrongFactors = [...choosenNumbers];
         for (let i = 0; i < n - 1; i++) {
@@ -72,6 +73,7 @@ function getPrimeNumbers() {
                 id: (0, uuid_1.v4)() + '',
                 statement: wrongAnswer,
                 isRightAnswer: false,
+                format: 'tex',
             });
         }
         return (0, shuffle_1.shuffle)(res);
@@ -81,6 +83,7 @@ function getPrimeNumbers() {
         answer,
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAU3E,eAAO,MAAM,0BAA0B,EAAE,QAUxC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAqDxD"}
+{"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,CAwDxD"}

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

@@ -34,6 +34,7 @@ function getFractionAndIntegerDivision() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -47,6 +48,7 @@ function getFractionAndIntegerDivision() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswerTree.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -60,6 +62,7 @@ function getFractionAndIntegerDivision() {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAS3E,eAAO,MAAM,yBAAyB,EAAE,QAUvC,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CA6CvD"}
+{"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,CAgDvD"}

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

@@ -31,6 +31,7 @@ function getFractionAndIntegerProduct() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -42,6 +43,7 @@ function getFractionAndIntegerProduct() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswerTree.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -55,6 +57,7 @@ function getFractionAndIntegerProduct() {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAS3E,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CA8CnD"}
+{"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,CAiDnD"}

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

@@ -31,6 +31,7 @@ function getFractionAndIntegerSum() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -42,6 +43,7 @@ function getFractionAndIntegerSum() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswerTree.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -55,6 +57,7 @@ function getFractionAndIntegerSum() {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAU3E,eAAO,MAAM,0BAA0B,EAAE,QASxC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAqHxD"}
+{"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,CAwHxD"}

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

@@ -66,6 +66,7 @@ function getFractionToPercentToDecimal() {
             id: (0, uuid_1.v4)(),
             statement: answer,
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -98,6 +99,7 @@ function getFractionToPercentToDecimal() {
                     id: (0, uuid_1.v4)(),
                     statement,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -110,6 +112,7 @@ function getFractionToPercentToDecimal() {
         answer,
         keys: ['percent'],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAO3E,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,oBAAoB,IAAI,QAAQ,CA6C/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,CAgD/C"}

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

@@ -28,6 +28,7 @@ function getFractionsDivision() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -39,6 +40,7 @@ function getFractionsDivision() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswerTree.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -52,6 +54,7 @@ function getFractionsDivision() {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAO3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CA4C9C"}
+{"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,CA+C9C"}

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

@@ -28,6 +28,7 @@ function getFractionsProduct() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -39,6 +40,7 @@ function getFractionsProduct() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswerTree.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -51,6 +53,7 @@ function getFractionsProduct() {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAO3E,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAEF,wBAAgB,eAAe,IAAI,QAAQ,CA4C1C"}
+{"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,CA+C1C"}

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

@@ -28,6 +28,7 @@ function getFractionsSum() {
             id: (0, uuid_1.v4)(),
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -39,6 +40,7 @@ function getFractionsSum() {
                     id: (0, uuid_1.v4)(),
                     statement: incorrectRational.add(incorrectRational2).toTree().toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -51,6 +53,7 @@ function getFractionsSum() {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAM3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAwC9C"}
+{"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,CA2C9C"}

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

@@ -24,6 +24,7 @@ function getSimplifyFraction() {
             id: (0, uuid_1.v4)(),
             statement: rational.simplify().toTree().toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -34,6 +35,7 @@ function getSimplifyFraction() {
                     id: (0, uuid_1.v4)(),
                     statement: incorrectRational.simplify().toTree().toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -46,6 +48,7 @@ function getSimplifyFraction() {
         answer: rational.simplify().toTree().toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAU3E,eAAO,MAAM,eAAe,EAAE,QAU7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CA+D7C"}
+{"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,CAkE7C"}

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

@@ -46,6 +46,7 @@ function getMentalAddAndSub() {
             id: (0, uuid_1.v4)() + '',
             statement: answer.toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         // Ajout des propositions incorrectes
         for (let i = 0; i < n - 1; i++) {
@@ -57,6 +58,7 @@ function getMentalAddAndSub() {
                     id: (0, uuid_1.v4)() + '',
                     statement: incorrectSum.toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -70,6 +72,7 @@ function getMentalAddAndSub() {
         answer: (0, round_1.round)(sum, 2) + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAU3E,eAAO,MAAM,eAAe,EAAE,QAU7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CAyF7C"}
+{"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,CA4F7C"}

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

@@ -63,6 +63,7 @@ function getMentalDivisions() {
             id: (0, uuid_1.v4)() + '',
             statement: answer.toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         // Ajout des propositions incorrectes
         for (let i = 0; i < n - 1; i++) {
@@ -74,6 +75,7 @@ function getMentalDivisions() {
                     id: (0, uuid_1.v4)() + '',
                     statement: incorrectAnswer.toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -87,6 +89,7 @@ function getMentalDivisions() {
         answer: (0, round_1.round)(answer, 2) + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAU3E,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAkEnD"}
+{"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,CAqEnD"}

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

@@ -49,6 +49,7 @@ function getMentalMultiplications() {
             id: (0, uuid_1.v4)() + '',
             statement: answer.toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -59,6 +60,7 @@ function getMentalMultiplications() {
                     id: (0, uuid_1.v4)() + '',
                     statement: incorrectAnswer.toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -71,6 +73,7 @@ function getMentalMultiplications() {
         answer: (0, round_1.round)(answer, 2) + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAO3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CA2I9C"}
+{"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,CA8I9C"}

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

@@ -65,6 +65,7 @@ function getMentalPercentage() {
             id: (0, uuid_1.v4)() + '',
             statement: (a * b) / 100 + '',
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -114,6 +115,7 @@ function getMentalPercentage() {
                     id: (0, uuid_1.v4)() + '',
                     statement: incorrectAnswer.toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -126,6 +128,7 @@ function getMentalPercentage() {
         answer: (a * b) / 100 + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAW3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,oBAAoB,IAAI,QAAQ,CA6H/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,CAgI/C"}

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

@@ -98,6 +98,7 @@ function getPriorityQuestions() {
             id: (0, uuid_1.v4)(),
             statement: answer,
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -107,6 +108,7 @@ function getPriorityQuestions() {
                     id: (0, uuid_1.v4)(),
                     statement: (0, randint_1.randint)(-100, 100) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -119,6 +121,7 @@ function getPriorityQuestions() {
         answer,
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     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;AAW3E,eAAO,MAAM,mCAAmC,EAAE,QAUjD,CAAC;AAEF,wBAAgB,sCAAsC,IAAI,QAAQ,CA+PjE"}
+{"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,CAkQjE"}

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

@@ -179,6 +179,7 @@ function getOperationsPrioritiesWithoutRelative() {
             id: (0, uuid_1.v4)(),
             statement: answer,
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -188,6 +189,7 @@ function getOperationsPrioritiesWithoutRelative() {
                     id: (0, uuid_1.v4)(),
                     statement: (0, randint_1.randint)(1, 50) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = propositions.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -200,6 +202,7 @@ function getOperationsPrioritiesWithoutRelative() {
         answer,
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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

@@ -1 +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"}
+{"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,CAyElD"}

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

@@ -46,6 +46,7 @@ function getProportionalityTable() {
             id: (0, uuid_1.v4)() + '',
             statement: answer + '',
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -55,6 +56,7 @@ function getProportionalityTable() {
                     id: (0, uuid_1.v4)() + '',
                     statement: answer + (0, randint_1.randint)(-answer + 1, 20, [0]) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -74,6 +76,7 @@ Déterminer le nombre manquant.`,
         answer: answer + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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;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"}
+{"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,CA0EtE"}