math-exercises 2.0.5 → 2.0.7

package/lib/exercises/calculLitteral/equation/index.d.ts

@@ -3,9 +3,7 @@ export * from "./equationType1Exercise";
 export * from "./equationType2Exercise";
 export * from "./equationType3Exercise";
 export * from "./equationType4Exercise";
-export * from "./expEquation";
 export * from "./firstDegreeEquation";
 export * from "./fractionEquation";
-export * from "./logEquation";
 export * from "./multiplicationEquation";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,yBAAyB,CAAC;AACxC,cAAc,yBAAyB,CAAC;AACxC,cAAc,yBAAyB,CAAC;AACxC,cAAc,yBAAyB,CAAC;AACxC,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,oBAAoB,CAAC;AACnC,cAAc,eAAe,CAAC;AAC9B,cAAc,0BAA0B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,yBAAyB,CAAC;AACxC,cAAc,yBAAyB,CAAC;AACxC,cAAc,yBAAyB,CAAC;AACxC,cAAc,yBAAyB,CAAC;AACxC,cAAc,uBAAuB,CAAC;AACtC,cAAc,oBAAoB,CAAC;AACnC,cAAc,0BAA0B,CAAC"}

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

@@ -19,8 +19,6 @@ __exportStar(require("./equationType1Exercise"), exports);
 __exportStar(require("./equationType2Exercise"), exports);
 __exportStar(require("./equationType3Exercise"), exports);
 __exportStar(require("./equationType4Exercise"), exports);
-__exportStar(require("./expEquation"), exports);
 __exportStar(require("./firstDegreeEquation"), exports);
 __exportStar(require("./fractionEquation"), exports);
-__exportStar(require("./logEquation"), exports);
 __exportStar(require("./multiplicationEquation"), exports);

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

@@ -1,5 +1,3 @@
 export * from "./evaluateExpression";
-export * from "./expSimplifiying";
-export * from "./logSimplifiying";
 export * from "./reduceExpression";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC"}

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

@@ -15,6 +15,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./evaluateExpression"), exports);
-__exportStar(require("./expSimplifiying"), exports);
-__exportStar(require("./logSimplifiying"), exports);
 __exportStar(require("./reduceExpression"), exports);

package/lib/exercises/exercise.d.ts

@@ -47,5 +47,5 @@ export interface MathExercise<TIdentifiers = {}> {
     isAnswerValid?: VEA<TIdentifiers>;
 }
 export type MathLevel = "6ème" | "5ème" | "4ème" | "3ème" | "2nde" | "1reTech" | "1reESM" | "1reSpé" | "TermSpé" | "TermTech" | "MathExp" | "MathComp" | "CAP" | "2ndPro" | "1rePro" | "TermPro";
-export type MathSection = "Aires" | "Arithmétique" | "Calcul littéral" | "Calculs" | "Combinatoire et dénombrement" | "Conversions" | "Dérivation" | "Droites" | "Ensembles et intervalles" | "Équations" | "Équations différentielles" | "Exponentielle" | "Fonction cube" | "Fonction inverse" | "Fonctions" | "Fonctions affines" | "Fonctions de référence" | "Fractions" | "Géométrie cartésienne" | "Géométrie euclidienne" | "Inéquations" | "Intégration" | "Limites" | "Logarithme népérien" | "Nombres complexes" | "Périmètres" | "Pourcentages" | "Primitives" | "Probabilités" | "Proportionnalité" | "Puissances" | "Racines carrées" | "Second degré" | "Statistiques" | "Suites" | "Théorème de Pythagore" | "Théorème de Thalès" | "Trigonométrie" | "Valeur absolue" | "Vecteurs";
+export type MathSection = "Aires" | "Arithmétique" | "Calcul littéral" | "Calculs" | "Combinatoire et dénombrement" | "Conversions" | "Dérivation" | "Droites" | "Ensembles et intervalles" | "Équations" | "Équations différentielles" | "Exponentielle" | "Fonction cube" | "Fonction inverse" | "Fonctions" | "Fonctions affines" | "Fonctions de référence" | "Fractions" | "Géométrie cartésienne" | "Géométrie euclidienne" | "Inéquations" | "Intégration" | "Limites" | "Logarithme népérien" | "Logarithme décimal" | "Nombres complexes" | "Périmètres" | "Pourcentages" | "Primitives" | "Probabilités" | "Proportionnalité" | "Puissances" | "Racines carrées" | "Second degré" | "Statistiques" | "Suites" | "Théorème de Pythagore" | "Théorème de Thalès" | "Trigonométrie" | "Valeur absolue" | "Vecteurs";
 //# sourceMappingURL=exercise.d.ts.map

package/lib/exercises/exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,iBAAiB,UACrB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAUtB,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ,CAAC,YAAY,GAAG,EAAE;IACzC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE,GAAG,CAAC;IACd,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,WAAW,EAAE,YAAY,CAAC;CAC3B;AAED,MAAM,MAAM,YAAY,CAAC,YAAY,IAAI,CACvC,CAAC,EAAE,MAAM,EACT,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,WAAW,EAAE,CAAC;AACnB,MAAM,MAAM,GAAG,CAAC,YAAY,IAAI,CAC9B,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,OAAO,CAAC;AACb,MAAM,MAAM,iBAAiB,CAAC,YAAY,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,IAAI,CAChE,IAAI,CAAC,EAAE,QAAQ,KACZ,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC5B,MAAM,WAAW,YAAY,CAAC,YAAY,GAAG,EAAE;IAC7C,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,YAAY,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC;IAClE,aAAa,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;CACnC;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,8BAA8B,GAC9B,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,mBAAmB,GACnB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,uBAAuB,GACvB,oBAAoB,GACpB,eAAe,GACf,gBAAgB,GAChB,UAAU,CAAC"}
+{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,iBAAiB,UACrB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAUtB,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ,CAAC,YAAY,GAAG,EAAE;IACzC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE,GAAG,CAAC;IACd,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,WAAW,EAAE,YAAY,CAAC;CAC3B;AAED,MAAM,MAAM,YAAY,CAAC,YAAY,IAAI,CACvC,CAAC,EAAE,MAAM,EACT,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,WAAW,EAAE,CAAC;AACnB,MAAM,MAAM,GAAG,CAAC,YAAY,IAAI,CAC9B,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,OAAO,CAAC;AACb,MAAM,MAAM,iBAAiB,CAAC,YAAY,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,IAAI,CAChE,IAAI,CAAC,EAAE,QAAQ,KACZ,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC5B,MAAM,WAAW,YAAY,CAAC,YAAY,GAAG,EAAE;IAC7C,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,YAAY,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC;IAClE,aAAa,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;CACnC;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,8BAA8B,GAC9B,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,oBAAoB,GACpB,mBAAmB,GACnB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,uBAAuB,GACvB,oBAAoB,GACpB,eAAe,GACf,gBAAgB,GAChB,UAAU,CAAC"}

package/lib/exercises/functions/basics/graphicEquation.d.ts

@@ -0,0 +1,8 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    yValue: number;
+    splinePoints: [number, number][];
+};
+export declare const graphicEquation: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=graphicEquation.d.ts.map

package/lib/exercises/functions/basics/graphicEquation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphicEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/graphicEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;CAClC,CAAC;AAiGF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAarD,CAAC"}

package/lib/exercises/functions/basics/graphicEquation.js

@@ -0,0 +1,109 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.graphicEquation = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const getGraphicEquationQuestion = () => {
+    let xSolutions = [];
+    const nb = (0, randint_1.randint)(2, 4);
+    // const nb = 2;
+    for (let i = 0; i < nb; i++) {
+        xSolutions.push((0, randint_1.randint)(-9, 10, xSolutions));
+    }
+    xSolutions.sort((a, b) => a - b);
+    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(xSolutions.map((sol) => new numberNode_1.NumberNode(sol)))).toTex();
+    const yValue = (0, randint_1.randint)(-5, 6);
+    const splinePoints = [];
+    let prevYWasAbove = (0, coinFlip_1.coinFlip)();
+    if ((0, coinFlip_1.coinFlip)()) {
+        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+        prevYWasAbove = y > 0;
+        splinePoints.push([xSolutions[0] - (1 + Math.random() * 3), yValue + y]);
+    }
+    for (let i = 0; i < xSolutions.length; i++) {
+        splinePoints.push([xSolutions[i], yValue]);
+        if (i < xSolutions.length - 1) {
+            const mid = (xSolutions[i] + xSolutions[i + 1]) / 2;
+            const distance = xSolutions[i + 1] - xSolutions[i];
+            const x = mid + ((Math.random() * 2) / 5) * (distance / 2);
+            const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+            prevYWasAbove = y > 0;
+            splinePoints.push([x, yValue + y]);
+        }
+    }
+    if ((0, coinFlip_1.coinFlip)() || splinePoints.length < 4) {
+        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+        prevYWasAbove = y > 0;
+        splinePoints.push([
+            xSolutions[xSolutions.length - 1] + (1 + Math.random() * 3),
+            yValue + y,
+        ]);
+    }
+    const xMin = Math.min(...splinePoints.map((point) => point[0]));
+    const yMin = Math.min(...splinePoints.map((point) => point[1]));
+    const xMax = Math.max(...splinePoints.map((point) => point[0]));
+    const yMax = Math.max(...splinePoints.map((point) => point[1]));
+    const question = {
+        answer,
+        instruction: `Déterminer graphiquement les solutions de l'équation $f(x) = ${yValue}$ où $f$ est la fonction représentée ci-dessous.`,
+        keys: equationKeys_1.equationKeys,
+        answerFormat: "tex",
+        commands: [
+            `Spline(${splinePoints
+                .map((point) => `(${point[0]},${point[1]})`)
+                .join(",")})`,
+            ...splinePoints.map((point) => `(${point[0]},${point[1]})`),
+        ],
+        coords: [
+            Math.min(xMin - 1, -1),
+            Math.max(xMax + 1, 1),
+            Math.min(yMin - 1, -1),
+            Math.max(yMax + 1, 1),
+        ],
+        identifiers: { yValue, splinePoints },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\emptyset`);
+    while (propositions.length < n) {
+        const nbs = [];
+        const nbSol = (0, randint_1.randint)(2, 4);
+        for (let i = 0; i < nbSol; i++) {
+            nbs.push((0, randint_1.randint)(-9, 10, nbs));
+        }
+        nbs.sort((a, b) => a - b);
+        const sol = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(nbs.map((nb) => new numberNode_1.NumberNode(nb))));
+        (0, exercise_1.tryToAddWrongProp)(propositions, sol.toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { yValue, splinePoints }) => {
+    const xSolutions = splinePoints
+        .filter((p) => p[1] === yValue)
+        .map((p) => p[0]);
+    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode(xSolutions.map((sol) => new numberNode_1.NumberNode(sol))));
+    const texs = answerTree.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.graphicEquation = {
+    id: "graphicEquation",
+    connector: "\\iff",
+    label: "Résoudre graphiquement une équation",
+    levels: ["2ndPro", "2nde", "1rePro", "1reESM", "1reTech"],
+    isSingleStep: true,
+    sections: ["Équations", "Fonctions"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getGraphicEquationQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/basics/graphicInequation.d.ts

@@ -0,0 +1,16 @@
+import { MathExercise } from "../../../exercises/exercise";
+import { ClosureType } from "../../../tree/nodes/sets/intervalNode";
+type Identifiers = {
+    yValue: number;
+    splinePoints: [number, number][];
+    isStrict: boolean;
+    isAskingSup: boolean;
+    intervals: {
+        a: number;
+        b: number;
+        closure: ClosureType;
+    }[];
+};
+export declare const graphicInequation: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=graphicInequation.d.ts.map

package/lib/exercises/functions/basics/graphicInequation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphicInequation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/graphicInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAOlC,OAAO,EAAE,WAAW,EAAgB,MAAM,oCAAoC,CAAC;AAI/E,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;IACjC,QAAQ,EAAE,OAAO,CAAC;IAClB,WAAW,EAAE,OAAO,CAAC;IACrB,SAAS,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,WAAW,CAAA;KAAE,EAAE,CAAC;CAC7D,CAAC;AA6JF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAavD,CAAC"}

package/lib/exercises/functions/basics/graphicInequation.js

@@ -0,0 +1,147 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.graphicInequation = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
+const unionIntervalNode_1 = require("../../../tree/nodes/sets/unionIntervalNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const getGraphicInequationQuestion = () => {
+    let xSolutions = [];
+    const nb = (0, randint_1.randint)(2, 4);
+    for (let i = 0; i < nb; i++) {
+        xSolutions.push((0, randint_1.randint)(-9, 10, xSolutions));
+    }
+    xSolutions.sort((a, b) => a - b);
+    const isAskingSup = (0, coinFlip_1.coinFlip)();
+    const isStrict = (0, coinFlip_1.coinFlip)();
+    const intervals = [];
+    const yValue = (0, randint_1.randint)(-5, 6);
+    const splinePoints = [];
+    let prevYWasAbove = (0, coinFlip_1.coinFlip)();
+    if (!isStrict || (0, coinFlip_1.coinFlip)()) {
+        //le !isStrict sert à empcher les points uniques solution
+        const x = xSolutions[0] - (0, randint_1.randint)(1, 3);
+        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+        if ((y > 0 && isAskingSup) || (y < 0 && !isAskingSup)) {
+            intervals.push({
+                a: x,
+                b: xSolutions[0],
+                closure: isStrict ? intervalNode_1.ClosureType.FO : intervalNode_1.ClosureType.FF,
+            });
+        }
+        prevYWasAbove = y > 0;
+        splinePoints.push([x, yValue + y]);
+    }
+    for (let i = 0; i < xSolutions.length; i++) {
+        splinePoints.push([xSolutions[i], yValue]);
+        if (i < xSolutions.length - 1) {
+            const mid = (xSolutions[i] + xSolutions[i + 1]) / 2;
+            const distance = xSolutions[i + 1] - xSolutions[i];
+            const x = mid + ((Math.random() * 2) / 5) * (distance / 2);
+            const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+            if ((y > 0 && isAskingSup) || (y < 0 && !isAskingSup)) {
+                intervals.push({
+                    a: xSolutions[i],
+                    b: xSolutions[i + 1],
+                    closure: isStrict ? intervalNode_1.ClosureType.OO : intervalNode_1.ClosureType.FF,
+                });
+            }
+            prevYWasAbove = y > 0;
+            splinePoints.push([x, yValue + y]);
+        }
+    }
+    if (!isStrict || (0, coinFlip_1.coinFlip)() || splinePoints.length < 4) {
+        const x = xSolutions[xSolutions.length - 1] + (0, randint_1.randint)(1, 3);
+        const y = prevYWasAbove ? (0, randint_1.randint)(-2, 0) : (0, randint_1.randint)(1, 3);
+        if ((y > 0 && isAskingSup) || (y < 0 && !isAskingSup)) {
+            intervals.push({
+                a: xSolutions[xSolutions.length - 1],
+                b: x,
+                closure: isStrict ? intervalNode_1.ClosureType.OF : intervalNode_1.ClosureType.FF,
+            });
+        }
+        prevYWasAbove = y > 0;
+        splinePoints.push([x, yValue + y]);
+    }
+    const xMin = Math.min(...splinePoints.map((point) => point[0]));
+    const yMin = Math.min(...splinePoints.map((point) => point[1]));
+    const xMax = Math.max(...splinePoints.map((point) => point[0]));
+    const yMax = Math.max(...splinePoints.map((point) => point[1]));
+    const intervalsNodes = intervals.map((i) => new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(i.a), new numberNode_1.NumberNode(i.b), i.closure));
+    const answer = intervalsNodes.length === 1
+        ? `S=${intervalsNodes[0].toTex()}`
+        : `S=${new unionIntervalNode_1.UnionIntervalNode(intervalsNodes).toTex()}`;
+    const question = {
+        answer,
+        instruction: `Déterminer graphiquement les solutions de l'inéquation $f(x)${isAskingSup ? (isStrict ? ">" : "\\geq") : isStrict ? "<" : "\\leq"}${yValue}$ où $f$ est la fonction représentée ci-dessous.`,
+        keys: [
+            "S",
+            "equal",
+            "lbracket",
+            "semicolon",
+            "rbracket",
+            "cup",
+            "lbrace",
+            "rbrace",
+        ],
+        answerFormat: "tex",
+        commands: [
+            `Spline(${splinePoints
+                .map((point) => `(${point[0]},${point[1]})`)
+                .join(",")})`,
+            ...splinePoints.map((point) => `(${point[0]},${point[1]})`),
+        ],
+        coords: [
+            Math.min(xMin - 1, -1),
+            Math.max(xMax + 1, 1),
+            Math.min(yMin - 1, -1),
+            Math.max(yMax + 1, 1),
+        ],
+        identifiers: {
+            yValue,
+            splinePoints,
+            isAskingSup,
+            isStrict,
+            intervals,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, intervals, splinePoints, yValue }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\emptyset`);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=${new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(splinePoints[0][0]), new numberNode_1.NumberNode(yValue), intervalNode_1.ClosureType.FF).toTex()}`);
+    while (propositions.length < n) {
+        const a = (0, randint_1.randint)(-9, 3);
+        const b = (0, randint_1.randint)(3, 10, [a]);
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=${new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b), intervalNode_1.ClosureType.FF).toTex()}`);
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { intervals }) => {
+    const intervalsNodes = intervals.map((n) => new intervalNode_1.IntervalNode(new numberNode_1.NumberNode(n.a), new numberNode_1.NumberNode(n.b), n.closure));
+    const intervalsTree = intervalsNodes.length === 1
+        ? intervalsNodes[0]
+        : new unionIntervalNode_1.UnionIntervalNode(intervalsNodes);
+    const answerTree = new inequationSolutionNode_1.InequationSolutionNode(intervalsTree);
+    const texs = answerTree.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.graphicInequation = {
+    id: "graphicInequation",
+    connector: "\\iff",
+    label: "Résoudre graphiquement une inéquation",
+    levels: ["2ndPro", "2nde", "1rePro", "1reESM", "1reTech"],
+    isSingleStep: true,
+    sections: ["Inéquations", "Fonctions"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getGraphicInequationQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -2,4 +2,6 @@ export * from "./imageFunction";
 export * from "./imageFunctionGeogebra";
 export * from "./inverseImageFunction";
 export * from "./inverseImageFunctionGeogebra";
+export * from "./graphicEquation";
+export * from "./graphicInequation";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AACxC,cAAc,wBAAwB,CAAC;AACvC,cAAc,gCAAgC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AACxC,cAAc,wBAAwB,CAAC;AACvC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC"}

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

@@ -18,3 +18,5 @@ __exportStar(require("./imageFunction"), exports);
 __exportStar(require("./imageFunctionGeogebra"), exports);
 __exportStar(require("./inverseImageFunction"), exports);
 __exportStar(require("./inverseImageFunctionGeogebra"), exports);
+__exportStar(require("./graphicEquation"), exports);
+__exportStar(require("./graphicInequation"), exports);

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

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

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

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

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

@@ -0,0 +1,75 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.expEquation = 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 getExpEquation = () => {
+    const a = (0, randint_1.randint)(-9, 20, [0]);
+    const k = a > 0 ? (0, randint_1.randint)(1, 20) : (0, randint_1.randint)(-20, 0);
+    const equation = new equalNode_1.EqualNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new variableNode_1.VariableNode("x"))), new numberNode_1.NumberNode(k));
+    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new logNode_1.LogNode(new rational_1.Rational(k, a).simplify().toTree())])).toTex();
+    const question = {
+        instruction: `Résoudre l'équation $${equation.toTex()}$.`,
+        answer: answer,
+        keys: [
+            "x",
+            "equal",
+            "epower",
+            "exp",
+            "ln",
+            "S",
+            "lbrace",
+            "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 logNode_1.LogNode(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 logNode_1.LogNode(new rational_1.Rational(k, a)
+            .simplify()
+            .toTree({ allowFractionToDecimal: true })),
+    ], { allowRawRightChildAsSolution: true }));
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.expEquation = {
+    id: "expEquation",
+    connector: "=",
+    label: "Résoudre des équations de type $a \\times \\exp(x) = k$",
+    levels: ["1reSpé", "TermSpé", "MathComp"],
+    sections: ["Exponentielle"],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpEquation, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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