math-exercises 1.3.66 → 1.3.67

package/lib/exercises/exercise.js

@@ -1,2 +1,15 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.tryToAddWrongProp = void 0;
+const uuidv4_1 = require("uuidv4");
+const tryToAddWrongProp = (props, statement, format = 'tex') => {
+    if (!props.some((prop) => prop.statement === statement)) {
+        props.push({
+            id: (0, uuidv4_1.uuid)(),
+            statement,
+            isRightAnswer: false,
+            format: format,
+        });
+    }
+};
+exports.tryToAddWrongProp = tryToAddWrongProp;

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

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

package/lib/exercises/exercises.js

@@ -167,6 +167,9 @@ 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");
+const sequencePolynomProductLimit_1 = require("./limits/sequencePolynomProductLimit");
+const sequencePolynomNoFILimit_1 = require("./limits/sequencePolynomNoFILimit");
+const sequenceGeometricLimit_1 = require("./limits/sequenceGeometricLimit");
 exports.exercises = [
     /**
      * calcul litteral
@@ -400,5 +403,8 @@ exports.exercises = [
     /**limites */
     polynomeLimit_1.polynomeLimit,
     sequencePolynomLimit_1.sequencePolynomLimit,
+    sequencePolynomNoFILimit_1.sequencePolynomNoFILimit,
     sequenceRationalFracLimit_1.sequenceRationalFracLimit,
+    sequencePolynomProductLimit_1.sequencePolynomProductLimit,
+    sequenceGeometricLimit_1.sequenceGeometricLimit,
 ];

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,CA4J1D"}
+{"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,CA0J1D"}

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

@@ -72,7 +72,6 @@ function getInverseImageFunctionGeogebra() {
         }
     }
     else {
-        console.log(optimum);
         if (roots.length === 2) {
             if (yValue > polynome2.calculate(optimum) + yValue) {
                 ymax = yValue + 2;

package/lib/exercises/limits/polynomeLimit.js

@@ -24,8 +24,8 @@ exports.polynomeLimit = {
     freeTimer: 60,
 };
 function getApplyPercentQuestion() {
-    const polynome1 = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(2, 6));
-    const polynome2 = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(2, 6));
+    const polynome1 = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(2, 6));
+    const polynome2 = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(2, 6));
     // a_1x^n + b_2x^(n-1) + ...
     const a1 = polynome1.coefficients[polynome1.coefficients.length - 1];
     const a2 = polynome2.coefficients[polynome2.coefficients.length - 1];

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceGeometricLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceGeometricLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAU9F,eAAO,MAAM,sBAAsB,EAAE,QAWpC,CAAC;AAEF,wBAAgB,iCAAiC,IAAI,QAAQ,CAgC5D"}

package/lib/exercises/limits/sequenceGeometricLimit.js

@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequenceGeometricLimitQuestion = exports.sequenceGeometricLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const geometricSequence_1 = require("../../math/sequences/geometricSequence");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.sequenceGeometricLimit = {
+    id: 'sequenceGeometricLimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une suite géométrique",
+    levels: ['TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Limites'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceGeometricLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getSequenceGeometricLimitQuestion() {
+    const sequence = geometricSequence_1.GeometricSequenceConstructor.randomWithLimit();
+    const to = '+\\infty';
+    const answer = sequence.getLimit();
+    if (!answer)
+        throw Error('received geometric sequence with no limit');
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, '+\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '-\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '0');
+        (0, exercise_1.tryToAddWrongProp)(res, sequence.reason.tex + '');
+        (0, exercise_1.tryToAddWrongProp)(res, sequence.firstTerm.tex + '');
+        return (0, shuffle_1.shuffle)(res).slice(0, n);
+    };
+    const question = {
+        answer: answer,
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${sequence.toTree().toTex()}$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequenceGeometricLimitQuestion = getSequenceGeometricLimitQuestion;

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

@@ -1 +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"}
+{"version":3,"file":"sequencePolynomLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAQ9F,eAAO,MAAM,oBAAoB,EAAE,QAWlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAkD1D"}

package/lib/exercises/limits/sequencePolynomLimit.js

@@ -1,9 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getSequencePolynomLimitQuestion = exports.sequencePolynomLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
 const polynomial_1 = require("../../math/polynomials/polynomial");
-const coinFlip_1 = require("../../utils/coinFlip");
+const randint_1 = require("../../math/utils/random/randint");
 const shuffle_1 = require("../../utils/shuffle");
 const uuid_1 = require("uuid");
 exports.sequencePolynomLimit = {
@@ -20,8 +21,7 @@ exports.sequencePolynomLimit = {
 };
 function getSequencePolynomLimitQuestion() {
     const poly = polynomial_1.PolynomialConstructor.random(4, 'n');
-    const isPositiveInfinite = (0, coinFlip_1.coinFlip)();
-    const to = isPositiveInfinite ? '+\\infty' : '-\\infty';
+    const to = '+\\infty';
     const answer = poly.getLimit(to);
     const getPropositions = (n) => {
         const res = [];
@@ -31,12 +31,16 @@ function getSequencePolynomLimitQuestion() {
             isRightAnswer: true,
             format: 'tex',
         });
+        (0, exercise_1.tryToAddWrongProp)(res, '+\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '-\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '0');
+        (0, exercise_1.tryToAddWrongProp)(res, poly.coefficients[poly.degree] + '');
         const missing = n - res.length;
         for (let i = 0; i < missing; i++) {
             let isDuplicate;
             let proposition;
             do {
-                const wrongAnswer = '';
+                const wrongAnswer = (0, randint_1.randint)(-10, 10) + '';
                 proposition = {
                     id: (0, uuid_1.v4)() + ``,
                     statement: wrongAnswer,
@@ -51,9 +55,7 @@ function getSequencePolynomLimitQuestion() {
     };
     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$$.`,
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly.toTree().toTex()}$.`,
         keys: ['infty'],
         getPropositions,
         answerFormat: 'tex',

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequencePolynomNoFILimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomNoFILimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAQ9F,eAAO,MAAM,wBAAwB,EAAE,QAWtC,CAAC;AAEF,wBAAgB,mCAAmC,IAAI,QAAQ,CAmD9D"}

package/lib/exercises/limits/sequencePolynomNoFILimit.js

@@ -0,0 +1,66 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequencePolynomNoFILimitQuestion = exports.sequencePolynomNoFILimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.sequencePolynomNoFILimit = {
+    id: 'sequencePolynomNoFILimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une suite polynomiale (sans F.I.)",
+    levels: ['TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Limites'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomNoFILimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getSequencePolynomNoFILimitQuestion() {
+    const length = (0, randint_1.randint)(2, 5);
+    const poly = polynomial_1.PolynomialConstructor.randomWithLengthAndSameSigns(4, length, 'n');
+    const to = '+\\infty';
+    const answer = poly.getLimit(to);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, '+\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '-\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '0');
+        (0, exercise_1.tryToAddWrongProp)(res, poly.coefficients[poly.degree] + '');
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, randint_1.randint)(-10, 10) + '';
+                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: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly.toTree().toTex()}$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequencePolynomNoFILimitQuestion = getSequencePolynomNoFILimitQuestion;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAU9F,eAAO,MAAM,2BAA2B,EAAE,QAWzC,CAAC;AAEF,wBAAgB,sCAAsC,IAAI,QAAQ,CA4DjE"}

package/lib/exercises/limits/sequencePolynomProductLimit.js

@@ -0,0 +1,74 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequencePolynomProductLimitQuestion = exports.sequencePolynomProductLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+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 randint_1 = require("../../math/utils/random/randint");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.sequencePolynomProductLimit = {
+    id: 'sequencePolynomProductLimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'un produit de suites polynomiales)",
+    levels: ['TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Limites'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequencePolynomProductLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getSequencePolynomProductLimitQuestion() {
+    const polyNum = polynomial_1.PolynomialConstructor.randomWithLength(3, 2, 'n');
+    const polyDenum = polynomial_1.PolynomialConstructor.randomWithLength(3, 2, 'n');
+    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
+    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
+    const product = new monom_1.Monom(polyNum.degree + polyDenum.degree, numLeadingCoeff * denumLeadingCoeff, 'n');
+    const to = '+\\infty';
+    let answer = product.getLimit(to);
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff).simplify().toTree().toTex();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, '+\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '-\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '0');
+        (0, exercise_1.tryToAddWrongProp)(res, leadingCoeffsRational);
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, randint_1.randint)(-10, 10) + '';
+                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: `Déterminer la limite de la suite $u$ définie par : $u_n = (${polyNum.toTree().toTex()})(${polyDenum
+            .toTree()
+            .toTex()})$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequencePolynomProductLimitQuestion = getSequencePolynomProductLimitQuestion;

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

@@ -1 +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"}
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAU9F,eAAO,MAAM,yBAAyB,EAAE,QAWvC,CAAC;AAEF,wBAAgB,oCAAoC,IAAI,QAAQ,CAuE/D"}

package/lib/exercises/limits/sequenceRationalFracLimit.js

@@ -1,11 +1,12 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getSequenceRationalFracLimitQuestion = exports.sequenceRationalFracLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
 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 randint_1 = require("../../math/utils/random/randint");
 const shuffle_1 = require("../../utils/shuffle");
 const uuid_1 = require("uuid");
 exports.sequenceRationalFracLimit = {
@@ -25,11 +26,11 @@ function getSequenceRationalFracLimitQuestion() {
     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';
+    const to = '+\\infty';
     let answer;
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff).simplify().toTree().toTex();
     if (polyDenum.degree === polyNum.degree) {
-        answer = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff).simplify().toTree().toTex();
+        answer = leadingCoeffsRational;
     }
     else if (polyDenum.degree > polyNum.degree) {
         answer = '0';
@@ -38,7 +39,6 @@ function getSequenceRationalFracLimitQuestion() {
         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({
@@ -47,12 +47,16 @@ function getSequenceRationalFracLimitQuestion() {
             isRightAnswer: true,
             format: 'tex',
         });
+        (0, exercise_1.tryToAddWrongProp)(res, '+\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '-\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '0');
+        (0, exercise_1.tryToAddWrongProp)(res, leadingCoeffsRational);
         const missing = n - res.length;
         for (let i = 0; i < missing; i++) {
             let isDuplicate;
             let proposition;
             do {
-                const wrongAnswer = '';
+                const wrongAnswer = (0, randint_1.randint)(-10, 10) + '';
                 proposition = {
                     id: (0, uuid_1.v4)() + ``,
                     statement: wrongAnswer,
@@ -67,9 +71,9 @@ function getSequenceRationalFracLimitQuestion() {
     };
     const question = {
         answer,
-        instruction: `Soit $u$ la suite définie par $u_n = \\dfrac{${polyNum.toTree().toTex()}}{${polyDenum
+        instruction: `Déterminer la limite de la suite $u$ définie par : $u_n = \\dfrac{${polyNum
             .toTree()
-            .toTex()}}$. Déterminer $$\\lim_{n\\to ${to}}u_n$$.`,
+            .toTex()}}{${polyDenum.toTree().toTex()}}$.`,
         keys: ['infty'],
         getPropositions,
         answerFormat: 'tex',

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceSimpleElementsSumLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/sequenceSimpleElementsSumLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAQ9F,eAAO,MAAM,8BAA8B,EAAE,QAW5C,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAkD1D"}

package/lib/exercises/limits/sequenceSimpleElementsSumLimit.js

@@ -0,0 +1,65 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequencePolynomLimitQuestion = exports.sequenceSimpleElementsSumLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.sequenceSimpleElementsSumLimit = {
+    id: 'sequenceSimpleElementsSumLimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une suite de sommes",
+    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 to = '+\\infty';
+    const answer = poly.getLimit(to);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, '+\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '-\\infty');
+        (0, exercise_1.tryToAddWrongProp)(res, '0');
+        (0, exercise_1.tryToAddWrongProp)(res, poly.coefficients[poly.degree] + '');
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = (0, randint_1.randint)(-10, 10) + '';
+                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: `Déterminer la limite de la suite $u$ définie par : $u_n = ${poly.toTree().toTex()}$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequencePolynomLimitQuestion = getSequencePolynomLimitQuestion;

package/lib/exercises/primitve/exponentialPrimitive.js

@@ -31,7 +31,7 @@ exports.exponentialPrimitive = {
 function getExponentialPrimitive() {
     const rand = (0, coinFlip_1.coinFlip)();
     const a = (0, randint_1.randint)(-9, 10);
-    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
+    const u = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(1, 3));
     let selectedFunction;
     let integratedFuction;
     if (rand) {

package/lib/exercises/primitve/logarithmePrimitive.js

@@ -24,7 +24,7 @@ exports.logarithmePrimitive = {
     freeTimer: 60,
 };
 function getLogarithmePrimitive() {
-    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
+    const u = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(1, 3));
     const selectedFunction = new fractionNode_1.FractionNode(u.derivate().toTree(), u.toTree());
     const integratedFuction = `ln\|${u.toTex()}\|`;
     const getPropositions = (n) => {
@@ -48,7 +48,7 @@ function getLogarithmePrimitive() {
                         .toTree(), new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2))).toTex(),
                     `ln(${new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2)).toTex()})`,
                     new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2)).toTex(),
-                    `ln\|${(0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3)).toTex()}\|`,
+                    `ln\|${polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(1, 3)).toTex()}\|`,
                 ];
                 wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
                 proposition = {

package/lib/exercises/primitve/polynomialPrimitive.js

@@ -41,7 +41,7 @@ function getIntegratedPolynomialNode(polynomial) {
 }
 function getPolynomialPrimitive() {
     const degree = (0, randint_1.randint)(1, 4);
-    const polynomial = (0, polynomial_1.createRandomPolynomialWithOrder)(degree);
+    const polynomial = polynomial_1.PolynomialConstructor.randomWithOrder(degree);
     const integralPolynomial = getIntegratedPolynomialNode(polynomial);
     const getPropositions = (n) => {
         const propositions = [];
@@ -55,7 +55,7 @@ function getPolynomialPrimitive() {
             let isDuplicate;
             let proposition;
             do {
-                const wrongPolynomial = (0, polynomial_1.createRandomPolynomialWithOrder)(degree);
+                const wrongPolynomial = polynomial_1.PolynomialConstructor.randomWithOrder(degree);
                 const wrongIntegral = getIntegratedPolynomialNode(wrongPolynomial);
                 proposition = {
                     id: (0, uuid_1.v4)(),

package/lib/exercises/primitve/sinCosPrimitive.js

@@ -29,7 +29,7 @@ exports.sinCosPrimitive = {
 function getSinCosPrimitive() {
     const rand = (0, coinFlip_1.coinFlip)();
     const a = (0, randint_1.randint)(-9, 10, [0]);
-    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
+    const u = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(1, 3));
     let selectedFunction;
     let integratedFuction;
     if (rand) {

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

@@ -1 +1 @@
-{"version":3,"file":"quartiles.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/quartiles.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,SAAS,EAAE,QAYvB,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CAkGvC"}
+{"version":3,"file":"quartiles.d.ts","sourceRoot":"","sources":["../../../src/exercises/probaStat/quartiles.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D,eAAO,MAAM,SAAS,EAAE,QAYvB,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CAiGvC"}

package/lib/exercises/probaStat/quartiles.js

@@ -35,7 +35,6 @@ function getQuartiles() {
     const n = randomEffectives.reduce((sum, value) => sum + value, 0);
     const firstQuartileIndex = Math.round(n / 4 + 0.49);
     const thirdQuartileIndex = Math.round((3 * n) / 4 + 0.49);
-    console.log(thirdQuartileIndex + '///' + (3 * n) / 4);
     const firstQuartile = sortedValues[firstQuartileIndex - 1];
     const thirdQuartile = sortedValues[thirdQuartileIndex - 1];
     const randomQuartile = (0, randint_1.randint)(0, 2);

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

@@ -58,9 +58,9 @@ function getInequalityToIntervalQuestion() {
         if (isIntervalToInequality) {
             if (interval.min === -Infinity) {
                 const wrongStatements = [
-                    `x ${switchInequality(interval.rightInequalitySymbol)} ${interval.maxTex}`,
-                    `-\\infty \\le x ${switchInequality(interval.rightInequalitySymbol)} ${interval.maxTex}`,
-                    `-\\infty < x ${switchInequality(interval.rightInequalitySymbol)} ${interval.maxTex}`,
+                    `x${switchInequality(interval.rightInequalitySymbol)}${interval.maxTex}`,
+                    `-\\infty\\le x${switchInequality(interval.rightInequalitySymbol)}${interval.maxTex}`,
+                    `-\\infty <x${switchInequality(interval.rightInequalitySymbol)}${interval.maxTex}`,
                 ];
                 wrongStatements.forEach((statement) => {
                     res.push({

package/lib/math/numbers/decimals/decimal.d.ts

@@ -2,7 +2,7 @@ import { Node } from '../../../tree/nodes/node';
 import { Nombre, NumberType } from '../nombre';
 export declare abstract class DecimalConstructor {
     static randomFracPart(precision: number): string;
-    static random(min: number, max: number, precision: number): Decimal;
+    static random(min: number, max: number, precision?: number): Decimal;
     static fromParts(intPart: string, decimalPart: string): Decimal;
 }
 export declare class Decimal implements Nombre {

package/lib/math/numbers/decimals/decimal.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"decimal.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/decimals/decimal.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAG7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,8BAAsB,kBAAkB;IACtC,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAQhD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO;IAKnE,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;CAGhE;AAED,qBAAa,OAAQ,YAAW,MAAM;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,aAAsB;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;gBACR,KAAK,EAAE,MAAM;IASzB;;;;OAIG;IACH,KAAK,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAoEhC,oBAAoB,CAAC,KAAK,EAAE,MAAM;IAsBlC,MAAM,IAAI,IAAI;CAGf"}
+{"version":3,"file":"decimal.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/decimals/decimal.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAG7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,8BAAsB,kBAAkB;IACtC,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAQhD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO;IAMpE,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;CAGhE;AAED,qBAAa,OAAQ,YAAW,MAAM;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,aAAsB;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;gBACR,KAAK,EAAE,MAAM;IASzB;;;;OAIG;IACH,KAAK,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAoEhC,oBAAoB,CAAC,KAAK,EAAE,MAAM;IAsBlC,MAAM,IAAI,IAAI;CAGf"}

package/lib/math/numbers/decimals/decimal.js

@@ -14,8 +14,9 @@ class DecimalConstructor {
         return decimals;
     }
     static random(min, max, precision) {
+        let prec = precision ?? (0, randint_1.randint)(1, 4);
         const int = (0, randint_1.randint)(min, max) + '';
-        const decimals = DecimalConstructor.randomFracPart(precision);
+        const decimals = DecimalConstructor.randomFracPart(prec);
         return DecimalConstructor.fromParts(int, decimals);
     }
     static fromParts(intPart, decimalPart) {

package/lib/math/numbers/rationals/rational.d.ts

@@ -6,6 +6,7 @@ export declare abstract class RationalConstructor {
      */
     static randomSimplifiable(maxGcd?: number): Rational;
     static randomIrreductible(max?: number): Rational;
+    static randomIrreductibleWithSign(max?: number): Rational;
 }
 export declare class Rational implements Nombre {
     num: number;

package/lib/math/numbers/rationals/rational.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rational.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/rationals/rational.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAO7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,8BAAsB,mBAAmB;IACvC;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,MAAM,GAAE,MAAW;IAW7C,MAAM,CAAC,kBAAkB,CAAC,GAAG,GAAE,MAAW;CAO3C;AAED,qBAAa,QAAS,YAAW,MAAM;IACrC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,EAAE,UAAU,CAAC;gBAEL,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAUlD,KAAK;IAIL,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgBvB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB5B,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB1B,QAAQ,IAAI,QAAQ;IAIpB,MAAM,IAAI,IAAI;IAId,QAAQ,IAAI,MAAM;CAMnB"}
+{"version":3,"file":"rational.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/rationals/rational.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAQ7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,8BAAsB,mBAAmB;IACvC;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,MAAM,GAAE,MAAW;IAW7C,MAAM,CAAC,kBAAkB,CAAC,GAAG,GAAE,MAAW;IAO1C,MAAM,CAAC,0BAA0B,CAAC,GAAG,GAAE,MAAW;CAQnD;AAED,qBAAa,QAAS,YAAW,MAAM;IACrC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,EAAE,UAAU,CAAC;gBAEL,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAUlD,KAAK;IAIL,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgBvB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB5B,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM;IAgB1B,QAAQ,IAAI,QAAQ;IAIpB,MAAM,IAAI,IAAI;IAId,QAAQ,IAAI,MAAM;CAMnB"}