math-exercises 1.4.4 → 1.4.6

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/calcul/proportionality/proportionalityTable.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"proportionalityTable.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/proportionality/proportionalityTable.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM/E,eAAO,MAAM,oBAAoB,EAAE,YAYlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAyElD"}
+{"version":3,"file":"proportionalityTable.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/proportionality/proportionalityTable.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO/E,eAAO,MAAM,oBAAoB,EAAE,YAYlC,CAAC;AAEF,wBAAgB,uBAAuB,IAAI,QAAQ,CAyElD"}

package/lib/exercises/calcul/proportionality/proportionalityTable.js

@@ -2,6 +2,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getProportionalityTable = exports.proportionalityTable = void 0;
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const integer_1 = require("../../../math/numbers/integer/integer");
 const randint_1 = require("../../../math/utils/random/randint");
 const shuffle_1 = require("../../../utils/shuffle");
 const uuid_1 = require("uuid");
@@ -20,25 +21,25 @@ exports.proportionalityTable = {
 };
 function getProportionalityTable() {
     const fact = (0, randint_1.randint)(2, 10);
-    let [x1, x2] = [1, 2].map((el) => (0, randint_1.randint)(1, 100 / fact));
+    let [x1, x2] = integer_1.IntegerConstructor.randomDifferents(1, 100 / fact, 2);
     let [x3, x4] = [x1 * fact, x2 * fact];
-    let answer;
+    let answer = '';
     const randQuation = (0, randint_1.randint)(0, 4);
     switch (randQuation) {
         case 0:
-            answer = x1;
+            answer = x1 + '';
             x1 = '?';
             break;
         case 1:
-            answer = x2;
+            answer = +x2 + '';
             x2 = '?';
             break;
         case 2:
-            answer = x3;
+            answer = x3 + '';
             x3 = '?';
             break;
         case 3:
-            answer = x4;
+            answer = x4 + '';
             x4 = '?';
             break;
     }
@@ -75,7 +76,7 @@ function getProportionalityTable() {
 |${x2}|${x4}|
 
 Déterminer le nombre manquant.`,
-        answer: answer + '',
+        answer: answer,
         keys: [],
         getPropositions,
         answerFormat: 'tex',

package/lib/exercises/derivation/derivative/expDerivativeOne.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"expDerivativeOne.d.ts","sourceRoot":"","sources":["../../../../src/exercises/derivation/derivative/expDerivativeOne.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,0BAA0B,CAAC;AAWhH,eAAO,MAAM,gBAAgB,EAAE,YAY9B,CAAC;AAEF,wBAAgB,gBAAgB,IAAI,QAAQ,CAsC3C"}
+{"version":3,"file":"expDerivativeOne.d.ts","sourceRoot":"","sources":["../../../../src/exercises/derivation/derivative/expDerivativeOne.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,0BAA0B,CAAC;AAWhH,eAAO,MAAM,gBAAgB,EAAE,YAY9B,CAAC;AAEF,wBAAgB,gBAAgB,IAAI,QAAQ,CAwC3C"}

package/lib/exercises/derivation/derivative/expDerivativeOne.js

@@ -39,8 +39,10 @@ function getExpDerivative() {
         });
         (0, exercise_1.tryToAddWrongProp)(propositions, myfunction.toTex());
         (0, exercise_1.tryToAddWrongProp)(propositions, (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(affine.toTree(), myfunction)).toTex());
-        (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(new numberNode_1.NumberNode(affine.coefficients[1])).toTex());
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(affine.coefficients[0]), myfunction)).toTex());
+        (0, exercise_1.tryToAddWrongProp)(propositions, new expNode_1.ExpNode(new numberNode_1.NumberNode(a)).toTex());
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(b), myfunction)).toTex());
+        while (propositions.length < numOptions)
+            (0, exercise_1.tryToAddWrongProp)(propositions, (0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10)), myfunction)).toTex());
         return (0, exercise_1.shuffleProps)(propositions, numOptions);
     };
     const question = {

package/lib/exercises/derivation/derivative/thirdDegreeDerivative.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"thirdDegreeDerivative.d.ts","sourceRoot":"","sources":["../../../../src/exercises/derivation/derivative/thirdDegreeDerivative.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAOlG,eAAO,MAAM,qBAAqB,EAAE,YAYnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAiEnD"}
+{"version":3,"file":"thirdDegreeDerivative.d.ts","sourceRoot":"","sources":["../../../../src/exercises/derivation/derivative/thirdDegreeDerivative.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,0BAA0B,CAAC;AAOhH,eAAO,MAAM,qBAAqB,EAAE,YAYnC,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAmEnD"}

package/lib/exercises/derivation/derivative/thirdDegreeDerivative.js

@@ -5,7 +5,6 @@ const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const polynomial_1 = require("../../../math/polynomials/polynomial");
 const randint_1 = require("../../../math/utils/random/randint");
-const shuffle_1 = require("../../../utils/shuffle");
 const uuid_1 = require("uuid");
 exports.thirdDegreeDerivative = {
     id: 'thirdDegreeDerivative',
@@ -35,8 +34,10 @@ function getThirdDegreeDerivative() {
             isRightAnswer: true,
             format: 'tex',
         });
-        (0, exercise_1.tryToAddWrongProp)(propositions, new polynomial_1.Polynomial([coefficients[0], coefficients[1], coefficients[2]]).toTree().toTex());
-        (0, exercise_1.tryToAddWrongProp)(propositions, new polynomial_1.Polynomial([coefficients[0] + coefficients[1], coefficients[1], coefficients[2]]).toTree().toTex());
+        if (coefficients[2] !== 0)
+            (0, exercise_1.tryToAddWrongProp)(propositions, new polynomial_1.Polynomial([coefficients[0], coefficients[1], coefficients[2]]).toTree().toTex());
+        if (coefficients[2] !== 0)
+            (0, exercise_1.tryToAddWrongProp)(propositions, new polynomial_1.Polynomial([coefficients[0] + coefficients[1], coefficients[1], coefficients[2]]).toTree().toTex());
         const missing = numOptions - propositions.length;
         for (let i = 0; i < missing; i++) {
             let isDuplicate;
@@ -57,7 +58,7 @@ function getThirdDegreeDerivative() {
             } while (isDuplicate);
             propositions.push(proposition);
         }
-        return (0, shuffle_1.shuffle)(propositions);
+        return (0, exercise_1.shuffleProps)(propositions, numOptions);
     };
     const question = {
         instruction: `Déterminer la fonction dérivée $f'$ de la fonction $f$ définie par $f(x) = ${polynomial.toString()}$.`,

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;AAW1C,eAAO,MAAM,SAAS,EAAE,YAAY,EA6QnC,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");
@@ -159,6 +159,7 @@ const firstDegreeInequationsType2_1 = require("./calculLitteral/inequations/firs
 const firstDegreeInequationsType3_1 = require("./calculLitteral/inequations/firstDegreeInequationsType3");
 const firstDegreeInequationsType0_1 = require("./calculLitteral/inequations/firstDegreeInequationsType0");
 const chasles_1 = require("./geometry/vectors/chasles");
+const deltaTrinom_1 = require("./functions/trinoms/deltaTrinom");
 const rootsFromFactorizedForm_1 = require("./functions/trinoms/rootsFromFactorizedForm");
 const rootsFromDevForm_1 = require("./functions/trinoms/rootsFromDevForm");
 const inequalityToInterval_1 = require("./sets/intervals/inequalityToInterval");
@@ -169,7 +170,15 @@ 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");
+const niceRootsFromDevForm_1 = require("./functions/trinoms/niceRootsFromDevForm");
 exports.exercises = [
     /**
      * calcul litteral
@@ -268,7 +277,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
      */
@@ -383,9 +396,10 @@ exports.exercises = [
     extremumFromCanonicalForm_1.extremumFromCanonicalForm,
     extremumTypeFromAlgebricForm_1.extremumTypeFromAlgebricForm,
     variationsFromAlgebricForm_1.variationsFromAlgebricForm,
-    // deltaTrinom,
+    deltaTrinom_1.deltaTrinom,
     rootsFromFactorizedForm_1.rootsFromFactorizedForm,
     rootsFromDevForm_1.rootsFromDevForm,
+    niceRootsFromDevForm_1.niceRootsFromDevForm,
     /**Complexes */
     mutiplyComplex_1.mutiplyComplex,
     reAndIm_1.reAndIm,
@@ -401,7 +415,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/functions/trinoms/niceRootsFromDevForm.d.ts

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

package/lib/exercises/functions/trinoms/niceRootsFromDevForm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"niceRootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/niceRootsFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAOlG,eAAO,MAAM,oBAAoB,EAAE,YAWlC,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CAgDtD"}

package/lib/exercises/functions/trinoms/niceRootsFromDevForm.js

@@ -0,0 +1,63 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getRootsFromDevFormQuestion = exports.niceRootsFromDevForm = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const trinom_1 = require("../../../math/polynomials/trinom");
+const randint_1 = require("../../../math/utils/random/randint");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.niceRootsFromDevForm = {
+    id: 'niceRootsFromDevForm',
+    connector: '\\iff',
+    instruction: '',
+    label: 'Résoudre une équation du second degré (solutions entières)',
+    levels: ['1reSpé', 'TermSpé', 'MathComp'],
+    isSingleStep: true,
+    sections: ['Second degré'],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRootsFromDevFormQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+};
+function getRootsFromDevFormQuestion() {
+    const trinom = trinom_1.TrinomConstructor.randomFactorized();
+    const answer = trinom.getRootsEquationSolutionTex();
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)(),
+            statement: answer,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        (0, exercise_1.tryToAddWrongProp)(res, 'S=\\emptyset');
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                let wrongX1 = (0, randint_1.randint)(-19, 0);
+                let wrongX2 = (0, randint_1.randint)(0, 20);
+                const wrongAnswer = `S=\\left\\{${wrongX1};${wrongX2}\\right\\}`;
+                proposition = {
+                    id: (0, uuid_1.v4)() + ``,
+                    statement: wrongAnswer,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        answer: answer,
+        instruction: `Soit $f(x) = ${trinom.toTree().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
+        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getRootsFromDevFormQuestion = getRootsFromDevFormQuestion;

package/lib/exercises/functions/trinoms/rootsFromDevForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAM/E,eAAO,MAAM,gBAAgB,EAAE,YAW9B,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CA6CtD"}
+{"version":3,"file":"rootsFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAqB,MAAM,0BAA0B,CAAC;AAOlG,eAAO,MAAM,gBAAgB,EAAE,YAW9B,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CA+CtD"}

package/lib/exercises/functions/trinoms/rootsFromDevForm.js

@@ -1,8 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getRootsFromDevFormQuestion = exports.rootsFromDevForm = void 0;
+const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const trinom_1 = require("../../../math/polynomials/trinom");
+const randint_1 = require("../../../math/utils/random/randint");
 const shuffle_1 = require("../../../utils/shuffle");
 const uuid_1 = require("uuid");
 exports.rootsFromDevForm = {
@@ -12,7 +14,7 @@ exports.rootsFromDevForm = {
     label: 'Résoudre une équation du second degré',
     levels: ['1reSpé', 'TermSpé', 'MathComp'],
     isSingleStep: true,
-    sections: [],
+    sections: ['Second degré'],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRootsFromDevFormQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
@@ -28,12 +30,15 @@ function getRootsFromDevFormQuestion() {
             isRightAnswer: true,
             format: 'tex',
         });
+        (0, exercise_1.tryToAddWrongProp)(res, 'S=\\emptyset');
         const missing = n - res.length;
         for (let i = 0; i < missing; i++) {
             let isDuplicate;
             let proposition;
             do {
-                const wrongAnswer = '';
+                let wrongX1 = (0, randint_1.randint)(-19, 0);
+                let wrongX2 = (0, randint_1.randint)(0, 20);
+                const wrongAnswer = `S=\\left\\{${wrongX1};${wrongX2}\\right\\}`;
                 proposition = {
                     id: (0, uuid_1.v4)() + ``,
                     statement: wrongAnswer,
@@ -49,7 +54,7 @@ function getRootsFromDevFormQuestion() {
     const question = {
         answer: answer,
         instruction: `Soit $f(x) = ${trinom.toTree().toTex()}$. Résoudre l'équation $f(x) = 0$.`,
-        keys: [],
+        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
         getPropositions,
         answerFormat: 'tex',
     };

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

@@ -1 +1 @@
-{"version":3,"file":"distanceBetweenTwoPoints.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/distanceBetweenTwoPoints.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU/E,eAAO,MAAM,wBAAwB,EAAE,YAYtC,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CAkGtD"}
+{"version":3,"file":"distanceBetweenTwoPoints.d.ts","sourceRoot":"","sources":["../../../../src/exercises/geometry/cartesian/distanceBetweenTwoPoints.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAe,QAAQ,EAAmC,MAAM,0BAA0B,CAAC;AAUhH,eAAO,MAAM,wBAAwB,EAAE,YAYtC,CAAC;AAEF,wBAAgB,2BAA2B,IAAI,QAAQ,CAkEtD"}

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

@@ -1,13 +1,13 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getDistanceBetweenTwoPoints = exports.distanceBetweenTwoPoints = void 0;
+const exercise_1 = require("../../../exercises/exercise");
 const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
 const point_1 = require("../../../math/geometry/point");
 const real_1 = require("../../../math/numbers/reals/real");
 const randTupleInt_1 = require("../../../math/utils/random/randTupleInt");
 const round_1 = require("../../../math/utils/round");
 const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const shuffle_1 = require("../../../utils/shuffle");
 const uuid_1 = require("uuid");
 exports.distanceBetweenTwoPoints = {
     id: 'distanceBetweenTwoPoints',
@@ -30,54 +30,26 @@ function getDistanceBetweenTwoPoints() {
     const getPropositions = (n) => {
         const res = [];
         let isDuplicate;
-        let temp = n;
         res.push({
             id: (0, uuid_1.v4)() + '',
             statement: answer,
             isRightAnswer: true,
             format: 'tex',
         });
-        temp--;
         A = new point_1.Point('A', new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords1[1]));
         B = new point_1.Point('B', new numberNode_1.NumberNode(-coords2[0]), new numberNode_1.NumberNode(-coords2[1]));
         let wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0)).simplify().toTree().toTex();
-        isDuplicate = res.some((p) => p.statement === wrongStatement);
-        if (!isDuplicate) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: wrongStatement,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-            temp--;
-        }
+        (0, exercise_1.tryToAddWrongProp)(res, wrongStatement);
         A = new point_1.Point('A', new numberNode_1.NumberNode(coords1[1]), new numberNode_1.NumberNode(coords1[0]));
         B = new point_1.Point('B', new numberNode_1.NumberNode(coords2[0]), new numberNode_1.NumberNode(coords2[1]));
         wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0)).simplify().toTree().toTex();
-        isDuplicate = res.some((p) => p.statement === wrongStatement);
-        if (n > 0 && !isDuplicate) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: wrongStatement,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-            temp--;
-        }
+        (0, exercise_1.tryToAddWrongProp)(res, wrongStatement);
         A = new point_1.Point('A', new numberNode_1.NumberNode(coords1[0]), new numberNode_1.NumberNode(coords2[0]));
         B = new point_1.Point('B', new numberNode_1.NumberNode(coords1[1]), new numberNode_1.NumberNode(coords2[1]));
         wrongStatement = new real_1.SquareRoot((0, round_1.round)(A.distanceTo(B) ** 2, 0)).simplify().toTree().toTex();
-        isDuplicate = res.some((p) => p.statement === wrongStatement);
-        if (n > 0 && !isDuplicate) {
-            res.push({
-                id: (0, uuid_1.v4)() + '',
-                statement: wrongStatement,
-                isRightAnswer: false,
-                format: 'tex',
-            });
-            temp--;
-        }
-        for (let i = 0; i < temp; i++) {
+        (0, exercise_1.tryToAddWrongProp)(res, wrongStatement);
+        const missing = n - res.length;
+        for (let i = 0; i < missing; i++) {
             let proposition;
             do {
                 const [tempCoords1, tempsCoords2] = (0, randTupleInt_1.distinctRandTupleInt)(2, 2, { from: -9, to: 10 });
@@ -92,9 +64,8 @@ function getDistanceBetweenTwoPoints() {
                 isDuplicate = res.some((p) => p.statement === proposition.statement);
             } while (isDuplicate);
             res.push(proposition);
-            temp--;
         }
-        return (0, shuffle_1.shuffle)(res);
+        return (0, exercise_1.shuffleProps)(res, n);
     };
     const question = {
         instruction: `Soit $${A.toTexWithCoords()}$ et $${B.toTexWithCoords()}$. Calculer la distance $AB$.`,

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"}