math-exercises 3.0.110 → 3.0.111

package/lib/exercises/math/functions/trinoms/roots/rootsFromFactorizedForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rootsFromFactorizedForm.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsFromFactorizedForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkHF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAazD,CAAC"}
+{"version":3,"file":"rootsFromFactorizedForm.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsFromFactorizedForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkHF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAazD,CAAC"}

package/lib/exercises/math/functions/trinoms/roots/rootsFromFactorizedForm.js

@@ -7,16 +7,15 @@ import { NumberNode } from "../../../../../tree/nodes/numbers/numberNode.js";
 import { discreteSetParser } from "../../../../../tree/parsers/discreteSetParser.js";
 import { shuffle } from "../../../../../utils/alea/shuffle.js";
 import { handleVEAError } from "../../../../../utils/errors/handleVEAError.js";
-const getHint = (identifiers) => {
-    return `Un produit est nul si et seulement si un de ses facteurs est nul. 
-  
-Il faut donc trouver les valeurs de $x$ qui rendent un des facteurs nuls.`;
-};
-const getCorrection = (identifiers) => {
-    const { a, b, c } = identifiers;
-    const trinom = new Trinom(a, b, c);
-    return ``;
-};
+// const getHint: GetHint<Identifiers> = (identifiers) => {
+//   return `Un produit est nul si et seulement si un de ses facteurs est nul.
+// Il faut donc trouver les valeurs de $x$ qui rendent un des facteurs nuls.`;
+// };
+// const getCorrection: GetCorrection<Identifiers> = (identifiers) => {
+//   const { a, b, c } = identifiers;
+//   const trinom = new Trinom(a, b, c);
+//   return ``;
+// };
 const getInstruction = (identifiers) => {
     const { a, b, c } = identifiers;
     const trinom = new Trinom(a, b, c);
@@ -72,7 +71,7 @@ const getPropositions = (n, { answer, a, b, c }) => {
     }
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { answer, a, b, c }) => {
+const isAnswerValid = (ans, { answer }) => {
     try {
         const parsed = discreteSetParser(ans);
         if (!parsed)

package/lib/exercises/math/functions/trinoms/roots/rootsProduct.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rootsProduct.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsProduct.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,4CAA4C,CAAC;AAOpD,KAAK,WAAW,GAAG;IACjB,iBAAiB,EAAE,qBAAqB,CAAC;CAC1C,CAAC;AA+GF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAc9C,CAAC"}
+{"version":3,"file":"rootsProduct.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsProduct.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,4CAA4C,CAAC;AAMpD,KAAK,WAAW,GAAG;IACjB,iBAAiB,EAAE,qBAAqB,CAAC;CAC1C,CAAC;AA+GF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAc9C,CAAC"}

package/lib/exercises/math/functions/trinoms/roots/rootsProduct.js

@@ -37,7 +37,7 @@ On admet que $f$ possède deux racines.
 
 Que vaut le produit des racines de $f$ ?`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Si $f(x) = ax^2 + bx + c$ admet deux racines, alors leur produit $P$ vaut : 
     
 $$
@@ -63,13 +63,13 @@ P = ${ans.toSimplificationTex()}
 $$
   `;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return [];
 };
 const isAnswerValid = (ans, { answer }) => {
     return rationalVEA(ans, answer);
 };
-const getRootsProductQuestion = (ops) => {
+const getRootsProductQuestion = () => {
     //(b,c) != 0
     //ac <= 0
     const a = randint(-10, 10, [0]);

package/lib/exercises/math/functions/trinoms/roots/rootsReading.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rootsReading.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAmGF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAY9C,CAAC"}
+{"version":3,"file":"rootsReading.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAmGF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAY9C,CAAC"}

package/lib/exercises/math/functions/trinoms/roots/rootsReading.js

@@ -7,7 +7,7 @@ import { randint } from "../../../../../math/utils/random/randint.js";
 import { divide } from "../../../../../tree/nodes/operators/divideNode.js";
 import { multiply } from "../../../../../tree/nodes/operators/multiplyNode.js";
 import { probaLawFlip } from "../../../../../utils/alea/probaLawFlip.js";
-const getInstruction = (identifiers) => {
+const getInstruction = () => {
     return `Déterminer graphiquement le ou les racine(s) du polynôme du second degré représenté ci-dessous.
   
 S'il n'y en a pas, on écrira "Aucun".`;
@@ -64,7 +64,7 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     tryToAddWrongProp(propositions, "\\text{Aucun}");
-    const { a, b, c } = identifiers;
+    const { a, b } = identifiers;
     tryToAddWrongProp(propositions, divide(-b, multiply(2, a)).simplify().toTex());
     while (propositions.length < n) {
         const x1 = randint(-10, 10);
@@ -74,7 +74,7 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     }
     return shuffleProps(propositions, n);
 };
-const isAnswerValid = (ans, { answer, a, b, c }) => {
+const isAnswerValid = (ans, { a, b, c }) => {
     const roots = new Trinom(a, b, c).getRoots();
     if (!roots.length) {
         return ans === "\\text{Aucun}";

package/lib/exercises/math/functions/trinoms/roots/rootsSum.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rootsSum.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,4CAA4C,CAAC;AAOpD,KAAK,WAAW,GAAG;IACjB,iBAAiB,EAAE,qBAAqB,CAAC;CAC1C,CAAC;AA0GF,eAAO,MAAM,QAAQ,EAAE,QAAQ,CAAC,WAAW,CAc1C,CAAC"}
+{"version":3,"file":"rootsSum.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/roots/rootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,4CAA4C,CAAC;AAMpD,KAAK,WAAW,GAAG;IACjB,iBAAiB,EAAE,qBAAqB,CAAC;CAC1C,CAAC;AA0GF,eAAO,MAAM,QAAQ,EAAE,QAAQ,CAAC,WAAW,CAc1C,CAAC"}

package/lib/exercises/math/functions/trinoms/roots/rootsSum.js

@@ -37,7 +37,7 @@ On admet que $f$ possède deux racines.
   
 Que vaut la somme des racines de $f$ ?`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Si $f(x) = ax^2 + bx + c$ admet deux racines, alors leur somme vaut : 
   
 $$
@@ -63,13 +63,13 @@ S = ${ans.toSimplificationTex()}
 $$
 `;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return [];
 };
 const isAnswerValid = (ans, { answer }) => {
     return rationalVEA(ans, answer);
 };
-const getRootsSumQuestion = (ops) => {
+const getRootsSumQuestion = () => {
     //ac <= 0
     const a = randint(-10, 10, [0]);
     const b = randint(-10, 10);

package/lib/exercises/math/functions/trinoms/sign/trinomSignFromFacto.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trinomSignFromFacto.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/sign/trinomSignFromFacto.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAkBrC,KAAK,WAAW,GAAG;IACjB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,gBAAgB,EAAE,OAAO,CAAC;CAC3B,CAAC;AA8HF,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,WAAW,CAqBrD,CAAC"}
+{"version":3,"file":"trinomSignFromFacto.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/sign/trinomSignFromFacto.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAkBrC,KAAK,WAAW,GAAG;IACjB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,gBAAgB,EAAE,OAAO,CAAC;CAC3B,CAAC;AAyHF,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,WAAW,CAqBrD,CAAC"}

package/lib/exercises/math/functions/trinoms/sign/trinomSignFromFacto.js

@@ -12,9 +12,6 @@ const getPropositions = (n, { answer, trinomCoeffs, isAskingPositive }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     const trinom = TrinomNodeConstructor.fromCoeffs(trinomCoeffs);
-    const roots = trinom.getRoots();
-    const a = trinomCoeffs[2];
-    const b = trinomCoeffs[1];
     tryToAddWrongProp(propositions, getAnswer({ trinomCoeffs, isAskingPositive: !isAskingPositive }));
     tryToAddWrongProp(propositions, new IntervalNode(trinom.a, trinom.b, ClosureType.FF).toTex());
     while (propositions.length < n) {
@@ -47,7 +44,7 @@ $$
 
 Sur quel(s) intervalle(s) les valeurs de la fonction $f$ sont-elles ${identifiers.isAskingPositive ? "positives" : "négatives"} ?`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Une fonction polynôme de degré $2$ est du signe de son coefficient $a$, sauf entre ses racines.`;
 };
 const getCorrection = (identifiers) => {
@@ -69,10 +66,10 @@ $$
 ${answer}
 $$`;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return ["lbracket", "semicolon", "rbracket", "infty", "cup"];
 };
-const isAnswerValid = (ans, { answer, isAskingPositive, trinomCoeffs }) => {
+const isAnswerValid = (ans, { answer }) => {
     try {
         const parsed = unionIntervalParser(ans);
         if (!parsed)

package/lib/exercises/math/functions/trinoms/sign/trinomSignFromRoots.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trinomSignFromRoots.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/sign/trinomSignFromRoots.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAkBrC,KAAK,WAAW,GAAG;IACjB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,gBAAgB,EAAE,OAAO,CAAC;CAC3B,CAAC;AA6HF,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,WAAW,CAqBrD,CAAC"}
+{"version":3,"file":"trinomSignFromRoots.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/sign/trinomSignFromRoots.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAkBrC,KAAK,WAAW,GAAG;IACjB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,gBAAgB,EAAE,OAAO,CAAC;CAC3B,CAAC;AAwHF,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,WAAW,CAqBrD,CAAC"}

package/lib/exercises/math/functions/trinoms/sign/trinomSignFromRoots.js

@@ -12,9 +12,6 @@ const getPropositions = (n, { answer, trinomCoeffs, isAskingPositive }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     const trinom = TrinomNodeConstructor.fromCoeffs(trinomCoeffs);
-    const roots = trinom.getRoots();
-    const a = trinomCoeffs[2];
-    const b = trinomCoeffs[1];
     tryToAddWrongProp(propositions, getAnswer({ trinomCoeffs, isAskingPositive: !isAskingPositive }));
     tryToAddWrongProp(propositions, new IntervalNode(trinom.a, trinom.b, ClosureType.FF).toTex());
     while (propositions.length < n) {
@@ -46,7 +43,7 @@ Les racines de $f$ sont $x_1 = ${roots[0].toTex()}$ et $x_2=${roots[1].toTex()}$
 
 Sur quel(s) intervalle(s) les valeurs de la fonction $f$ sont-elles ${identifiers.isAskingPositive ? "positives" : "négatives"} ?`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Une fonction polynôme de degré $2$ est du signe de son coefficient $a$, sauf entre ses racines.`;
 };
 const getCorrection = (identifiers) => {
@@ -68,10 +65,10 @@ $$
 ${answer}
 $$`;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return ["lbracket", "semicolon", "rbracket", "infty", "cup"];
 };
-const isAnswerValid = (ans, { answer, isAskingPositive, trinomCoeffs }) => {
+const isAnswerValid = (ans, { answer }) => {
     try {
         const parsed = unionIntervalParser(ans);
         if (!parsed)

package/lib/exercises/math/functions/trinoms/summitAndCanonical/alphaBetaInCanonicalForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"alphaBetaInCanonicalForm.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/summitAndCanonical/alphaBetaInCanonicalForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AA+EF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAa1D,CAAC"}
+{"version":3,"file":"alphaBetaInCanonicalForm.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/summitAndCanonical/alphaBetaInCanonicalForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AA+EF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAa1D,CAAC"}

package/lib/exercises/math/functions/trinoms/summitAndCanonical/alphaBetaInCanonicalForm.js

@@ -18,7 +18,7 @@ $$
 Que vaut $${param}$ ?`;
 };
 const getAnswer = (identifiers) => {
-    const { param, a, alpha, beta } = identifiers;
+    const { param, alpha, beta } = identifiers;
     return param === "\\alpha" ? alpha.frenchify() : beta.frenchify();
 };
 const getStartStatement = (identifiers) => {
@@ -57,7 +57,7 @@ const getPropositions = (n, { answer, param, alpha, beta, a }) => {
     }
     return shuffle(propositions);
 };
-const isAnswerValid = (ans, { a, alpha, beta, param }) => {
+const isAnswerValid = (ans, { alpha, beta, param }) => {
     if (param === "\\alpha") {
         return ans === alpha.toString();
     }

package/lib/exercises/math/functions/trinoms/summitAndCanonical/canonicalFromDevForm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"canonicalFromDevForm.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/summitAndCanonical/canonicalFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA8DF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAatD,CAAC"}
+{"version":3,"file":"canonicalFromDevForm.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/summitAndCanonical/canonicalFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAKrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA8DF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAatD,CAAC"}

package/lib/exercises/math/functions/trinoms/summitAndCanonical/extremumTypeFromAlgebricForm.js

@@ -36,7 +36,7 @@ const getExtremumTypeFromAlgebricFormQuestion = () => {
     const identifiers = { isDevForm, a: trinom.a, b: trinom.b, c: trinom.c };
     return getQuestionFromIdentifiers(identifiers);
 };
-const getPropositions = (n, { answer, a }) => {
+const getPropositions = (_n, { answer, a }) => {
     const propositions = [];
     addValidProp(propositions, answer, "raw");
     tryToAddWrongProp(propositions, a < 0 ? "Un minimum" : "Un maximum", "raw");

package/lib/exercises/math/functions/trinoms/summitAndCanonical/summitAbscissFromDevForm.js

@@ -42,7 +42,7 @@ const getQuestionFromIdentifiers = (identifiers) => {
     };
     return question;
 };
-const getPropositions = (n, { answer, a, b, c }) => {
+const getPropositions = (n, { answer, a, b }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     tryToAddWrongProp(propositions, new Rational(-b, a).simplify().toTree().toTex());
@@ -52,7 +52,7 @@ const getPropositions = (n, { answer, a, b, c }) => {
     }
     return shuffleProps(propositions, n);
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `L'abscisse $\\alpha$ du sommet d'une parabole s'obtient à partir de la forme développée $f(x) = ax^2 + bx +c$ via la formule : 
   
 $$
@@ -60,7 +60,7 @@ $$
 $$`;
 };
 const getCorrection = (identifiers) => {
-    const { a, b, c } = identifiers;
+    const { a, b } = identifiers;
     const alpha = frac(opposite(b), multiply(2, a), {
         allowMinusAnywhereInFraction: true,
     });
@@ -80,7 +80,7 @@ ${alignTex([
     ])}
 `;
 };
-const isAnswerValid = (ans, { answer, a, b, c }) => {
+const isAnswerValid = (ans, { answer }) => {
     try {
         const parsed = parseAlgebraic(ans);
         return parsed.simplify({ decimalToFractions: true }).toTex() === answer;

package/lib/exercises/math/functions/trinoms/summitAndCanonical/summitAbscissFromRoots.js

@@ -25,7 +25,7 @@ const getAnswer = (identifiers) => {
         .toTex();
     return answer;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `L'abscisse du sommet d'une parabole admettant deux racines est la moyenne des racines.`;
 };
 const getCorrection = (identifiers) => {
@@ -66,7 +66,7 @@ const getPropositions = (n, { answer, a, b, c }) => {
     }
     return shuffleProps(propositions, n);
 };
-const isAnswerValid = (ans, { answer, a, b, c }) => {
+const isAnswerValid = (ans, { answer }) => {
     try {
         const parsed = parseAlgebraic(ans);
         return parsed.simplify({ decimalToFractions: true }).toTex() === answer;

package/lib/exercises/math/functions/trinoms/summitAndCanonical/summitReading.js

@@ -5,7 +5,7 @@ import { GeogebraConstructor } from "../../../../../geogebra/geogebraConstructor
 import { Point } from "../../../../../math/geometry/point.js";
 import { Trinom, TrinomConstructor } from "../../../../../math/polynomials/trinom.js";
 import { randint } from "../../../../../math/utils/random/randint.js";
-const getInstruction = (identifiers) => {
+const getInstruction = () => {
     return `Déterminer les coordonnées du sommet de la parabole représentée ci-dessous :`;
 };
 const getAnswer = (identifiers) => {

package/lib/exercises/math/functions/trinoms/trinomialMeanValue.js

@@ -73,7 +73,7 @@ const getPropositions = (n, { answer, quadrinomial, leftbound, rightbound }) =>
     }
     return shuffleProps(propositions, n);
 };
-const isAnswerValid = (ans, { answer, quadrinomial, leftbound, rightbound }) => {
+const isAnswerValid = (ans, { quadrinomial, leftbound, rightbound }) => {
     const quadrinomial1 = new Polynomial(quadrinomial);
     const validanswer = new MultiplyNode(new FractionNode(new NumberNode(1), (rightbound - leftbound).toTree()), (quadrinomial1.calculate(rightbound) - quadrinomial1.calculate(leftbound)).toTree()).simplify();
     const latexs = validanswer.toAllValidTexs();

package/lib/exercises/math/functions/variations/compareImagesInVarTable.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compareImagesInVarTable.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/compareImagesInVarTable.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAkJF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAiBzD,CAAC"}
+{"version":3,"file":"compareImagesInVarTable.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/compareImagesInVarTable.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,EAAE,EAAE,MAAM,EAAE,CAAC;IACb,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAgJF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAiBzD,CAAC"}

package/lib/exercises/math/functions/variations/compareImagesInVarTable.js

@@ -12,7 +12,7 @@ const getPropositions = (n, { answer }) => {
     return shuffleProps(propositions, n);
 };
 const getAnswer = (identifiers) => {
-    const { a, b, vars, xs, ys } = identifiers;
+    const { a, vars, xs } = identifiers;
     const index = a < xs[0] ? 0 : a >= xs[1] ? 2 : 1;
     if (vars[index] === "\\nearrow") {
         return "\\le";
@@ -59,15 +59,14 @@ $$
 f(${a}) \\ \\ldots \\ f(${b}) 
 $$`;
 };
-const getHint = (identifiers) => {
-    const { a, b, vars, xs, ys } = identifiers;
+const getHint = () => {
     return `Soient $a$ et $b$ deux nombres d'un intervalle $I$, tels que $a\\leq b$ :
   
 - si la fonction $f$ est croissante sur $I$, alors $f(a)\\leq f(b)$;
 - si la fonction $f$ est décroissante sur $I$, alors $f(a)\\geq f(b)$.`;
 };
 const getCorrection = (identifiers) => {
-    const { a, b, vars, xs, ys } = identifiers;
+    const { a, b, vars, xs } = identifiers;
     const index = a < xs[0] ? 0 : a >= xs[1] ? 2 : 1;
     const intervals = [
         new IntervalNode(MinusInfinityNode, xs[0].toTree(), ClosureType.OF),
@@ -85,7 +84,7 @@ f(${a}) \\ ${vars[index] === "\\nearrow" ? "\\le" : "\\ge"} f(${b})
 $$
 `;
 };
-const getCompareImagesInVarTableQuestion = (ops) => {
+const getCompareImagesInVarTableQuestion = () => {
     const x1 = randint(-10, 0);
     const x2 = randint(x1 + 6, 16);
     const y1 = randint(-10, 10);

package/lib/exercises/math/functions/variations/partialVarTableFromGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"partialVarTableFromGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/partialVarTableFromGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAmMF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAmB1D,CAAC"}
+{"version":3,"file":"partialVarTableFromGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/partialVarTableFromGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA6LF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAmB1D,CAAC"}

package/lib/exercises/math/functions/variations/partialVarTableFromGraph.js

@@ -4,13 +4,8 @@ import { Polynomial } from "../../../../math/polynomials/polynomial.js";
 import { randint } from "../../../../math/utils/random/randint.js";
 import { coinFlip } from "../../../../utils/alea/coinFlip.js";
 import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
-const getFunc = (identifiers) => {
-    const { coeffs } = identifiers;
-    const poly = new Polynomial(coeffs);
-    return (x) => coeffs;
-};
 const getRoots = (coeffs) => {
-    const [d, c, b, a] = coeffs;
+    const [_d, c, b, a] = coeffs;
     const sqrtDelta = 2 * Math.sqrt(b ** 2 - 3 * a * c);
     const x1 = (-2 * b - sqrtDelta) / (6 * a);
     const x2 = (-2 * b + sqrtDelta) / (6 * a);
@@ -49,7 +44,7 @@ const getFirstLine = (x1, x2) => {
     ];
 };
 const getSecondsLines = (coeffs) => {
-    const [d, c, b, a] = coeffs;
+    const [_d, _c, _b, a] = coeffs;
     const poly = new Polynomial(coeffs);
     const [x1, x2] = getRoots(coeffs);
     const fx1 = poly.calculate(x1);
@@ -86,17 +81,17 @@ const getAnswerTable = (identifiers) => {
     const [x1, x2] = getRoots(coeffs);
     return [getFirstLine(x1, x2), ...getSecondsLines(coeffs)];
 };
-const getInstruction = (identifiers) => {
+const getInstruction = () => {
     return `Dresser le tableau de variations de la fonction $f$ définie sur $\\mathbb{R}$ dont la courbe représentative est donnée ci-dessous :`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `La fonction est définie sur $\\mathbb{R}$, donc les valeurs de $x$ vont de $-\\infty$ à $+\\infty$.
   
 Repère ensuite les points de la courbe auxquels le sens de variation change. Dans la première ligne du tableau, il faut mettre les abscisses de ces points, et dans la deuxième ligne, les ordonnées.`;
 };
 const getCorrection = (identifiers) => {
     const { coeffs } = identifiers;
-    const [d, c, b, a] = coeffs;
+    const [_d, _c, _b, a] = coeffs;
     const poly = new Polynomial(coeffs);
     const [x1, x2] = getRoots(coeffs);
     const fx1 = poly.calculate(x1);
@@ -111,7 +106,7 @@ De plus, on lit graphiquement que l'image de $${x1}$ est $${fx1}$, et celle de $
 
 `;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return ["infty"];
 };
 const isAnswerTableValid = (ans, { answerTable }) => {
@@ -138,7 +133,7 @@ const poly3Coeffs = [
     [0, -9, 6, -1],
     // [0, 36, -24, 4],
 ];
-const getTestSignTableQuestion = (ops) => {
+const getTestSignTableQuestion = () => {
     const index = randint(0, 4);
     const lineAsked = randint(0, 2);
     const coeffs = coinFlip()

package/lib/exercises/math/functions/variations/readExtremaOnGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readExtremaOnGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/readExtremaOnGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAmBT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,EAAE,MAAM,EAAE,EAAE,CAAC;IACzB,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B,CAAC;AACF,KAAK,OAAO,GAAG;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AA2OF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAoB7D,CAAC"}
+{"version":3,"file":"readExtremaOnGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/readExtremaOnGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,EAAE,MAAM,EAAE,EAAE,CAAC;IACzB,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B,CAAC;AACF,KAAK,OAAO,GAAG;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AA2OF,eAAO,MAAM,kBAAkB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAoB7D,CAAC"}

package/lib/exercises/math/functions/variations/readExtremaOnGraph.js

@@ -12,7 +12,7 @@ import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
 const getPropositions = (n, { answer, ...identifiers }) => {
     const propositions = [];
     addValidProp(propositions, answer);
-    const { askingMax, askingX, splinePoints } = identifiers;
+    const { askingMax, splinePoints } = identifiers;
     const y = (askingMax ? Math.max : Math.min)(...splinePoints.map((e) => e[1]));
     const x = splinePoints.find((e) => e[1] === y)[0];
     tryToAddWrongProp(propositions, x.frenchify());
@@ -32,7 +32,7 @@ const getAnswer = (identifiers) => {
         : extremum.frenchify();
 };
 const getInstruction = (identifiers) => {
-    const { askingMax, askingX, splinePoints, intervalBounds } = identifiers;
+    const { splinePoints, intervalBounds } = identifiers;
     const xMin = splinePoints[0][0];
     const xMax = splinePoints[splinePoints.length - 1][0];
     const word = identifiers.askingMax ? "maximum" : "minimum";
@@ -45,13 +45,13 @@ ${identifiers.askingX
         ? `En quelle valeur le ${word} de $f$ sur ${interval} est-il atteint ?`
         : `Déterminer le ${word} de $f$ sur ${interval}.`}`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `- Le maximum d'une fonction $f$ sur un intervalle $I$ est la plus grande valeur prise par $f(x)$ pour $x\\in I$. On dit alors que le maximum de $f$ sur $I$ est $f(x)$, atteint en $x$.
 
 - Le minimum d'une fonction $f$ sur un intervalle $I$ est la plus petite valeur prise par $f(x)$ pour $x\\in I$. On dit alors que le minimum de $f$ sur $I$ est $f(x)$, atteint en $x$.`;
 };
 const getCorrection = (identifiers) => {
-    const { askingMax, askingX, splinePoints, intervalBounds } = identifiers;
+    const { askingMax, splinePoints, intervalBounds } = identifiers;
     const word = askingMax ? "maximum" : "minimum";
     const xMin = splinePoints[0][0];
     const xMax = splinePoints[splinePoints.length - 1][0];
@@ -67,7 +67,7 @@ const getCorrection = (identifiers) => {
     const y = extremum.frenchify();
     return `On lit graphiquement que le ${word} de $f(x)$ sur $${interval}$ est $${y}$, atteint pour $x = ${x}$. En effet, c'est la plus ${word2} valeur de $f(x)$ sur $${interval}$.`;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return [];
 };
 const isAnswerValid = (ans, { answer }) => {
@@ -170,7 +170,7 @@ const getReadExtremaOnGraphQuestion = (opts) => {
     };
     return getQuestionFromIdentifiers(identifiers, opts);
 };
-const getQuestionFromIdentifiers = (identifiers, opts) => {
+const getQuestionFromIdentifiers = (identifiers) => {
     return {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),

package/lib/exercises/math/functions/variations/readVarOnGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readVarOnGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/readVarOnGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAkBrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;CAC5B,CAAC;AAsHF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAmBhD,CAAC"}
+{"version":3,"file":"readVarOnGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/readVarOnGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;CAC5B,CAAC;AAsHF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAmBhD,CAAC"}

package/lib/exercises/math/functions/variations/readVarOnGraph.js

@@ -5,7 +5,7 @@ import { Polynomial } from "../../../../math/polynomials/polynomial.js";
 import { randint } from "../../../../math/utils/random/randint.js";
 import { MinusInfinityNode, PlusInfinityNode, } from "../../../../tree/nodes/numbers/infiniteNode.js";
 import { ClosureType } from "../../../../tree/nodes/sets/closure.js";
-import { IntervalNode, } from "../../../../tree/nodes/sets/intervalNode.js";
+import { IntervalNode } from "../../../../tree/nodes/sets/intervalNode.js";
 import { coinFlip } from "../../../../utils/alea/coinFlip.js";
 const getPropositions = (n, { answer }) => {
     const propositions = [];
@@ -49,7 +49,7 @@ const getCorrection = (identifiers) => {
 On en conclut donc que ${answer.toLocaleLowerCase()} sur cet intervalle.`;
 };
 const getRoots = (coeffs) => {
-    const [d, c, b, a] = coeffs;
+    const [_d, c, b, a] = coeffs;
     const sqrtDelta = 2 * Math.sqrt(b ** 2 - 3 * a * c);
     const x1 = (-2 * b - sqrtDelta) / (6 * a);
     const x2 = (-2 * b + sqrtDelta) / (6 * a);
@@ -83,7 +83,7 @@ const poly3Coeffs = [
     [0, -9, 6, -1],
     // [0, 36, -24, 4],
 ];
-const getReadVarOnGraphQuestion = (ops) => {
+const getReadVarOnGraphQuestion = () => {
     const index = randint(0, 4);
     const coeffs = coinFlip()
         ? poly3Coeffs[index]

package/lib/exercises/math/functions/variations/readVarOnGraph2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"readVarOnGraph2.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/readVarOnGraph2.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAmBrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,gBAAgB,EAAE,OAAO,CAAC;CAC3B,CAAC;AA4KF,eAAO,MAAM,eAAe,EAAE,QAAQ,CAAC,WAAW,CAoBjD,CAAC"}
+{"version":3,"file":"readVarOnGraph2.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/readVarOnGraph2.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAkBrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,gBAAgB,EAAE,OAAO,CAAC;CAC3B,CAAC;AA4KF,eAAO,MAAM,eAAe,EAAE,QAAQ,CAAC,WAAW,CAoBjD,CAAC"}

package/lib/exercises/math/functions/variations/readVarOnGraph2.js

@@ -59,13 +59,13 @@ const getCorrection = (identifiers) => {
     return `On lit graphiquement que la fonction $f$ est ${word} sur l'intervalle $${intervals[0].toTex()}$ ainsi que sur l'intervalle $${intervals[1].toTex()}$. En effet, sur chacun de ces intervalles, les valeurs de $f(x)$ (c'est à dire les ordonnées des points de la courbe) ${word2}.`;
 };
 const getRoots = (coeffs) => {
-    const [d, c, b, a] = coeffs;
+    const [_d, c, b, a] = coeffs;
     const sqrtDelta = 2 * Math.sqrt(b ** 2 - 3 * a * c);
     const x1 = (-2 * b - sqrtDelta) / (6 * a);
     const x2 = (-2 * b + sqrtDelta) / (6 * a);
     return [x1, x2].sort((a, b) => a - b);
 };
-const isAnswerValid = (ans, { answer, ...identifiers }) => {
+const isAnswerValid = (ans, { answer }) => {
     try {
         const intervals = ans
             .split("\\text{ et }")
@@ -122,7 +122,7 @@ const poly3Coeffs = [
     [0, -9, 6, -1],
     // [0, 36, -24, 4],
 ];
-const getReadVarOnGraphQuestion = (ops) => {
+const getReadVarOnGraphQuestion = () => {
     const index = randint(0, 4);
     const coeffs = coinFlip()
         ? poly3Coeffs[index]
@@ -136,7 +136,7 @@ const getReadVarOnGraphQuestion = (ops) => {
     };
     return getQuestionFromIdentifiers(identifiers);
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return ["infty", "lbracket", "semicolon", "rbracket", "et"];
 };
 const getQuestionFromIdentifiers = (identifiers) => {

package/lib/exercises/math/functions/variations/varTableExtremaReading.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"varTableExtremaReading.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/varTableExtremaReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAoBT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B,CAAC;AAyPF,KAAK,OAAO,GAAG;IACb,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAWF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAgBjE,CAAC"}
+{"version":3,"file":"varTableExtremaReading.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/varTableExtremaReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B,CAAC;AAuPF,KAAK,OAAO,GAAG;IACb,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAWF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAgBjE,CAAC"}

package/lib/exercises/math/functions/variations/varTableExtremaReading.js

@@ -8,7 +8,7 @@ import { coinFlip } from "../../../../utils/alea/coinFlip.js";
 import { random } from "../../../../utils/alea/random.js";
 const getPropositions = (n, { answer, ...identifiers }) => {
     const propositions = [];
-    const { isAskingX, isAskingMin, xValues, yValues, intervalXIndexes } = identifiers;
+    const { xValues, yValues } = identifiers;
     addValidProp(propositions, answer);
     while (propositions.length < n) {
         tryToAddWrongProp(propositions, random(coinFlip() ? xValues : yValues).frenchify());
@@ -62,7 +62,7 @@ const getInstruction = (identifiers) => {
     const type = identifiers.isAskingMin ? "minimum" : "maximum";
     const interval = new IntervalNode(identifiers.xValues[identifiers.intervalXIndexes[0]].toTree(), identifiers.xValues[identifiers.intervalXIndexes[1]].toTree(), ClosureType.FF);
     const table = getTable(identifiers);
-    let instruction = `On considère la fonction $f$ dont le tableau de variations est donné ci-dessous : 
+    const instruction = `On considère la fonction $f$ dont le tableau de variations est donné ci-dessous : 
   
 <svg id="varTable">${JSON.stringify(table)}</svg>
   
@@ -72,14 +72,14 @@ ${identifiers.isAskingX
   `;
     return instruction;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Le minimum d'une fonction $f$ sur un intervalle $[a;b]$ est la plus petite valeur de $f(x)$ pour $x$ appartenant à $[a;b]$. On dit alors que le minimum de $f$ sur $[a;b]$ est $f(x)$, atteint en $x$.
 
 Le maximum d'une fonction $f$ sur un intervalle $[a;b]$ est la plus grande valeur de $f(x)$ pour $x$ appartenant à $[a;b]$. On dit alors que le maximum de $f$ sur $[a;b]$ est $f(x)$, atteint en $x$.
   `;
 };
 const getCorrection = (identifiers) => {
-    const { intervalXIndexes, isAskingMin, isAskingX, xValues, yValues } = identifiers;
+    const { intervalXIndexes, isAskingMin, xValues, yValues } = identifiers;
     const type = isAskingMin ? "minimum" : "maximum";
     const type2 = isAskingMin ? "petite" : "grande";
     const interval = new IntervalNode(identifiers.xValues[identifiers.intervalXIndexes[0]].toTree(), identifiers.xValues[identifiers.intervalXIndexes[1]].toTree(), ClosureType.FF);
@@ -127,7 +127,7 @@ ${identifiers.isAskingX
 //     coords: [-10, 10, -10, 10],
 //   });
 // };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return [];
 };
 const isAnswerValid = (ans, { answer }) => {

package/lib/exercises/math/functions/variations/varTableFromGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"varTableFromGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/varTableFromGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;CACvB,CAAC;AA0KF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAmBnD,CAAC"}
+{"version":3,"file":"varTableFromGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/varTableFromGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;CACvB,CAAC;AA0KF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAmBnD,CAAC"}