math-exercises 1.3.41 → 1.3.43

package/lib/exercises/limits/polynomeLimit.js

@@ -0,0 +1,132 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getApplyPercentQuestion = exports.polynomeLimit = void 0;
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+exports.polynomeLimit = {
+    id: 'polynomeLimit',
+    connector: '=',
+    instruction: '',
+    label: "Calculer la limite d'une fonction polynomiale",
+    levels: ['2', '1', '0'],
+    section: 'Limites',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getApplyPercentQuestion, nb),
+    keys: ['infty'],
+};
+function getApplyPercentQuestion() {
+    const polynome1 = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(2, 6));
+    const polynome2 = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(2, 6));
+    // a_1x^n + b_2x^(n-1) + ...
+    const a1 = polynome1.coefficients[polynome1.coefficients.length - 1];
+    const a2 = polynome2.coefficients[polynome2.coefficients.length - 1];
+    const rand = (0, coinFlip_1.coinFlip)(); // polynome ou fraction
+    const randLimite = (0, coinFlip_1.coinFlip)() ? 1 : -1; // + infini ou - infini
+    let instruction = '';
+    let answer = '';
+    if (rand) {
+        instruction = `Déterminer la limite en $${randLimite > 0 ? `+` : `-`} \\infty$ de la fonction $f$ définie par : $f(x)$ = $${polynome1.toTex()}$.`;
+        answer = a1 * randLimite ** polynome1.degree > 0 ? `+\\infty` : `-\\infty`;
+    }
+    else {
+        instruction = `Déterminer la limite en $${randLimite > 0 ? `+` : `-`} \\infty$ de la fonction $f$ définie par : $f(x)$ = $${new fractionNode_1.FractionNode(polynome1.toTree(), polynome2.toTree()).toTex()}$.`;
+        if (polynome1.degree > polynome2.degree)
+            answer = a1 * randLimite > 0 ? `+\\infty` : `-\\infty`;
+        else if (polynome2.degree > polynome1.degree)
+            answer = '0';
+        else
+            answer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(a1), new numberNode_1.NumberNode(a2))).toTex();
+    }
+    const getPropositions = (n) => {
+        const res = [];
+        let wrongAnswer = '';
+        let k = n - 1;
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        wrongAnswer = `+\\infty`;
+        if (k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        wrongAnswer = `-\\infty`;
+        if (k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        wrongAnswer = `0`;
+        if (k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        wrongAnswer = (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(a1), new numberNode_1.NumberNode(a2))).toTex();
+        if (!rand && k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        wrongAnswer = `${a1}`;
+        if (k > 0 && answer !== wrongAnswer) {
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: wrongAnswer,
+                isRightAnswer: false,
+                format: 'tex',
+            });
+            k--;
+        }
+        for (let i = 0; i < k; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: (0, randint_1.randint)(-9, 10) + '',
+                    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,
+        answer,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getApplyPercentQuestion = getApplyPercentQuestion;

package/lib/exercises/percent/applyPercent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"applyPercent.d.ts","sourceRoot":"","sources":["../../../src/exercises/percent/applyPercent.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CA4DlD"}
+{"version":3,"file":"applyPercent.d.ts","sourceRoot":"","sources":["../../../src/exercises/percent/applyPercent.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CA+DlD"}

package/lib/exercises/percent/applyPercent.js

@@ -39,6 +39,7 @@ function getApplyPercentQuestion() {
             id: (0, uuid_1.v4)() + '',
             statement: ans.toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -53,6 +54,7 @@ function getApplyPercentQuestion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer.toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -65,6 +67,7 @@ function getApplyPercentQuestion() {
         answer: ans.toString(),
         keys: ['percent'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/percent/averageEvolutionRate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"averageEvolutionRate.d.ts","sourceRoot":"","sources":["../../../src/exercises/percent/averageEvolutionRate.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAmDlD"}
+{"version":3,"file":"averageEvolutionRate.d.ts","sourceRoot":"","sources":["../../../src/exercises/percent/averageEvolutionRate.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAsDlD"}

package/lib/exercises/percent/averageEvolutionRate.js

@@ -28,6 +28,7 @@ function getAverageEvolutionRate() {
             id: (0, uuid_1.v4)() + '',
             statement: `${answer}\\%`,
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -42,6 +43,7 @@ function getAverageEvolutionRate() {
                     id: (0, uuid_1.v4)() + '',
                     statement: `${wrongAnswer}\\%`,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -54,6 +56,7 @@ function getAverageEvolutionRate() {
         answer: answer + `\\%`,
         keys: ['percent'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/percent/globalPercent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"globalPercent.d.ts","sourceRoot":"","sources":["../../../src/exercises/percent/globalPercent.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAK9D,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAkEnD"}
+{"version":3,"file":"globalPercent.d.ts","sourceRoot":"","sources":["../../../src/exercises/percent/globalPercent.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAK9D,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAqEnD"}

package/lib/exercises/percent/globalPercent.js

@@ -42,6 +42,7 @@ function getGlobalPercentQuestion() {
             id: (0, uuid_1.v4)() + '',
             statement: answer,
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -56,6 +57,7 @@ function getGlobalPercentQuestion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: `${wrongAnswer} \\%`,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -68,6 +70,7 @@ function getGlobalPercentQuestion() {
         answer,
         keys: ['percent'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/percent/reciprocalPercentage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reciprocalPercentage.d.ts","sourceRoot":"","sources":["../../../src/exercises/percent/reciprocalPercentage.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAK9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAqD1D"}
+{"version":3,"file":"reciprocalPercentage.d.ts","sourceRoot":"","sources":["../../../src/exercises/percent/reciprocalPercentage.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAK9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAwD1D"}

package/lib/exercises/percent/reciprocalPercentage.js

@@ -30,6 +30,7 @@ function getReciprocalPercentageQuestion() {
             id: (0, uuid_1.v4)() + '',
             statement: `${ans > 0 ? '+' + (0, mathjs_1.round)(ans, 2) : (0, mathjs_1.round)(ans, 2)} \\%`,
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -44,6 +45,7 @@ function getReciprocalPercentageQuestion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: `${wrongAnswer > 0 ? '+' + wrongAnswer : wrongAnswer} \\%`,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -56,6 +58,7 @@ function getReciprocalPercentageQuestion() {
         answer: `${ans > 0 ? '+' + (0, mathjs_1.round)(ans, 2) : (0, mathjs_1.round)(ans, 2)} \\%`,
         keys: ['percent'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"powersDivision.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powersDivision.ts"],"names":[],"mappings":"AAAA;;GAEG;AAQH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAS5B,CAAC;AACF,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAEF,wBAAgB,yBAAyB,CAAC,kBAAkB,GAAE,OAAe,GAAG,QAAQ,CAkDvF"}
+{"version":3,"file":"powersDivision.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powersDivision.ts"],"names":[],"mappings":"AAAA;;GAEG;AAQH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAS5B,CAAC;AACF,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAEF,wBAAgB,yBAAyB,CAAC,kBAAkB,GAAE,OAAe,GAAG,QAAQ,CAqDvF"}

package/lib/exercises/powers/powersDivision.js

@@ -44,6 +44,7 @@ function getPowersDivisionQuestion(useOnlyPowersOfTen = false) {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -56,6 +57,7 @@ function getPowersDivisionQuestion(useOnlyPowersOfTen = false) {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -68,6 +70,7 @@ function getPowersDivisionQuestion(useOnlyPowersOfTen = false) {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"powersOfTenToDecimal.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powersOfTenToDecimal.ts"],"names":[],"mappings":"AAAA;;GAEG;AAOH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,8BAA8B,IAAI,QAAQ,CA8CzD"}
+{"version":3,"file":"powersOfTenToDecimal.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powersOfTenToDecimal.ts"],"names":[],"mappings":"AAAA;;GAEG;AAOH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,8BAA8B,IAAI,QAAQ,CAiDzD"}

package/lib/exercises/powers/powersOfTenToDecimal.js

@@ -32,6 +32,7 @@ function getPowersOfTenDivisionQuestion() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -44,6 +45,7 @@ function getPowersOfTenDivisionQuestion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -56,6 +58,7 @@ function getPowersOfTenDivisionQuestion() {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"powersPower.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powersPower.ts"],"names":[],"mappings":"AAAA;;GAEG;AAOH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,gBAAgB,EAAE,QAS9B,CAAC;AAEF,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,sBAAsB,CAAC,kBAAkB,GAAE,OAAe,GAAG,QAAQ,CA+CpF"}
+{"version":3,"file":"powersPower.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powersPower.ts"],"names":[],"mappings":"AAAA;;GAEG;AAOH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,gBAAgB,EAAE,QAS9B,CAAC;AAEF,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,sBAAsB,CAAC,kBAAkB,GAAE,OAAe,GAAG,QAAQ,CAkDpF"}

package/lib/exercises/powers/powersPower.js

@@ -43,6 +43,7 @@ function getPowersPowerQuestion(useOnlyPowersOfTen = false) {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -55,6 +56,7 @@ function getPowersPowerQuestion(useOnlyPowersOfTen = false) {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -67,6 +69,7 @@ function getPowersPowerQuestion(useOnlyPowersOfTen = false) {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"powersProduct.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powersProduct.ts"],"names":[],"mappings":"AAAA;;GAEG;AAQH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,kBAAkB,EAAE,QAShC,CAAC;AAEF,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,CAAC,kBAAkB,GAAE,OAAe,GAAG,QAAQ,CAkDtF"}
+{"version":3,"file":"powersProduct.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powersProduct.ts"],"names":[],"mappings":"AAAA;;GAEG;AAQH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,kBAAkB,EAAE,QAShC,CAAC;AAEF,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,CAAC,kBAAkB,GAAE,OAAe,GAAG,QAAQ,CAqDtF"}

package/lib/exercises/powers/powersProduct.js

@@ -44,6 +44,7 @@ function getPowersProductQuestion(useOnlyPowersOfTen = false) {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -56,6 +57,7 @@ function getPowersProductQuestion(useOnlyPowersOfTen = false) {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -68,6 +70,7 @@ function getPowersProductQuestion(useOnlyPowersOfTen = false) {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

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

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

package/lib/exercises/powers/scientificToDecimal.js

@@ -37,6 +37,7 @@ function getScientificToDecimalQuestion() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -48,6 +49,7 @@ function getScientificToDecimalQuestion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -60,6 +62,7 @@ function getScientificToDecimalQuestion() {
         answer: answerTree.toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/primitve/constantPrimitive.d.ts

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

package/lib/exercises/primitve/constantPrimitive.d.ts.map

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

package/lib/exercises/primitve/constantPrimitive.js

@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getConstantPrimitive = exports.constantPrimitive = 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.constantPrimitive = {
+    id: 'constantPrimitive',
+    connector: '=',
+    instruction: '',
+    label: "Primitive d'une constante",
+    levels: ['1', '0'],
+    section: 'Intégration',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getConstantPrimitive, nb),
+    keys: ['x', 'C'],
+};
+function getConstantPrimitive() {
+    const c = (0, randint_1.randint)(-9, 10, [0]);
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: `${c}x + C`,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = `${(0, randint_1.randint)(-9, 10)}x + C`;
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    const question = {
+        instruction: `Déterminer la forme générale des primitives de la fonction constante $f$ définie par $f(x) = ${c}$.`,
+        startStatement: `F(x)`,
+        answer: `${c}x + C`,
+        keys: ['x', 'C'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getConstantPrimitive = getConstantPrimitive;

package/lib/exercises/primitve/exponentialPrimitive.d.ts

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

package/lib/exercises/primitve/exponentialPrimitive.d.ts.map

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

package/lib/exercises/primitve/exponentialPrimitive.js

@@ -0,0 +1,103 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getExponentialPrimitive = exports.exponentialPrimitive = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const expNode_1 = require("../../tree/nodes/functions/expNode");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.exponentialPrimitive = {
+    id: 'exponentialPrimitive',
+    connector: '=',
+    instruction: '',
+    label: 'Primitive de la fonction exponentielle',
+    levels: ['1', '0'],
+    section: 'Intégration',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExponentialPrimitive, nb),
+    keys: ['x', 'C', 'exp'],
+};
+function getExponentialPrimitive() {
+    const rand = (0, coinFlip_1.coinFlip)();
+    const a = (0, randint_1.randint)(-9, 10);
+    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
+    let selectedFunction;
+    let integratedFuction;
+    if (rand) {
+        // a * e^(x)
+        selectedFunction = (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new variableNode_1.VariableNode('x')))); // le simplify ici a pour but de éviter les 1*e / -1*e
+        integratedFuction = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new variableNode_1.VariableNode('x')));
+    }
+    else {
+        // u'(x) * e^(u(x))
+        const oneOrTwo = (0, coinFlip_1.coinFlip)();
+        selectedFunction = new multiplyNode_1.MultiplyNode(u.derivate().toTree(), new expNode_1.ExpNode(u.toTree()));
+        integratedFuction = new expNode_1.ExpNode(u.toTree());
+    }
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()} + C`,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            let wrongIntegral;
+            do {
+                if (rand) {
+                    const wrongIntegrals = [
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), new expNode_1.ExpNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new variableNode_1.VariableNode('x')))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new fractionNode_1.FractionNode(new variableNode_1.VariableNode('x'), new numberNode_1.NumberNode(a)))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new addNode_1.AddNode(new variableNode_1.VariableNode('x'), new numberNode_1.NumberNode(a)))),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new powerNode_1.PowerNode(new variableNode_1.VariableNode('x'), new numberNode_1.NumberNode(a)))),
+                        new expNode_1.ExpNode(new variableNode_1.VariableNode('x')),
+                    ];
+                    wrongIntegral = (0, simplify_1.simplifyNode)(wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)]);
+                }
+                else {
+                    const wrongIntegrals = [
+                        new multiplyNode_1.MultiplyNode(u.toTree(), new expNode_1.ExpNode(u.toTree())),
+                        new multiplyNode_1.MultiplyNode(u.derivate().toTree(), new expNode_1.ExpNode(u.toTree())),
+                        new multiplyNode_1.MultiplyNode(u.toTree(), new expNode_1.ExpNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), u.toTree()), new expNode_1.ExpNode(new variableNode_1.VariableNode('x'))),
+                        new multiplyNode_1.MultiplyNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), u.toTree()), new expNode_1.ExpNode(u.toTree())),
+                        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [0])), new expNode_1.ExpNode(u.toTree())),
+                    ];
+                    wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
+                }
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: `${wrongIntegral.toTex()} + C`,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    const question = {
+        instruction: `Déterminer la forme générale des primitives de la fonction f définie par $f(x) = ${selectedFunction.toTex()}$.`,
+        startStatement: `F(x)`,
+        answer: `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()} + C`,
+        keys: ['x', 'C', 'exp'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getExponentialPrimitive = getExponentialPrimitive;

package/lib/exercises/primitve/logarithmePrimitive.d.ts

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

package/lib/exercises/primitve/logarithmePrimitive.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logarithmePrimitive.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitve/logarithmePrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CAiEjD"}