math-exercises 1.3.41 → 1.3.43

package/lib/exercises/sequences/arithmetic/arithmeticThresholdFind.js

@@ -37,6 +37,7 @@ function getArithmeticThresholdFind() {
             id: (0, uuid_1.v4)() + '',
             statement: (Math.floor((randValue - firstValue) / reason) + 1).toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -46,6 +47,7 @@ function getArithmeticThresholdFind() {
                     id: (0, uuid_1.v4)() + '',
                     statement: (Math.floor((randValue - firstValue) / reason) + (0, randint_1.randint)(-5, 6, [1])).toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -59,6 +61,7 @@ function getArithmeticThresholdFind() {
         answer: (Math.floor((randValue - firstValue) / reason) + 1).toString(),
         keys: ['r', 'n', 'u', 'underscore', 'inf', 'sup', 'approx'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/geometric/geometricExplicitFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"geometricExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/geometric/geometricExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,6BAA6B,EAAE,QAU3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAgD3D"}
+{"version":3,"file":"geometricExplicitFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/geometric/geometricExplicitFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,6BAA6B,EAAE,QAU3C,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAmD3D"}

package/lib/exercises/sequences/geometric/geometricExplicitFormulaUsage.js

@@ -33,6 +33,7 @@ function getGeometricExplicitFormulaUsage() {
             id: (0, uuid_1.v4)() + '',
             statement: (firstValue * Math.pow(reason, askedRank)).toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -42,6 +43,7 @@ function getGeometricExplicitFormulaUsage() {
                     id: (0, uuid_1.v4)() + '',
                     statement: (firstValue * Math.pow(reason, (0, randint_1.randint)(0, 9, [askedRank]))).toString(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -55,6 +57,7 @@ function getGeometricExplicitFormulaUsage() {
         answer: (firstValue * Math.pow(reason, askedRank)).toString(),
         keys: ['n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/geometric/geometricFindExplicitFormula.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"geometricFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/geometric/geometricFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,4BAA4B,EAAE,QAU1C,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CA2D1D"}
+{"version":3,"file":"geometricFindExplicitFormula.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/geometric/geometricFindExplicitFormula.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,4BAA4B,EAAE,QAU1C,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CA+D1D"}

package/lib/exercises/sequences/geometric/geometricFindExplicitFormula.js

@@ -32,11 +32,13 @@ function getGeometricFindExplicitFormula() {
             id: (0, uuid_1.v4)() + '',
             statement: (0, simplify_1.simplifyNode)(formula).toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         res.push({
             id: (0, uuid_1.v4)() + '',
             statement: (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(reason), new powerNode_1.PowerNode(new numberNode_1.NumberNode(firstValue), new variableNode_1.VariableNode('n')))).toTex(),
             isRightAnswer: false,
+            format: 'tex',
         });
         for (let i = 0; i < n - 2; i++) {
             let isDuplicate;
@@ -47,6 +49,7 @@ function getGeometricFindExplicitFormula() {
                     id: (0, uuid_1.v4)() + '',
                     statement: (0, simplify_1.simplifyNode)(wrongAnswer).toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -60,6 +63,7 @@ function getGeometricFindExplicitFormula() {
         answer: (0, simplify_1.simplifyNode)(formula).toTex(),
         keys: ['q', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/geometric/geometricFindReason.d.ts.map

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

package/lib/exercises/sequences/geometric/geometricFindReason.js

@@ -28,12 +28,14 @@ function getGeometricFindReason() {
             id: (0, uuid_1.v4)() + '',
             statement: reason + '',
             isRightAnswer: true,
+            format: 'tex',
         });
         if (value2 - value1 !== 2)
             res.push({
                 id: (0, uuid_1.v4)() + '',
                 statement: value2 - value1 + '',
                 isRightAnswer: false,
+                format: 'tex',
             });
         for (let i = 0; i < (value2 - value1 === 2 ? n - 1 : n - 2); i++) {
             let isDuplicate;
@@ -43,6 +45,7 @@ function getGeometricFindReason() {
                     id: (0, uuid_1.v4)() + '',
                     statement: reason + (0, randint_1.randint)(1, 10) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -56,6 +59,7 @@ function getGeometricFindReason() {
         answer: reason.toString(),
         keys: ['q', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/geometric/geometricReasonUsage.d.ts.map

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

package/lib/exercises/sequences/geometric/geometricReasonUsage.js

@@ -27,12 +27,14 @@ function getGeometricReasonUsage() {
             id: (0, uuid_1.v4)() + '',
             statement: (startValue * reason).toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         if (startValue + reason !== 4)
             res.push({
                 id: (0, uuid_1.v4)() + '',
                 statement: (startValue + reason).toString(),
                 isRightAnswer: false,
+                format: 'tex',
             });
         for (let i = 0; i < (startValue + reason === 4 ? n - 1 : n - 2); i++) {
             let isDuplicate;
@@ -42,6 +44,7 @@ function getGeometricReasonUsage() {
                     id: (0, uuid_1.v4)() + '',
                     statement: startValue * (reason + (0, randint_1.randint)(-reason + 1, 6, [0])) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -55,6 +58,7 @@ function getGeometricReasonUsage() {
         answer: (startValue * reason).toString(),
         keys: ['q', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/sequences/geometric/geometricRecurrenceFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"geometricRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/geometric/geometricRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM7F,UAAU,sCAAuC,SAAQ,gBAAgB;IACvE,IAAI,EAAE,OAAO,CAAC;CACf;AAED,eAAO,MAAM,+BAA+B,EAAE,QAY7C,CAAC;AAEF,wBAAgB,kCAAkC,CAAC,OAAO,EAAE,sCAAsC,GAAG,QAAQ,CAkD5G"}
+{"version":3,"file":"geometricRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/sequences/geometric/geometricRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM7F,UAAU,sCAAuC,SAAQ,gBAAgB;IACvE,IAAI,EAAE,OAAO,CAAC;CACf;AAED,eAAO,MAAM,+BAA+B,EAAE,QAY7C,CAAC;AAEF,wBAAgB,kCAAkC,CAAC,OAAO,EAAE,sCAAsC,GAAG,QAAQ,CAsD5G"}

package/lib/exercises/sequences/geometric/geometricRecurrenceFormulaUsage.js

@@ -27,12 +27,14 @@ function getGeometricRecurrenceFormulaUsage(options) {
             id: (0, uuid_1.v4)() + '',
             statement: (firstValue * reason).toString(),
             isRightAnswer: true,
+            format: 'tex',
         });
         if (firstValue + reason !== 4)
             res.push({
                 id: (0, uuid_1.v4)() + '',
                 statement: (firstValue + reason).toString(),
                 isRightAnswer: false,
+                format: 'tex',
             });
         for (let i = 0; i < (firstValue + reason === 4 ? n - 1 : n - 2); i++) {
             let isDuplicate;
@@ -42,6 +44,7 @@ function getGeometricRecurrenceFormulaUsage(options) {
                     id: (0, uuid_1.v4)() + '',
                     statement: firstValue * (reason + (0, randint_1.randint)(-reason + 1, 6, [0])) + '',
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -55,6 +58,7 @@ function getGeometricRecurrenceFormulaUsage(options) {
         answer: (firstValue * reason).toString(),
         keys: ['q', 'n', 'u', 'underscore'],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/exercises/squareRoots/simpifySquareRoot.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"simpifySquareRoot.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/simpifySquareRoot.ts"],"names":[],"mappings":"AAEA,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":"simpifySquareRoot.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/simpifySquareRoot.ts"],"names":[],"mappings":"AAEA,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/squareRoots/simpifySquareRoot.js

@@ -27,6 +27,7 @@ function getSimplifySquareRoot() {
             id: (0, uuid_1.v4)() + '',
             statement: squareRoot.simplify().toTree().toTex(),
             isRightAnswer: true,
+            format: 'tex',
         });
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
@@ -40,6 +41,7 @@ function getSimplifySquareRoot() {
                     id: (0, uuid_1.v4)() + '',
                     statement: squareRoot.simplify().toTree().toTex(),
                     isRightAnswer: false,
+                    format: 'tex',
                 };
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
@@ -52,6 +54,7 @@ function getSimplifySquareRoot() {
         answer: squareRoot.simplify().toTree().toTex(),
         keys: [],
         getPropositions,
+        answerFormat: 'tex',
     };
     return question;
 }

package/lib/index.d.ts

@@ -1,3 +1,3 @@
-declare const allExercises: import("./exercises/exercise").Exercise[];
-export { allExercises };
+declare const allMathExercises: import("./exercises/exercise").Exercise[];
+export { allMathExercises };
 //# sourceMappingURL=index.d.ts.map

package/lib/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAEA,QAAA,MAAM,YAAY,2CAAiB,CAAC;AAQpC,OAAO,EAAE,YAAY,EAAE,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAEA,QAAA,MAAM,gBAAgB,2CAAiB,CAAC;AAQxC,OAAO,EAAE,gBAAgB,EAAE,CAAC"}

package/lib/index.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.allExercises = void 0;
+exports.allMathExercises = void 0;
 const exercises_1 = require("./exercises/exercises");
-const allExercises = [...exercises_1.exercises];
-exports.allExercises = allExercises;
+const allMathExercises = [...exercises_1.exercises];
+exports.allMathExercises = allMathExercises;

package/lib/math/polynomials/polynomial.d.ts

@@ -1,4 +1,5 @@
 import { Node } from '../../tree/nodes/node';
+export declare function createRandomPolynomialWithOrder(order: number, variable?: string): Polynomial;
 export declare class Polynomial {
     degree: number;
     variable: string;
@@ -13,12 +14,13 @@ export declare class Polynomial {
      */
     constructor(coefficients: number[], variable?: string);
     equals(P: Polynomial): boolean;
-    getRoots(): void;
+    getRoots(): number[];
     add(P: Polynomial): Polynomial;
     times(nb: number): Polynomial;
     multiply(Q: Polynomial): Polynomial;
     opposite(): Polynomial;
     derivate(): Polynomial;
+    integrate(): Polynomial;
     calculate(x: number): number;
     toTree(): Node;
     toTex(): string;

package/lib/math/polynomials/polynomial.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"polynomial.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/polynomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAS7C,qBAAa,UAAU;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;gBACS,YAAY,EAAE,MAAM,EAAE,EAAE,QAAQ,GAAE,MAAY;IAS1D,MAAM,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO;IAG9B,QAAQ;IACR,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAc9B,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU;IAM7B,QAAQ,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAkBnC,QAAQ,IAAI,UAAU;IAOtB,QAAQ,IAAI,UAAU;IAQtB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5B,MAAM,IAAI,IAAI;IAmCd,KAAK,IAAI,MAAM;IAkBf,QAAQ,IAAI,MAAM;CAGnB"}
+{"version":3,"file":"polynomial.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/polynomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAU7C,wBAAgB,+BAA+B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY,GAAG,UAAU,CAYjG;AAED,qBAAa,UAAU;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;gBACS,YAAY,EAAE,MAAM,EAAE,EAAE,QAAQ,GAAE,MAAY;IAS1D,MAAM,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO;IAG9B,QAAQ,IAAI,MAAM,EAAE;IA8BpB,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAc9B,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU;IAM7B,QAAQ,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAkBnC,QAAQ,IAAI,UAAU;IAOtB,QAAQ,IAAI,UAAU;IAQtB,SAAS,IAAI,UAAU;IAMvB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5B,MAAM,IAAI,IAAI;IAmCd,KAAK,IAAI,MAAM;IAkBf,QAAQ,IAAI,MAAM;CAGnB"}

package/lib/math/polynomials/polynomial.js

@@ -1,12 +1,25 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Polynomial = void 0;
+exports.Polynomial = exports.createRandomPolynomialWithOrder = void 0;
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const addNode_1 = require("../../tree/nodes/operators/addNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
 const oppositeNode_1 = require("../../tree/nodes/functions/oppositeNode");
 const powerNode_1 = require("../../tree/nodes/operators/powerNode");
 const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const randint_1 = require("../../math/utils/random/randint");
+function createRandomPolynomialWithOrder(order, variable = 'x') {
+    if (order < 0) {
+        throw Error('Order must be a non-negative integer');
+    }
+    const coefficients = [];
+    for (let i = 0; i <= order - 1; i++) {
+        coefficients.push((0, randint_1.randint)(-9, 10));
+    }
+    coefficients.push((0, randint_1.randint)(-9, 10, [0]));
+    return new Polynomial(coefficients, variable);
+}
+exports.createRandomPolynomialWithOrder = createRandomPolynomialWithOrder;
 class Polynomial {
     /**
      *
@@ -26,7 +39,35 @@ class Polynomial {
     equals(P) {
         return P.degree === this.degree && this.coefficients.every((coeff, i) => coeff === P.coefficients[i]);
     }
-    getRoots() { }
+    getRoots() {
+        const roots = [];
+        if (this.degree === 1) {
+            // Polynôme de degré 1 : ax + b = 0
+            const a = this.coefficients[1];
+            const b = this.coefficients[0];
+            if (a !== 0) {
+                roots.push(-b / a);
+            }
+        }
+        else if (this.degree === 2) {
+            // Polynôme de degré 2 : ax^2 + bx + c = 0
+            const a = this.coefficients[2];
+            const b = this.coefficients[1];
+            const c = this.coefficients[0];
+            const delta = b * b - 4 * a * c;
+            if (delta > 0) {
+                roots.push((-b + Math.sqrt(delta)) / (2 * a));
+                roots.push((-b - Math.sqrt(delta)) / (2 * a));
+            }
+            else if (delta === 0) {
+                roots.push(-b / (2 * a));
+            }
+        }
+        else {
+            //méthode de Newton-Raphson ou des bibliothèques de calcul symbolique pour obtenir les racines.
+        }
+        return roots.sort((a, b) => a - b);
+    }
     add(P) {
         var _a, _b;
         if (P.variable !== this.variable)
@@ -67,6 +108,11 @@ class Polynomial {
             res.push(i * this.coefficients[i]);
         return new Polynomial(res, this.variable);
     }
+    integrate() {
+        const newCoefficients = this.coefficients.map((coeff, exp) => coeff / (exp + 1));
+        newCoefficients.unshift(0);
+        return new Polynomial(newCoefficients, this.variable);
+    }
     calculate(x) {
         let res = 0;
         for (let i = 0; i < this.coefficients.length; i++)

package/lib/tree/nodes/functions/expNode.d.ts

@@ -0,0 +1,10 @@
+import { Node, NodeType } from '../node';
+import { FunctionNode } from './functionNode';
+export declare class ExpNode extends FunctionNode implements Node {
+    type: NodeType;
+    constructor(child: Node);
+    toMathString(): string;
+    toTex(): string;
+    simplify(): Node;
+}
+//# sourceMappingURL=expNode.d.ts.map

package/lib/tree/nodes/functions/expNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/expNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,YAAY,EAAgB,MAAM,gBAAgB,CAAC;AAE5D,qBAAa,OAAQ,SAAQ,YAAa,YAAW,IAAI;IACvD,IAAI,EAAE,QAAQ,CAAqB;gBAEvB,KAAK,EAAE,IAAI;IAIvB,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAIf,QAAQ,IAAI,IAAI;CAGjB"}

package/lib/tree/nodes/functions/expNode.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ExpNode = void 0;
+const node_1 = require("../node");
+const functionNode_1 = require("./functionNode");
+class ExpNode extends functionNode_1.FunctionNode {
+    constructor(child) {
+        super(functionNode_1.FunctionsIds.exp, child, '\\exp');
+        this.type = node_1.NodeType.function;
+    }
+    toMathString() {
+        return `e^(${this.child.toMathString()})`;
+    }
+    toTex() {
+        return `e^{${this.child.toTex()}}`;
+    }
+    simplify() {
+        return this;
+    }
+}
+exports.ExpNode = ExpNode;

package/lib/tree/nodes/functions/functionNode.d.ts

@@ -3,7 +3,9 @@ export declare enum FunctionsIds {
     opposite = 0,
     sqrt = 1,
     cos = 2,
-    sin = 3
+    sin = 3,
+    log = 4,
+    exp = 5
 }
 export declare abstract class FunctionNode {
     id: FunctionsIds;

package/lib/tree/nodes/functions/functionNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"functionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/functionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEzC,oBAAY,YAAY;IACtB,QAAQ,IAAA;IACR,IAAI,IAAA;IACJ,GAAG,IAAA;IACH,GAAG,IAAA;CACJ;AAED,8BAAsB,YAAY;IAChC,EAAE,EAAE,YAAY,CAAC;IACjB,KAAK,EAAE,IAAI,CAAC;IACZ,IAAI,WAAqB;IACzB,GAAG,EAAE,MAAM,CAAC;gBACA,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM;CAKvD"}
+{"version":3,"file":"functionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/functionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEzC,oBAAY,YAAY;IACtB,QAAQ,IAAA;IACR,IAAI,IAAA;IACJ,GAAG,IAAA;IACH,GAAG,IAAA;IACH,GAAG,IAAA;IACH,GAAG,IAAA;CACJ;AAED,8BAAsB,YAAY;IAChC,EAAE,EAAE,YAAY,CAAC;IACjB,KAAK,EAAE,IAAI,CAAC;IACZ,IAAI,WAAqB;IACzB,GAAG,EAAE,MAAM,CAAC;gBACA,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM;CAKvD"}

package/lib/tree/nodes/functions/functionNode.js

@@ -8,6 +8,8 @@ var FunctionsIds;
     FunctionsIds[FunctionsIds["sqrt"] = 1] = "sqrt";
     FunctionsIds[FunctionsIds["cos"] = 2] = "cos";
     FunctionsIds[FunctionsIds["sin"] = 3] = "sin";
+    FunctionsIds[FunctionsIds["log"] = 4] = "log";
+    FunctionsIds[FunctionsIds["exp"] = 5] = "exp";
 })(FunctionsIds = exports.FunctionsIds || (exports.FunctionsIds = {}));
 class FunctionNode {
     constructor(id, child, tex) {

package/lib/tree/nodes/functions/logNode.d.ts

@@ -0,0 +1,10 @@
+import { Node, NodeType } from '../node';
+import { FunctionNode } from './functionNode';
+export declare class LogNode extends FunctionNode implements Node {
+    type: NodeType;
+    constructor(child: Node);
+    toMathString(): string;
+    toTex(): string;
+    simplify(): Node;
+}
+//# sourceMappingURL=logNode.d.ts.map

package/lib/tree/nodes/functions/logNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/logNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,YAAY,EAAgB,MAAM,gBAAgB,CAAC;AAE5D,qBAAa,OAAQ,SAAQ,YAAa,YAAW,IAAI;IACvD,IAAI,EAAE,QAAQ,CAAqB;gBAEvB,KAAK,EAAE,IAAI;IAIvB,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAIf,QAAQ,IAAI,IAAI;CAGjB"}

package/lib/tree/nodes/functions/logNode.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LogNode = void 0;
+const node_1 = require("../node");
+const functionNode_1 = require("./functionNode");
+class LogNode extends functionNode_1.FunctionNode {
+    constructor(child) {
+        super(functionNode_1.FunctionsIds.log, child, '\\ln');
+        this.type = node_1.NodeType.function;
+    }
+    toMathString() {
+        return `log(${this.child.toMathString()})`;
+    }
+    toTex() {
+        return `\\ln\\left(${this.child.toTex()}\\right)`;
+    }
+    simplify() {
+        return this;
+    }
+}
+exports.LogNode = LogNode;

package/lib/tree/nodes/functions/sinNode.d.ts

@@ -1 +1,10 @@
+import { Node, NodeType } from '../node';
+import { FunctionNode } from './functionNode';
+export declare class SinNode extends FunctionNode implements Node {
+    type: NodeType;
+    constructor(child: Node);
+    toMathString(): string;
+    toTex(): string;
+    simplify(): Node;
+}
 //# sourceMappingURL=sinNode.d.ts.map

package/lib/tree/nodes/functions/sinNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sinNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/sinNode.ts"],"names":[],"mappings":""}
+{"version":3,"file":"sinNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/sinNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,YAAY,EAAgB,MAAM,gBAAgB,CAAC;AAE5D,qBAAa,OAAQ,SAAQ,YAAa,YAAW,IAAI;IACvD,IAAI,EAAE,QAAQ,CAAqB;gBAEvB,KAAK,EAAE,IAAI;IAIvB,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAIf,QAAQ,IAAI,IAAI;CAGjB"}

package/lib/tree/nodes/functions/sinNode.js

@@ -1 +1,21 @@
 "use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SinNode = void 0;
+const node_1 = require("../node");
+const functionNode_1 = require("./functionNode");
+class SinNode extends functionNode_1.FunctionNode {
+    constructor(child) {
+        super(functionNode_1.FunctionsIds.sin, child, '\\sin');
+        this.type = node_1.NodeType.function;
+    }
+    toMathString() {
+        return `sin(${this.child.toMathString()})`;
+    }
+    toTex() {
+        return `\\sin\\left(${this.child.toTex()}\\right)`;
+    }
+    simplify() {
+        return this;
+    }
+}
+exports.SinNode = SinNode;

package/lib/tree/parsers/simplify.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"simplify.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/simplify.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AAqBrC,eAAO,MAAM,YAAY,SAAU,IAAI,KAAG,IAEzC,CAAC"}
+{"version":3,"file":"simplify.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/simplify.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AAyBrC,eAAO,MAAM,YAAY,SAAU,IAAI,KAAG,IAEzC,CAAC"}

package/lib/tree/parsers/simplify.js

@@ -12,6 +12,10 @@ const multiplyNode_1 = require("../nodes/operators/multiplyNode");
 const powerNode_1 = require("../nodes/operators/powerNode");
 const substractNode_1 = require("../nodes/operators/substractNode");
 const variableNode_1 = require("../nodes/variables/variableNode");
+const logNode_1 = require("../nodes/functions/logNode");
+const expNode_1 = require("../nodes/functions/expNode");
+const cosNode_1 = require("../../tree/nodes/functions/cosNode");
+const sinNode_1 = require("../../tree/nodes/functions/sinNode");
 const simplifyNode = (node) => {
     return mathjsNodeToNode((0, mathjs_1.simplify)(node.toMathString()));
 };
@@ -46,6 +50,14 @@ const mathjsNodeToNode = (mathjsNode) => {
         switch (fn.name) {
             case 'sqrt':
                 return new sqrtNode_1.SqrtNode(mathjsNodeToNode(mathjsNode.args[0]));
+            case 'log':
+                return new logNode_1.LogNode(mathjsNodeToNode(mathjsNode.args[0]));
+            case 'exp':
+                return new expNode_1.ExpNode(mathjsNodeToNode(mathjsNode.args[0]));
+            case 'cos':
+                return new cosNode_1.CosNode(mathjsNodeToNode(mathjsNode.args[0]));
+            case 'sin':
+                return new sinNode_1.SinNode(mathjsNodeToNode(mathjsNode.args[0]));
         }
     }
     throw Error('unrecognized mathjs node');

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "1.3.41",
+  "version": "1.3.43",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [