math-exercises 2.0.13 → 2.0.14

package/lib/exercises/calcul/fractions/simplifyFraction.js

@@ -10,7 +10,7 @@ const getSimplifyFraction = () => {
     const rationalTex = rational.toTree().toTex();
     const answer = rational.simplify().toTree().toTex();
     const question = {
-        instruction: `Simplifier : $${rationalTex}$`,
+        instruction: `Mettre sous forme irréductible : $${rationalTex}$`,
         startStatement: rationalTex,
         answer,
         keys: [],

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"firstDegreeInequationsType0.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType0.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AAyDF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}
+{"version":3,"file":"firstDegreeInequationsType0.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType0.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AA2DF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.js

@@ -18,7 +18,7 @@ const getFirstDegreeInequationsQuestion = () => {
     const c = (0, randint_1.randint)(-10, 11);
     const result = c - affine.b;
     const ineqType = inequation_1.InequationSymbolConstructor.random();
-    const answer = `x${ineqType}${result}`;
+    const answer = `x${ineqType.symbol}${result}`;
     const question = {
         answer: answer,
         instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${c}$ `,
@@ -41,11 +41,13 @@ const getPropositions = (n, { answer, ineqType, b, c }) => {
     }
     return (0, shuffle_1.shuffle)(propositions);
 };
-const isAnswerValid = (ans, { ineqType, b, c }) => {
+const isAnswerValid = (ans, { answer, ineqType, b, c }) => {
     const result = c - b;
     const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(result)], ineqType);
-    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval());
-    const texs = answer.toAllValidTexs();
+    console.log(answer);
+    const tree = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval());
+    const texs = tree.toAllValidTexs();
+    console.log(texs);
     return texs.includes(ans);
 };
 exports.firstDegreeInequationsType0 = {

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType1.js

@@ -19,7 +19,7 @@ const getFirstDegreeInequationsQuestion = () => {
     const result = new rational_1.Rational(b, affine.a).simplify().toTree().toTex();
     const ineqType = inequation_1.InequationSymbolConstructor.random();
     const invIneqType = ineqType.reversed();
-    const answer = `x${affine.a > 0 ? ineqType : invIneqType}${result}`;
+    const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
     const question = {
         answer: answer,
         instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${b}$ `,

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.js

@@ -22,7 +22,7 @@ const getFirstDegreeInequationsQuestion = () => {
         .toTex();
     const ineqType = inequation_1.InequationSymbolConstructor.random();
     const invIneqType = ineqType.reversed();
-    const answer = `x${affine.a > 0 ? ineqType : invIneqType}${result}`;
+    const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
     const question = {
         answer: answer,
         instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${c}$ `,

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.js

@@ -23,7 +23,7 @@ const getFirstDegreeInequationsQuestion = () => {
     const coeff = affine1.a - affine2.a;
     const ineqType = inequation_1.InequationSymbolConstructor.random();
     const invIneqType = ineqType.reversed();
-    const answer = `x${coeff > 0 ? ineqType : invIneqType}${result}`;
+    const answer = `x${coeff > 0 ? ineqType.symbol : invIneqType}${result}`;
     const question = {
         answer: answer,
         instruction: `Résoudre l'inéquation : $${affine1.toTex()} ${ineqType} ${affine2.toTex()}$ `,

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

@@ -1 +1 @@
-{"version":3,"file":"massConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/massConversion.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,YAAY,EAQb,MAAM,aAAa,CAAC;AAGrB,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,MAAM,CAAC;IACxB,0BAA0B,EAAE,MAAM,CAAC;IACnC,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAuDF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAYpD,CAAC"}
+{"version":3,"file":"massConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/massConversion.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,YAAY,EAQb,MAAM,aAAa,CAAC;AAGrB,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,MAAM,CAAC;IACxB,0BAA0B,EAAE,MAAM,CAAC;IACnC,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AA0DF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAYpD,CAAC"}

package/lib/exercises/conversion/massConversion.js

@@ -8,6 +8,7 @@ const exercise_1 = require("../exercise");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
 const units = ["mg", "cg", "dg", "g", "dag", "hg", "kg"];
 const getMassConversion = () => {
+    console.log("mass conv gen");
     const randomUnitIndex = (0, randint_1.randint)(0, 7);
     const randomUnitInstructionIndex = (0, randint_1.randint)(0, 7, [randomUnitIndex]);
     const randomMass = decimal_1.DecimalConstructor.random(0, 1000, (0, randint_1.randint)(0, 4));
@@ -32,6 +33,7 @@ const getPropositions = (n, { answer, randomMass, randomUnitIndex, randomUnitIns
     (0, exercise_1.addValidProp)(propositions, answer);
     const massDecimal = new decimal_1.Decimal(randomMass);
     while (propositions.length < n) {
+        console.log("mass conv prop");
         const wrongAnswer = massDecimal
             .multiplyByPowerOfTen((0, randint_1.randint)(-3, 4, [randomUnitIndex - randomUnitInstructionIndex]))
             .value.toString()

package/lib/exercises/functions/affines/affineExpressionReading.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"affineExpressionReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/affineExpressionReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAWlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAgGF,eAAO,MAAM,uBAAuB,EAAE,YAAY,CAAC,WAAW,CAa7D,CAAC"}
+{"version":3,"file":"affineExpressionReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/affineExpressionReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AA2GF,eAAO,MAAM,uBAAuB,EAAE,YAAY,CAAC,WAAW,CAa7D,CAAC"}

package/lib/exercises/functions/affines/affineExpressionReading.js

@@ -45,12 +45,15 @@ const getAffineExpressionReadingQuestion = () => {
 const getPropositions = (n, { answer, b, secondPoint }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    const wrongAs = [
-        new rational_1.Rational(secondPoint[0], secondPoint[1] - b).simplify().toTree(),
-        new rational_1.Rational(secondPoint[1] + b, secondPoint[0]).simplify().toTree(),
-        new rational_1.Rational(secondPoint[0], secondPoint[1] + b).simplify().toTree(),
-        new rational_1.Rational(secondPoint[1] - secondPoint[0], b).simplify().toTree(),
-    ];
+    const wrongAs = [];
+    if (secondPoint[1] - b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] - b).simplify().toTree());
+    if (secondPoint[0] !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[1] + b, secondPoint[0]).simplify().toTree());
+    if (secondPoint[1] + b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] + b).simplify().toTree());
+    if (b !== 0)
+        wrongAs.push(new rational_1.Rational(secondPoint[1] - secondPoint[0], b).simplify().toTree());
     const fx = new variableNode_1.VariableNode("f(x)");
     const x = new variableNode_1.VariableNode("x");
     wrongAs.forEach((coeff) => {

package/lib/exercises/functions/trinoms/secondDegreeInequation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"secondDegreeInequation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/secondDegreeInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AA+FF,eAAO,MAAM,sBAAsB,EAAE,YAAY,CAAC,WAAW,CAa5D,CAAC"}
+{"version":3,"file":"secondDegreeInequation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/secondDegreeInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAa3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AAgHF,eAAO,MAAM,sBAAsB,EAAE,YAAY,CAAC,WAAW,CAa5D,CAAC"}

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

@@ -5,8 +5,10 @@ const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const inequation_1 = require("../../../math/inequations/inequation");
 const trinom_1 = require("../../../math/polynomials/trinom");
+const randint_1 = require("../../../math/utils/random/randint");
 const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
 const infiniteNode_1 = require("../../../tree/nodes/numbers/infiniteNode");
+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 getAnswer = ({ a, roots, ineqType }) => {
@@ -26,8 +28,15 @@ const getAnswer = ({ a, roots, ineqType }) => {
     return new inequationSolutionNode_1.InequationSolutionNode(tree);
 };
 const getSecondDegreeInequationQuestion = () => {
-    const trinom = trinom_1.TrinomConstructor.randomFactorized();
-    const roots = trinom.getRootsNode();
+    const a = (0, randint_1.randint)(-5, 6, [0]);
+    const x1 = (0, randint_1.randint)(-5, 6);
+    const x2 = (0, randint_1.randint)(-5, 6, [x1]);
+    const roots = x1 < x2
+        ? [new numberNode_1.NumberNode(x1), new numberNode_1.NumberNode(x2)]
+        : [new numberNode_1.NumberNode(x2), new numberNode_1.NumberNode(x1)];
+    const c = a * x1 * x2;
+    const b = -a * x2 - a * x1;
+    const trinom = new trinom_1.Trinom(a, b, c);
     const ineqType = inequation_1.InequationSymbolConstructor.random();
     const answer = getAnswer({ a: trinom.a, roots, ineqType }).toTex();
     const question = {
@@ -50,18 +59,22 @@ const getPropositions = (n, { answer, a, b, c, ineqType }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
     const roots = new trinom_1.Trinom(a, b, c).getRootsNode();
+    console.log("prop", roots.length);
     const ineq = new inequation_1.InequationSymbol(ineqType);
     (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer({ a: -a, ineqType: ineq, roots }).toTex());
     (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer({ a, ineqType: ineq.toStrictnessToggled(), roots }).toTex());
     (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer({ a: -a, ineqType: ineq.toStrictnessToggled(), roots }).toTex());
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
-const isAnswerValid = (ans, { a, b, c, ineqType }) => {
+const isAnswerValid = (ans, { answer, a, b, c, ineqType }) => {
     const trinom = new trinom_1.Trinom(a, b, c);
     const roots = trinom.getRootsNode();
+    console.log("vea", roots.length);
     const ineq = new inequation_1.InequationSymbol(ineqType);
     const tree = getAnswer({ a, ineqType: ineq, roots });
     const texs = tree.toAllValidTexs();
+    console.log("2ndIneq VEA texs", texs);
+    console.log("2ndIneq VEA Answer", answer);
     return texs.includes(ans);
 };
 exports.secondDegreeInequation = {

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

@@ -1 +1 @@
-{"version":3,"file":"squareRootsSum.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AA2EF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAapD,CAAC"}
+{"version":3,"file":"squareRootsSum.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AA+EF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAapD,CAAC"}

package/lib/exercises/squareRoots/squareRootsSum.js

@@ -55,13 +55,14 @@ const getPropositions = (n, { answer, b }) => {
     }
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
-const isAnswerValid = (ans, { a, b, c, d, y, x, z }) => {
+const isAnswerValid = (ans, { answer, a, b, c, d, y, x, z }) => {
     let coeff = a * Math.sqrt(x) + c * Math.sqrt(y);
     if (!!d && !!z) {
         coeff += d * Math.sqrt(z);
     }
-    const tree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b)));
+    const tree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b))).simplify();
     const texs = tree.toAllValidTexs();
+    console.log("vea SumSQRT answer: ", answer, "texs : ", texs);
     return texs.includes(ans);
 };
 exports.squareRootsSum = {

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

@@ -1 +1 @@
-{"version":3,"file":"trinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/trinom.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,oCAAoC,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAIvE,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAO1C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAEvE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAE/D,8BAAwB,iBAAiB;IACvC,MAAM,CAAC,MAAM,CACX,OAAO,GAAE,OAER,EACD,OAAO,GAAE,OAAqC,EAC9C,OAAO,GAAE,OAAqC,GAC7C,MAAM;IAST,MAAM,CAAC,eAAe,CACpB,OAAO,GAAE,OAER,EACD,WAAW,GAAE,OAAqC,EAClD,UAAU,GAAE,OAAqC,GAChD,MAAM;IAUT,MAAM,CAAC,gBAAgB,CACrB,OAAO,GAAE,OAER,EACD,QAAQ,GAAE,OAAqC,EAC/C,QAAQ,GAAE,OAAqC,GAC9C,MAAM;CAcV;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAQnE,QAAQ;IAGR,YAAY,IAAI,UAAU;IAI1B,QAAQ;IAUR,YAAY,IAAI,aAAa,EAAE;IAoD/B,2BAA2B;IAO3B,QAAQ;IAGR,YAAY;IAIZ,OAAO;IAIP,WAAW;IAIX,iBAAiB;IA4CjB,gBAAgB;IAsBhB,SAAS;CAGV"}
+{"version":3,"file":"trinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/trinom.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,oCAAoC,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAIvE,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAO1C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAEvE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAE/D,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,MAAM,CACX,OAAO,GAAE,OAER,EACD,OAAO,GAAE,OAAqC,EAC9C,OAAO,GAAE,OAAqC,GAC7C,MAAM;IAST,MAAM,CAAC,eAAe,CACpB,OAAO,GAAE,OAER,EACD,WAAW,GAAE,OAAqC,EAClD,UAAU,GAAE,OAAqC,GAChD,MAAM;IAUT,MAAM,CAAC,gBAAgB,CACrB,OAAO,GAAE,OAER,EACD,QAAQ,GAAE,OAAqC,EAC/C,QAAQ,GAAE,OAAqC,GAC9C,MAAM;CAcV;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAQnE,QAAQ;IAGR,YAAY,IAAI,UAAU;IAI1B,QAAQ;IAUR,YAAY,IAAI,aAAa,EAAE;IAoD/B,2BAA2B;IAO3B,QAAQ;IAGR,YAAY;IAIZ,OAAO;IAIP,WAAW;IAIX,iBAAiB;IA4CjB,gBAAgB;IAsBhB,SAAS;CAGV"}

package/package.json

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