math-exercises 1.3.41 → 1.3.43

package/lib/exercises/calculLitteral/equation/logEquation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/logEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAc3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,aAAa,IAAI,QAAQ,CAuDxC"}

package/lib/exercises/calculLitteral/equation/logEquation.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLnEquation = exports.logEquation = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const expNode_1 = require("../../../tree/nodes/functions/expNode");
+const logNode_1 = require("../../../tree/nodes/functions/logNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const equalNode_1 = require("../../../tree/nodes/operators/equalNode");
+const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.logEquation = {
+    id: 'logEquation',
+    connector: '=',
+    instruction: '',
+    label: 'Résoudre des équations de type $a \\times ln(x) = k$',
+    levels: ['1', '0'],
+    section: 'Fonction Logarithme népérien',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLnEquation, nb),
+    keys: ['ln', 'exp'],
+};
+function getLnEquation() {
+    const a = (0, randint_1.randint)(-9, 20, [0]);
+    const k = (0, randint_1.randint)(-9, 20, [0]);
+    const equation = new equalNode_1.EqualNode((0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new logNode_1.LogNode(new variableNode_1.VariableNode('x')))), new numberNode_1.NumberNode(k));
+    const answer = new expNode_1.ExpNode((0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(k), new numberNode_1.NumberNode(a))));
+    const getPropositions = (numOptions) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < numOptions - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const randomA = (0, randint_1.randint)(1, 10);
+                const randomK = (0, randint_1.randint)(1, 20);
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: new expNode_1.ExpNode((0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(randomK), new numberNode_1.NumberNode(randomA)))).toTex(),
+                    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: `Résoudre l'équation $${equation.toTex()}$.`,
+        answer: answer.toTex(),
+        keys: ['ln', 'exp'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLnEquation = getLnEquation;

package/lib/exercises/calculLitteral/equation/multiplicationEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"multiplicationEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/multiplicationEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,sBAAsB,EAAE,QAUpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAsEpD"}
+{"version":3,"file":"multiplicationEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/multiplicationEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,sBAAsB,EAAE,QAUpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAyEpD"}

package/lib/exercises/calculLitteral/equation/multiplicationEquation.js

@@ -38,6 +38,7 @@ function getMultiplicationEquation() {
             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 getMultiplicationEquation() {
                     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 getMultiplicationEquation() {
         answer: `S = \\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`,
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/calculLitteral/factorisation/factoIdRmq1.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAuDhD"}
+{"version":3,"file":"factoIdRmq1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA2DhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq1.js

@@ -33,11 +33,13 @@ function getFactoType1Question() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         res.push({
             id: (0, uuid_1.v4)() + '',
             statement: new powerNode_1.PowerNode(new affine_1.Affine(affine.b, affine.a).toTree(), new numberNode_1.NumberNode(2)).toTex(),
             isRightAnswer: false,
+            format: 'tex',
         });
         for (let i = 0; i < n - 2; i++) {
             let isDuplicate;
@@ -48,6 +50,7 @@ function getFactoType1Question() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -60,6 +63,7 @@ function getFactoType1Question() {
         answer: answerTree.toTex(),
         keys: ['x'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/calculLitteral/factorisation/factoIdRmq2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAgEhD"}
+{"version":3,"file":"factoIdRmq2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAqEhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq2.js

@@ -34,17 +34,20 @@ function getFactoType1Question() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         res.push({
             id: (0, uuid_1.v4)() + '',
             statement: new powerNode_1.PowerNode(new affine_1.Affine(-affine.b, -affine.a).toTree(), new numberNode_1.NumberNode(2)).toTex(),
             isRightAnswer: false,
+            format: 'tex',
         });
         if (n > 2)
             res.push({
                 id: (0, uuid_1.v4)() + '',
                 statement: new powerNode_1.PowerNode(new affine_1.Affine(-affine.a, affine.b).toTree(), new numberNode_1.NumberNode(2)).toTex(),
                 isRightAnswer: false,
+                format: 'tex',
             });
         for (let i = 0; i < n - 3; i++) {
             let isDuplicate;
@@ -55,6 +58,7 @@ function getFactoType1Question() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -67,6 +71,7 @@ function getFactoType1Question() {
         answer: answerTree.toTex(),
         keys: ['x'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/calculLitteral/factorisation/factoIdRmq3.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq3.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAqEhD"}
+{"version":3,"file":"factoIdRmq3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq3.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA2EhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq3.js

@@ -33,23 +33,27 @@ function getFactoType1Question() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         res.push({
             id: (0, uuid_1.v4)() + '',
             statement: new multiplyNode_1.MultiplyNode(affine.toTree(), affine.toTree()).toTex(),
             isRightAnswer: false,
+            format: 'tex',
         });
         if (n > 2)
             res.push({
                 id: (0, uuid_1.v4)() + '',
                 statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), affine2.toTree()).toTex(),
                 isRightAnswer: false,
+                format: 'tex',
             });
         if (n > 3)
             res.push({
                 id: (0, uuid_1.v4)() + '',
                 statement: new multiplyNode_1.MultiplyNode(affine2.toTree(), new affine_1.Affine(-affine.b, affine.a).toTree()).toTex(),
                 isRightAnswer: false,
+                format: 'tex',
             });
         for (let i = 0; i < n - 4; i++) {
             let isDuplicate;
@@ -60,6 +64,7 @@ function getFactoType1Question() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -72,6 +77,7 @@ function getFactoType1Question() {
         answer: answerTree.toTex(),
         keys: ['x'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoType1Exercise.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA6FhD"}
+{"version":3,"file":"factoType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoType1Exercise.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAmGhD"}

package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.js

@@ -37,23 +37,27 @@ function getFactoType1Question() {
             id: (0, uuid_1.v4)() + '',
             statement: answerTree.toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         res.push({
             id: (0, uuid_1.v4)() + '',
             statement: new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(operation !== 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
             isRightAnswer: false,
+            format: 'tex',
         });
         if (n > 2)
             res.push({
                 id: (0, uuid_1.v4)() + '',
                 statement: new multiplyNode_1.MultiplyNode(affines[1].toTree(), affines[0].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
                 isRightAnswer: false,
+                format: 'tex',
             });
         if (n > 3)
             res.push({
                 id: (0, uuid_1.v4)() + '',
                 statement: new multiplyNode_1.MultiplyNode(affines[2].toTree(), affines[0].add(operation === 'add' ? affines[2] : affines[2].opposite()).toTree()).toTex(),
                 isRightAnswer: false,
+                format: 'tex',
             });
         for (let i = 0; i < n - 4; i++) {
             let isDuplicate;
@@ -64,6 +68,7 @@ function getFactoType1Question() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer.toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -76,6 +81,7 @@ function getFactoType1Question() {
         answer: answerTree.toTex(),
         keys: ['x'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/calculLitteral/simplifying/evaluateExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"evaluateExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/evaluateExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAiDhD"}
+{"version":3,"file":"evaluateExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/evaluateExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAoDhD"}

package/lib/exercises/calculLitteral/simplifying/evaluateExpression.js

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

package/lib/exercises/calculLitteral/simplifying/expSimplifiying.d.ts

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

package/lib/exercises/calculLitteral/simplifying/expSimplifiying.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expSimplifiying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/expSimplifiying.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAc3E,eAAO,MAAM,eAAe,EAAE,QAU7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CAyG7C"}

package/lib/exercises/calculLitteral/simplifying/expSimplifiying.js

@@ -0,0 +1,96 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getExpSimplifiying = exports.expSimplifiying = 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 fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const simplify_1 = require("../../../tree/parsers/simplify");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.expSimplifiying = {
+    id: 'expSimplifiying',
+    connector: '\\iff',
+    instruction: '',
+    label: "Simplifier des expressions avec l'exponentielle",
+    levels: ['1', '0'],
+    section: 'Fonction Exponentielle',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
+    keys: ['exp'],
+};
+function getExpSimplifiying() {
+    const random = (0, randint_1.randint)(1, 4);
+    let expression;
+    switch (random) {
+        case 1:
+            expression = new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new expNode_1.ExpNode(new polynomial_1.Polynomial([0, (0, randint_1.randint)(-9, 10, [0])]).toTree()), new expNode_1.ExpNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [0])))), new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()));
+            expression.shuffle();
+            break;
+        case 2:
+            expression = new multiplyNode_1.MultiplyNode(new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()), new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()));
+            expression.shuffle();
+            break;
+        case 3:
+            expression = new fractionNode_1.FractionNode(new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()), new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()));
+            expression.shuffle();
+            break;
+        default:
+            expression = new expNode_1.ExpNode(new variableNode_1.VariableNode('x'));
+    }
+    const simplifiedExpression = (0, simplify_1.simplifyNode)(expression);
+    const getPropositions = (numOptions) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: simplifiedExpression.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < numOptions - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                let wrongExpression;
+                switch (random) {
+                    case 1:
+                        wrongExpression = new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new expNode_1.ExpNode(new polynomial_1.Polynomial([0, (0, randint_1.randint)(-9, 10, [0])]).toTree()), new expNode_1.ExpNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [0])))), new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()));
+                        wrongExpression.shuffle();
+                        break;
+                    case 2:
+                        wrongExpression = new multiplyNode_1.MultiplyNode(new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()), new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()));
+                        wrongExpression.shuffle();
+                        break;
+                    case 3:
+                        wrongExpression = new fractionNode_1.FractionNode(new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()), new expNode_1.ExpNode(new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]).toTree()));
+                        wrongExpression.shuffle();
+                        break;
+                    default:
+                        wrongExpression = new expNode_1.ExpNode(new variableNode_1.VariableNode('x'));
+                }
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: (0, simplify_1.simplifyNode)(wrongExpression).toTex(),
+                    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: `Simplifier l'expression $${expression.toTex()}$.`,
+        answer: simplifiedExpression.toTex(),
+        keys: ['exp'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getExpSimplifiying = getExpSimplifiying;

package/lib/exercises/calculLitteral/simplifying/logSimplifiying.d.ts

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

package/lib/exercises/calculLitteral/simplifying/logSimplifiying.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logSimplifiying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/logSimplifiying.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY3E,eAAO,MAAM,eAAe,EAAE,QAU7B,CAAC;AAEF,wBAAgB,kBAAkB,IAAI,QAAQ,CA+D7C"}

package/lib/exercises/calculLitteral/simplifying/logSimplifiying.js

@@ -0,0 +1,78 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getExpSimplifiying = exports.logSimplifiying = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const logNode_1 = require("../../../tree/nodes/functions/logNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
+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.logSimplifiying = {
+    id: 'logSimplifiying',
+    connector: '\\iff',
+    instruction: '',
+    label: 'Simplifier des expressions avec $ln$',
+    levels: ['1', '0'],
+    section: 'Fonction Logarithme népérien',
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
+    keys: ['ln'],
+};
+function getExpSimplifiying() {
+    const a = (0, randint_1.randint)(1, 10);
+    const b = (0, randint_1.randint)(1, 10);
+    let expression;
+    let simplifiedExpression;
+    let pm = 0;
+    if ((0, coinFlip_1.coinFlip)()) {
+        expression = new addNode_1.AddNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a)), new logNode_1.LogNode(new numberNode_1.NumberNode(b)));
+        simplifiedExpression = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
+        pm = 1;
+    }
+    else {
+        expression = new substractNode_1.SubstractNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a)), new logNode_1.LogNode(new numberNode_1.NumberNode(b)));
+        simplifiedExpression = new logNode_1.LogNode((0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)));
+        pm = -1;
+    }
+    const getPropositions = (numOptions) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: simplifiedExpression.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < numOptions - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const a = (0, randint_1.randint)(1, 10);
+                const b = (0, randint_1.randint)(1, 10);
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: pm > 0
+                        ? new logNode_1.LogNode(new numberNode_1.NumberNode(a * b)).toTex()
+                        : new logNode_1.LogNode((0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b))).toTex(),
+                    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: `Simplifier l'expression $${expression.toTex()}$.`,
+        answer: simplifiedExpression.toTex(),
+        keys: ['ln'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getExpSimplifiying = getExpSimplifiying;

package/lib/exercises/calculLitteral/simplifying/reduceExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reduceExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/reduceExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAgI9C"}
+{"version":3,"file":"reduceExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/reduceExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAmI9C"}

package/lib/exercises/calculLitteral/simplifying/reduceExpression.js

@@ -88,6 +88,7 @@ function getReduceExpression() {
             id: (0, uuid_1.v4)() + '',
             statement: answer,
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -100,6 +101,7 @@ function getReduceExpression() {
                     id: (0, uuid_1.v4)() + '',
                     statement: polynome1.add(polynome2).toTree().toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -112,6 +114,7 @@ function getReduceExpression() {
         answer,
         keys: ['x'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/conversion/aeraConversion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aeraConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/aeraConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CAoD5C"}
+{"version":3,"file":"aeraConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/aeraConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CAuD5C"}

package/lib/exercises/conversion/aeraConversion.js

@@ -30,6 +30,7 @@ function getAeraConversion() {
             id: (0, uuid_1.v4)() + '',
             statement: randomAera.multiplyByPowerOfTen(2 * (randomUnitIndex - randomUnitInstructionIndex)).value + '',
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -41,6 +42,7 @@ function getAeraConversion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -53,6 +55,7 @@ function getAeraConversion() {
         answer: randomAera.multiplyByPowerOfTen(2 * (randomUnitIndex - randomUnitInstructionIndex)).value + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/conversion/capacityConversion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"capacityConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/capacityConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA+ChD"}
+{"version":3,"file":"capacityConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/capacityConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAkDhD"}

package/lib/exercises/conversion/capacityConversion.js

@@ -28,6 +28,7 @@ function getCapacityConversion() {
             id: (0, uuid_1.v4)() + '',
             statement: randomCapacity.multiplyByPowerOfTen(randomUnitIndex - randomUnitInstructionIndex).value + '',
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -39,6 +40,7 @@ function getCapacityConversion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -51,6 +53,7 @@ function getCapacityConversion() {
         answer: randomCapacity.multiplyByPowerOfTen(randomUnitIndex - randomUnitInstructionIndex).value + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/conversion/lengthConversion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lengthConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/lengthConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CA8C9C"}
+{"version":3,"file":"lengthConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/lengthConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAiD9C"}

package/lib/exercises/conversion/lengthConversion.js

@@ -28,6 +28,7 @@ function getLengthConversion() {
             id: (0, uuid_1.v4)() + '',
             statement: randomlength.multiplyByPowerOfTen(randomUnitIndex - randomUnitInstructionIndex).value + '',
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -38,6 +39,7 @@ function getLengthConversion() {
                     id: (0, uuid_1.v4)() + '',
                     statement: wrongAnswer,
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -50,6 +52,7 @@ function getLengthConversion() {
         answer: randomlength.multiplyByPowerOfTen(randomUnitIndex - randomUnitInstructionIndex).value + '',
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/conversion/massConversion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"massConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/massConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CA8C5C"}
+{"version":3,"file":"massConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/massConversion.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,iBAAiB,IAAI,QAAQ,CAiD5C"}