math-exercises 1.4.3 → 1.4.5

package/lib/exercises/calculLitteral/equation/fractionEquation.js

@@ -12,7 +12,7 @@ const uuid_1 = require("uuid");
 exports.fractionEquation = {
     id: 'fractionEquation',
     connector: '\\iff',
-    instruction: 'Résoudre :',
+    instruction: '',
     label: 'Résoudre une équation quotient nul',
     levels: ['2nde', '1reESM', '1reSpé', '1reTech'],
     sections: ['Équations'],
@@ -65,6 +65,7 @@ function getFractionEquation() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: `Résoudre : $\\frac{${polynome1.toTex()}}{${polynome2.toTex()}} = 0$`,
         startStatement: `\\frac{${polynome1.toTex()}}{${polynome2.toTex()}} = 0`,
         answer,
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou', 'emptyset'],

package/lib/exercises/calculLitteral/equation/multiplicationEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"multiplicationEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/multiplicationEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU/E,eAAO,MAAM,sBAAsB,EAAE,YAYpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAyEpD"}
+{"version":3,"file":"multiplicationEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/multiplicationEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU/E,eAAO,MAAM,sBAAsB,EAAE,YAYpC,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CA0EpD"}

package/lib/exercises/calculLitteral/equation/multiplicationEquation.js

@@ -12,7 +12,7 @@ const uuid_1 = require("uuid");
 exports.multiplicationEquation = {
     id: 'multiplicationEquation',
     connector: '\\iff',
-    instruction: 'Résoudre :',
+    instruction: '',
     label: 'Résoudre une équation produit nul',
     levels: ['2nde', '1reESM', '1reSpé', '1reTech'],
     sections: ['Équations'],
@@ -68,6 +68,7 @@ function getMultiplicationEquation() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: `Résoudre : $(${polynome1.toTex()})(${polynome2.toTex()}) = 0$`,
         startStatement: `(${polynome1.toTex()})(${polynome2.toTex()}) = 0`,
         answer: `S=\\left\\{${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-b), new numberNode_1.NumberNode(a))).toTex()};${(0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(-d), new numberNode_1.NumberNode(c))).toTex()}\\right\\}`,
         keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou'],

package/lib/exercises/calculLitteral/factorisation/factoIdRmq1.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB/E,eAAO,MAAM,WAAW,EAAE,YAYzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA2DhD"}
+{"version":3,"file":"factoIdRmq1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq1.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAgB/E,eAAO,MAAM,WAAW,EAAE,YAYzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA4DhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq1.js

@@ -14,7 +14,7 @@ const uuid_1 = require("uuid");
 exports.factoIdRmq1 = {
     id: 'factoIdRmq1',
     connector: '=',
-    instruction: 'Factoriser :',
+    instruction: '',
     isSingleStep: false,
     label: 'Factorisation du type $a^2 + 2ab + b^2$',
     levels: ['3ème', '2nde'],
@@ -61,6 +61,7 @@ function getFactoType1Question() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: `Factoriser : $${statementTree.toTex()}$`,
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],

package/lib/exercises/calculLitteral/factorisation/factoIdRmq2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY/E,eAAO,MAAM,WAAW,EAAE,YAYzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAqEhD"}
+{"version":3,"file":"factoIdRmq2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq2.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY/E,eAAO,MAAM,WAAW,EAAE,YAYzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAuEhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq2.js

@@ -14,7 +14,7 @@ const uuid_1 = require("uuid");
 exports.factoIdRmq2 = {
     id: 'factoIdRmq2',
     connector: '=',
-    instruction: 'Factoriser :',
+    instruction: '',
     isSingleStep: false,
     label: 'Factorisation du type $a^2 - 2ab + b^2$',
     levels: ['3ème', '2nde'],
@@ -69,6 +69,7 @@ function getFactoType1Question() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: `Factoriser : $${statementTree.toTex()}$`,
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],

package/lib/exercises/calculLitteral/factorisation/factoIdRmq3.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoIdRmq3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq3.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa/E,eAAO,MAAM,WAAW,EAAE,YAYzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA2EhD"}
+{"version":3,"file":"factoIdRmq3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoIdRmq3.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa/E,eAAO,MAAM,WAAW,EAAE,YAYzB,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CA6EhD"}

package/lib/exercises/calculLitteral/factorisation/factoIdRmq3.js

@@ -13,7 +13,7 @@ const uuid_1 = require("uuid");
 exports.factoIdRmq3 = {
     id: 'factoIdRmq3',
     connector: '=',
-    instruction: 'Factoriser :',
+    instruction: '',
     isSingleStep: false,
     label: 'Factorisation du type $a^2 - b^2$',
     levels: ['3ème', '2nde'],
@@ -75,6 +75,7 @@ function getFactoType1Question() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: `Factoriser : $${statementTree.toTex()}$`,
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],

package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"factoType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoType1Exercise.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU/E,eAAO,MAAM,kBAAkB,EAAE,YAYhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAmGhD"}
+{"version":3,"file":"factoType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/factoType1Exercise.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU/E,eAAO,MAAM,kBAAkB,EAAE,YAYhC,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAqGhD"}

package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.js

@@ -15,7 +15,7 @@ const uuid_1 = require("uuid");
 exports.factoType1Exercise = {
     id: 'facto1',
     connector: '=',
-    instruction: 'Factoriser :',
+    instruction: '',
     isSingleStep: false,
     label: 'Factorisation du type $(ax+b)(cx+d) \\pm (ax+b)(ex+f)$',
     levels: ['3ème', '2nde'],
@@ -79,6 +79,7 @@ function getFactoType1Question() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: `Factoriser : $${statementTree.toTex()}$`,
         startStatement: statementTree.toTex(),
         answer: answerTree.toTex(),
         keys: ['x'],

package/lib/exercises/calculLitteral/simplifying/reduceExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reduceExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/reduceExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ/E,eAAO,MAAM,gBAAgB,EAAE,YAY9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAmI9C"}
+{"version":3,"file":"reduceExpression.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/reduceExpression.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ/E,eAAO,MAAM,gBAAgB,EAAE,YAY9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAoI9C"}

package/lib/exercises/calculLitteral/simplifying/reduceExpression.js

@@ -10,7 +10,7 @@ const uuid_1 = require("uuid");
 exports.reduceExpression = {
     id: 'reduceExpression',
     connector: '=',
-    instruction: "Réduire l'expression suivante :",
+    instruction: '',
     isSingleStep: false,
     label: 'Réduire une expression',
     levels: ['4ème', '3ème', '2nde', 'CAP', '2ndPro'],
@@ -112,6 +112,7 @@ function getReduceExpression() {
         return (0, shuffle_1.shuffle)(res);
     };
     const question = {
+        instruction: `Réduire l'expression suivante : $${statement.toTex()}$`,
         startStatement: statement.toTex(),
         answer,
         keys: ['x'],

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;