math-exercises 1.3.64 → 1.3.66

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

@@ -1 +1 @@
-{"version":3,"file":"exercises.d.ts","sourceRoot":"","sources":["../../src/exercises/exercises.ts"],"names":[],"mappings":"AA+KA,eAAO,MAAM,SAAS,iCA8PrB,CAAC"}
+{"version":3,"file":"exercises.d.ts","sourceRoot":"","sources":["../../src/exercises/exercises.ts"],"names":[],"mappings":"AAiLA,eAAO,MAAM,SAAS,iCAmQrB,CAAC"}

package/lib/exercises/exercises.js

@@ -165,6 +165,8 @@ const inequalityToInterval_1 = require("./sets/intervals/inequalityToInterval");
 const setBelonging_1 = require("./sets/setBelonging");
 const intervalsUnion_1 = require("./sets/intervals/intervalsUnion");
 const intervalsIntersection_1 = require("./sets/intervals/intervalsIntersection");
+const sequencePolynomLimit_1 = require("./limits/sequencePolynomLimit");
+const sequenceRationalFracLimit_1 = require("./limits/sequenceRationalFracLimit");
 exports.exercises = [
     /**
      * calcul litteral
@@ -363,7 +365,6 @@ exports.exercises = [
     euclideanDivision_1.euclideanDivision,
     signFunction_1.signFunction,
     thirdDegreeFunctionVariation_1.thirdDegreeFunctionVariation,
-    polynomeLimit_1.polynomeLimit,
     equaDiffGeneralForme_1.exponentialDifferentialEquation,
     equaDiffGeneralFormeWithIC_1.exponentialDifferentialEquationWithIC,
     /**Stats */
@@ -396,4 +397,8 @@ exports.exercises = [
     setBelonging_1.setBelonging,
     intervalsUnion_1.intervalsUnion,
     intervalsIntersection_1.intervalsIntersection,
+    /**limites */
+    polynomeLimit_1.polynomeLimit,
+    sequencePolynomLimit_1.sequencePolynomLimit,
+    sequenceRationalFracLimit_1.sequenceRationalFracLimit,
 ];

package/lib/exercises/functions/basics/inverseImageFunctionGeogebra.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"inverseImageFunctionGeogebra.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/inverseImageFunctionGeogebra.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,4BAA4B,EAAE,QAY1C,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAsJ1D"}
+{"version":3,"file":"inverseImageFunctionGeogebra.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/basics/inverseImageFunctionGeogebra.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,4BAA4B,EAAE,QAY1C,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CA4J1D"}

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

@@ -141,7 +141,13 @@ function getInverseImageFunctionGeogebra() {
         }
         return (0, shuffle_1.shuffle)(res);
     };
-    const commands = [rand ? polynome1.toString() : polynome2.add(new polynomial_1.Polynomial([yValue])).toString()];
+    const commands = [
+        rand
+            ? polynome1.toString()
+            : yValue !== 0
+                ? polynome2.add(new polynomial_1.Polynomial([yValue])).toString()
+                : polynome2.toString(),
+    ];
     const question = {
         instruction: statement,
         answer: answer + '',

package/lib/exercises/limits/sequencePolynomLimit.d.ts

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

package/lib/exercises/limits/sequencePolynomLimit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequencePolynomLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,oBAAoB,EAAE,QAWlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAiD1D"}

package/lib/exercises/limits/sequencePolynomLimit.js

@@ -0,0 +1,63 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequencePolynomLimitQuestion = exports.sequencePolynomLimit = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.sequencePolynomLimit = {
+    id: 'sequencePolynomLimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une suite polynomiale",
+    levels: ['TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Limites'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getSequencePolynomLimitQuestion() {
+    const poly = polynomial_1.PolynomialConstructor.random(4, 'n');
+    const isPositiveInfinite = (0, coinFlip_1.coinFlip)();
+    const to = isPositiveInfinite ? '+\\infty' : '-\\infty';
+    const answer = poly.getLimit(to);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = '';
+                proposition = {
+                    id: (0, uuid_1.v4)() + ``,
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answer,
+        instruction: `Soit $u$ la suite définie par $u_n = ${poly
+            .toTree()
+            .toTex()}$. Déterminer $$\\lim_{n\\to ${to}}u_n$$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequencePolynomLimitQuestion = getSequencePolynomLimitQuestion;

package/lib/exercises/limits/sequenceRationalFracLimit.d.ts

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

package/lib/exercises/limits/sequenceRationalFracLimit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAS3E,eAAO,MAAM,yBAAyB,EAAE,QAWvC,CAAC;AAEF,wBAAgB,oCAAoC,IAAI,QAAQ,CAmE/D"}

package/lib/exercises/limits/sequenceRationalFracLimit.js

@@ -0,0 +1,79 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequenceRationalFracLimitQuestion = exports.sequenceRationalFracLimit = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../math/numbers/rationals/rational");
+const monom_1 = require("../../math/polynomials/monom");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.sequenceRationalFracLimit = {
+    id: 'sequenceRationalFracLimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une suite rationnelle",
+    levels: ['TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Limites'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getSequenceRationalFracLimitQuestion() {
+    const polyNum = polynomial_1.PolynomialConstructor.random(4, 'n');
+    const polyDenum = polynomial_1.PolynomialConstructor.random(4, 'n');
+    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
+    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
+    const isPositiveInfinite = (0, coinFlip_1.coinFlip)();
+    const to = isPositiveInfinite ? '+\\infty' : '-\\infty';
+    let answer;
+    if (polyDenum.degree === polyNum.degree) {
+        answer = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff).simplify().toTree().toTex();
+    }
+    else if (polyDenum.degree > polyNum.degree) {
+        answer = '0';
+    }
+    else {
+        const tempPoly = new monom_1.Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1, 'n');
+        answer = tempPoly.getLimit(to);
+    }
+    // sinon créer un polynome de coeff = leading coeff et degré = division des degrés
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = '';
+                proposition = {
+                    id: (0, uuid_1.v4)() + ``,
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer,
+        instruction: `Soit $u$ la suite définie par $u_n = \\dfrac{${polyNum.toTree().toTex()}}{${polyDenum
+            .toTree()
+            .toTex()}}$. Déterminer $$\\lim_{n\\to ${to}}u_n$$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequenceRationalFracLimitQuestion = getSequenceRationalFracLimitQuestion;

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

@@ -127,7 +127,7 @@ function getInequalityToIntervalQuestion() {
     const question = {
         answer,
         instruction: instruction,
-        keys: ['x', 'belongs', 'inf', 'sup', 'geq', 'leq', 'lbracket', 'rbracket', 'semicolon'],
+        keys: ['x', 'belongs', 'inf', 'sup', 'geq', 'leq', 'lbracket', 'rbracket', 'semicolon', 'infty'],
         getPropositions,
         answerFormat: 'tex',
     };

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

@@ -0,0 +1,5 @@
+import { Polynomial } from './polynomial';
+export declare class Monom extends Polynomial {
+    constructor(degree: number, coeff: number, variable?: string);
+}
+//# sourceMappingURL=monom.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"monom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/monom.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C,qBAAa,KAAM,SAAQ,UAAU;gBACvB,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;CAMlE"}

package/lib/math/polynomials/monom.js

@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Monom = void 0;
+const polynomial_1 = require("./polynomial");
+class Monom extends polynomial_1.Polynomial {
+    constructor(degree, coeff, variable = 'x') {
+        const coeffs = [];
+        for (let i = 0; i < degree; i++)
+            coeffs.push(0);
+        coeffs.push(coeff);
+        super(coeffs, variable);
+    }
+}
+exports.Monom = Monom;

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

@@ -1,5 +1,9 @@
 import { Node } from '../../tree/nodes/node';
 export declare function createRandomPolynomialWithOrder(order: number, variable?: string): Polynomial;
+export declare abstract class PolynomialConstructor {
+    static randomWithOrder(order: number, variable?: string): Polynomial;
+    static random(maxOrder: number, variable?: string): Polynomial;
+}
 export declare class Polynomial {
     degree: number;
     variable: string;
@@ -22,6 +26,7 @@ export declare class Polynomial {
     derivate(): Polynomial;
     integrate(): Polynomial;
     calculate(x: number): number;
+    getLimit(to: '+\\infty' | '-\\infty'): string;
     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;AAU7C,wBAAgB,+BAA+B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY,GAAG,UAAU,CAYjG;AAED,qBAAa,UAAU;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;gBACS,YAAY,EAAE,MAAM,EAAE,EAAE,QAAQ,GAAE,MAAY;IAS1D,MAAM,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO;IAG9B,QAAQ,IAAI,MAAM,EAAE;IA8BpB,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAc9B,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU;IAM7B,QAAQ,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAkBnC,QAAQ,IAAI,UAAU;IAOtB,QAAQ,IAAI,UAAU;IAQtB,SAAS,IAAI,UAAU;IAMvB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5B,MAAM,IAAI,IAAI;IAmCd,KAAK,IAAI,MAAM;IAkBf,QAAQ,IAAI,MAAM;CAGnB"}
+{"version":3,"file":"polynomial.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/polynomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAU7C,wBAAgB,+BAA+B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY,GAAG,UAAU,CAYjG;AAED,8BAAsB,qBAAqB;IACzC,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAa5D,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;CAavD;AAED,qBAAa,UAAU;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;gBACS,YAAY,EAAE,MAAM,EAAE,EAAE,QAAQ,GAAE,MAAY;IAS1D,MAAM,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO;IAG9B,QAAQ,IAAI,MAAM,EAAE;IA8BpB,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAc9B,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU;IAM7B,QAAQ,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAkBnC,QAAQ,IAAI,UAAU;IAOtB,QAAQ,IAAI,UAAU;IAQtB,SAAS,IAAI,UAAU;IAMvB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5B,QAAQ,CAAC,EAAE,EAAE,UAAU,GAAG,UAAU,GAAG,MAAM;IAiB7C,MAAM,IAAI,IAAI;IAmCd,KAAK,IAAI,MAAM;IAkBf,QAAQ,IAAI,MAAM;CAGnB"}

package/lib/math/polynomials/polynomial.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Polynomial = exports.createRandomPolynomialWithOrder = void 0;
+exports.Polynomial = exports.PolynomialConstructor = exports.createRandomPolynomialWithOrder = void 0;
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const addNode_1 = require("../../tree/nodes/operators/addNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
@@ -20,6 +20,32 @@ function createRandomPolynomialWithOrder(order, variable = 'x') {
     return new Polynomial(coefficients, variable);
 }
 exports.createRandomPolynomialWithOrder = createRandomPolynomialWithOrder;
+class PolynomialConstructor {
+    static randomWithOrder(order, variable = 'x') {
+        if (order < 0) {
+            throw Error('Order must be a non-negative integer');
+        }
+        const coefficients = [];
+        for (let i = 0; i <= order - 1; i++) {
+            coefficients.push((0, randint_1.randint)(-9, 10));
+        }
+        coefficients.push((0, randint_1.randint)(-9, 10, [0]));
+        return new Polynomial(coefficients, variable);
+    }
+    static random(maxOrder, variable = 'x') {
+        if (maxOrder < 0) {
+            throw Error('Order must be a non-negative integer');
+        }
+        const order = (0, randint_1.randint)(1, maxOrder + 1);
+        const coefficients = [];
+        for (let i = 0; i <= order - 1; i++) {
+            coefficients.push((0, randint_1.randint)(-9, 10));
+        }
+        coefficients.push((0, randint_1.randint)(-9, 10, [0]));
+        return new Polynomial(coefficients, variable);
+    }
+}
+exports.PolynomialConstructor = PolynomialConstructor;
 class Polynomial {
     /**
      *
@@ -118,6 +144,28 @@ class Polynomial {
             res += x ** i * this.coefficients[i];
         return res;
     }
+    getLimit(to) {
+        const leadingCoeff = this.coefficients[this.coefficients.length - 1];
+        if (this.degree === 0)
+            return leadingCoeff + '';
+        if (to === '+\\infty') {
+            if (leadingCoeff > 0)
+                return '+\\infty';
+            return '-\\infty';
+        }
+        else {
+            if (leadingCoeff > 0) {
+                if (this.degree % 2 === 0)
+                    return '+\\infty';
+                return '-\\infty';
+            }
+            else {
+                if (this.degree % 2 === 0)
+                    return '-\\infty';
+                return '+\\infty';
+            }
+        }
+    }
     toTree() {
         const recursive = (cursor) => {
             const coeff = this.coefficients[cursor];

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

@@ -216,19 +216,19 @@ class Interval {
         const isRightClosed = this.boundType === BoundType.FF || this.boundType === BoundType.OF;
         if (this.max === Infinity) {
             if (isLeftClosed) {
-                return `x \\ge ${this.min}`;
+                return `x\\ge${this.min}`;
             }
             else
-                return `x > ${this.min}`;
+                return `x>${this.min}`;
         }
         else if (this.min === -Infinity) {
             if (this.boundType === BoundType.OF) {
-                return `x \\le ${this.max}`;
+                return `x\\le${this.max}`;
             }
             else
-                return `x < ${this.max}`;
+                return `x<${this.max}`;
         }
-        return `${this.min} ${isLeftClosed ? '\\le' : '<'} x ${isRightClosed ? '\\le' : '<'} ${this.max}`;
+        return `${this.min}${isLeftClosed ? '\\le x' : '<x'}${isRightClosed ? '\\le' : '<'}${this.max}`;
     }
     getRandomElement(precision = this.type === nombre_1.NumberType.Integer ? 0 : 2) {
         if (this.min === -Infinity || this.max === Infinity)

package/package.json

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