math-exercises 2.0.22 → 2.0.24

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

@@ -77,7 +77,7 @@ const getPropositions = (n, { answer, randNbr }) => {
             const tempAns = sqrt + (0, randint_1.randint)(-sqrt + 1, 7, [0]);
             (0, exercise_1.tryToAddWrongProp)(propositions, (0, coinFlip_1.coinFlip)()
                 ? `S=\\left\\{-${tempAns};${tempAns}\\right\\}`
-                : `S=\\emptyset`);
+                : `S=\\varnothing`);
         }
     }
     else {
@@ -92,7 +92,7 @@ const getPropositions = (n, { answer, randNbr }) => {
             const tempRadicand = radicand + (0, randint_1.randint)(-radicand + 1, 7, [0]);
             (0, exercise_1.tryToAddWrongProp)(propositions, (0, coinFlip_1.coinFlip)()
                 ? `S=\\left\\{-${tempFactor}\\sqrt{${tempRadicand}};${tempFactor}\\sqrt{${tempRadicand}}\\right\\}`
-                : `S=\\emptyset`);
+                : `S=\\varnothing`);
         }
     }
     return (0, exercise_1.shuffleProps)(propositions, n);

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

@@ -18,7 +18,7 @@ const getFractionEquation = () => {
     const polynome1 = new polynomial_1.Polynomial([b, a]);
     const polynome2 = new polynomial_1.Polynomial([d, c]);
     const answer = -d / c === -b / a
-        ? `S=\\emptyset`
+        ? `S=\\varnothing`
         : `S=\\left\\{${new rational_1.Rational(-b, a)
             .simplify()
             .toTree()
@@ -35,7 +35,7 @@ const getFractionEquation = () => {
             "rbrace",
             "semicolon",
             "ou",
-            "emptyset",
+            "varnothing",
         ],
         answerFormat: "tex",
         identifiers: { a, b, c, d },

package/lib/exercises/equaDiff/equaDiffCheckSolutionFirstOrderTrinom.d.ts

@@ -0,0 +1 @@
+//# sourceMappingURL=equaDiffCheckSolutionFirstOrderTrinom.d.ts.map

package/lib/exercises/equaDiff/equaDiffCheckSolutionFirstOrderTrinom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equaDiffCheckSolutionFirstOrderTrinom.d.ts","sourceRoot":"","sources":["../../../src/exercises/equaDiff/equaDiffCheckSolutionFirstOrderTrinom.ts"],"names":[],"mappings":""}

package/lib/exercises/equaDiff/equaDiffCheckSolutionFirstOrderTrinom.js

@@ -0,0 +1,53 @@
+"use strict";
+// import {
+//   MathExercise,
+//   Proposition,
+//   QCMGenerator,
+//   Question,
+//   QuestionGenerator,
+//   VEA,
+//   addValidProp,
+//   shuffleProps,
+//   tryToAddWrongProp,
+// } from "../../exercises/exercise";
+// import { getDistinctQuestions } from "../../exercises/utils/getDistinctQuestions";
+// import { TrinomConstructor } from "../../math/polynomials/trinom";
+// type Identifiers = {};
+// /**y = y' + dx^2+ex+f, alors y = ax^2+bx+c */
+// const getEquaDiffCheckSolutionFirstOrderQuestion: QuestionGenerator<
+//   Identifiers
+// > = () => {
+//   const trinom = TrinomConstructor.random();
+//   const d = trinom.a;
+//   const e = trinom.b - 2 * trinom.a;
+//   const f = trinom.c - trinom.b;
+//   const question: Question<Identifiers> = {
+//     answer,
+//     instruction: ``,
+//     keys: [],
+//     answerFormat: "tex",
+//     identifiers: {},
+//   };
+//   return question;
+// };
+// const getPropositions: QCMGenerator<Identifiers> = (n, { answer }) => {
+//   const propositions: Proposition[] = [];
+//   addValidProp(propositions, answer);
+//   while (propositions.length < n) {}
+//   return shuffleProps(propositions, n);
+// };
+// const isAnswerValid: VEA<Identifiers> = (ans, { answer }) => {};
+// export const equaDiffCheckSolutionFirstOrder: MathExercise<Identifiers> = {
+//   id: "equaDiffCheckSolutionFirstOrder",
+//   connector: "",
+//   label: "",
+//   levels: [],
+//   isSingleStep: true,
+//   sections: [],
+//   generator: (nb: number) =>
+//     getDistinctQuestions(getEquaDiffCheckSolutionFirstOrderQuestion, nb),
+//   qcmTimer: 60,
+//   freeTimer: 60,
+//   getPropositions,
+//   isAnswerValid,
+// };

package/lib/exercises/functions/absolute/absoluteValueEquations.js

@@ -18,12 +18,12 @@ const getAbsoluteValueEquationsQuestion = () => {
     const answer = a === 0
         ? `S=\\left\\{${b}\\right\\}`
         : a < 0
-            ? `S=\\emptyset`
+            ? `S=\\varnothing`
             : `S=\\left\\{${b - a};${b + a}\\right\\}`;
     const question = {
         answer: answer,
         instruction: `Résoudre l'équation $|${poly.toTree().toTex()}| = ${a}$.`,
-        keys: ["S", "equal", "emptyset", "lbrace", "semicolon", "rbrace"],
+        keys: ["S", "equal", "varnothing", "lbrace", "semicolon", "rbrace"],
         answerFormat: "tex",
         identifiers: { a, b },
     };
@@ -37,7 +37,7 @@ const getPropositions = (n, { answer, a, b }) => {
         (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{${b + a}\\right\\}`);
     }
     else if (a === 0) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\emptyset`);
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\varnothing`);
     }
     else if (a > 0) {
         (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{${b + a}\\right\\}`);

package/lib/exercises/functions/absolute/absoluteValueInequations.js

@@ -25,7 +25,7 @@ const getAbsoluteValueInequationsQuestion = () => {
             "lbracket",
             "semicolon",
             "rbracket",
-            "emptyset",
+            "varnothing",
             "x",
             "leq",
             "geq",

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

@@ -73,7 +73,7 @@ const getGraphicEquationQuestion = () => {
 const getPropositions = (n, { answer }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\emptyset`);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\varnothing`);
     while (propositions.length < n) {
         const nbs = [];
         const nbSol = (0, randint_1.randint)(2, 4);

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

@@ -114,7 +114,7 @@ const getGraphicInequationQuestion = () => {
 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=\\varnothing`);
     (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);

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

@@ -1 +1 @@
-{"version":3,"file":"log10Simplifying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/log10Simplifying.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AAsFF,eAAO,MAAM,mBAAmB,EAAE,YAAY,CAAC,WAAW,CAgBzD,CAAC;AACF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAgBvD,CAAC"}
+{"version":3,"file":"log10Simplifying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/log10Simplifying.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AA0FF,eAAO,MAAM,mBAAmB,EAAE,YAAY,CAAC,WAAW,CAgBzD,CAAC;AACF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAgBvD,CAAC"}

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

@@ -15,6 +15,7 @@ const operatorComposition_1 = require("../../../tree/utilities/operatorCompositi
 const random_1 = require("../../../utils/random");
 const getLog10SumSimplifyingQuestion = (opts) => {
     const nb = (0, randint_1.randint)(2, 10);
+    const trueNb = [2, 4, 8].includes(nb) ? 2 : [3, 9].includes(nb) ? 3 : nb;
     const nbTerms = (0, randint_1.randint)(2, 4);
     const powers = [];
     const signs = [];
@@ -36,7 +37,7 @@ const getLog10SumSimplifyingQuestion = (opts) => {
     const answer = statement.simplify();
     const question = {
         answer: answer.toTex(),
-        instruction: `Simplifier le plus possible l'expression suivante : $${statement.toTex()}$`,
+        instruction: `Exprimer le nombre suivant sous la forme $a${opts?.isLog10 ? "\\log" : "\\ln"}\\left(${trueNb}\\right)$ : $\\newline ${statement.toTex()}$`,
         keys: [opts?.isLog10 ? "log" : "ln"],
         answerFormat: "tex",
         identifiers: { nb, powers, signs, isLog10: opts?.isLog10 ?? false },

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

@@ -31,7 +31,7 @@ const getExpSimplifiying = () => {
     }
     const answer = simplifiedExpression.toTex();
     const question = {
-        instruction: `Simplifier l'expression suivante : $${expression.toTex()}$.`,
+        instruction: `Ecrire le nombre suivant sous la forme $\\ln\\left(a\\right)$ : $\\newline ${expression.toTex()}$.`,
         answer,
         keys: ["ln"],
         answerFormat: "tex",

package/lib/exercises/functions/trinoms/niceRootsFromDevForm.js

@@ -16,7 +16,7 @@ const getRootsFromDevFormQuestion = () => {
         instruction: `Soit $f(x) = ${trinom
             .toTree()
             .toTex()}$. Résoudre l'équation $f(x) = 0$.`,
-        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "emptyset"],
+        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "varnothing"],
         identifiers: { a: trinom.a, b: trinom.b, c: trinom.c },
         answerFormat: "tex",
     };
@@ -25,7 +25,7 @@ const getRootsFromDevFormQuestion = () => {
 const getPropositions = (n, { answer }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, "S=\\emptyset");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "S=\\varnothing");
     while (propositions.length < n) {
         let wrongX1 = (0, randint_1.randint)(-19, 0);
         let wrongX2 = (0, randint_1.randint)(0, 20);

package/lib/exercises/functions/trinoms/rootsFromDevForm.js

@@ -16,7 +16,7 @@ const getRootsFromDevFormQuestion = () => {
         instruction: `Soit $f(x) = ${trinom
             .toTree()
             .toTex()}$. Résoudre l'équation $f(x) = 0$.`,
-        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "emptyset"],
+        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "varnothing"],
         answerFormat: "tex",
         identifiers: { a: trinom.a, b: trinom.b, c: trinom.c },
     };
@@ -25,7 +25,7 @@ const getRootsFromDevFormQuestion = () => {
 const getPropositions = (n, { answer }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, "S=\\emptyset");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "S=\\varnothing");
     while (propositions.length < n) {
         let wrongX1 = (0, randint_1.randint)(-19, 0);
         let wrongX2 = (0, randint_1.randint)(0, 20);

package/lib/exercises/functions/trinoms/rootsFromFactorizedForm.js

@@ -18,7 +18,7 @@ const getRootsFromFactorizedFormQuestion = () => {
         instruction: `Soit $f(x) = ${trinom
             .getFactorizedForm()
             .toTex()}$. Résoudre l'équation $f(x) = 0$.`,
-        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "emptyset"],
+        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "varnothing"],
         answerFormat: "tex",
         identifiers: { a: trinom.a, b: trinom.b, c: trinom.c },
     };

package/lib/exercises/functions/trinoms/secondDegreeInequation.js

@@ -52,7 +52,7 @@ const getSecondDegreeInequationQuestion = () => {
             "rbracket",
             "cup",
             "infty",
-            "emptyset",
+            "varnothing",
         ],
         answerFormat: "tex",
         identifiers: {

package/lib/exercises/sets/intervals/intervalsIntersection.js

@@ -14,7 +14,7 @@ const getIntervalsIntersectionQuestion = () => {
         instruction: `Soit $I = ${int1.toTex()}$ et $J = ${int2.toTex()}$. Déterminer $I\\cap J$.`,
         keys: [
             "infty",
-            "emptyset",
+            "varnothing",
             "lbracket",
             "rbracket",
             "semicolon",

package/lib/exercises/sets/setBelonging.js

@@ -42,7 +42,7 @@ const getSetBelongingQuestion = () => {
         answer,
         instruction: `Donner le plus petit ensemble auquel le nombre $${nb}$ appartient.`,
         keys: [
-            "emptyset",
+            "varnothing",
             "naturals",
             "integers",
             "decimals",

package/lib/exercises/squareRoots/squareRootEquation.js

@@ -10,11 +10,11 @@ const discreteSetNode_1 = require("../../tree/nodes/sets/discreteSetNode");
 const shuffle_1 = require("../../utils/shuffle");
 const getSquareRootEquationQuestion = () => {
     const k = Math.random() < 0.2 ? (0, randint_1.randint)(-20, 0) : (0, randint_1.randint)(0, 11);
-    const answer = k < 0 ? "S=\\emptyset" : `S=\\left\\{${k ** 2}\\right\\}`;
+    const answer = k < 0 ? "S=\\varnothing" : `S=\\left\\{${k ** 2}\\right\\}`;
     const question = {
         answer: answer,
         instruction: `Résoudre l'équation suivante : $\\sqrt x = ${k}$`,
-        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "emptyset"],
+        keys: ["S", "equal", "lbrace", "semicolon", "rbrace", "varnothing"],
         answerFormat: "tex",
         identifiers: { k },
     };
@@ -24,7 +24,7 @@ const getPropositions = (n, { answer, k }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
     if (k >= 0)
-        (0, exercise_1.tryToAddWrongProp)(propositions, "S=\\emptyset");
+        (0, exercise_1.tryToAddWrongProp)(propositions, "S=\\varnothing");
     if (Math.sqrt(k) !== k ** 2)
         (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\left\\{\\sqrt{${k}}\\right\\}`);
     while (propositions.length < n) {

package/lib/exercises/utils/keys/equationKeys.js

@@ -8,5 +8,5 @@ exports.equationKeys = [
     "lbrace",
     "semicolon",
     "rbrace",
-    "emptyset",
+    "varnothing",
 ];

package/lib/exercises/utils/keys/inequationKeys.js

@@ -13,5 +13,5 @@ exports.inequationKeys = [
     "semicolon",
     "rbracket",
     "infty",
-    "emptyset",
+    "varnothing",
 ];

package/lib/geogebra/geogebraConstructor.d.ts

@@ -0,0 +1,7 @@
+export declare class GeogebraConstructor {
+    commands: string[];
+    constructor();
+    addCommand(...s: string[]): void;
+    getCommands(): string[];
+}
+//# sourceMappingURL=geogebraConstructor.d.ts.map

package/lib/geogebra/geogebraConstructor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"geogebraConstructor.d.ts","sourceRoot":"","sources":["../../src/geogebra/geogebraConstructor.ts"],"names":[],"mappings":"AAAA,qBAAa,mBAAmB;IAC9B,QAAQ,EAAE,MAAM,EAAE,CAAM;;IAIxB,UAAU,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE;IAGzB,WAAW;CAGZ"}

package/lib/geogebra/geogebraConstructor.js

@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GeogebraConstructor = void 0;
+class GeogebraConstructor {
+    constructor() {
+        this.commands = [];
+    }
+    addCommand(...s) {
+        this.commands.push(...s);
+    }
+    getCommands() {
+        return this.commands;
+    }
+}
+exports.GeogebraConstructor = GeogebraConstructor;

package/lib/math/polynomials/trinom.js

@@ -119,7 +119,7 @@ class Trinom extends polynomial_1.Polynomial {
     getRootsEquationSolutionTex() {
         const roots = this.getRootsNode();
         if (!roots.length)
-            return `S=\\emptyset`;
+            return `S=\\varnothing`;
         if (roots.length === 1)
             return `S=\\left\\{${roots[0].toTex()}\\right\\}`;
         return `S=\\left\\{${roots[0].toTex()};${roots[1].toTex()}\\right\\}`;

package/lib/math/sets/emptySet.js

@@ -1,6 +1,6 @@
 "use strict";
 // import { MathSetInterface } from "./mathSetInterface";
 // export abstract class EmptySet implements MathSetInterface {
-//   tex: string = "\\emptyset";
+//   tex: string = "\\varnothing";
 //   getRandomElement = () => null;
 // }

package/lib/math/sets/intervals/intervals.js

@@ -170,7 +170,7 @@ class Interval {
                 (this.rightBracket === "[" || interval.leftBracket === "]")) ||
             (a === d && (interval.rightBracket === "[" || this.leftBracket === "]"));
         if (isDisjoint) {
-            return new mathSet_1.MathSet("\\emptyset", () => null);
+            return new mathSet_1.MathSet("\\varnothing", () => null);
         }
         const winningLeftBracket = (brack1, brack2) => brack1 === "]" || brack2 === "]" ? "]" : "[";
         const winningRightBracket = (brack1, brack2) => brack1 === "[" || brack2 === "[" ? "[" : "]";

package/lib/math/utils/arithmetic/maxPowerDecomposition.d.ts

@@ -0,0 +1,11 @@
+/**
+ *
+ * @param n
+ * eg for n = 36 will return 6^2
+ * for n = 12 will return 2^2*3
+ */
+export declare const maxPowerDecomposition: (n: number) => {
+    value: number;
+    power: number;
+}[];
+//# sourceMappingURL=maxPowerDecomposition.d.ts.map

package/lib/math/utils/arithmetic/maxPowerDecomposition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"maxPowerDecomposition.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/arithmetic/maxPowerDecomposition.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,MAAO,MAAM;WAEzB,MAAM;WAAS,MAAM;GAW1C,CAAC"}

package/lib/math/utils/arithmetic/maxPowerDecomposition.js

@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.maxPowerDecomposition = void 0;
+const primeDecomposition_1 = require("./primeDecomposition");
+/**
+ *
+ * @param n
+ * eg for n = 36 will return 6^2
+ * for n = 12 will return 2^2*3
+ */
+const maxPowerDecomposition = (n) => {
+    const decomposition = (0, primeDecomposition_1.primeDecomposition)(n);
+    const res = [];
+    for (const item of decomposition) {
+        const { value, power } = item;
+        const matchingPower = res.find((el) => el.power === power);
+        if (matchingPower) {
+            matchingPower.value *= value;
+        }
+        else {
+            res.push(item);
+        }
+    }
+    return res;
+};
+exports.maxPowerDecomposition = maxPowerDecomposition;

package/lib/math/utils/arithmetic/primeDecomposition.d.ts

@@ -0,0 +1,5 @@
+export declare const primeDecomposition: (n: number) => {
+    value: number;
+    power: number;
+}[];
+//# sourceMappingURL=primeDecomposition.d.ts.map

package/lib/math/utils/arithmetic/primeDecomposition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"primeDecomposition.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/arithmetic/primeDecomposition.ts"],"names":[],"mappings":"AAEA,eAAO,MAAM,kBAAkB,MAAO,MAAM;WAEtB,MAAM;WAAS,MAAM;GAa1C,CAAC"}

package/lib/math/utils/arithmetic/primeDecomposition.js

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.primeDecomposition = void 0;
+const primeFactors_1 = require("./primeFactors");
+const primeDecomposition = (n) => {
+    const factors = (0, primeFactors_1.primeFactors)(n);
+    const res = [];
+    for (const factor of factors) {
+        const data = res.find((el) => el.value === factor);
+        if (data) {
+            data.power++;
+        }
+        else {
+            res.push({
+                value: factor,
+                power: 1,
+            });
+        }
+    }
+    return res;
+};
+exports.primeDecomposition = primeDecomposition;

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

@@ -1 +1 @@
-{"version":3,"file":"log10Node.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/log10Node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAMjD,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AACD,qBAAa,SAAU,YAAW,YAAY;IAC5C,EAAE,EAAE,YAAY,CAAC;IACjB,KAAK,EAAE,aAAa,CAAC;IACrB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;gBACP,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;IAQpD,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAaf,iBAAiB,IAAI,aAAa,EAAE;IASpC,cAAc,IAAI,MAAM,EAAE;IAG1B,QAAQ,IAAI,aAAa;IA0BzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAGrC,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAGrC"}
+{"version":3,"file":"log10Node.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/log10Node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAQjD,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AACD,qBAAa,SAAU,YAAW,YAAY;IAC5C,EAAE,EAAE,YAAY,CAAC;IACjB,KAAK,EAAE,aAAa,CAAC;IACrB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;gBACP,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;IAQpD,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAaf,iBAAiB,IAAI,aAAa,EAAE;IASpC,cAAc,IAAI,MAAM,EAAE;IAG1B,QAAQ,IAAI,aAAa;IAgCzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAGrC,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAGrC"}

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

@@ -9,7 +9,7 @@ const numberNode_1 = require("../numbers/numberNode");
 const isInt_1 = require("../../../utils/isInt");
 const powerNode_1 = require("../operators/powerNode");
 const multiplyNode_1 = require("../operators/multiplyNode");
-const primeFactors_1 = require("../../../math/utils/arithmetic/primeFactors");
+const maxPowerDecomposition_1 = require("../../../math/utils/arithmetic/maxPowerDecomposition");
 function isLog10Node(a) {
     return (0, functionNode_1.isFunctionNode)(a) && a.id === functionNode_1.FunctionsIds.log10;
 }
@@ -58,11 +58,18 @@ class Log10Node {
             if ((0, isInt_1.isInt)(log10))
                 return new numberNode_1.NumberNode(log10);
             if ((0, isInt_1.isInt)(value)) {
-                const factors = (0, primeFactors_1.primeFactors)(value);
-                if (factors.length === 1)
-                    return this; //isPrime
-                if (factors.every((nb) => nb === factors[0])) {
-                    return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(factors.length), new Log10Node(new numberNode_1.NumberNode(factors[0]))).simplify();
+                const decomposition = (0, maxPowerDecomposition_1.maxPowerDecomposition)(value);
+                if (decomposition.length === 1) {
+                    const el = decomposition[0];
+                    if (el.power === 1)
+                        return this; //isPrime
+                    else
+                        return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(el.power), new Log10Node(new numberNode_1.NumberNode(el.value)));
+                }
+                else {
+                    //! things like log(6) will return themselves
+                    //! even true for log(12). Should they be simplified into 2ln(2)+ln(3) ?
+                    return new Log10Node(simplifiedChild);
                 }
             }
         }

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

@@ -1 +1 @@
-{"version":3,"file":"logNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/logNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAOjD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AACD,qBAAa,OAAQ,YAAW,YAAY;IAC1C,EAAE,EAAE,YAAY,CAAC;IACjB,KAAK,EAAE,aAAa,CAAC;IACrB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;gBACP,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;IAQpD,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAaf,iBAAiB,IAAI,aAAa,EAAE;IASpC,cAAc,IAAI,MAAM,EAAE;IAG1B,QAAQ,IAAI,aAAa;IA6BzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAGrC,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAGrC"}
+{"version":3,"file":"logNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/logNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAQjD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AACD,qBAAa,OAAQ,YAAW,YAAY;IAC1C,EAAE,EAAE,YAAY,CAAC;IACjB,KAAK,EAAE,aAAa,CAAC;IACrB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;gBACP,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;IAQpD,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAaf,iBAAiB,IAAI,aAAa,EAAE;IASpC,cAAc,IAAI,MAAM,EAAE;IAG1B,QAAQ,IAAI,aAAa;IAmCzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAGrC,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAGrC"}

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

@@ -9,8 +9,8 @@ const multiplyNode_1 = require("../operators/multiplyNode");
 const powerNode_1 = require("../operators/powerNode");
 const numberNode_1 = require("../numbers/numberNode");
 const isInt_1 = require("../../../utils/isInt");
-const primeFactors_1 = require("../../../math/utils/arithmetic/primeFactors");
 const expNode_1 = require("./expNode");
+const maxPowerDecomposition_1 = require("../../../math/utils/arithmetic/maxPowerDecomposition");
 function isLogNode(a) {
     return (0, functionNode_1.isFunctionNode)(a) && a.id === functionNode_1.FunctionsIds.log;
 }
@@ -55,15 +55,22 @@ class LogNode {
         const simplifiedChild = this.child.simplify();
         if ((0, numberNode_1.isNumberNode)(simplifiedChild)) {
             const value = simplifiedChild.value;
-            const log = Math.log(value);
-            if ((0, isInt_1.isInt)(log))
-                return new numberNode_1.NumberNode(log);
+            const log10 = Math.log10(value);
+            if ((0, isInt_1.isInt)(log10))
+                return new numberNode_1.NumberNode(log10);
             if ((0, isInt_1.isInt)(value)) {
-                const factors = (0, primeFactors_1.primeFactors)(value);
-                if (factors.length === 1)
-                    return this; //isPrime
-                if (factors.every((nb) => nb === factors[0])) {
-                    return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(factors.length), new LogNode(new numberNode_1.NumberNode(factors[0]))).simplify();
+                const decomposition = (0, maxPowerDecomposition_1.maxPowerDecomposition)(value);
+                if (decomposition.length === 1) {
+                    const el = decomposition[0];
+                    if (el.power === 1)
+                        return this; //isPrime
+                    else
+                        return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(el.power), new LogNode(new numberNode_1.NumberNode(el.value)));
+                }
+                else {
+                    //! things like log(6) will return themselves
+                    //! even true for log(12). Should they be simplified into 2ln(2)+ln(3) ?
+                    return new LogNode(simplifiedChild);
                 }
             }
         }

package/lib/tree/nodes/sets/discreteSetNode.js

@@ -50,7 +50,7 @@ class DiscreteSetNode {
     }
     toTex() {
         if (!this.elements.length)
-            return `\\emptyset`;
+            return `\\varnothing`;
         return `\\left\\{${this.elements
             .map((el) => el.toTex())
             .join(";")}\\right\\}`;

package/lib/types/keyIds.d.ts

@@ -10,7 +10,7 @@ export type KeyId =
 /**operations */
  | "plus" | "minus" | "times" | "frac" | "obelus" | "sqrt" | "sqrtCub" | "square" | "cube" | "power" | "percent" | "leftParenthesis" | "rightParenthesis" | "equal" | "comma" | "semicolon" | "dot" | "sup" | "inf" | "geq" | "leq" | "approx" | "xsquare" | "xcube"
 /**sets */
- | "belongs" | "notin" | "cap" | "cup" | "lbrace" | "rbrace" | "lbracket" | "rbracket" | "emptyset" | "naturals" | "integers" | "rationals" | "decimals" | "reals" | "complex" | "ast" | "del" | "right" | "left" | "rightarrow" | "overrightarrow" | "infty"
+ | "belongs" | "notin" | "cap" | "cup" | "lbrace" | "rbrace" | "lbracket" | "rbracket" | "varnothing" | "naturals" | "integers" | "rationals" | "decimals" | "reals" | "complex" | "ast" | "del" | "right" | "left" | "rightarrow" | "overrightarrow" | "infty"
 /**fcts */
  | "log" | "ln" | "exp" | "epower" | "sin" | "cos" | "tan" | "arccos" | "arcsin" | "arctan" | "abs" | "fx"
 /**sequences */

package/lib/types/keyIds.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"keyIds.d.ts","sourceRoot":"","sources":["../../src/types/keyIds.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,KAAK;AACf,WAAW;AACT,IAAI,GACJ,KAAK,GACL,SAAS,GACT,IAAI,GACJ,KAAK,GACL,IAAI,GACJ,IAAI;AAEN,aAAa;GACX,QAAQ,GACR,OAAO,GACP,MAAM,GACN,YAAY,GACZ,KAAK,GACL,OAAO,GACP,QAAQ,GACR,KAAK;AAEP,WAAW;GACT,IAAI,GACJ,IAAI,GACJ,OAAO;AAET,cAAc;GACZ,gBAAgB,GAChB,QAAQ,GACR,SAAS;AAEX,gBAAgB;GACd,MAAM,GACN,OAAO,GACP,OAAO,GACP,MAAM,GACN,QAAQ,GACR,MAAM,GACN,SAAS,GACT,QAAQ,GACR,MAAM,GACN,OAAO,GACP,SAAS,GACT,iBAAiB,GACjB,kBAAkB,GAClB,OAAO,GACP,OAAO,GACP,WAAW,GACX,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,QAAQ,GACR,SAAS,GACT,OAAO;AAET,UAAU;GACR,SAAS,GACT,OAAO,GACP,KAAK,GACL,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,UAAU,GACV,UAAU,GACV,UAAU,GACV,UAAU,GACV,UAAU,GACV,WAAW,GACX,UAAU,GACV,OAAO,GACP,SAAS,GACT,KAAK,GACL,KAAK,GACL,OAAO,GACP,MAAM,GACN,YAAY,GACZ,gBAAgB,GAChB,OAAO;AAET,UAAU;GACR,KAAK,GACL,IAAI,GACJ,KAAK,GACL,QAAQ,GACR,KAAK,GACL,KAAK,GACL,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,KAAK,GACL,IAAI;AAEN,eAAe;GACb,IAAI,GACJ,SAAS;AAEX,YAAY;GACV,eAAe,GACf,UAAU,GACV,UAAU,GACV,OAAO;AAET,aAAa;GACX,UAAU;AAEZ,WAAW;GACT,OAAO,GACP,MAAM,GACN,OAAO,GACP,OAAO,GACP,OAAO,GACP,OAAO,GACP,KAAK,GACL,IAAI,GACJ,KAAK,GACL,OAAO,GACP,QAAQ,GACR,IAAI,GACJ,OAAO,GACP,OAAO;AAET,cAAc;GACZ,WAAW,GACX,OAAO,GACP,QAAQ,GACR,MAAM,GACN,OAAO,GACP,YAAY,GACZ,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG;AAEL,aAAa;GACX,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG;AAEL,WAAW;GACT,WAAW,GACX,QAAQ,GACR,SAAS,GACT,WAAW,GACX,MAAM,GACN,SAAS,GACT,OAAO,GACP,SAAS,GACT,OAAO,GACP,MAAM,GACN,QAAQ,GACR,WAAW,GACX,WAAW,GACX,UAAU,GACV,WAAW,GACX,QAAQ,GACR,QAAQ,GACR,OAAO,GACP,WAAW,GACX,SAAS,GACT,UAAU,GACV,QAAQ,GACR,UAAU,GACV,QAAQ,GACR,WAAW,GACX,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,MAAM,GACN,SAAS,GACT,WAAW,GACX,SAAS,GACT,UAAU,GACV,OAAO,GACP,SAAS,GACT,UAAU,GACV,WAAW,GACX,SAAS,GACT,WAAW,GACX,SAAS,GACT,WAAW,GACX,YAAY,GACZ,WAAW,GACX,SAAS,GACT,WAAW,GACX,QAAQ,GACR,SAAS,GACT,QAAQ,GACR,OAAO,GACP,WAAW,GACX,SAAS,GACT,MAAM,GACN,OAAO,GACP,QAAQ,GACR,QAAQ,GACR,UAAU,GACV,QAAQ,GACR,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,UAAU,GACV,UAAU,GACV,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,SAAS,GACT,QAAQ,GACR,SAAS,GACT,WAAW,GACX,UAAU,GACV,SAAS,GACT,SAAS,GACT,WAAW,GACX,SAAS,GACT,QAAQ,GACR,SAAS,GACT,SAAS,GACT,IAAI,GACJ,SAAS,GACT,UAAU,GACV,OAAO,GACP,SAAS,GACT,UAAU,GACV,QAAQ,GACR,OAAO,GACP,UAAU,GACV,QAAQ,GACR,UAAU,GACV,SAAS,GACT,cAAc,GACd,SAAS,GACT,WAAW,GACX,WAAW,GACX,WAAW,GACX,QAAQ,GACR,WAAW,GACX,aAAa,GACb,aAAa,GACb,SAAS,GACT,aAAa,GACb,UAAU,GACV,YAAY,GACZ,eAAe,GACf,SAAS,GACT,YAAY,GACZ,SAAS,GACT,SAAS,GACT,YAAY,GACZ,cAAc,GACd,aAAa,GACb,aAAa,GACb,UAAU,GACV,WAAW,GACX,WAAW,GACX,aAAa,GACb,YAAY,GACZ,WAAW;AAEb,eAAe;GACb,aAAa,GACb,WAAW,GACX,KAAK,GACL,SAAS,GACT,oBAAoB,GACpB,UAAU,GACV,mBAAmB,GACnB,SAAS,GACT,SAAS,GACT,UAAU,GACV,SAAS,GACT,QAAQ,GACR,kBAAkB,GAClB,WAAW,GACX,SAAS,GACT,cAAc,GACd,UAAU,GACV,sBAAsB,GACtB,sBAAsB,GACtB,oBAAoB,GACpB,iBAAiB,GACjB,oBAAoB,GACpB,qBAAqB,GACrB,YAAY,GACZ,UAAU,GACV,SAAS,GACT,aAAa,GACb,oBAAoB,GACpB,SAAS,GACT,gBAAgB,GAChB,WAAW,GACX,oBAAoB,GACpB,KAAK,GACL,mBAAmB,GACnB,QAAQ,GACR,UAAU,GACV,SAAS,GACT,SAAS,GACT,iBAAiB,GACjB,QAAQ,GACR,SAAS,GACT,aAAa,GACb,kBAAkB,GAClB,oBAAoB,GACpB,mBAAmB,GACnB,QAAQ,GACR,SAAS,GACT,eAAe,GACf,UAAU,GACV,gBAAgB,GAChB,SAAS,GACT,qBAAqB,GACrB,qBAAqB,GACrB,kBAAkB,GAClB,mBAAmB,GACnB,mBAAmB,GACnB,sBAAsB,GACtB,oBAAoB,GACpB,mBAAmB,GACnB,yBAAyB,GACzB,mBAAmB,GACnB,MAAM,GACN,kBAAkB,GAClB,wBAAwB,GACxB,sBAAsB,GACtB,sBAAsB,GACtB,uBAAuB,GACvB,qBAAqB,GACrB,qBAAqB,GACrB,uBAAuB,GACvB,mBAAmB,GACnB,QAAQ,GACR,mBAAmB,GACnB,mBAAmB,GACnB,QAAQ,GACR,uBAAuB,GACvB,QAAQ,GACR,sBAAsB,GACtB,QAAQ,GACR,sBAAsB,GACtB,OAAO,GACP,sBAAsB,GACtB,sBAAsB,GACtB,kBAAkB,GAClB,wBAAwB,GACxB,qBAAqB,GACrB,UAAU,GACV,mBAAmB,GACnB,yBAAyB,GACzB,iBAAiB,GACjB,uBAAuB,GACvB,iBAAiB,GACjB,oBAAoB,GACpB,iBAAiB,GACjB,kBAAkB,GAClB,qBAAqB,GACrB,mBAAmB,GACnB,sBAAsB,GACtB,oBAAoB,GACpB,eAAe,GACf,aAAa,GACb,aAAa,GACb,eAAe,GACf,eAAe,GACf,eAAe,GACf,uBAAuB,GACvB,gBAAgB,GAChB,mBAAmB,GACnB,sBAAsB,GACtB,qBAAqB,GACrB,kBAAkB,GAClB,wBAAwB,GACxB,uBAAuB,CAAC"}
+{"version":3,"file":"keyIds.d.ts","sourceRoot":"","sources":["../../src/types/keyIds.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,KAAK;AACf,WAAW;AACT,IAAI,GACJ,KAAK,GACL,SAAS,GACT,IAAI,GACJ,KAAK,GACL,IAAI,GACJ,IAAI;AAEN,aAAa;GACX,QAAQ,GACR,OAAO,GACP,MAAM,GACN,YAAY,GACZ,KAAK,GACL,OAAO,GACP,QAAQ,GACR,KAAK;AAEP,WAAW;GACT,IAAI,GACJ,IAAI,GACJ,OAAO;AAET,cAAc;GACZ,gBAAgB,GAChB,QAAQ,GACR,SAAS;AAEX,gBAAgB;GACd,MAAM,GACN,OAAO,GACP,OAAO,GACP,MAAM,GACN,QAAQ,GACR,MAAM,GACN,SAAS,GACT,QAAQ,GACR,MAAM,GACN,OAAO,GACP,SAAS,GACT,iBAAiB,GACjB,kBAAkB,GAClB,OAAO,GACP,OAAO,GACP,WAAW,GACX,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,QAAQ,GACR,SAAS,GACT,OAAO;AAET,UAAU;GACR,SAAS,GACT,OAAO,GACP,KAAK,GACL,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,UAAU,GACV,UAAU,GACV,YAAY,GACZ,UAAU,GACV,UAAU,GACV,WAAW,GACX,UAAU,GACV,OAAO,GACP,SAAS,GACT,KAAK,GACL,KAAK,GACL,OAAO,GACP,MAAM,GACN,YAAY,GACZ,gBAAgB,GAChB,OAAO;AAET,UAAU;GACR,KAAK,GACL,IAAI,GACJ,KAAK,GACL,QAAQ,GACR,KAAK,GACL,KAAK,GACL,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,KAAK,GACL,IAAI;AAEN,eAAe;GACb,IAAI,GACJ,SAAS;AAEX,YAAY;GACV,eAAe,GACf,UAAU,GACV,UAAU,GACV,OAAO;AAET,aAAa;GACX,UAAU;AAEZ,WAAW;GACT,OAAO,GACP,MAAM,GACN,OAAO,GACP,OAAO,GACP,OAAO,GACP,OAAO,GACP,KAAK,GACL,IAAI,GACJ,KAAK,GACL,OAAO,GACP,QAAQ,GACR,IAAI,GACJ,OAAO,GACP,OAAO;AAET,cAAc;GACZ,WAAW,GACX,OAAO,GACP,QAAQ,GACR,MAAM,GACN,OAAO,GACP,YAAY,GACZ,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG;AAEL,aAAa;GACX,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG;AAEL,WAAW;GACT,WAAW,GACX,QAAQ,GACR,SAAS,GACT,WAAW,GACX,MAAM,GACN,SAAS,GACT,OAAO,GACP,SAAS,GACT,OAAO,GACP,MAAM,GACN,QAAQ,GACR,WAAW,GACX,WAAW,GACX,UAAU,GACV,WAAW,GACX,QAAQ,GACR,QAAQ,GACR,OAAO,GACP,WAAW,GACX,SAAS,GACT,UAAU,GACV,QAAQ,GACR,UAAU,GACV,QAAQ,GACR,WAAW,GACX,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,MAAM,GACN,SAAS,GACT,WAAW,GACX,SAAS,GACT,UAAU,GACV,OAAO,GACP,SAAS,GACT,UAAU,GACV,WAAW,GACX,SAAS,GACT,WAAW,GACX,SAAS,GACT,WAAW,GACX,YAAY,GACZ,WAAW,GACX,SAAS,GACT,WAAW,GACX,QAAQ,GACR,SAAS,GACT,QAAQ,GACR,OAAO,GACP,WAAW,GACX,SAAS,GACT,MAAM,GACN,OAAO,GACP,QAAQ,GACR,QAAQ,GACR,UAAU,GACV,QAAQ,GACR,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,UAAU,GACV,UAAU,GACV,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,SAAS,GACT,QAAQ,GACR,SAAS,GACT,WAAW,GACX,UAAU,GACV,SAAS,GACT,SAAS,GACT,WAAW,GACX,SAAS,GACT,QAAQ,GACR,SAAS,GACT,SAAS,GACT,IAAI,GACJ,SAAS,GACT,UAAU,GACV,OAAO,GACP,SAAS,GACT,UAAU,GACV,QAAQ,GACR,OAAO,GACP,UAAU,GACV,QAAQ,GACR,UAAU,GACV,SAAS,GACT,cAAc,GACd,SAAS,GACT,WAAW,GACX,WAAW,GACX,WAAW,GACX,QAAQ,GACR,WAAW,GACX,aAAa,GACb,aAAa,GACb,SAAS,GACT,aAAa,GACb,UAAU,GACV,YAAY,GACZ,eAAe,GACf,SAAS,GACT,YAAY,GACZ,SAAS,GACT,SAAS,GACT,YAAY,GACZ,cAAc,GACd,aAAa,GACb,aAAa,GACb,UAAU,GACV,WAAW,GACX,WAAW,GACX,aAAa,GACb,YAAY,GACZ,WAAW;AAEb,eAAe;GACb,aAAa,GACb,WAAW,GACX,KAAK,GACL,SAAS,GACT,oBAAoB,GACpB,UAAU,GACV,mBAAmB,GACnB,SAAS,GACT,SAAS,GACT,UAAU,GACV,SAAS,GACT,QAAQ,GACR,kBAAkB,GAClB,WAAW,GACX,SAAS,GACT,cAAc,GACd,UAAU,GACV,sBAAsB,GACtB,sBAAsB,GACtB,oBAAoB,GACpB,iBAAiB,GACjB,oBAAoB,GACpB,qBAAqB,GACrB,YAAY,GACZ,UAAU,GACV,SAAS,GACT,aAAa,GACb,oBAAoB,GACpB,SAAS,GACT,gBAAgB,GAChB,WAAW,GACX,oBAAoB,GACpB,KAAK,GACL,mBAAmB,GACnB,QAAQ,GACR,UAAU,GACV,SAAS,GACT,SAAS,GACT,iBAAiB,GACjB,QAAQ,GACR,SAAS,GACT,aAAa,GACb,kBAAkB,GAClB,oBAAoB,GACpB,mBAAmB,GACnB,QAAQ,GACR,SAAS,GACT,eAAe,GACf,UAAU,GACV,gBAAgB,GAChB,SAAS,GACT,qBAAqB,GACrB,qBAAqB,GACrB,kBAAkB,GAClB,mBAAmB,GACnB,mBAAmB,GACnB,sBAAsB,GACtB,oBAAoB,GACpB,mBAAmB,GACnB,yBAAyB,GACzB,mBAAmB,GACnB,MAAM,GACN,kBAAkB,GAClB,wBAAwB,GACxB,sBAAsB,GACtB,sBAAsB,GACtB,uBAAuB,GACvB,qBAAqB,GACrB,qBAAqB,GACrB,uBAAuB,GACvB,mBAAmB,GACnB,QAAQ,GACR,mBAAmB,GACnB,mBAAmB,GACnB,QAAQ,GACR,uBAAuB,GACvB,QAAQ,GACR,sBAAsB,GACtB,QAAQ,GACR,sBAAsB,GACtB,OAAO,GACP,sBAAsB,GACtB,sBAAsB,GACtB,kBAAkB,GAClB,wBAAwB,GACxB,qBAAqB,GACrB,UAAU,GACV,mBAAmB,GACnB,yBAAyB,GACzB,iBAAiB,GACjB,uBAAuB,GACvB,iBAAiB,GACjB,oBAAoB,GACpB,iBAAiB,GACjB,kBAAkB,GAClB,qBAAqB,GACrB,mBAAmB,GACnB,sBAAsB,GACtB,oBAAoB,GACpB,eAAe,GACf,aAAa,GACb,aAAa,GACb,eAAe,GACf,eAAe,GACf,eAAe,GACf,uBAAuB,GACvB,gBAAgB,GAChB,mBAAmB,GACnB,sBAAsB,GACtB,qBAAqB,GACrB,kBAAkB,GAClB,wBAAwB,GACxB,uBAAuB,CAAC"}

package/package.json

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