math-exercises 1.4.4 → 1.4.5

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

@@ -28,7 +28,7 @@ function getFractionToPercentToDecimal() {
     const decimal = numerator / denominator;
     const percent = (0, round_1.round)((numerator / denominator) * 100, 2);
     const rand = (0, randint_1.randint)(1, 7);
-    let instruction;
+    let instruction = '';
     let answer = '';
     switch (rand) {
         case 1: {

package/lib/exercises/exercise.d.ts

@@ -9,7 +9,7 @@ export type Proposition = {
     format: 'tex' | 'raw';
 };
 export interface Question {
-    instruction?: string;
+    instruction: string;
     startStatement?: string;
     answer: string;
     answerFormat: 'tex' | 'raw';
@@ -22,7 +22,7 @@ export interface Question {
 }
 export interface MathExercise {
     id: string;
-    instruction: string;
+    instruction?: string;
     isSingleStep: boolean;
     label: string;
     sections: MathSection[];

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

@@ -1 +1 @@
-{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,iBAAiB,UAAW,WAAW,EAAE,aAAa,MAAM,WAAU,KAAK,GAAG,KAAK,SAS/F,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AACF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ;IACvB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE,GAAG,CAAC;IACd,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,eAAe,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,WAAW,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,QAAQ,EAAE,CAAC;IAC9D,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,mBAAmB,GACnB,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,eAAe,GACf,UAAU,CAAC"}
+{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,iBAAiB,UAAW,WAAW,EAAE,aAAa,MAAM,WAAU,KAAK,GAAG,KAAK,SAS/F,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AACF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE,GAAG,CAAC;IACd,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,eAAe,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,WAAW,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,QAAQ,EAAE,CAAC;IAC9D,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,mBAAmB,GACnB,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,eAAe,GACf,UAAU,CAAC"}

package/lib/exercises/exercises.d.ts

@@ -1,2 +1,3 @@
-export declare const exercises: import("./exercise").MathExercise[];
+import { MathExercise } from './exercise';
+export declare const exercises: MathExercise[];
 //# sourceMappingURL=exercises.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"exercises.d.ts","sourceRoot":"","sources":["../../src/exercises/exercises.ts"],"names":[],"mappings":"AAoLA,eAAO,MAAM,SAAS,qCAsQrB,CAAC"}
+{"version":3,"file":"exercises.d.ts","sourceRoot":"","sources":["../../src/exercises/exercises.ts"],"names":[],"mappings":"AAkLA,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAU1C,eAAO,MAAM,SAAS,EAAE,YAAY,EA4QnC,CAAC"}

package/lib/exercises/exercises.js

@@ -115,7 +115,7 @@ const quartiles_1 = require("../exercises/probaStat/quartiles");
 const quartilesList_1 = require("../exercises/probaStat/quartilesList");
 const euclideanDivision_1 = require("../exercises/calcul/arithmetics/euclideanDivision");
 const thirdDegreeFunctionVariation_1 = require("../exercises/derivation/derivative/thirdDegreeFunctionVariation");
-const polynomeLimit_1 = require("../exercises/limits/polynomeLimit");
+const polynomLimit_1 = require("../exercises/limits/polynomLimit");
 const constantPrimitive_1 = require("../exercises/primitve/constantPrimitive");
 const polynomialPrimitive_1 = require("../exercises/primitve/polynomialPrimitive");
 const sinCosPrimitive_1 = require("../exercises/primitve/sinCosPrimitive");
@@ -169,7 +169,14 @@ 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 polynomLimitNoFI_1 = require("./limits/polynomLimitNoFI");
+const rationalFracLimit_1 = require("./limits/rationalFracLimit");
+const rationalFracForbiddenValueLimit_1 = require("./limits/rationalFracForbiddenValueLimit");
 const sequenceGeometricLimit_1 = require("./limits/sequenceGeometricLimit");
+const calculatePower_1 = require("./powers/calculatePower");
+const calculateNegativePower_1 = require("./powers/calculateNegativePower");
+const decimalToScientific_1 = require("./powers/decimalToScientific");
+const powerDefinition_1 = require("./powers/powerDefinition");
 exports.exercises = [
     /**
      * calcul litteral
@@ -268,7 +275,11 @@ exports.exercises = [
     powersPower_1.powersOfTenPower,
     powersProduct_1.powersOfTenProduct,
     scientificToDecimal_1.scientificToDecimal,
+    decimalToScientific_1.decimalToScientific,
     powersOfTenToDecimal_1.powersOfTenToDecimal,
+    calculatePower_1.calculatePower,
+    calculateNegativePower_1.calculateNegativePower,
+    powerDefinition_1.powerDefinition,
     /**
      * suites
      */
@@ -401,7 +412,10 @@ exports.exercises = [
     intervalsUnion_1.intervalsUnion,
     intervalsIntersection_1.intervalsIntersection,
     /**limites */
-    polynomeLimit_1.polynomeLimit,
+    polynomLimit_1.polynomLimit,
+    polynomLimitNoFI_1.polynomLimitNoFI,
+    rationalFracLimit_1.rationalFracLimit,
+    rationalFracForbiddenValueLimit_1.rationalFracForbiddenValueLimit,
     sequencePolynomLimit_1.sequencePolynomLimit,
     sequencePolynomNoFILimit_1.sequencePolynomNoFILimit,
     sequenceRationalFracLimit_1.sequenceRationalFracLimit,

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

@@ -1 +1 @@
-{"version":3,"file":"leadingCoefficient.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/leadingCoefficient.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY/E,eAAO,MAAM,kBAAkB,EAAE,YAWhC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAiFxD"}
+{"version":3,"file":"leadingCoefficient.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/leadingCoefficient.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY/E,eAAO,MAAM,kBAAkB,EAAE,YAWhC,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAkFxD"}

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

@@ -14,7 +14,7 @@ const uuid_1 = require("uuid");
 exports.leadingCoefficient = {
     id: 'leadingCoefficient',
     connector: '=',
-    instruction: 'Déterminer le coefficient directeur de la droite représentée ci-dessous :',
+    instruction: '',
     label: 'Lire le coefficient directeur',
     levels: ['3ème', '2nde', '1reESM', '2ndPro', '1rePro', '1reTech'],
     isSingleStep: false,
@@ -83,6 +83,7 @@ function getLeadingCoefficientQuestion() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: 'Déterminer le coefficient directeur de la droite représentée ci-dessous : ',
         answer: droite.getLeadingCoefficient(),
         keys: [],
         commands: [`f(x) = (${a}) * x + (${b})`],

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

@@ -1 +1 @@
-{"version":3,"file":"pythagore.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/pythagore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ/E,eAAO,MAAM,SAAS,EAAE,YAWvB,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CA6EvC"}
+{"version":3,"file":"pythagore.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/euclidean/pythagore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ/E,eAAO,MAAM,SAAS,EAAE,YAWvB,CAAC;AAEF,wBAAgB,YAAY,IAAI,QAAQ,CA8EvC"}

package/lib/exercises/geometry/euclidean/pythagore.js

@@ -9,7 +9,7 @@ const uuid_1 = require("uuid");
 exports.pythagore = {
     id: 'pythagore',
     connector: '=',
-    instruction: "Écrire l'égalité de Pythagore pour la figure suivante : ",
+    instruction: '',
     label: "Écrire l'égalité de Pythagore",
     levels: ['4ème', '3ème', '2nde'],
     isSingleStep: false,
@@ -76,6 +76,7 @@ function getPythagore() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: "Écrire l'égalité de Pythagore pour la figure suivante : ",
         answer: `${triangle.getSideAName()}^2=${triangle.getSideBName()}^2+${triangle.getSideCName()}^2`,
         keys: [...vertices, 'equal'],
         commands: triangle.generateCommands({}),

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"polynomLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/polynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAQlG,eAAO,MAAM,YAAY,EAAE,YAW1B,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAkDlD"}

package/lib/exercises/limits/polynomLimit.js

@@ -0,0 +1,66 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getPolynomLimitQuestion = exports.polynomLimit = 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 coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.polynomLimit = {
+    id: 'polynomLimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une fonction polynomiale",
+    levels: ['TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Limites'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPolynomLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getPolynomLimitQuestion() {
+    const poly = polynomial_1.PolynomialConstructor.random(4);
+    const to = (0, coinFlip_1.coinFlip)() ? '+\\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',
+        });
+        (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 en $${to}$ de la fonction $f$ définie par : $f(x) = ${poly.toTree().toTex()}$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getPolynomLimitQuestion = getPolynomLimitQuestion;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"polynomLimitNoFI.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/polynomLimitNoFI.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAQlG,eAAO,MAAM,gBAAgB,EAAE,YAW9B,CAAC;AAEF,wBAAgB,mCAAmC,IAAI,QAAQ,CAoD9D"}

package/lib/exercises/limits/polynomLimitNoFI.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequencePolynomNoFILimitQuestion = exports.polynomLimitNoFI = 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 coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.polynomLimitNoFI = {
+    id: 'polynomLimitNoFI',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une fonction 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 to = (0, coinFlip_1.coinFlip)() ? '+\\infty' : '-\\infty';
+    const poly = polynomial_1.PolynomialConstructor.randomNoFI(4, to, length);
+    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 en $${to}$ de la fonction $f$ définie par : $f(x) = ${poly.toTree().toTex()}$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequencePolynomNoFILimitQuestion = getSequencePolynomNoFILimitQuestion;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"rationalFracForbiddenValueLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/rationalFracForbiddenValueLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAclG,eAAO,MAAM,+BAA+B,EAAE,YAW7C,CAAC;AAEF,wBAAgB,oCAAoC,IAAI,QAAQ,CAmE/D"}

package/lib/exercises/limits/rationalFracForbiddenValueLimit.js

@@ -0,0 +1,82 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequenceRationalFracLimitQuestion = exports.rationalFracForbiddenValueLimit = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const integer_1 = require("../../math/numbers/integer/integer");
+const affine_1 = require("../../math/polynomials/affine");
+const trinom_1 = require("../../math/polynomials/trinom");
+const discreteSet_1 = require("../../math/sets/discreteSet");
+const intervals_1 = require("../../math/sets/intervals/intervals");
+const randint_1 = require("../../math/utils/random/randint");
+const coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.rationalFracForbiddenValueLimit = {
+    id: 'rationalFracForbiddenValueLimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une fraction rationnelle avec valeur interdite",
+    levels: ['TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Limites'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSequenceRationalFracLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getSequenceRationalFracLimitQuestion() {
+    const polyDenum = new affine_1.Affine(1, (0, randint_1.randint)(-9, 10, [0]));
+    const forbiddenValue = -polyDenum.b;
+    const interval = new intervals_1.Interval('[[-10;10]]').difference(new discreteSet_1.DiscreteSet([new integer_1.Integer(forbiddenValue)]));
+    const polyNum = trinom_1.TrinomConstructor.randomFactorized(new intervals_1.Interval('[[-10;10]]'), interval, interval);
+    const numLimit = polyNum.calculate(-polyDenum.b);
+    const getSign = (nb) => {
+        return nb >= 0 ? '+' : '-';
+    };
+    const isRight = (0, coinFlip_1.coinFlip)();
+    const to = isRight ? `${forbiddenValue}` : `${forbiddenValue}`;
+    const from = isRight ? `x > ${forbiddenValue}` : `x<${forbiddenValue}`;
+    const answer = isRight ? `${getSign(numLimit)}\\infty` : `${getSign(-numLimit)}\\infty`;
+    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, polyNum.coefficients[polyNum.degree].toString());
+        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: `Soit $f$ la fonction définie par : $f(x) = \\dfrac{${polyNum.toTree().toTex()}}{${polyDenum
+            .toTree()
+            .toTex()}}$. Déterminer $\\lim\\limits_{x \\to ${to}, ${from}}f(x).$
+      `,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequenceRationalFracLimitQuestion = getSequenceRationalFracLimitQuestion;

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"rationalFracLimit.d.ts","sourceRoot":"","sources":["../../../src/exercises/limits/rationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAUlG,eAAO,MAAM,iBAAiB,EAAE,YAW/B,CAAC;AAEF,wBAAgB,oCAAoC,IAAI,QAAQ,CAoE/D"}

package/lib/exercises/limits/rationalFracLimit.js

@@ -0,0 +1,84 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSequenceRationalFracLimitQuestion = exports.rationalFracLimit = 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 coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.rationalFracLimit = {
+    id: 'rationalFracLimit',
+    connector: '=',
+    instruction: '',
+    label: "Limite d'une fraction 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.randomWithLength(4, (0, randint_1.randint)(2, 5));
+    const polyDenum = polynomial_1.PolynomialConstructor.randomWithLength(4, (0, randint_1.randint)(2, 5));
+    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
+    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
+    const to = (0, coinFlip_1.coinFlip)() ? '+\\infty' : '-\\infty';
+    let answer;
+    let leadingCoeffsRational = new rational_1.Rational(numLeadingCoeff, denumLeadingCoeff).simplify().toTree().toTex();
+    if (polyDenum.degree === polyNum.degree) {
+        answer = leadingCoeffsRational;
+    }
+    else if (polyDenum.degree > polyNum.degree) {
+        answer = '0';
+    }
+    else {
+        const tempPoly = new monom_1.Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
+        answer = tempPoly.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, 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 en $${to}$ de la fonction $f$ définie par : $f(x) = \\dfrac{${polyNum
+            .toTree()
+            .toTex()}}{${polyDenum.toTree().toTex()}}$.`,
+        keys: ['infty'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSequenceRationalFracLimitQuestion = getSequenceRationalFracLimitQuestion;

package/lib/exercises/powers/calculateNegativePower.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"calculateNegativePower.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/calculateNegativePower.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,0BAA0B,CAAC;AAWhH,eAAO,MAAM,sBAAsB,EAAE,YAWpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CA2DpD"}

package/lib/exercises/powers/calculateNegativePower.js

@@ -0,0 +1,76 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCalculatePowerQuestion = exports.calculateNegativePower = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../math/numbers/rationals/rational");
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const uuid_1 = require("uuid");
+exports.calculateNegativePower = {
+    id: 'calculateNegativePower',
+    connector: '=',
+    instruction: '',
+    label: 'Calculer une puissance négative',
+    levels: ['4ème', '3ème', '2ndPro', '2nde', 'CAP'],
+    isSingleStep: true,
+    sections: ['Puissances'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCalculatePowerQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getCalculatePowerQuestion() {
+    const int = (0, randint_1.randint)(0, 11);
+    const power = (0, randint_1.randint)(-5, 0);
+    const statement = new powerNode_1.PowerNode(new numberNode_1.NumberNode(int), new numberNode_1.NumberNode(power)).toTex();
+    const answer = new rational_1.Rational(1, int ** Math.abs(power)).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, int * power + '');
+        (0, exercise_1.tryToAddWrongProp)(res, -(int ** Math.abs(power)) + '');
+        (0, exercise_1.tryToAddWrongProp)(res, int * power + '');
+        if (int < 0)
+            (0, exercise_1.tryToAddWrongProp)(res, -(int ** power) + '');
+        if (int === 0 || int === 1) {
+            (0, exercise_1.tryToAddWrongProp)(res, power + '');
+            (0, exercise_1.tryToAddWrongProp)(res, '0');
+            (0, exercise_1.tryToAddWrongProp)(res, '1');
+            (0, exercise_1.tryToAddWrongProp)(res, '-1');
+            (0, exercise_1.tryToAddWrongProp)(res, '2');
+            (0, exercise_1.tryToAddWrongProp)(res, -power + '');
+        }
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new rational_1.Rational(1, int ** (0, randint_1.randint)(0, 6, [power])).simplify().toTree().toTex();
+                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, exercise_1.shuffleProps)(res, n);
+    };
+    const question = {
+        answer,
+        instruction: `Calculer : $${statement}$`,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getCalculatePowerQuestion = getCalculatePowerQuestion;

package/lib/exercises/powers/calculatePower.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"calculatePower.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/calculatePower.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,0BAA0B,CAAC;AAShH,eAAO,MAAM,cAAc,EAAE,YAW5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAgEpD"}

package/lib/exercises/powers/calculatePower.js

@@ -0,0 +1,80 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCalculatePowerQuestion = exports.calculatePower = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const uuid_1 = require("uuid");
+exports.calculatePower = {
+    id: 'calculatePower',
+    connector: '=',
+    instruction: '',
+    label: 'Calculer une puissance',
+    levels: ['4ème', '3ème', '2ndPro', '2nde', 'CAP'],
+    isSingleStep: true,
+    sections: ['Puissances'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCalculatePowerQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getCalculatePowerQuestion() {
+    const int = (0, randint_1.randint)(-10, 11);
+    const power = (0, randint_1.randint)(0, 6);
+    const statement = new powerNode_1.PowerNode(new numberNode_1.NumberNode(int), new numberNode_1.NumberNode(power)).toTex();
+    const answer = int ** power + '';
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, int * power + '');
+        if (int < 0)
+            (0, exercise_1.tryToAddWrongProp)(res, -(int ** power) + '');
+        if (int === 0) {
+            (0, exercise_1.tryToAddWrongProp)(res, power + '');
+            (0, exercise_1.tryToAddWrongProp)(res, '1');
+            (0, exercise_1.tryToAddWrongProp)(res, -power + '');
+            (0, exercise_1.tryToAddWrongProp)(res, '-1');
+            (0, exercise_1.tryToAddWrongProp)(res, '2');
+        }
+        if (int === 1 || int === -1) {
+            (0, exercise_1.tryToAddWrongProp)(res, power + '');
+            (0, exercise_1.tryToAddWrongProp)(res, '0');
+            (0, exercise_1.tryToAddWrongProp)(res, '1');
+            (0, exercise_1.tryToAddWrongProp)(res, '-1');
+            (0, exercise_1.tryToAddWrongProp)(res, '2');
+            (0, exercise_1.tryToAddWrongProp)(res, -power + '');
+        }
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = int ** (0, randint_1.randint)(0, 6, [power]) + '';
+                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, exercise_1.shuffleProps)(res, n);
+    };
+    const question = {
+        answer,
+        instruction: `Calculer : $${statement}$`,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getCalculatePowerQuestion = getCalculatePowerQuestion;

package/lib/exercises/powers/decimalToScientific.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"decimalToScientific.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/decimalToScientific.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,aAAa,CAAC;AAInG,eAAO,MAAM,mBAAmB,EAAE,YA0BjC,CAAC;AAEF,wBAAgB,8BAA8B,IAAI,QAAQ,CAyDzD"}

package/lib/exercises/powers/decimalToScientific.js

@@ -0,0 +1,90 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getDecimalToScientificQuestion = exports.decimalToScientific = void 0;
+const decimal_1 = require("../../math/numbers/decimals/decimal");
+const integer_1 = require("../../math/numbers/integer/integer");
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const probaFlip_1 = require("../../utils/probaFlip");
+const exercise_1 = require("../exercise");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+exports.decimalToScientific = {
+    id: 'decimalToScientific',
+    connector: '=',
+    instruction: '',
+    label: "Passer d'écriture décimal à écriture scientifique",
+    levels: [
+        '5ème',
+        '4ème',
+        '3ème',
+        '2nde',
+        'CAP',
+        '2ndPro',
+        '1reESM',
+        '1rePro',
+        '1reSpé',
+        '1reTech',
+        'TermPro',
+        'TermTech',
+    ],
+    sections: ['Puissances'],
+    isSingleStep: true,
+    keys: [],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDecimalToScientificQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getDecimalToScientificQuestion() {
+    //! manque le cas 0.000
+    const isZero = (0, probaFlip_1.probaFlip)(0.2);
+    let intPart, dec;
+    if (isZero) {
+        dec = decimal_1.DecimalConstructor.fromParts('0', decimal_1.DecimalConstructor.randomFracPart((0, randint_1.randint)(2, 5), (0, randint_1.randint)(1, 4)));
+    }
+    else {
+        intPart = integer_1.IntegerConstructor.random((0, randint_1.randint)(2, 5));
+        dec = decimal_1.DecimalConstructor.fromParts(intPart.toString(), decimal_1.DecimalConstructor.randomFracPart((0, randint_1.randint)(1, 5)));
+    }
+    const decTex = dec.toTree().toTex();
+    const answer = dec.toScientificNotation().toTex();
+    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 = new multiplyNode_1.MultiplyNode(dec.toScientificPart(), new powerNode_1.PowerNode(new numberNode_1.NumberNode(10), new numberNode_1.NumberNode((0, randint_1.randint)(-5, 5, [0, 1])))).toTex();
+                // const wrongAnswer = randint(-100, 100) + '';
+                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, exercise_1.shuffleProps)(res, n);
+    };
+    const question = {
+        instruction: `Donner l'écriture scientifique de : $${decTex}$`,
+        startStatement: decTex,
+        answer: answer,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getDecimalToScientificQuestion = getDecimalToScientificQuestion;

package/lib/exercises/powers/powerDefinition.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"powerDefinition.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/powerDefinition.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,0BAA0B,CAAC;AAOhH,eAAO,MAAM,eAAe,EAAE,YAW7B,CAAC;AAEF,wBAAgB,0BAA0B,IAAI,QAAQ,CAqDrD"}

package/lib/exercises/powers/powerDefinition.js

@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getPowerDefinitionQuestion = exports.powerDefinition = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const powerNode_1 = require("../../tree/nodes/operators/powerNode");
+const uuid_1 = require("uuid");
+exports.powerDefinition = {
+    id: 'powerDefinition',
+    connector: '=',
+    instruction: '',
+    label: 'Écrire un produit sous forme de puissance',
+    levels: ['4ème', '3ème', '2ndPro', 'CAP'],
+    isSingleStep: true,
+    sections: ['Puissances'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPowerDefinitionQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getPowerDefinitionQuestion() {
+    const int = (0, randint_1.randint)(2, 11);
+    const power = (0, randint_1.randint)(2, 6);
+    let statement = '';
+    for (let i = 0; i < power; i++) {
+        statement += int + '';
+        if (i < power - 1)
+            statement += '\\times';
+    }
+    const answer = new powerNode_1.PowerNode(new numberNode_1.NumberNode(int), new numberNode_1.NumberNode(power)).toTex();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, `${power}\\times${int}`);
+        (0, exercise_1.tryToAddWrongProp)(res, `${int}\\times${power}`);
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongAnswer = new powerNode_1.PowerNode(new numberNode_1.NumberNode(int), new numberNode_1.NumberNode((0, randint_1.randint)(2, 7))).toTex();
+                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, exercise_1.shuffleProps)(res, n);
+    };
+    const question = {
+        answer,
+        instruction: `Écrire sous forme de puissance : $${statement}$`,
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getPowerDefinitionQuestion = getPowerDefinitionQuestion;

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

@@ -1 +1 @@
-{"version":3,"file":"scientificToDecimal.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/scientificToDecimal.ts"],"names":[],"mappings":"AAAA;;MAEM;AASN,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAIlE,eAAO,MAAM,mBAAmB,EAAE,YA0BjC,CAAC;AAEF,wBAAgB,8BAA8B,IAAI,QAAQ,CAsDzD"}
+{"version":3,"file":"scientificToDecimal.d.ts","sourceRoot":"","sources":["../../../src/exercises/powers/scientificToDecimal.ts"],"names":[],"mappings":"AAAA;;MAEM;AASN,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,aAAa,CAAC;AAIrF,eAAO,MAAM,mBAAmB,EAAE,YA0BjC,CAAC;AAEF,wBAAgB,8BAA8B,IAAI,QAAQ,CAoDzD"}

package/lib/exercises/powers/scientificToDecimal.js

@@ -5,19 +5,19 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getScientificToDecimalQuestion = exports.scientificToDecimal = void 0;
 const decimal_1 = require("../../math/numbers/decimals/decimal");
-const integer_1 = require("../../math/numbers/integer/integer");
 const randint_1 = require("../../math/utils/random/randint");
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
 const powerNode_1 = require("../../tree/nodes/operators/powerNode");
 const shuffle_1 = require("../../utils/shuffle");
+const exercise_1 = require("../exercise");
 const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
 const uuid_1 = require("uuid");
 exports.scientificToDecimal = {
     id: 'scientificToDecimal',
     connector: '=',
     instruction: '',
-    label: 'Ecriture décimale de $a\\times 10^x$',
+    label: "Passer d'écriture scientifique à écriture décimal",
     levels: [
         '5ème',
         '4ème',
@@ -40,25 +40,24 @@ exports.scientificToDecimal = {
     freeTimer: 60,
 };
 function getScientificToDecimalQuestion() {
-    const randPower = (0, randint_1.randint)(-6, 8);
-    const int = integer_1.IntegerConstructor.random((0, randint_1.randint)(1, 4), [0]);
-    const fracPart = decimal_1.DecimalConstructor.randomFracPart((0, randint_1.randint)(0, 4));
-    const randDecimal = decimal_1.DecimalConstructor.fromParts(int + '', fracPart);
-    const statement = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(randDecimal.value), new powerNode_1.PowerNode(new numberNode_1.NumberNode(10), new numberNode_1.NumberNode(randPower)));
-    const answerTree = randDecimal.multiplyByPowerOfTen(randPower).toTree();
+    const decScientific = decimal_1.DecimalConstructor.randomScientific((0, randint_1.randint)(1, 4));
+    const tenPower = (0, randint_1.randint)(-5, 6, [0, 1]);
+    const answer = decScientific.multiplyByPowerOfTen(tenPower).toTree().toTex();
+    const statement = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(decScientific.value), new powerNode_1.PowerNode(new numberNode_1.NumberNode(10), new numberNode_1.NumberNode(tenPower)));
     const getPropositions = (n) => {
         const res = [];
         res.push({
             id: (0, uuid_1.v4)() + '',
-            statement: answerTree.toTex(),
+            statement: answer,
             isRightAnswer: true,
             format: 'tex',
         });
+        (0, exercise_1.tryToAddWrongProp)(res, decScientific.multiplyByPowerOfTen(-tenPower).toTree().toTex());
         for (let i = 0; i < n - 1; i++) {
             let isDuplicate;
             let proposition;
             do {
-                const wrongAnswerTree = randDecimal.multiplyByPowerOfTen((0, randint_1.randint)(-6, 8, [randPower])).toTree();
+                const wrongAnswerTree = decScientific.multiplyByPowerOfTen((0, randint_1.randint)(-6, 6, [tenPower])).toTree();
                 const wrongAnswer = wrongAnswerTree.toTex();
                 proposition = {
                     id: (0, uuid_1.v4)() + '',
@@ -75,7 +74,7 @@ function getScientificToDecimalQuestion() {
     const question = {
         instruction: `Donner l'écriture décimale de : $${statement.toTex()}$`,
         startStatement: statement.toTex(),
-        answer: answerTree.toTex(),
+        answer: answer,
         keys: [],
         getPropositions,
         answerFormat: 'tex',

package/lib/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAUjE,QAAA,MAAM,gBAAgB,gBAAiB,CAAC;AAExC,QAAA,MAAM,4BAA4B;aACT,WAAW;UAAQ,YAAY,EAAE;GAkBzD,CAAC;AAEF,OAAO,EAAE,gBAAgB,EAAE,4BAA4B,EAAE,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAIjE,QAAA,MAAM,gBAAgB,gBAAiB,CAAC;AAExC,QAAA,MAAM,4BAA4B;aACT,WAAW;UAAQ,YAAY,EAAE;GAkBzD,CAAC;AAIF,OAAO,EAAE,gBAAgB,EAAE,4BAA4B,EAAE,CAAC"}

package/lib/index.js

@@ -2,6 +2,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getAllMathExercisesBySection = exports.allMathExercises = void 0;
 const exercises_1 = require("./exercises/exercises");
+const decimalToScientific_1 = require("./exercises/powers/decimalToScientific");
 const allMathExercises = [...exercises_1.exercises];
 exports.allMathExercises = allMathExercises;
 const getAllMathExercisesBySection = () => {
@@ -23,3 +24,4 @@ const getAllMathExercisesBySection = () => {
     return data;
 };
 exports.getAllMathExercisesBySection = getAllMathExercisesBySection;
+console.log(decimalToScientific_1.decimalToScientific.generator(10).forEach((q) => q.getPropositions(4)));

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

@@ -1,9 +1,10 @@
 import { Node } from '../../../tree/nodes/node';
 import { Nombre, NumberType } from '../nombre';
 export declare abstract class DecimalConstructor {
-    static randomFracPart(precision: number): string;
+    static randomFracPart(precision: number, leadingZeros?: number): string;
     static random(min: number, max: number, precision?: number): Decimal;
     static fromParts(intPart: string, decimalPart: string): Decimal;
+    static randomScientific(precision?: number): Decimal;
 }
 export declare class Decimal implements Nombre {
     value: number;
@@ -20,6 +21,8 @@ export declare class Decimal implements Nombre {
      */
     round(precision: number): Nombre;
     multiplyByPowerOfTen(power: number): Decimal;
+    toScientificPart(): Node;
+    toScientificNotation(): Node;
     toTree(): Node;
 }
 //# sourceMappingURL=decimal.d.ts.map

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,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"}
+{"version":3,"file":"decimal.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/decimals/decimal.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAK7C,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,8BAAsB,kBAAkB;IACtC,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,YAAY,GAAE,MAAU,GAAG,MAAM;IAU1E,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;IAI/D,MAAM,CAAC,gBAAgB,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO;CAMrD;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,gBAAgB,IAAI,IAAI;IAUxB,oBAAoB,IAAI,IAAI;IAgB5B,MAAM,IAAI,IAAI;CAGf"}

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

@@ -3,13 +3,20 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.Decimal = exports.DecimalConstructor = void 0;
 const randint_1 = require("../../../math/utils/random/randint");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
 const integer_1 = require("../integer/integer");
 const nombre_1 = require("../nombre");
 class DecimalConstructor {
-    static randomFracPart(precision) {
+    static randomFracPart(precision, leadingZeros = 0) {
         let decimals = '';
         for (let i = 0; i < precision; i++) {
-            decimals += (0, randint_1.randint)(i === precision - 1 ? 1 : 0, 10);
+            if (i < leadingZeros)
+                decimals += '0';
+            if (i === precision - 1 || (i === 0 && !leadingZeros))
+                decimals += (0, randint_1.randint)(1, 10);
+            else
+                decimals += (0, randint_1.randint)(0, 10);
         }
         return decimals;
     }
@@ -22,6 +29,13 @@ class DecimalConstructor {
     static fromParts(intPart, decimalPart) {
         return new Decimal(Number('' + intPart + '.' + decimalPart));
     }
+    //returns X.YYYY where X € [0, 9] and first Y is not zero if X is zero
+    static randomScientific(precision) {
+        let prec = precision ?? (0, randint_1.randint)(1, 4);
+        const int = (0, randint_1.randint)(0, 10) + '';
+        const decimals = DecimalConstructor.randomFracPart(prec, 0);
+        return DecimalConstructor.fromParts(int, decimals);
+    }
 }
 exports.DecimalConstructor = DecimalConstructor;
 class Decimal {
@@ -134,6 +148,35 @@ class Decimal {
         }
         return DecimalConstructor.fromParts(newIntPart, newFracPart);
     }
+    toScientificPart() {
+        const intString = this.intPart.toString();
+        const intSize = intString.length;
+        if (intSize === 0 && this.intPart !== 0)
+            return this.toTree();
+        if (this.intPart === 0) {
+            const firstNonZeroIndex = this.decimalPart.split('').findIndex((el) => Number(el) !== 0);
+            return new numberNode_1.NumberNode(Number('0.' + this.decimalPart.slice(firstNonZeroIndex)));
+        }
+        return new numberNode_1.NumberNode(Number(intString[0] + '.' + intString.slice(1) + this.decimalPart));
+    }
+    toScientificNotation() {
+        const intString = this.intPart.toString();
+        const intSize = intString.length;
+        if (intSize === 0)
+            return this.toTree();
+        const decNode = this.toScientificPart();
+        let leadingZeros = 0;
+        const nbs = this.decimalPart.split('').map(Number);
+        for (let i = 0; i < nbs.length; i++) {
+            if (nbs[i] !== 0)
+                break;
+            leadingZeros++;
+        }
+        const power = this.intPart === 0 ? -leadingZeros : intSize - 1;
+        if (power === 1)
+            return new multiplyNode_1.MultiplyNode(decNode, new numberNode_1.NumberNode(10));
+        return new multiplyNode_1.MultiplyNode(decNode, new powerNode_1.PowerNode(new numberNode_1.NumberNode(10), new numberNode_1.NumberNode(power)));
+    }
     toTree() {
         return new numberNode_1.NumberNode(this.value);
     }

package/lib/math/numbers/integer/integer.js

@@ -9,7 +9,7 @@ const rational_1 = require("../rationals/rational");
 const primes_1 = require("./primes");
 class IntegerConstructor {
     static random(nbOfDigits, excludes) {
-        return (0, randint_1.randint)(0, 10 ** nbOfDigits, excludes);
+        return (0, randint_1.randint)(10 ** (nbOfDigits - 1), 10 ** nbOfDigits, excludes);
     }
     static randomPrime(max = 20) {
         return (0, random_1.random)(primes_1.primes.filter((p) => p < 20));

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;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"}
+{"version":3,"file":"rational.d.ts","sourceRoot":"","sources":["../../../../src/math/numbers/rationals/rational.ts"],"names":[],"mappings":"AAKA,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;IAKd,QAAQ,IAAI,MAAM;CAMnB"}

package/lib/math/numbers/rationals/rational.js

@@ -5,6 +5,7 @@ const coprimesOf_1 = require("../../../math/utils/arithmetic/coprimesOf");
 const gcd_1 = require("../../../math/utils/arithmetic/gcd");
 const lcd_1 = require("../../../math/utils/arithmetic/lcd");
 const randint_1 = require("../../../math/utils/random/randint");
+const oppositeNode_1 = require("../../../tree/nodes/functions/oppositeNode");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
 const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
@@ -54,11 +55,11 @@ class Rational {
         this.denum = denumerator;
         this.value = numerator / denumerator;
         this.isSimplified = Math.abs((0, gcd_1.gcd)(numerator, denumerator)) === 1;
-        this.tex = `\\frac{${this.num}}{${this.denum}}`;
+        this.tex = `${this.num < 0 ? '-' : ''}\\frac{${this.num < 0 ? -this.num : this.num}}{${this.denum}}`;
         this.type = nombre_1.NumberType.Rational;
     }
     toTex() {
-        return `\\frac{${this.num}}{${this.denum}}`;
+        return `${this.num < 0 ? '-' : ''}\\frac{${this.num < 0 ? -this.num : this.num}}{${this.denum}}`;
     }
     add(nb) {
         switch (nb.type) {
@@ -110,6 +111,8 @@ class Rational {
         return new Rational(-this.num, this.denum);
     }
     toTree() {
+        if (this.num < 0)
+            return new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-this.num), new numberNode_1.NumberNode(this.denum)));
         return new fractionNode_1.FractionNode(new numberNode_1.NumberNode(this.num), new numberNode_1.NumberNode(this.denum));
     }
     simplify() {

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

@@ -4,6 +4,7 @@ export declare abstract class PolynomialConstructor {
     static random(maxOrder: number, variable?: string): Polynomial;
     static randomWithLength(maxOrder: number, length: number, variable?: string): Polynomial;
     static randomWithLengthAndSameSigns(maxOrder: number, length: number, variable?: string): Polynomial;
+    static randomNoFI(maxOrder: number, to: '+\\infty' | '-\\infty', length?: number, variable?: string): Polynomial;
 }
 export declare class Polynomial {
     degree: number;

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;AAW7C,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;IActD,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAmBhF,MAAM,CAAC,4BAA4B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;CAmB7F;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"}
+{"version":3,"file":"polynomial.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/polynomial.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAW7C,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;IActD,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAmBhF,MAAM,CAAC,4BAA4B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAmB5F,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,GAAG,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;CAyBzG;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

@@ -72,6 +72,31 @@ class PolynomialConstructor {
         coefficients.push(sign * (0, randint_1.randint)(0, 10, [0]));
         return new Polynomial(coefficients, variable);
     }
+    static randomNoFI(maxOrder, to, length, variable = 'x') {
+        if (maxOrder < 0) {
+            throw Error('Order must be a non-negative integer');
+        }
+        const order = (0, randint_1.randint)(1, maxOrder + 1);
+        const fixedLength = length ?? order;
+        if (to === '+\\infty') {
+            return PolynomialConstructor.randomWithLengthAndSameSigns(maxOrder, fixedLength, variable);
+        }
+        //en -infini les degrés de parité différentes doivent avoir un signe différent
+        const coefficients = [];
+        const otherTermDegrees = [];
+        const signEven = (0, coinFlip_1.coinFlip)() ? 1 : -1;
+        for (let i = 0; i < fixedLength - 1; i++) {
+            otherTermDegrees.push((0, randint_1.randint)(0, order));
+        }
+        for (let i = 0; i <= order - 1; i++) {
+            if (otherTermDegrees.includes(i))
+                coefficients.push((i % 2 === 0 ? signEven : -signEven) * (0, randint_1.randint)(0, 10, [0]));
+            else
+                coefficients.push(0);
+        }
+        coefficients.push((order % 2 === 0 ? signEven : -signEven) * (0, randint_1.randint)(0, 10, [0]));
+        return new Polynomial(coefficients, variable);
+    }
 }
 exports.PolynomialConstructor = PolynomialConstructor;
 class Polynomial {

package/lib/utils/probaFlip.d.ts

@@ -0,0 +1,2 @@
+export declare const probaFlip: (n: number) => boolean;
+//# sourceMappingURL=probaFlip.d.ts.map

package/lib/utils/probaFlip.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"probaFlip.d.ts","sourceRoot":"","sources":["../../src/utils/probaFlip.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,SAAS,MAAO,MAAM,YAElC,CAAC"}

package/lib/utils/probaFlip.js

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

package/package.json

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