math-exercises 1.3.33 → 1.3.36

package/lib/tree/parsers/simplify.js

@@ -1,52 +1,52 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.simplifyNode = void 0;
-const mathjs_1 = require("mathjs");
-const oppositeNode_1 = require("../nodes/functions/oppositeNode");
-const sqrtNode_1 = require("../nodes/functions/sqrtNode");
-const numberNode_1 = require("../nodes/numbers/numberNode");
-const piNode_1 = require("../nodes/numbers/piNode");
-const addNode_1 = require("../nodes/operators/addNode");
-const fractionNode_1 = require("../nodes/operators/fractionNode");
-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 simplifyNode = (node) => {
-    return mathjsNodeToNode((0, mathjs_1.simplify)(node.toMathString()));
-};
-exports.simplifyNode = simplifyNode;
-const mathjsNodeToNode = (mathjsNode) => {
-    if (mathjsNode.isSymbolNode) {
-        if (mathjsNode.name === 'pi')
-            return piNode_1.PiNode;
-        return new variableNode_1.VariableNode(mathjsNode.name);
-    }
-    else if (mathjsNode.isConstantNode) {
-        return new numberNode_1.NumberNode(mathjsNode.value);
-    }
-    else if (mathjsNode.isOperatorNode) {
-        switch (mathjsNode.fn) {
-            case 'add':
-                return new addNode_1.AddNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-            case 'subtract':
-                return new substractNode_1.SubstractNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-            case 'unaryMinus':
-                return new oppositeNode_1.OppositeNode(mathjsNodeToNode(mathjsNode.args[0]));
-            case 'divide':
-                return new fractionNode_1.FractionNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-            case 'multiply':
-                return new multiplyNode_1.MultiplyNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-            case 'pow':
-                return new powerNode_1.PowerNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-        }
-    }
-    else if (mathjsNode.isFunctionNode) {
-        const fn = mathjsNode.fn;
-        switch (fn.name) {
-            case 'sqrt':
-                return new sqrtNode_1.SqrtNode(mathjsNodeToNode(mathjsNode.args[0]));
-        }
-    }
-    throw Error('unrecognized mathjs node');
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.simplifyNode = void 0;
+const mathjs_1 = require("mathjs");
+const oppositeNode_1 = require("../nodes/functions/oppositeNode");
+const sqrtNode_1 = require("../nodes/functions/sqrtNode");
+const numberNode_1 = require("../nodes/numbers/numberNode");
+const piNode_1 = require("../nodes/numbers/piNode");
+const addNode_1 = require("../nodes/operators/addNode");
+const fractionNode_1 = require("../nodes/operators/fractionNode");
+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 simplifyNode = (node) => {
+    return mathjsNodeToNode((0, mathjs_1.simplify)(node.toMathString()));
+};
+exports.simplifyNode = simplifyNode;
+const mathjsNodeToNode = (mathjsNode) => {
+    if (mathjsNode.isSymbolNode) {
+        if (mathjsNode.name === 'pi')
+            return piNode_1.PiNode;
+        return new variableNode_1.VariableNode(mathjsNode.name);
+    }
+    else if (mathjsNode.isConstantNode) {
+        return new numberNode_1.NumberNode(mathjsNode.value);
+    }
+    else if (mathjsNode.isOperatorNode) {
+        switch (mathjsNode.fn) {
+            case 'add':
+                return new addNode_1.AddNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
+            case 'subtract':
+                return new substractNode_1.SubstractNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
+            case 'unaryMinus':
+                return new oppositeNode_1.OppositeNode(mathjsNodeToNode(mathjsNode.args[0]));
+            case 'divide':
+                return new fractionNode_1.FractionNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
+            case 'multiply':
+                return new multiplyNode_1.MultiplyNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
+            case 'pow':
+                return new powerNode_1.PowerNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
+        }
+    }
+    else if (mathjsNode.isFunctionNode) {
+        const fn = mathjsNode.fn;
+        switch (fn.name) {
+            case 'sqrt':
+                return new sqrtNode_1.SqrtNode(mathjsNodeToNode(mathjsNode.args[0]));
+        }
+    }
+    throw Error('unrecognized mathjs node');
+};

package/lib/utils/arrayEqual.d.ts

@@ -1,2 +1,2 @@
-export declare function arrayEqual<T>(arr1: T[], arr2: T[]): boolean;
+export declare function arrayEqual<T>(arr1: T[], arr2: T[]): boolean;
 //# sourceMappingURL=arrayEqual.d.ts.map

package/lib/utils/arrayEqual.js

@@ -1,13 +1,13 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrayEqual = void 0;
-function arrayEqual(arr1, arr2) {
-    if (arr1.length !== arr2.length)
-        return false;
-    for (let i = 0; i < arr1.length; i++) {
-        if (arr1[i] !== arr2[i])
-            return false;
-    }
-    return true;
-}
-exports.arrayEqual = arrayEqual;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrayEqual = void 0;
+function arrayEqual(arr1, arr2) {
+    if (arr1.length !== arr2.length)
+        return false;
+    for (let i = 0; i < arr1.length; i++) {
+        if (arr1[i] !== arr2[i])
+            return false;
+    }
+    return true;
+}
+exports.arrayEqual = arrayEqual;

package/lib/utils/coinFlip.d.ts

@@ -1,2 +1,2 @@
-export declare const coinFlip: () => Boolean;
+export declare const coinFlip: () => Boolean;
 //# sourceMappingURL=coinFlip.d.ts.map

package/lib/utils/coinFlip.js

@@ -1,7 +1,7 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.coinFlip = void 0;
-const coinFlip = () => {
-    return Math.random() < 0.5;
-};
-exports.coinFlip = coinFlip;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.coinFlip = void 0;
+const coinFlip = () => {
+    return Math.random() < 0.5;
+};
+exports.coinFlip = coinFlip;

package/lib/utils/random.d.ts

@@ -1,2 +1,2 @@
-export declare function random<t>(array: t[]): t;
+export declare function random<t>(array: t[]): t;
 //# sourceMappingURL=random.d.ts.map

package/lib/utils/random.js

@@ -1,7 +1,7 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.random = void 0;
-function random(array) {
-    return array[Math.floor(Math.random() * array.length)];
-}
-exports.random = random;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.random = void 0;
+function random(array) {
+    return array[Math.floor(Math.random() * array.length)];
+}
+exports.random = random;

package/lib/utils/shuffle.d.ts

@@ -1,2 +1,2 @@
-export declare function shuffle<T>(array: T[]): T[];
+export declare function shuffle<T>(array: T[]): T[];
 //# sourceMappingURL=shuffle.d.ts.map

package/lib/utils/shuffle.js

@@ -1,15 +1,15 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.shuffle = void 0;
-/* Randomize array in-place using Durstenfeld shuffle algorithm */
-function shuffle(array) {
-    const res = [...array];
-    for (var i = res.length - 1; i > 0; i--) {
-        var j = Math.floor(Math.random() * (i + 1));
-        var temp = res[i];
-        res[i] = res[j];
-        res[j] = temp;
-    }
-    return res;
-}
-exports.shuffle = shuffle;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.shuffle = void 0;
+/* Randomize array in-place using Durstenfeld shuffle algorithm */
+function shuffle(array) {
+    const res = [...array];
+    for (var i = res.length - 1; i > 0; i--) {
+        var j = Math.floor(Math.random() * (i + 1));
+        var temp = res[i];
+        res[i] = res[j];
+        res[j] = temp;
+    }
+    return res;
+}
+exports.shuffle = shuffle;

package/package.json

@@ -1,50 +1,50 @@
-{
-  "name": "math-exercises",
-  "version": "1.3.33",
-  "description": "Math exercises generator for middle school and high school",
-  "main": "lib/index.js",
-  "files": [
-    "lib/**/*"
-  ],
-  "scripts": {
-    "dev": "nodemon",
-    "start": "ts-node -r tsconfig-paths/register src/index.ts",
-    "test": "echo \"Error: no test specified\" && exit 1",
-    "prepublishOnly": "npm run build",
-    "build": "tsc && tsc-alias"
-  },
-  "keywords": [],
-  "author": "Heureux Hasard",
-  "license": "ISC",
-  "dependencies": {
-    "mathjs": "^11.5.1"
-  },
-  "devDependencies": {
-    "@types/cors": "^2.8.13",
-    "@types/express": "^4.17.17",
-    "@types/node": "^18.11.9",
-    "nodemon": "^2.0.20",
-    "prettier": "^2.8.4",
-    "ts-node": "^10.9.1",
-    "ts-node-dev": "^2.0.0",
-    "tsc-alias": "^1.8.2",
-    "tsconfig-paths": "^4.1.2",
-    "tslint": "^6.1.3",
-    "tslint-config-prettier": "^1.18.0",
-    "typescript": "^4.9.3",
-    "cors": "^2.8.5",
-    "dotenv": "^16.0.3",
-    "express": "^4.18.2"
-  },
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/krirkrirk/math-exercises.git"
-  },
-  "bugs": {
-    "url": "https://github.com/krirkrirk/math-exercises/issues"
-  },
-  "homepage": "https://github.com/krirkrirk/math-exercises#readme",
-  "exports": {
-    ".": "./lib/index.js"
-  }
-}
+{
+  "name": "math-exercises",
+  "version": "1.3.36",
+  "description": "Math exercises generator for middle school and high school",
+  "main": "lib/index.js",
+  "files": [
+    "lib/**/*"
+  ],
+  "scripts": {
+    "dev": "nodemon",
+    "start": "ts-node -r tsconfig-paths/register src/index.ts",
+    "test": "echo \"Error: no test specified\" && exit 1",
+    "prepublishOnly": "npm run build",
+    "build": "tsc && tsc-alias"
+  },
+  "keywords": [],
+  "author": "Heureux Hasard",
+  "license": "ISC",
+  "dependencies": {
+    "mathjs": "^11.5.1"
+  },
+  "devDependencies": {
+    "@types/cors": "^2.8.13",
+    "@types/express": "^4.17.17",
+    "@types/node": "^18.11.9",
+    "nodemon": "^2.0.20",
+    "prettier": "^2.8.4",
+    "ts-node": "^10.9.1",
+    "ts-node-dev": "^2.0.0",
+    "tsc-alias": "^1.8.2",
+    "tsconfig-paths": "^4.1.2",
+    "tslint": "^6.1.3",
+    "tslint-config-prettier": "^1.18.0",
+    "typescript": "^4.9.3",
+    "cors": "^2.8.5",
+    "dotenv": "^16.0.3",
+    "express": "^4.18.2"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/krirkrirk/math-exercises.git"
+  },
+  "bugs": {
+    "url": "https://github.com/krirkrirk/math-exercises/issues"
+  },
+  "homepage": "https://github.com/krirkrirk/math-exercises#readme",
+  "exports": {
+    ".": "./lib/index.js"
+  }
+}

package/lib/exercises/calcul/operationsPriorities.js

@@ -1,88 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getPriorityQuestions = exports.operationsPriorities = void 0;
-const randint_1 = require("../../mathutils/random/randint");
-const latexParser_1 = require("../../tree/parsers/latexParser");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const divideNode_1 = require("../../tree/nodes/operators/divideNode");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const coin_1 = require("../../utils/coin");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-/**
- * a*b ±c±d
- * a/b ±c±d
- * a*b*c ± d
- * a*b±c*d
- * a/b ± c*d
- */
-exports.operationsPriorities = {
-    id: "operationsPriorities",
-    connector: "=",
-    instruction: "Calculer :",
-    label: "Priorités opératoires",
-    levels: ["6", "5", "4"],
-    section: "Calculs",
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPriorityQuestions, nb),
-};
-function getPriorityQuestions() {
-    const type = (0, randint_1.randint)(1, 6);
-    let statement;
-    let answer = "";
-    let a, b, c, d;
-    switch (type) {
-        case 1: // a*b ±c±d
-            [c, d] = [1, 2, 3, 4].map((el) => (0, randint_1.randint)(-10, 11, [0]));
-            [a, b] = [1, 2].map((el) => (0, randint_1.randint)(-10, 11));
-            statement = (0, coin_1.coin)()
-                ? //a*b first ou last
-                    new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b)), new addNode_1.AddNode(new numberNode_1.NumberNode(c), new numberNode_1.NumberNode(d))).shuffle()
-                : //a*b middle
-                    new addNode_1.AddNode(new addNode_1.AddNode(new numberNode_1.NumberNode(c), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b))), new numberNode_1.NumberNode(d));
-            answer = (a * b + c + d).toString();
-            break;
-        case 2: // a/b ±c±d
-            [b, c, d] = [1, 2, 3].map((el) => (0, randint_1.randint)(-10, 11, [0]));
-            a = b * (0, randint_1.randint)(0, 11);
-            statement = (0, coin_1.coin)()
-                ? //a/b first ou last
-                    new addNode_1.AddNode(new divideNode_1.DivideNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b)), new addNode_1.AddNode(new numberNode_1.NumberNode(c), new numberNode_1.NumberNode(d))).shuffle()
-                : //a/b middle
-                    new addNode_1.AddNode(new addNode_1.AddNode(new numberNode_1.NumberNode(c), new divideNode_1.DivideNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b))), new numberNode_1.NumberNode(d));
-            answer = (a / b + c + d).toString();
-            break;
-        case 3: // a*b ± c*d
-            [a, b, c, d] = [1, 2, 3, 4].map((el) => (0, randint_1.randint)(-10, 11));
-            statement = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b)), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(c), new numberNode_1.NumberNode(d)));
-            answer = (a * b + c * d).toString();
-            break;
-        case 4: // a*b ± c/d
-            [a, b] = [1, 2].map((el) => (0, randint_1.randint)(-10, 11));
-            d = (0, randint_1.randint)(-10, 11, [0]);
-            c = d * (0, randint_1.randint)(0, 11);
-            statement = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b)), new divideNode_1.DivideNode(new numberNode_1.NumberNode(c), new numberNode_1.NumberNode(d))).shuffle();
-            answer = (a * b + c / d).toString();
-            break;
-        case 5: // a/b ± c/d
-            [b, d] = [1, 2].map((el) => (0, randint_1.randint)(-10, 11, [0]));
-            a = b * (0, randint_1.randint)(0, 11);
-            c = d * (0, randint_1.randint)(0, 11);
-            statement = new addNode_1.AddNode(new divideNode_1.DivideNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b)), new divideNode_1.DivideNode(new numberNode_1.NumberNode(c), new numberNode_1.NumberNode(d)));
-            answer = (a / b + c / d).toString();
-            break;
-        case 5: // a*b*c ± d
-            [b, d] = [1, 2].map((el) => (0, randint_1.randint)(-10, 11, [0]));
-            a = b * (0, randint_1.randint)(0, 11);
-            c = d * (0, randint_1.randint)(0, 11);
-            statement = new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new numberNode_1.NumberNode(b)), new numberNode_1.NumberNode(c)), new numberNode_1.NumberNode(d)).shuffle();
-            answer = (a * b * c + d).toString();
-            break;
-    }
-    const question = {
-        startStatement: (0, latexParser_1.latexParser)(statement),
-        answer: answer,
-    };
-    return question;
-}
-exports.getPriorityQuestions = getPriorityQuestions;

package/lib/exercises/derivation/derivative/affineDerivative.d.ts

@@ -1,4 +0,0 @@
-import { Exercise, Question } from '../../../exercises/exercise';
-export declare const affineDerivative: Exercise;
-export declare function getAffineDerivativeQuestion(): Question;
-//# sourceMappingURL=affineDerivative.d.ts.map

package/lib/exercises/derivation/derivative/affineDerivative.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"affineDerivative.d.ts","sourceRoot":"","sources":["../../../../src/exercises/derivation/derivative/affineDerivative.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ9D,eAAO,MAAM,gBAAgB,EAAE,QAS9B,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CAUtD"}

package/lib/exercises/derivation/derivative/affineDerivative.js

@@ -1,27 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getAffineDerivativeQuestion = exports.affineDerivative = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-exports.affineDerivative = {
-    id: 'affineDerivative',
-    connector: '=',
-    instruction: '',
-    isSingleStep: false,
-    label: "Calculer la dérivée d'une fonction affine",
-    levels: ['1, 0'],
-    section: 'Dérivation',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAffineDerivativeQuestion, nb),
-};
-function getAffineDerivativeQuestion() {
-    const a = (0, randint_1.randint)(-20, 20, [0]);
-    const b = (0, randint_1.randint)(-20, 20);
-    const affine = new affine_1.Affine(a, b);
-    return {
-        instruction: `Soit $f(x) = ${affine.toTex()}$. Déterminer la fonction dérivée $f'$ de $f$.`,
-        startStatement: `f'(x)`,
-        answer: a.toString(),
-    };
-}
-exports.getAffineDerivativeQuestion = getAffineDerivativeQuestion;

package/lib/exercises/derivation/derivative/thridDegreeDerivative.d.ts

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

package/lib/exercises/derivation/derivative/thridDegreeDerivative.d.ts.map

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

package/lib/exercises/derivation/derivative/thridDegreeDerivative.js

@@ -1 +0,0 @@
-"use strict";

package/lib/geometry/point.js

@@ -1,27 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Point = exports.PointConstructor = void 0;
-const numberNode_1 = require("../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../tree/nodes/operators/addNode");
-const fractionNode_1 = require("../tree/nodes/operators/fractionNode");
-const simplify_1 = require("../tree/parsers/simplify");
-class PointConstructor {
-}
-exports.PointConstructor = PointConstructor;
-class Point {
-    constructor(name, x, y) {
-        this.name = name;
-        this.x = x;
-        this.y = y;
-    }
-    toTex() {
-        return `${this.name}`;
-    }
-    toTexWithCoords() {
-        return `${this.name}\\left(${this.x.toTex()}; ${this.y.toTex()}\\right)`;
-    }
-    midpoint(B, name = 'I') {
-        return new Point(name, (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new addNode_1.AddNode(this.x, B.x), new numberNode_1.NumberNode(2))), (0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new addNode_1.AddNode(this.y, B.y), new numberNode_1.NumberNode(2))));
-    }
-}
-exports.Point = Point;

package/lib/geometry/vector.js

@@ -1,31 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Vector = exports.VectorConstructor = void 0;
-const addNode_1 = require("../tree/nodes/operators/addNode");
-const multiplyNode_1 = require("../tree/nodes/operators/multiplyNode");
-const substractNode_1 = require("../tree/nodes/operators/substractNode");
-const simplify_1 = require("../tree/parsers/simplify");
-class VectorConstructor {
-    static fromPoints(origin, end) {
-        return new Vector(`${origin.name}${end.name}`, new substractNode_1.SubstractNode(end.x, origin.x), new substractNode_1.SubstractNode(end.y, origin.y));
-    }
-}
-exports.VectorConstructor = VectorConstructor;
-class Vector {
-    constructor(name, x, y) {
-        this.name = name;
-        this.tex = `\\overrightarrow{${name}}`;
-        this.x = x;
-        this.y = y;
-    }
-    toTex() {
-        return `\\overrightarrow{${this.name}}`;
-    }
-    toTexWithCoords() {
-        return `\\overrightarrow{${this.name}}\\begin{pmatrix}${this.x.toTex()} \\\\ ${this.y.toTex()} \\end{pmatrix}`;
-    }
-    scalarProduct(v) {
-        return (0, simplify_1.simplifyNode)(new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(this.x, v.x), new multiplyNode_1.MultiplyNode(this.y, v.y)));
-    }
-}
-exports.Vector = Vector;

package/lib/mathutils/arithmetic/coprimesOf.js

@@ -1,13 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.coprimesOf = void 0;
-const gcd_1 = require("./gcd");
-const coprimesOf = (nb) => {
-    let coprimes = [];
-    for (let i = 2; i <= nb; i++) {
-        if ((0, gcd_1.gcd)(nb, i) === 1)
-            coprimes.push(i);
-    }
-    return coprimes;
-};
-exports.coprimesOf = coprimesOf;

package/lib/mathutils/arithmetic/dividersOf.js

@@ -1,12 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.dividersOf = void 0;
-const dividersOf = (nb) => {
-    let divisors = [];
-    for (let i = 1; i <= nb; i++) {
-        if (nb % i === 0)
-            divisors.push(i);
-    }
-    return divisors;
-};
-exports.dividersOf = dividersOf;

package/lib/mathutils/arithmetic/gcd.js

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.gcd = void 0;
-function gcd(a, b) {
-    return b ? gcd(b, a % b) : a;
-}
-exports.gcd = gcd;

package/lib/mathutils/arithmetic/isSquare.js

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.isSquare = void 0;
-const isSquare = (a) => {
-    return a > 0 && Math.sqrt(a) % 1 === 0;
-};
-exports.isSquare = isSquare;

package/lib/mathutils/arithmetic/lcd.js

@@ -1,12 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.lcd = void 0;
-function lcd(a, b) {
-    const max = Math.max(a, b);
-    for (let i = max; i < a * b; i++) {
-        if (i % a === 0 && i % b === 0)
-            return i;
-    }
-    return a * b;
-}
-exports.lcd = lcd;

package/lib/mathutils/arithmetic/nonCoprimesOf.js

@@ -1,13 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.nonCoprimesOf = void 0;
-const gcd_1 = require("./gcd");
-const nonCoprimesOf = (nb) => {
-    let nonCoprimes = [];
-    for (let i = 1; i <= nb; i++) {
-        if ((0, gcd_1.gcd)(nb, i) !== 1)
-            nonCoprimes.push(i);
-    }
-    return nonCoprimes;
-};
-exports.nonCoprimesOf = nonCoprimesOf;

package/lib/mathutils/arithmetic/nonDividersOf.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.nonDivisorOf = void 0;
-const dividersOf_1 = require("./dividersOf");
-const nonDivisorOf = (nb) => {
-    let nonDividers = [];
-    let dividers = (0, dividersOf_1.dividersOf)(nb);
-    for (let i = 2; i < nb; i++) {
-        if (nb % i !== 0)
-            nonDividers.push(i);
-    }
-    return nonDividers;
-};
-exports.nonDivisorOf = nonDivisorOf;

package/lib/mathutils/arithmetic/primeFactors.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.primeFactors = void 0;
-/***
- * returns array of prime factors
- * e.g 12 -> [2, 2, 3]
- */
-const primeFactors = (a) => {
-    const factors = [];
-    let divisor = 2;
-    while (a >= 2) {
-        if (a % divisor === 0) {
-            factors.push(divisor);
-            a = a / divisor;
-        }
-        else {
-            divisor++;
-        }
-    }
-    return factors;
-};
-exports.primeFactors = primeFactors;

package/lib/mathutils/decimals/decimalPartLengthOf.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.decimalPartLengthOf = void 0;
-const decimalPartLengthOf = (x) => {
-    function hasFraction(x) {
-        return Math.abs(Math.round(x) - x) > 1e-10;
-    }
-    let count = 0;
-    // multiply by increasing powers of 10 until the fractional part is ~ 0
-    while (hasFraction(x * 10 ** count) && isFinite(10 ** count))
-        count++;
-    return count;
-};
-exports.decimalPartLengthOf = decimalPartLengthOf;