math-exercises 1.3.38 → 1.3.40

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

@@ -3,6 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.getGeometricReasonUsage = exports.geometricReasonUsage = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.geometricReasonUsage = {
     id: 'geometricReasonUsage',
     connector: '=',
@@ -19,11 +21,40 @@ function getGeometricReasonUsage() {
     const startRank = (0, randint_1.randint)(0, 20);
     const askedRank = startRank + 1;
     const startValue = (0, randint_1.randint)(1, 10);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (startValue * reason).toString(),
+            isRightAnswer: true,
+        });
+        if (startValue + reason !== 4)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: (startValue + reason).toString(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < (startValue + reason === 4 ? n - 1 : n - 2); i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: startValue * (reason + (0, randint_1.randint)(-reason + 1, 6, [0])) + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: `$(u_n)$ est une suite géométrique de raison $q = ${reason}$ et on sait que $u_{${startRank}} = ${startValue}$. Calculer : `,
         startStatement: `u_{${askedRank}}`,
         answer: (startValue * reason).toString(),
         keys: ['q', 'n', 'u', 'underscore'],
+        getPropositions,
     };
     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;AAIhF,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,CAa5G"}
+{"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"}

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

@@ -3,6 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.getGeometricRecurrenceFormulaUsage = exports.geometricRecurrenceFormulaUsage = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
 exports.geometricRecurrenceFormulaUsage = {
     id: 'geometricRecurrenceFormulaUsage',
     connector: '=',
@@ -19,11 +21,40 @@ function getGeometricRecurrenceFormulaUsage(options) {
     const firstValue = (0, randint_1.randint)(1, 10);
     const reason = (0, randint_1.randint)(2, 10);
     const askedRank = firstRank + 1;
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: (firstValue * reason).toString(),
+            isRightAnswer: true,
+        });
+        if (firstValue + reason !== 4)
+            res.push({
+                id: (0, uuid_1.v4)() + '',
+                statement: (firstValue + reason).toString(),
+                isRightAnswer: false,
+            });
+        for (let i = 0; i < (firstValue + reason === 4 ? n - 1 : n - 2); i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: firstValue * (reason + (0, randint_1.randint)(-reason + 1, 6, [0])) + '',
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         instruction: `$(u_n)$ est une suite définie par $u_{n+1} = ${reason}\\times u_n$ et $u_{${firstRank}} = ${firstValue}$. Calculer :`,
         startStatement: `u_{${askedRank}}`,
         answer: (firstValue * reason).toString(),
         keys: ['q', 'n', 'u', 'underscore'],
+        getPropositions,
     };
     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":"AACA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGjD,eAAO,MAAM,kBAAkB,EAAE,QAUhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAWhD"}
+{"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"}

package/lib/exercises/squareRoots/simpifySquareRoot.js

@@ -2,7 +2,9 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getSimplifySquareRoot = exports.simplifySquareRoot = void 0;
 const squareRoot_1 = require("../../math/numbers/reals/squareRoot");
+const shuffle_1 = require("../../utils/shuffle");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
 exports.simplifySquareRoot = {
     id: 'simplifySqrt',
     connector: '=',
@@ -19,10 +21,37 @@ function getSimplifySquareRoot() {
         allowPerfectSquare: false,
         maxSquare: 11,
     });
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: squareRoot.simplify().toTree().toTex(),
+            isRightAnswer: true,
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const squareRoot = squareRoot_1.SquareRootConstructor.randomSimplifiable({
+                    allowPerfectSquare: false,
+                    maxSquare: 11,
+                });
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: squareRoot.simplify().toTree().toTex(),
+                    isRightAnswer: false,
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
     const question = {
         startStatement: squareRoot.toTree().toTex(),
         answer: squareRoot.simplify().toTree().toTex(),
         keys: [],
+        getPropositions,
     };
     return question;
 }

package/lib/math/geometry/point.d.ts

@@ -12,6 +12,7 @@ export declare class Point {
     getYnumber(): number;
     midpoint(B: Point, name?: string): Point;
     distanceTo(B: Point): number;
+    distanceToNode(B: Point): Node;
     equalTo(B: Point): boolean;
 }
 /**

package/lib/math/geometry/point.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"point.d.ts","sourceRoot":"","sources":["../../../src/math/geometry/point.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAO7C,8BAAsB,gBAAgB;CAMrC;AAED,qBAAa,KAAK;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,IAAI,CAAC;IACR,CAAC,EAAE,IAAI,CAAC;gBACI,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI;IAM1C,KAAK,IAAI,MAAM;IAIf,eAAe,IAAI,MAAM;IAIzB,UAAU,IAAI,MAAM;IAIpB,UAAU,IAAI,MAAM;IAIpB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,SAAM,GAAG,KAAK;IAQrC,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM;IAM5B,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO;CAG3B;AAED;;;;;;;;;;;;GAYG"}
+{"version":3,"file":"point.d.ts","sourceRoot":"","sources":["../../../src/math/geometry/point.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAS7C,8BAAsB,gBAAgB;CAMrC;AAED,qBAAa,KAAK;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,IAAI,CAAC;IACR,CAAC,EAAE,IAAI,CAAC;gBACI,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI;IAM1C,KAAK,IAAI,MAAM;IAIf,eAAe,IAAI,MAAM;IAIzB,UAAU,IAAI,MAAM;IAIpB,UAAU,IAAI,MAAM;IAIpB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,SAAM,GAAG,KAAK;IAQrC,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM;IAM5B,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAO9B,OAAO,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO;CAG3B;AAED;;;;;;;;;;;;GAYG"}

package/lib/math/geometry/point.js

@@ -1,9 +1,12 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Point = exports.PointConstructor = void 0;
+const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
 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 powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const substractNode_1 = require("../../tree/nodes/operators/substractNode");
 const simplify_1 = require("../../tree/parsers/simplify");
 const mathjs_1 = require("mathjs");
 class PointConstructor {
@@ -35,6 +38,12 @@ class Point {
         const dy = this.getYnumber() - B.getYnumber();
         return Math.sqrt(dx ** 2 + dy ** 2);
     }
+    distanceToNode(B) {
+        const dx = new substractNode_1.SubstractNode(this.x, B.x);
+        const dy = new substractNode_1.SubstractNode(this.y, B.y);
+        const sum = new addNode_1.AddNode(new powerNode_1.PowerNode(dx, new numberNode_1.NumberNode(2)), new powerNode_1.PowerNode(dy, new numberNode_1.NumberNode(2)));
+        return new sqrtNode_1.SqrtNode((0, simplify_1.simplifyNode)(sum));
+    }
     equalTo(B) {
         return this.getXnumber() === B.getXnumber() && this.getYnumber() === B.getYnumber();
     }

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

@@ -19,6 +19,7 @@ export declare class Polynomial {
     multiply(Q: Polynomial): Polynomial;
     opposite(): Polynomial;
     derivate(): Polynomial;
+    calculate(x: number): number;
     toTree(): Node;
     toTex(): string;
     toString(): 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;IAStB,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;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"}

package/lib/math/polynomials/polynomial.js

@@ -28,6 +28,7 @@ class Polynomial {
     }
     getRoots() { }
     add(P) {
+        var _a, _b;
         if (P.variable !== this.variable)
             throw Error("Can't add two polynomials with different variables");
         const newDegree = P.degree === this.degree && P.coefficients[P.degree] === -this.coefficients[this.degree]
@@ -35,7 +36,7 @@ class Polynomial {
             : Math.max(P.degree, this.degree);
         const res = [];
         for (let i = 0; i < newDegree + 1; i++) {
-            res[i] = P.coefficients[i] + this.coefficients[i];
+            res[i] = ((_a = P.coefficients[i]) !== null && _a !== void 0 ? _a : 0) + ((_b = this.coefficients[i]) !== null && _b !== void 0 ? _b : 0);
         }
         return new Polynomial(res, this.variable);
     }
@@ -66,6 +67,12 @@ class Polynomial {
             res.push(i * this.coefficients[i]);
         return new Polynomial(res, this.variable);
     }
+    calculate(x) {
+        let res = 0;
+        for (let i = 0; i < this.coefficients.length; i++)
+            res += x ** i * this.coefficients[i];
+        return res;
+    }
     toTree() {
         const recursive = (cursor) => {
             const coeff = this.coefficients[cursor];

package/lib/server.js

@@ -26,26 +26,22 @@ const runServer = () => {
             questions,
         });
     });
-    /*console.log(new Droite('D', new NumberNode(2), new NumberNode(-1)).toEquationExpression());
-    console.log(
-      PointConstructor.fromTwoPoints(
-        new Point('A', new NumberNode(0), new NumberNode(-1)),
-        new Point('B', new NumberNode(1), new NumberNode(1)),
-      ).toEquationExpression(),
-    );
-    console.log(
-      PointConstructor.fromPointAndSlope(
-        new Point('A', new NumberNode(0), new NumberNode(-1)),
-        new NumberNode(2),
-      ).toEquationExpression(),
-    );
-    console.log(
-      PointConstructor.fromPointAndAngle(
-        new Point('A', new NumberNode(0), new NumberNode(-1)),
-        new NumberNode(1.107),
-      ).toEquationExpression(),
-    );*/
-    //console.log(leadingCoefficient.generator(2));
+    app.get('/qcmExo', (req, res) => {
+        const exoId = req.query.exoId;
+        const exo = allExercises.find((exo) => exo.id == exoId);
+        if (!exo)
+            res.send('Exo not found');
+        const questions = exo === null || exo === void 0 ? void 0 : exo.generator(10);
+        console.log(questions);
+        const populatedQuestions = questions === null || questions === void 0 ? void 0 : questions.map((q) => {
+            var _a;
+            return Object.assign(Object.assign({}, q), { propositions: (_a = q.getPropositions) === null || _a === void 0 ? void 0 : _a.call(q, 4) });
+        });
+        res.json({
+            exercise: exo,
+            questions: populatedQuestions,
+        });
+    });
     app.listen('5000', () => {
         console.log(`[server]: Server is running at http://localhost:5000`);
     });

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "1.3.38",
+  "version": "1.3.40",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [
@@ -17,12 +17,16 @@
   "author": "Heureux Hasard",
   "license": "ISC",
   "dependencies": {
-    "mathjs": "^11.5.1"
+    "mathjs": "^11.5.1",
+    "uuidv4": "^6.2.13"
   },
   "devDependencies": {
     "@types/cors": "^2.8.13",
     "@types/express": "^4.17.17",
     "@types/node": "^18.11.9",
+    "cors": "^2.8.5",
+    "dotenv": "^16.0.3",
+    "express": "^4.18.2",
     "nodemon": "^2.0.20",
     "prettier": "^2.8.4",
     "ts-node": "^10.9.1",
@@ -31,10 +35,7 @@
     "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"
+    "typescript": "^4.9.3"
   },
   "repository": {
     "type": "git",

package/lib/exercises/geometry/cartesian/derivativeNumberReading.d.ts

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

package/lib/exercises/geometry/cartesian/derivativeNumberReading.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"derivativeNumberReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/derivativeNumberReading.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS9D,eAAO,MAAM,uBAAuB,EAAE,QASrC,CAAC;AAEF,wBAAgB,0BAA0B,IAAI,QAAQ,CAoCrD"}

package/lib/exercises/geometry/cartesian/derivativeNumberReading.js

@@ -1,51 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getDerivativeNumberReading = exports.derivativeNumberReading = void 0;
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const droite_1 = require("../../../math/geometry/droite");
-const point_1 = require("../../../math/geometry/point");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const randint_1 = require("../../../math/utils/random/randint");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const mathjs_1 = require("mathjs");
-exports.derivativeNumberReading = {
-    id: 'derivativeNumberReading',
-    connector: '=',
-    instruction: '',
-    label: 'Lecture de nombre dérivé',
-    levels: ['3', '2', '1'],
-    isSingleStep: false,
-    section: 'Géométrie cartésienne',
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDerivativeNumberReading, nb),
-};
-function getDerivativeNumberReading() {
-    let xA, yA, xB, yB;
-    let pointA, pointB;
-    do {
-        [xA, yA] = [1, 2].map((el) => (0, randint_1.randint)(-5, 6));
-        xB = xA > 0 ? (0, randint_1.randint)(xA - 4, 6) : (0, randint_1.randint)(-4, xA + 5); // l'écart entre les deux points ne soit pas grand
-        yB = yA > 0 ? (0, randint_1.randint)(yA - 4, 6) : (0, randint_1.randint)(-4, yA + 5);
-        pointA = new point_1.Point('A', new numberNode_1.NumberNode(xA), new numberNode_1.NumberNode(yA));
-        pointB = new point_1.Point('B', new numberNode_1.NumberNode(xB), new numberNode_1.NumberNode(yB));
-    } while (xB - xA === 0);
-    const droite = droite_1.DroiteConstructor.fromTwoPoints(pointA, pointB, 'D');
-    const [a, b] = [(3 * (0, randint_1.randint)(-100, 100, [0])) / 100, (2 * (0, randint_1.randint)(-4, 5)) / 100];
-    const c = (0, mathjs_1.evaluate)(droite.a.toMathString()) - a * Math.pow(xA, 2) - b * xA;
-    const d = yA - (a / 3) * Math.pow(xA, 3) - (b / 2) * Math.pow(xA, 2) - xA * c;
-    const polynome = new polynomial_1.Polynomial([d, c, b / 2, a / 3]);
-    const instruction = `Ci-dessous sont tracées la courbe de la fonction $f$ et la tangente à cette courbe au point d'abscisse $${xA}$.$\\\\$ Déterminer le coefficient directeur de la tangente qui passe par ce point.`;
-    const commands = [
-        polynome.toString(),
-        `g(x) = (${droite.a.toMathString()}) * x + (${droite.b.toMathString()})`,
-        `(${xA},${yA})`,
-    ];
-    const question = {
-        instruction,
-        startStatement: 'a',
-        answer: droite.getLeadingCoefficient(),
-        commands,
-        coords: [xA - 5, xA + 5, yA - 5, yA + 5],
-    };
-    return question;
-}
-exports.getDerivativeNumberReading = getDerivativeNumberReading;

package/lib/exercises/geometry/cartesian/derivativeNumberReading2.d.ts

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

package/lib/exercises/geometry/cartesian/derivativeNumberReading2.d.ts.map

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

package/lib/exercises/geometry/cartesian/derivativeNumberReading2.js

@@ -1,91 +0,0 @@
-"use strict";
-/*import { Exercise, Question } from '../../../exercises/exercise';
-import { getDistinctQuestions } from '../../../exercises/utils/getDistinctQuestions';
-import { DroiteConstructor } from '../../../math/geometry/droite';
-import { Point } from '../../../math/geometry/point';
-import { Polynomial } from '../../../math/polynomials/polynomial';
-import { randint } from '../../../math/utils/random/randint';
-import { NumberNode } from '../../../tree/nodes/numbers/numberNode';
-import { evaluate } from 'mathjs';
-
-export const derivativeNumberReading2: Exercise = {
-  id: 'derivativeNumberReading2',
-  connector: '=',
-  instruction: '',
-  label: 'Lecture de nombre dérivé 2',
-  levels: ['3', '2', '1'],
-  isSingleStep: false,
-  section: 'Géométrie cartésienne',
-  generator: (nb: number) => getDistinctQuestions(getDerivativeNumberReading, nb),
-};
-
-export function getDerivativeNumberReading(): Question {
-  function computePolynomial(
-    x0: number,
-    y0: number,
-    m: number,
-    x1: number,
-    y1: number,
-    x2: number,
-    y2: number,
-    x3: number,
-    y3: number,
-  ): [number, number, number, number] {
-    const a = (-2 * x0 * x1 * x2 + x0 * x1 * x3 + x0 * x2 * x3 + x1 * x2 * x3) / ((x0 - x1) * (x0 - x2) * (x0 - x3));
-    const b =
-      ((y0 - y1) / ((x0 - x1) * (x0 - x1)) -
-        (y0 - y2) / ((x0 - x2) * (x0 - x2)) +
-        (y0 - y3) / ((x0 - x3) * (x0 - x3))) /
-      (x0 - x1);
-    const c =
-      ((m - 2 * a * x0 - b) * (x0 - x1) * (x0 - x2) * (x0 - x3) -
-        (y0 - y1) / ((x0 - x1) * (x0 - x1)) +
-        a * (x1 * x1 * (x0 - x2) + x2 * x2 * (x0 - x1) - 2 * x1 * x2 * x0) +
-        b * (x1 + x2 - 2 * x0)) /
-      ((x0 - x2) * (x0 - x3));
-    const d = y0 - a * x0 * x0 * x0 - b * x0 * x0 - c * x0;
-    return [a, b, c, d];
-  }
-
-  function generatePolynomial(
-    x0: number,
-    y0: number,
-    m: number,
-    x1: number,
-    y1: number,
-    x2: number,
-    y2: number,
-    x3: number,
-    y3: number,
-  ): Polynomial {
-    const [a, b, c, d] = computePolynomial(x0, y0, m, x1, y1, x2, y2, x3, y3);
-    return new Polynomial([d, c, b, a]);
-  }
-
-  const [x1, y1, x2, y2, x3, y3] = [1, 2, 3, 4, 5, 6].map((el) => randint(-5, 6));
-
-  let xA: number, yA, xB, yB: number;
-  let pointA, pointB: Point;
-  do {
-    [xA, yA] = [1, 2].map((el) => randint(-5, 6));
-    xB = xA > 0 ? randint(xA - 4, 6) : randint(-4, xA + 5); // l'écart entre les deux points ne soit pas grand
-    yB = yA > 0 ? randint(yA - 4, 6) : randint(-4, yA + 5);
-    pointA = new Point('A', new NumberNode(xA), new NumberNode(yA));
-    pointB = new Point('B', new NumberNode(xB), new NumberNode(yB));
-  } while (xB - xA === 0);
-
-  const droite = DroiteConstructor.fromTwoPoints(pointA, pointB, 'D');
-
-  const polynome = generatePolynomial(xA, yA, evaluate(droite.a.toMathString()), x1, y1, x2, y2, x3, y3);
-
-  let instruction = `$f(x) = ${polynome.toTex()}$, $${pointA.toTexWithCoords()}$, $${pointB.toTexWithCoords()}$, $f'(${xA}) = ${droite.getLeadingCoefficient()}$`;
-
-  const question: Question = {
-    instruction,
-    //startStatement: pointA.toTexWithCoords() + ' ' + pointB.toTexWithCoords(),
-    answer: droite.a.toTex(),
-  };
-
-  return question;
-}
-*/

package/lib/exercises/geometry/euclidean/TriangleArea.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"triangleArea.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/triangleArea.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM9D,eAAO,MAAM,YAAY,EAAE,QAS1B,CAAC;AAEF,wBAAgB,eAAe,IAAI,QAAQ,CA4C1C"}