math-exercises 2.0.6 → 2.0.9

package/lib/exercises/functions/exponential/expSimplifiying.d.ts

@@ -0,0 +1,10 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    random: number;
+    a?: number;
+    uCoeffs: number[];
+    vCoeffs: number[];
+};
+export declare const expSimplifiying: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=expSimplifiying.d.ts.map

package/lib/exercises/functions/exponential/expSimplifiying.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expSimplifiying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/exponential/expSimplifiying.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAclC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AAmIF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAYrD,CAAC"}

package/lib/exercises/functions/exponential/expSimplifiying.js

@@ -0,0 +1,116 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.expSimplifiying = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+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 shuffle_1 = require("../../../utils/shuffle");
+const getExpSimplifiying = () => {
+    const random = (0, randint_1.randint)(1, 4);
+    let a;
+    let u, v;
+    let expression;
+    let answer;
+    switch (random) {
+        case 1:
+            //e^u*e^a / e^v
+            a = (0, randint_1.randint)(-9, 10, [0]);
+            u = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-9, 10, [0])]);
+            v = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            expression = new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new expNode_1.ExpNode(u.toTree()), new expNode_1.ExpNode(new numberNode_1.NumberNode(a))), new expNode_1.ExpNode(v.toTree()));
+            answer = new expNode_1.ExpNode(u.add(a).add(v.opposite()).toTree()).toTex();
+            break;
+        case 2:
+            //e^u * e^v
+            u = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            v = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            expression = new multiplyNode_1.MultiplyNode(new expNode_1.ExpNode(u.toTree()), new expNode_1.ExpNode(v.toTree()));
+            expression.shuffle();
+            answer = new expNode_1.ExpNode(u.add(v).toTree()).toTex();
+            break;
+        case 3:
+            //e^u / e^v
+            u = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            v = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            expression = new fractionNode_1.FractionNode(new expNode_1.ExpNode(u.toTree()), new expNode_1.ExpNode(v.toTree()));
+            answer = new expNode_1.ExpNode(u.add(v.opposite()).toTree()).toTex();
+            break;
+        default:
+            throw Error("something wrong happened");
+    }
+    const question = {
+        instruction: `Simplifier l'expression $${expression.toTex()}$.`,
+        answer,
+        keys: ["x", "epower", "exp"],
+        answerFormat: "tex",
+        identifiers: {
+            random,
+            a,
+            uCoeffs: u.coefficients,
+            vCoeffs: v.coefficients,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, random, a, uCoeffs, vCoeffs }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const u = new polynomial_1.Polynomial(uCoeffs);
+    const v = new polynomial_1.Polynomial(vCoeffs);
+    switch (random) {
+        case 1:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(u.times(a).add(v.opposite()).toTree()).toTex());
+            break;
+        case 2:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(u.multiply(v).toTree()).toTex());
+            break;
+        case 3:
+            (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(new fractionNode_1.FractionNode(u.toTree(), v.toTree())).toTex());
+            (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(u.add(v).toTree()).toTex());
+            break;
+        default:
+            throw Error("received wrong quesiton type");
+    }
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(polynomial_1.PolynomialConstructor.randomWithOrder(1).toTree()).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, random, uCoeffs, vCoeffs }) => {
+    const u = new polynomial_1.Polynomial(uCoeffs);
+    const v = new polynomial_1.Polynomial(vCoeffs);
+    let answer;
+    switch (random) {
+        case 1:
+            answer = new expNode_1.ExpNode(u.add(a).add(v.opposite()).toTree());
+            break;
+        case 2:
+            answer = new expNode_1.ExpNode(u.add(v).toTree());
+            break;
+        case 3:
+            answer = new expNode_1.ExpNode(u.add(v.opposite()).toTree());
+            break;
+        default:
+            throw Error("wrong random in exp simplifying");
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.expSimplifiying = {
+    id: "expSimplifiying",
+    connector: "\\iff",
+    label: "Simplifier des expressions avec l'exponentielle",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    sections: ["Exponentielle"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/exponential/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./expEquation";
+export * from "./expSimplifiying";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/exponential/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/exponential/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC"}

package/lib/exercises/functions/exponential/index.js

@@ -0,0 +1,18 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./expEquation"), exports);
+__exportStar(require("./expSimplifiying"), exports);

package/lib/exercises/functions/index.d.ts

@@ -4,4 +4,6 @@ export * from "./basics";
 export * from "./cube";
 export * from "./rationalFraction";
 export * from "./trinoms";
+export * from "./exponential";
+export * from "./logarithm";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/functions/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC;AACvB,cAAc,oBAAoB,CAAC;AACnC,cAAc,WAAW,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/functions/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC;AACvB,cAAc,oBAAoB,CAAC;AACnC,cAAc,WAAW,CAAC;AAC1B,cAAc,eAAe,CAAC;AAC9B,cAAc,aAAa,CAAC"}

package/lib/exercises/functions/index.js

@@ -20,3 +20,5 @@ __exportStar(require("./basics"), exports);
 __exportStar(require("./cube"), exports);
 __exportStar(require("./rationalFraction"), exports);
 __exportStar(require("./trinoms"), exports);
+__exportStar(require("./exponential"), exports);
+__exportStar(require("./logarithm"), exports);

package/lib/exercises/functions/logarithm/index.d.ts

@@ -0,0 +1,5 @@
+export * from "./logEquation";
+export * from "./logSimplifiying";
+export * from "./log10PowerSimplifying";
+export * from "./logPowerEquation";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/logarithm/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC;AAClC,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC"}

package/lib/exercises/functions/logarithm/index.js

@@ -0,0 +1,20 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./logEquation"), exports);
+__exportStar(require("./logSimplifiying"), exports);
+__exportStar(require("./log10PowerSimplifying"), exports);
+__exportStar(require("./logPowerEquation"), exports);

package/lib/exercises/functions/logarithm/log10PowerSimplifying.d.ts

@@ -0,0 +1,7 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    tenthPower: number;
+};
+export declare const log10PowerSimplifying: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=log10PowerSimplifying.d.ts.map

package/lib/exercises/functions/logarithm/log10PowerSimplifying.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"log10PowerSimplifying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/log10PowerSimplifying.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAqCF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAc3D,CAAC"}

package/lib/exercises/functions/logarithm/log10PowerSimplifying.js

@@ -0,0 +1,54 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.log10PowerSimplifying = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const decimal_1 = require("../../../math/numbers/decimals/decimal");
+const randint_1 = require("../../../math/utils/random/randint");
+const log10Node_1 = require("../../../tree/nodes/functions/log10Node");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
+const probaFlip_1 = require("../../../utils/probaFlip");
+const getLog10PowerSimplifyingQuestion = () => {
+    const tenthPower = (0, randint_1.randint)(-5, 6, [0, 1]);
+    const shouldEvaluate = (0, probaFlip_1.probaFlip)(0.7);
+    const nb = shouldEvaluate
+        ? new decimal_1.Decimal(1).multiplyByPowerOfTen(tenthPower).toTree()
+        : new powerNode_1.PowerNode(new numberNode_1.NumberNode(10), new numberNode_1.NumberNode(tenthPower));
+    const answer = tenthPower + "";
+    const question = {
+        answer,
+        instruction: `Calculer : $${new log10Node_1.Log10Node(nb).toTex()}$`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { tenthPower },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, tenthPower }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, "10");
+    (0, exercise_1.tryToAddWrongProp)(propositions, tenthPower + 1 + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, tenthPower + 2 + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, tenthPower - 1 + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, tenthPower - 2 + "");
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, tenthPower }) => {
+    return ans === answer;
+};
+exports.log10PowerSimplifying = {
+    id: "log10PowerSimplifying",
+    connector: "=",
+    label: "Calculer un logarithme décimal",
+    levels: ["TermTech", "MathComp"],
+    isSingleStep: true,
+    sections: ["Logarithme décimal", "Puissances"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLog10PowerSimplifyingQuestion, nb, 15),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    maxAllowedQuestions: 15,
+};

package/lib/exercises/functions/logarithm/logEquation.d.ts

@@ -0,0 +1,9 @@
+import { MathExercise } from "../../../exercises/exercise";
+/**aln(x)=k */
+type Identifiers = {
+    a: number;
+    k: number;
+};
+export declare const logEquation: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=logEquation.d.ts.map

package/lib/exercises/functions/logarithm/logEquation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/logEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAclC,cAAc;AACd,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqEF,eAAO,MAAM,WAAW,EAAE,YAAY,CAAC,WAAW,CAYjD,CAAC"}

package/lib/exercises/functions/logarithm/logEquation.js

@@ -0,0 +1,74 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.logEquation = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+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/equations/equalNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const 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(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 equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new expNode_1.ExpNode(new rational_1.Rational(k, a).simplify().toTree())])).toTex();
+    const question = {
+        instruction: `Résoudre l'équation $${equation.toTex()}$.`,
+        answer,
+        keys: [
+            "x",
+            "equal",
+            "ln",
+            "e",
+            "epower",
+            "exp",
+            "lbrace",
+            "S",
+            "semicolon",
+            "rbrace",
+        ],
+        answerFormat: "tex",
+        identifiers: { a, k },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const randomA = (0, randint_1.randint)(1, 10);
+        const randomK = (0, randint_1.randint)(1, 20);
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+            new expNode_1.ExpNode(new rational_1.Rational(randomK, randomA).simplify().toTree()),
+        ])).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, k }) => {
+    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+        new expNode_1.ExpNode(new rational_1.Rational(k, a).simplify().toTree({ allowFractionToDecimal: true })),
+    ]));
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.logEquation = {
+    id: "logEquation",
+    connector: "=",
+    label: "Résoudre des équations de type $a \\times \\ln(x) = k$",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    sections: ["Logarithme népérien", "Exponentielle"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLnEquation, nb),
+    getPropositions,
+    qcmTimer: 60,
+    freeTimer: 60,
+    isAnswerValid,
+};

package/lib/exercises/functions/logarithm/logPowerEquation.d.ts

@@ -0,0 +1,12 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    powered: number;
+    c: number;
+    k: number;
+    isLog10: boolean;
+};
+export declare const logPowerEquation: MathExercise<Identifiers>;
+export declare const log10PowerEquation: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=logPowerEquation.d.ts.map

package/lib/exercises/functions/logarithm/logPowerEquation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logPowerEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/logPowerEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAgBlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,MAAM,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AAwGF,eAAO,MAAM,gBAAgB,EAAE,YAAY,CAAC,WAAW,CAatD,CAAC;AACF,eAAO,MAAM,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAgBxD,CAAC"}

package/lib/exercises/functions/logarithm/logPowerEquation.js

@@ -0,0 +1,103 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.log10PowerEquation = exports.logPowerEquation = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const log10Node_1 = require("../../../tree/nodes/functions/log10Node");
+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 fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+/**a*b^x+c=d */
+const getLogPowerEquationQuestion = (opts) => {
+    const powered = (0, randint_1.randint)(2, 8);
+    const a = (0, randint_1.randint)(1, 10, [powered]);
+    const c = (0, randint_1.randint)(-5, 5, [a]);
+    const k = (0, randint_1.randint)(5, 15, [powered]);
+    const d = k * a + c;
+    const xNode = new variableNode_1.VariableNode("x");
+    const poweredNode = new numberNode_1.NumberNode(powered);
+    const LNode = opts?.isLog10 ? log10Node_1.Log10Node : logNode_1.LogNode;
+    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+        new fractionNode_1.FractionNode(new LNode(new numberNode_1.NumberNode(k)), new LNode(poweredNode)).simplify(),
+    ])).toTex();
+    const equation = new equalNode_1.EqualNode(new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new powerNode_1.PowerNode(poweredNode, xNode)), new numberNode_1.NumberNode(c)).simplify(), new numberNode_1.NumberNode(d));
+    const keys = [
+        "log",
+        "x",
+        "equal",
+        "S",
+        "lbrace",
+        "semicolon",
+        "rbrace",
+    ];
+    keys.push(opts?.isLog10 ? "log" : "ln");
+    const question = {
+        answer,
+        instruction: `Résoudre : $${equation.toTex()}$`,
+        keys,
+        answerFormat: "tex",
+        identifiers: { a, c, k, powered, isLog10: opts?.isLog10 ?? false },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, isLog10, a, c, k, powered }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const LNode = isLog10 ? log10Node_1.Log10Node : logNode_1.LogNode;
+    const withoutLogs = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+        new fractionNode_1.FractionNode(new numberNode_1.NumberNode(k), new numberNode_1.NumberNode(powered)).simplify(),
+    ]));
+    (0, exercise_1.tryToAddWrongProp)(propositions, withoutLogs.toTex());
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+            new fractionNode_1.FractionNode(new LNode(new numberNode_1.NumberNode((0, randint_1.randint)(2, 10))), new LNode(new numberNode_1.NumberNode((0, randint_1.randint)(2, 10)))).simplify(),
+        ])).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { a, c, k, powered, isLog10 }) => {
+    const LNode = isLog10 ? log10Node_1.Log10Node : logNode_1.LogNode;
+    const poweredNode = new numberNode_1.NumberNode(powered);
+    const answerSimp = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+        new fractionNode_1.FractionNode(new LNode(new numberNode_1.NumberNode(k)), new LNode(poweredNode)).simplify(),
+    ]));
+    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
+        new fractionNode_1.FractionNode(new LNode(new numberNode_1.NumberNode(k)), new LNode(poweredNode)),
+    ]));
+    const texs = [...answerSimp.toAllValidTexs(), ...answer.toAllValidTexs()];
+    return texs.includes(ans);
+};
+exports.logPowerEquation = {
+    id: "logPowerEquation",
+    connector: "\\iff",
+    label: "Résoudre une équation du type $a\\times b^x + c = d$",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Logarithme népérien", "Puissances"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLogPowerEquationQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};
+exports.log10PowerEquation = {
+    id: "log10PowerEquation",
+    connector: "\\iff",
+    label: "Résoudre une équation du type $a\\times b^x + c = d$",
+    levels: ["TermSpé", "MathComp"],
+    isSingleStep: true,
+    sections: ["Logarithme décimal", "Puissances"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(() => getLogPowerEquationQuestion({ isLog10: true }), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/logarithm/logSimplifiying.d.ts

@@ -0,0 +1,9 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    pm: number;
+    a: number;
+    b: number;
+};
+export declare const logSimplifiying: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=logSimplifiying.d.ts.map

package/lib/exercises/functions/logarithm/logSimplifiying.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logSimplifiying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/logSimplifiying.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqEF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAYrD,CAAC"}

package/lib/exercises/functions/logarithm/logSimplifiying.js

@@ -0,0 +1,77 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.logSimplifiying = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+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 coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getExpSimplifiying = () => {
+    let expression;
+    let simplifiedExpression;
+    let pm = (0, coinFlip_1.coinFlip)() ? 1 : -1;
+    const a = (0, randint_1.randint)(1, 10);
+    let b;
+    do {
+        b = (0, randint_1.randint)(1, 10);
+    } while (pm === -1 && a === b);
+    const opts = { allowLnOfOne: true };
+    if (pm === 1) {
+        expression = new addNode_1.AddNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a), opts), new logNode_1.LogNode(new numberNode_1.NumberNode(b), opts));
+        simplifiedExpression = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
+    }
+    else {
+        expression = new substractNode_1.SubstractNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a), opts), new logNode_1.LogNode(new numberNode_1.NumberNode(b), opts));
+        simplifiedExpression = new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree());
+    }
+    const answer = simplifiedExpression.toTex();
+    const question = {
+        instruction: `Simplifier l'expression suivante : $${expression.toTex()}$.`,
+        answer,
+        keys: ["ln"],
+        answerFormat: "tex",
+        identifiers: { pm, a, b },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, pm }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const a = (0, randint_1.randint)(1, 10);
+        const b = (0, randint_1.randint)(1, 10);
+        (0, exercise_1.tryToAddWrongProp)(propositions, pm > 0
+            ? new logNode_1.LogNode(new numberNode_1.NumberNode(a * b)).toTex()
+            : new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree()).toTex());
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { a, b, pm }) => {
+    let answer;
+    if (pm === 1) {
+        answer = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
+    }
+    else {
+        answer = new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree({ allowFractionToDecimal: true }));
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.logSimplifiying = {
+    id: "logSimplifiying",
+    connector: "\\iff",
+    label: "Simplifier des expressions avec $\\ln$",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    sections: ["Logarithme népérien"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/sets/intervals/inequalityToInterval.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"inequalityToInterval.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sets/intervals/inequalityToInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAkBlC,KAAK,WAAW,GAAG;IACjB,sBAAsB,EAAE,OAAO,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC;AAmKF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,WAAW,CAa1D,CAAC"}
+{"version":3,"file":"inequalityToInterval.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sets/intervals/inequalityToInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,sBAAsB,EAAE,OAAO,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC;AAmKF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,WAAW,CAa1D,CAAC"}

package/lib/exercises/trigonometry/associatePoint.d.ts

@@ -0,0 +1,7 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    angleValue: number;
+};
+export declare const associatePoint: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=associatePoint.d.ts.map

package/lib/exercises/trigonometry/associatePoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"associatePoint.d.ts","sourceRoot":"","sources":["../../../src/exercises/trigonometry/associatePoint.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,WAAW,GAAG;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAqDF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAapD,CAAC"}