math-exercises 3.0.110 → 3.0.112

package/lib/exercises/math/geometry/cartesian/readAbscissOnSemiLine.js

@@ -11,7 +11,7 @@ import { multiply, MultiplyNode, } from "../../../../tree/nodes/operators/multip
 import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
 import { random } from "../../../../utils/alea/random.js";
 import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
-const getPropositions = (n, { answer, absciss, abscissTex, abscissType, axisUnit, oneUnitTex }) => {
+const getPropositions = (n, { answer, oneUnitTex }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     const unitNode = parseAlgebraic(oneUnitTex);
@@ -22,11 +22,11 @@ const getPropositions = (n, { answer, absciss, abscissTex, abscissType, axisUnit
     return shuffleProps(propositions, n);
 };
 const getHint = (identifiers) => {
-    const { absciss, axisUnit, oneUnitTex, abscissType, abscissTex, coeff } = identifiers;
+    const { oneUnitTex } = identifiers;
     return `Il faut compter le nombre de graduations entre les points $O$ et $A$. Puis on utilise le fait qu'une graduation vaut $${oneUnitTex}$.`;
 };
 const getCorrection = (identifiers) => {
-    const { absciss, axisUnit, oneUnitTex, abscissType, abscissTex, coeff } = identifiers;
+    const { oneUnitTex, abscissTex, coeff } = identifiers;
     const oneUnitNode = parseAlgebraic(oneUnitTex);
     return `Il y a $${Math.abs(coeff)}$ graduations entre $O$ et $A$. Puisqu'une graduation vaut $${oneUnitTex}$, cela représente un écart de  :
   
@@ -38,13 +38,13 @@ $$
   
 L'abscisse du point $A$ est donc $${abscissTex}$.`;
 };
-const getAnswer = ({ absciss, abscissType, axisUnit, abscissTex, oneUnitTex, }) => {
+const getAnswer = ({ abscissTex }) => {
     return abscissTex;
 };
-const getInstruction = (identifiers) => {
+const getInstruction = () => {
     return `Quelle est l'abscisse du point $A$ sur la demi-droite graduée ci-dessous ?`;
 };
-const getGGBOptions = ({ absciss, abscissType, axisUnit, oneUnitTex, coeff, }) => {
+const getGGBOptions = ({ abscissType, oneUnitTex, coeff, }) => {
     const O = new Point("O", (0).toTree(), (0).toTree());
     const I = new Point("I", (1).toTree(), (0).toTree());
     const A = new Point("A", coeff.toTree(), (0).toTree());
@@ -73,10 +73,10 @@ const getGGBOptions = ({ absciss, abscissType, axisUnit, oneUnitTex, coeff, }) =
         coords: [-1, 10, -2, 2],
     });
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return [];
 };
-const isAnswerValid = (ans, { answer, abscissTex }) => {
+const isAnswerValid = (ans, { abscissTex }) => {
     try {
         const answerNode = parseAlgebraic(ans);
         const node = parseAlgebraic(abscissTex);
@@ -101,7 +101,7 @@ const getReadAbscissOnSemiLineQuestion = () => {
             oneUnitTex = axisUnit.frenchify();
             abscissTex = absciss.frenchify();
             break;
-        case NumberType.Rational:
+        case NumberType.Rational: {
             const randomFrac = random([
                 [1, 2],
                 [1, 3],
@@ -120,6 +120,7 @@ const getReadAbscissOnSemiLineQuestion = () => {
             absciss = axisUnit * coeff;
             abscissTex = new MultiplyNode(oneUnit, coeff.toTree()).simplify().toTex();
             break;
+        }
         case NumberType.Decimal:
         default:
             axisUnit = randfloat(0.1, 5, 1);

package/lib/exercises/math/geometry/convexity/convexityQuadrinomialsGeo.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"convexityQuadrinomialsGeo.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/convexity/convexityQuadrinomialsGeo.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAsBrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;AAqLF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}
+{"version":3,"file":"convexityQuadrinomialsGeo.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/convexity/convexityQuadrinomialsGeo.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAkBrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;AAqLF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}

package/lib/exercises/math/geometry/convexity/convexityQuadrinomialsGeo.js

@@ -2,7 +2,7 @@ import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../../exer
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { blueMain } from "../../../../geogebra/colors.js";
 import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js";
-import { Polynomial, } from "../../../../math/polynomials/polynomial.js";
+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 { NumberNode } from "../../../../tree/nodes/numbers/numberNode.js";
@@ -33,7 +33,7 @@ function generateEvenInflexionPoint() {
     return inflexionPointX;
 }
 const getInstruction = (identifiers) => {
-    const { askConvex, inflexionPoint, quadcoeffs } = identifiers;
+    const { askConvex } = identifiers;
     const questionType = askConvex ? "convexe" : "concave";
     const instruction = `Ci-dessous est tracée la courbe représentative $\\mathcal C_f$ d'une fonction $f$. Sur quel intervalle $f$ est-elle ${questionType} ?`;
     return instruction;
@@ -56,7 +56,7 @@ const getAnswer = (identifiers) => {
     return interval;
 };
 const getGGBOptions = (identifiers) => {
-    const { askConvex, inflexionPoint, quadcoeffs } = identifiers;
+    const { quadcoeffs } = identifiers;
     const quadrinomial = new Polynomial(quadcoeffs);
     const trinomial = quadrinomial.derivate();
     const criticalPoints = trinomial.getRoots();

package/lib/exercises/math/geometry/convexity/convexityTrinomialsGeo.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"convexityTrinomialsGeo.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/convexity/convexityTrinomialsGeo.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAyEF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAcxD,CAAC"}
+{"version":3,"file":"convexityTrinomialsGeo.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/convexity/convexityTrinomialsGeo.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAyEF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAcxD,CAAC"}

package/lib/exercises/math/geometry/convexity/convexityTrinomialsGeo.js

@@ -4,7 +4,7 @@ import { blueMain } from "../../../../geogebra/colors.js";
 import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js";
 import { Trinom, TrinomConstructor } from "../../../../math/polynomials/trinom.js";
 import { shuffle } from "../../../../utils/alea/shuffle.js";
-const getInstruction = (identifiers) => {
+const getInstruction = () => {
     return `Ci-dessous est tracée la courbe représentative $\\mathcal C_f$ d'une fonction $f$. Sur $\\mathbb{R}$, la fonction $f$ est :`;
 };
 const getAnswer = (identifiers) => {
@@ -44,7 +44,7 @@ const getQuestionFromIdentifiers = (identifiers) => {
     };
     return question;
 };
-const getPropositions = (n, { answer }) => {
+const getPropositions = (_n, { answer }) => {
     const propositions = [];
     addValidProp(propositions, answer, "raw");
     tryToAddWrongProp(propositions, "Concave", "raw");

package/lib/exercises/math/geometry/euclidian/orthogonalProjectFromPicture.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"orthogonalProjectFromPicture.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidian/orthogonalProjectFromPicture.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAOrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAkMF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAoB9D,CAAC"}
+{"version":3,"file":"orthogonalProjectFromPicture.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidian/orthogonalProjectFromPicture.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAOrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAkMF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAoB9D,CAAC"}

package/lib/exercises/math/geometry/euclidian/orthogonalProjectFromPicture.js

@@ -116,7 +116,7 @@ const getInstruction = (identifiers) => {
 Quel est le projeté orthogonal de $${point}$ sur la droite $\\left(${line}\\right)$ ?
 `;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `- Si $A$ est un point sur une droite $d$, alors le projeté orthogonal de $A$ sur $d$ est $A$.
   
 - Si $A$ n'appartient pas à la droite $d$, alors le projeté orthogonal de $A$ sur $d$ est le point $H$ sur $d$ tel que la droite $(AH)$ est perpendiculaire à $d$.`;
@@ -137,7 +137,7 @@ const getCorrection = (identifiers) => {
         return `Les droites $\\left(${line}\\right)$ et $\\left(${point}${pointAnswer}\\right)$ sont perpendiculaires. De plus, le point $${pointAnswer}$ appartient à la droite $${line}$. Le projeté orthogonal de $${point}$ sur $\\left(${line}\\right)$ est donc $${pointAnswer}$.`;
     }
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     const names = getNames();
     return names;
 };
@@ -149,7 +149,7 @@ const isAnswerValid = (ans, { answer }) => {
         return handleVEAError(err);
     }
 };
-const getOrthogonalProjectFromPictureQuestion = (ops) => {
+const getOrthogonalProjectFromPictureQuestion = () => {
     const data = [
         { lines: ["AB", "EF", "DC"], excludes: ["I", "J", "K", "L"] },
         { lines: ["DA", "GH", "CB"], excludes: ["I", "J", "K", "L"] },

package/lib/exercises/math/geometry/euclidian/pythagoreOrThales.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pythagoreOrThales.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidian/pythagoreOrThales.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AAKrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AAkBtC,KAAK,WAAW,GAAG;IACjB,cAAc,EAAE,OAAO,CAAC;IACxB,eAAe,EAAE,OAAO,CAAC;IAEzB,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtC,OAAO,EAAE,MAAM,EAAE,CAAC;CAQnB,CAAC;AA4RF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAuBnD,CAAC"}
+{"version":3,"file":"pythagoreOrThales.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidian/pythagoreOrThales.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAIrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AAYtC,KAAK,WAAW,GAAG;IACjB,cAAc,EAAE,OAAO,CAAC;IACxB,eAAe,EAAE,OAAO,CAAC;IAEzB,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtC,OAAO,EAAE,MAAM,EAAE,CAAC;CAQnB,CAAC;AAwRF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAuBnD,CAAC"}

package/lib/exercises/math/geometry/euclidian/pythagoreOrThales.js

@@ -4,7 +4,7 @@ import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js
 import { Angle } from "../../../../math/geometry/angle.js";
 import { PointConstructor, } from "../../../../math/geometry/point.js";
 import { RightTriangleConstructor } from "../../../../math/geometry/triangles/rightTriangle.js";
-import { Segment, } from "../../../../math/geometry/segment.js";
+import { Segment } from "../../../../math/geometry/segment.js";
 import { Triangle, TriangleConstructor, } from "../../../../math/geometry/triangles/triangle.js";
 import { VectorConstructor } from "../../../../math/geometry/vector.js";
 import { round } from "../../../../math/utils/round.js";
@@ -77,7 +77,7 @@ On connaît les longueurs suivantes : $${segments
 
 Pour ${instruction}, il faut utiliser... `;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Voici les énoncés des théorèmes de Pythagore et de Thalès, et leurs réciproques :
 
 - **Théorème de Pythagore** : Dans un triangle rectangle, le carré de l'hypoténuse est égal à la somme des carrés des deux autres côtés.
@@ -90,7 +90,7 @@ $$
 - **Réciproque du théorème de Thalès** :  Soit un triangle $ABC$, et $D$ un point sur la droite $(AB)$ et $E$ un point sur la droite $(AC)$. Si $\\frac{AD}{AB}=\\frac{AE}{AC}$, alors les droites $(AB)$ et $(AC)$ sont parallèles.`;
 };
 const getCorrection = (identifiers) => {
-    const { isAskingLength, pointsIdentifiers, isSegmentHeight } = identifiers;
+    const { isAskingLength, isSegmentHeight } = identifiers;
     if (isSegmentHeight) {
         if (isAskingLength) {
             return `Il faut utiliser le théorème de Pythagore : das un triangle rectangle, le carré de l'hypoténuse est égal à la somme des carrés des deux autres côtés.
@@ -143,7 +143,7 @@ const getGGBOptions = (identifiers) => {
     }
     const commands = [
         ...points.flatMap((p) => p.toGGBCommand()),
-        ...segments.flatMap((s, i) => s.toGGBCommands(false, { color: "grey", thickness: 3 })),
+        ...segments.flatMap((s) => s.toGGBCommands(false, { color: "grey", thickness: 3 })),
         // ...segments
         //   .slice(0, segments.length - 1)
         //   .flatMap((s, i) =>
@@ -162,21 +162,17 @@ const getGGBOptions = (identifiers) => {
         coords: ggb.getCoordsForPoints(points),
     });
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return [];
 };
-const isAnswerValid = (ans, { answer }) => {
+const isAnswerValid = () => {
     throw Error("VEA not implemented");
 };
-const getPythagoreOrThalesQuestion = (opts) => {
+const getPythagoreOrThalesQuestion = () => {
     const isSegmentHeight = coinFlip();
     const isAskingLength = coinFlip();
     let points;
     let lengths;
-    const triangle = isSegmentHeight
-        ? RightTriangleConstructor.randomNiceSides({ names: ["D", "B", "C"] })
-        : TriangleConstructor.randomNiceSides({ minAngle: 40 });
-    const summitNames = triangle.points.map((p) => p.name);
     if (isSegmentHeight) {
         const triangle = RightTriangleConstructor.randomNiceSides({
             names: ["D", "B", "C"],
@@ -266,7 +262,7 @@ export const pythagoreOrThales = {
     getQuestionFromIdentifiers,
     hasHintAndCorrection: true,
 };
-const getSubTriangle = ({ triangle, insidePointsNames, ratio, isPapillon, }) => {
+const getSubTriangle = ({ triangle, insidePointsNames, ratio, }) => {
     const [A, B, C] = triangle.points;
     const [dName, eName] = insidePointsNames;
     const vecAB = VectorConstructor.fromPoints(A, B).times((1 - ratio).toTree());

package/lib/exercises/math/geometry/euclidianConstructions/buildMediatriceWithCompass.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"buildMediatriceWithCompass.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidianConstructions/buildMediatriceWithCompass.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AA0IF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAa5D,CAAC"}
+{"version":3,"file":"buildMediatriceWithCompass.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidianConstructions/buildMediatriceWithCompass.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,CAAC,EAAE,MAAM,EAAE,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AA0IF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAa5D,CAAC"}

package/lib/exercises/math/geometry/euclidianConstructions/buildMediatriceWithCompass.js

@@ -8,7 +8,7 @@ import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js
 import { Point, PointConstructor } from "../../../../math/geometry/point.js";
 import { Segment } from "../../../../math/geometry/segment.js";
 const getInstruction = (identifiers) => {
-    const { A, B, nameA, nameB } = identifiers;
+    const { nameA, nameB } = identifiers;
     const segmentName = nameA + nameB;
     return `Avec les outils disponibles, tracer la médiatrice du segment $[${segmentName}]$.`;
 };
@@ -96,7 +96,7 @@ const getPropositions = (n, { answer }) => {
     }
     return shuffleProps(propositions, n);
 };
-const isGGBAnswerValid = (ans, { ggbAnswer, A, B }) => {
+const isGGBAnswerValid = (ans, { A, B }) => {
     const lines = ans.filter((s) => isGGBLine(s));
     const segmentPointA = new Point("Seg_A", A[0].toTree(), A[1].toTree());
     const segmentPointB = new Point("Seg_B", B[0].toTree(), B[1].toTree());

package/lib/exercises/math/geometry/euclidianConstructions/buildPointFromAxialSymetry.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"buildPointFromAxialSymetry.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidianConstructions/buildPointFromAxialSymetry.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EAGL,eAAe,EAChB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AAEtC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,gBAAgB,CAAC;IACxB,IAAI,EAAE,eAAe,CAAC;CACvB,CAAC;AAwGF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAgB5D,CAAC"}
+{"version":3,"file":"buildPointFromAxialSymetry.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidianConstructions/buildPointFromAxialSymetry.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EAGL,eAAe,EAChB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AAEtC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,gBAAgB,CAAC;IACxB,IAAI,EAAE,eAAe,CAAC;CACvB,CAAC;AAwGF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAgB5D,CAAC"}

package/lib/exercises/math/geometry/euclidianConstructions/buildPointFromAxialSymetry.js

@@ -6,7 +6,7 @@ import { parseGGBPoints } from "../../../../geogebra/parsers/parseGGBPoints.js";
 import { Circle } from "../../../../math/geometry/circle.js";
 import { Line, LineConstructor, } from "../../../../math/geometry/line.js";
 import { Point, PointConstructor, } from "../../../../math/geometry/point.js";
-const getInstruction = (identifiers) => {
+const getInstruction = () => {
     return `Placer le point $A'$, symétrique du point $A$ par rapport à la droite $d$.`;
 };
 // const getHint : GetHint<Identifiers> = (identifiers)=>{

package/lib/exercises/math/geometry/euclidianConstructions/buildTriangleWithSizes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"buildTriangleWithSizes.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidianConstructions/buildTriangleWithSizes.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AA6GF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAexD,CAAC"}
+{"version":3,"file":"buildTriangleWithSizes.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidianConstructions/buildTriangleWithSizes.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAQT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AA2GF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAexD,CAAC"}

package/lib/exercises/math/geometry/euclidianConstructions/buildTriangleWithSizes.js

@@ -23,7 +23,7 @@ const getGGBAnswer = (identifiers) => {
         `Polygon(A,B,C)`,
     ];
 };
-const getStudentGGBOptions = (identifiers) => {
+const getStudentGGBOptions = () => {
     const ggb = new GeogebraConstructor({
         commands: [],
         customToolBar: toolBarConstructor({
@@ -42,7 +42,7 @@ const getStudentGGBOptions = (identifiers) => {
         coords: [-8, 8, -8, 8],
     });
 };
-const isGGBAnswerValid = (ans, { ggbAnswer, lengths }) => {
+const isGGBAnswerValid = (ans, { lengths }) => {
     let points = [];
     const polygone = ans.find((c) => c.includes("Polygon"));
     if (polygone) {

package/lib/exercises/math/geometry/euclidianConstructions/pointImageFromTranslation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pointImageFromTranslation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidianConstructions/pointImageFromTranslation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAQrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AAMtC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,gBAAgB,EAAE,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,EAAE,CAAC;CAC7B,CAAC;AAEF,KAAK,OAAO,GAAG;IACb,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC;AAyKF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAiBpE,CAAC"}
+{"version":3,"file":"pointImageFromTranslation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/euclidianConstructions/pointImageFromTranslation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAQrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AAKtC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,gBAAgB,EAAE,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,EAAE,CAAC;CAC7B,CAAC;AAEF,KAAK,OAAO,GAAG;IACb,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC;AAqKF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAiBpE,CAAC"}

package/lib/exercises/math/geometry/euclidianConstructions/pointImageFromTranslation.js

@@ -25,19 +25,18 @@ const getEndPoint = (identifiers) => {
     return end;
 };
 const getHint = (identifiers, opts) => {
-    const { points, startPoint, translationPoints } = identifiers;
+    const { startPoint, translationPoints } = identifiers;
     const useVector = opts?.useVector;
     if (useVector) {
         const vector = translationPoints[0] + translationPoints[1];
         return `Trace le vecteur $\\overrightarrow{${vector}}$ à partir du point $${startPoint}$.`;
     }
     else {
-        const vector = translationPoints[0] + translationPoints[1];
         return `À partir du point $${startPoint}$, déplace toi de la même façon que le déplacement de $${translationPoints[0]}$ vers $${translationPoints[1]}$.`;
     }
 };
 const getCorrection = (identifiers, opts) => {
-    const { points, startPoint, translationPoints } = identifiers;
+    const { startPoint, translationPoints } = identifiers;
     const useVector = opts?.useVector;
     if (useVector) {
         const vector = translationPoints[0] + translationPoints[1];
@@ -48,7 +47,7 @@ const getCorrection = (identifiers, opts) => {
     }
 };
 const getGGBAnswer = (identifiers) => {
-    const { points, startPoint, translationPoints } = identifiers;
+    const { startPoint } = identifiers;
     const endPoint = getEndPoint(identifiers);
     return [
         ...endPoint.toGGBCommand(),
@@ -73,7 +72,7 @@ const getStudentGGBOptions = (identifiers) => {
         coords: ggb.getCoordsForPoints([...points, endPoint]),
     });
 };
-const isGGBAnswerValid = (ans, { ggbAnswer, points, startPoint, translationPoints }) => {
+const isGGBAnswerValid = (ans, { ggbAnswer, points }) => {
     const pointsUsed = points.map((p) => p.name);
     const studentAns = ans.filter((c) => !pointsUsed.includes(c[0]));
     if (studentAns.length !== 1)

package/lib/exercises/math/geometry/lines/aAndBFromReductEquation.js

@@ -5,7 +5,7 @@ import { randint } from "../../../../math/utils/random/randint.js";
 import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
 import { coinFlip } from "../../../../utils/alea/coinFlip.js";
 import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Dans l'équation réduite d'une droite : 
   
 $$

package/lib/exercises/math/geometry/lines/cartesianEquationToReduced.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cartesianEquationToReduced.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/cartesianEquationToReduced.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAkBrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC;AA+OF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAkB5D,CAAC"}
+{"version":3,"file":"cartesianEquationToReduced.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/cartesianEquationToReduced.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAiBrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC;AA+OF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAkB5D,CAAC"}

package/lib/exercises/math/geometry/lines/cartesianEquationToReduced.js

@@ -16,13 +16,13 @@ import { isInt } from "../../../../utils/isInt.js";
 import { alignTex } from "../../../../utils/latex/alignTex.js";
 //ax+by+c = 0 into y = ... (et inversement)
 const getCartesianEquation = (identifiers) => {
-    const { a, b, c, toReduced } = identifiers;
+    const { a, b, c } = identifiers;
     return add(add(monom(a, 1), monom(b, 1, { variable: "y" })), c).simplify({
         forbidFactorize: true,
     });
 };
 const getReducedEquation = (identifiers) => {
-    const { a, b, c, toReduced } = identifiers;
+    const { a, b, c } = identifiers;
     return frac(substract(-c, multiply(a, "x")), b).simplify({
         towardsDistribute: true,
         forceDistributeFractions: true,
@@ -30,7 +30,7 @@ const getReducedEquation = (identifiers) => {
     });
 };
 const getPropositions = (n, { answer, ...identifiers }) => {
-    const { a, b, c, toReduced } = identifiers;
+    const { toReduced } = identifiers;
     const propositions = [];
     addValidProp(propositions, answer);
     while (propositions.length < n) {
@@ -51,14 +51,14 @@ const getPropositions = (n, { answer, ...identifiers }) => {
     return shuffleProps(propositions, n);
 };
 const getAnswer = (identifiers) => {
-    const { a, b, c, toReduced } = identifiers;
+    const { toReduced } = identifiers;
     const equation = toReduced
         ? `y=${getReducedEquation(identifiers).toTex()}`
         : `${getCartesianEquation(identifiers).toTex()}=0`;
     return equation;
 };
 const getInstruction = (identifiers) => {
-    const { a, b, c, toReduced } = identifiers;
+    const { toReduced } = identifiers;
     const equation = toReduced
         ? `${getCartesianEquation(identifiers).toTex()}=0`
         : `y=${getReducedEquation(identifiers).toTex()}`;
@@ -132,7 +132,7 @@ $$`
 
 `;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return ["x", "y", "equal"];
 };
 const isAnswerValid = (ans, { answer, ...identifiers }) => {
@@ -187,7 +187,7 @@ const isAnswerValid = (ans, { answer, ...identifiers }) => {
         return handleVEAError(err);
     }
 };
-const getCartesianEquationToReducedQuestion = (ops) => {
+const getCartesianEquationToReducedQuestion = () => {
     let a;
     let b;
     let c;

package/lib/exercises/math/geometry/lines/cartesianEquationsIntersection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cartesianEquationsIntersection.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/cartesianEquationsIntersection.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAWrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAQ7C,KAAK,WAAW,GAAG;IACjB,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC,gBAAgB,EAAE,eAAe,EAAE,CAAC;CACrC,CAAC;AA0KF,eAAO,MAAM,8BAA8B,EAAE,QAAQ,CAAC,WAAW,CAqBhE,CAAC"}
+{"version":3,"file":"cartesianEquationsIntersection.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/cartesianEquationsIntersection.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAUrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAO7C,KAAK,WAAW,GAAG;IACjB,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC,gBAAgB,EAAE,eAAe,EAAE,CAAC;CACrC,CAAC;AA0KF,eAAO,MAAM,8BAA8B,EAAE,QAAQ,CAAC,WAAW,CAqBhE,CAAC"}

package/lib/exercises/math/geometry/lines/cartesianEquationsIntersection.js

@@ -109,7 +109,7 @@ $$
 `;
     return corr;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return ["semicolon"];
 };
 const isAnswerValid = (ans, { answer }) => {
@@ -123,7 +123,7 @@ const isAnswerValid = (ans, { answer }) => {
         return handleVEAError(err);
     }
 };
-const getCartesianEquationsIntersectionQuestion = (ops) => {
+const getCartesianEquationsIntersectionQuestion = () => {
     const inter = PointConstructor.random("A");
     const randVec = new Vector("u", randint(-10, 11, [0]).toTree(), randint(-10, 11, [0]).toTree());
     const randVec2 = doWhile(() => new Vector("v", randint(-10, 11, [0]).toTree(), randint(-10, 11, [0]).toTree()), (v) => v.isColinear(randVec));

package/lib/exercises/math/geometry/lines/directorVectorFromAnother.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"directorVectorFromAnother.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/directorVectorFromAnother.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAO7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,eAAe,CAAC;CACvB,CAAC;AA+GF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAkB3D,CAAC"}
+{"version":3,"file":"directorVectorFromAnother.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/directorVectorFromAnother.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAO7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,eAAe,CAAC;CACvB,CAAC;AA+GF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAkB3D,CAAC"}

package/lib/exercises/math/geometry/lines/directorVectorFromAnother.js

@@ -33,7 +33,7 @@ const getInstruction = (identifiers) => {
 
 Donner les coordonnées d'un autre vecteur directeur de $d$.`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Si $\\overrightarrow{u}$ est un vecteur directeur d'une droite $d$, alors tout vecteur colinéaire à $\\overrightarrow{u}$ est également un vecteur directeur de $d$.`;
 };
 const getCorrection = (identifiers) => {
@@ -54,7 +54,7 @@ ${getAnswer(identifiers)}
 $$
 `;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return ["binom", "semicolon"];
 };
 const isAnswerValid = (ans, { answer, ...identifiers }) => {
@@ -84,7 +84,7 @@ const isAnswerValid = (ans, { answer, ...identifiers }) => {
         return handleVEAError(err);
     }
 };
-const getDirectorVectorFromAnotherQuestion = (ops) => {
+const getDirectorVectorFromAnotherQuestion = () => {
     const vector = VectorConstructor.random("u", false);
     const identifiers = {
         aIds: vector.x.toIdentifiers(),

package/lib/exercises/math/geometry/lines/directorVectorFromReductEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"directorVectorFromReductEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/directorVectorFromReductEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAIrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAa7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,eAAe,CAAC;CACvB,CAAC;AAiHF,eAAO,MAAM,gCAAgC,EAAE,QAAQ,CAAC,WAAW,CAsBlE,CAAC"}
+{"version":3,"file":"directorVectorFromReductEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/directorVectorFromReductEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAIrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAa7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,eAAe,CAAC;CACvB,CAAC;AA8GF,eAAO,MAAM,gCAAgC,EAAE,QAAQ,CAAC,WAAW,CAsBlE,CAAC"}

package/lib/exercises/math/geometry/lines/directorVectorFromReductEquation.js

@@ -18,7 +18,7 @@ const getEquationTex = (identifiers) => {
         .simplify({ forbidFactorize: true })
         .toTex()}`;
 };
-const getPropositions = (n, { answer, aIds, bIds }) => {
+const getPropositions = (n, { answer, aIds }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     const a = reifyAlgebraic(aIds);
@@ -33,7 +33,7 @@ const getPropositions = (n, { answer, aIds, bIds }) => {
     return shuffleProps(propositions, n);
 };
 const getAnswer = (identifiers) => {
-    const { aIds, bIds } = identifiers;
+    const { aIds } = identifiers;
     const a = reifyAlgebraic(aIds);
     return new BinomialCoefficientNode((1).toTree(), a).toTex();
 };
@@ -46,11 +46,11 @@ $$
 
 Donner les coordonnées d'un vecteur directeur de $d$.`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return "Le coefficient directeur de la droite représente la variation de l'ordonnée lorsque l'abscisse augmente de $1$. On peut donc en déduire un vecteur directeur d'abscisse $1$ de la droite.";
 };
 const getCorrection = (identifiers) => {
-    const { aIds, bIds } = identifiers;
+    const { aIds } = identifiers;
     const a = reifyAlgebraic(aIds);
     const aEv = a.evaluate();
     return `Le coefficient directeur de $d$ est $${a.toTex()}$. 
@@ -63,10 +63,10 @@ $$
 ${getAnswer(identifiers)}
 $$`;
 };
-const getKeys = (identifiers) => {
+const getKeys = () => {
     return ["binom", "semicolon"];
 };
-const isAnswerValid = (ans, { answer, aIds, bIds }) => {
+const isAnswerValid = (ans, { aIds }) => {
     try {
         const a = reifyAlgebraic(aIds);
         const solVector = new Vector("u", (1).toTree(), a);
@@ -88,7 +88,7 @@ const isAnswerValid = (ans, { answer, aIds, bIds }) => {
         return handleVEAError(err);
     }
 };
-const getDirectorVectorFromReductEquationQuestion = (ops) => {
+const getDirectorVectorFromReductEquationQuestion = () => {
     const a = randint(-9, 10);
     const b = randint(-9, 10);
     const identifiers = {

package/lib/exercises/math/geometry/lines/drawLineFromCartesianEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"drawLineFromCartesianEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/drawLineFromCartesianEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAGL,iBAAiB,EAClB,MAAM,+BAA+B,CAAC;AAMvC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,SAAS,EAAE,iBAAiB,CAAC;CAC9B,CAAC;AA4KF,eAAO,MAAM,6BAA6B,EAAE,QAAQ,CAAC,WAAW,CAoB/D,CAAC"}
+{"version":3,"file":"drawLineFromCartesianEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/drawLineFromCartesianEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAGL,iBAAiB,EAClB,MAAM,+BAA+B,CAAC;AAMvC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,SAAS,EAAE,iBAAiB,CAAC;CAC9B,CAAC;AA2KF,eAAO,MAAM,6BAA6B,EAAE,QAAQ,CAAC,WAAW,CAoB/D,CAAC"}

package/lib/exercises/math/geometry/lines/drawLineFromCartesianEquation.js

@@ -23,7 +23,7 @@ $$
 ${getCartesianEquation(identifiers).toTex()}
 $$`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     const u = new Vector("u", opposite("b"), "a".toTree());
     return `Commence par chercher les coordonnées d'un point appartenant à la droite. Pour cela, remplace par exemple $x$ par $0$ et déduis-en l'ordonnée $y$ du point d'abscisse $0$ de la droite.
   
@@ -71,7 +71,6 @@ const getGGBAnswer = (identifiers) => {
     const point = PointConstructor.fromIdentifiers(pointIds);
     const vector = VectorConstructor.fromIdentifiers(vectorIds);
     const B = vector.getEndPoint(point, "B");
-    const equa = getCartesianEquation(identifiers).toMathString();
     return [
         ...point.toGGBCommand(),
         ...B.toGGBCommand(),

package/lib/exercises/math/geometry/lines/drawLineFromPointAndVector.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"drawLineFromPointAndVector.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/drawLineFromPointAndVector.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAGL,iBAAiB,EAClB,MAAM,+BAA+B,CAAC;AAIvC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,SAAS,EAAE,iBAAiB,CAAC;CAC9B,CAAC;AA0HF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAiB5D,CAAC"}
+{"version":3,"file":"drawLineFromPointAndVector.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/drawLineFromPointAndVector.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAGL,iBAAiB,EAClB,MAAM,+BAA+B,CAAC;AAIvC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,SAAS,EAAE,iBAAiB,CAAC;CAC9B,CAAC;AA0HF,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,WAAW,CAiB5D,CAAC"}

package/lib/exercises/math/geometry/lines/drawLineFromPointAndVector.js

@@ -15,7 +15,7 @@ const getInstruction = (identifiers) => {
     
   Tracer la droite $d$.`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Place le point $A$. Puis détermine l'image du point $A$ par la translation de vecteur $\\overrightarrow{u}$. La droite recherchée passe par ces deux points.`;
 };
 const getCorrection = (identifiers) => {

package/lib/exercises/math/geometry/lines/findParallelLineFromCartesianEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"findParallelLineFromCartesianEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/findParallelLineFromCartesianEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAO7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,eAAe,CAAC;IACtB,mBAAmB,EAAE,eAAe,CAAC;IACrC,QAAQ,EAAE,eAAe,CAAC;CAC3B,CAAC;AAgIF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAAC,WAAW,CAoBvE,CAAC"}
+{"version":3,"file":"findParallelLineFromCartesianEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/findParallelLineFromCartesianEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAOrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAM7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,eAAe,CAAC;IACtB,mBAAmB,EAAE,eAAe,CAAC;IACrC,QAAQ,EAAE,eAAe,CAAC;CAC3B,CAAC;AA+HF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAAC,WAAW,CAoBvE,CAAC"}

package/lib/exercises/math/geometry/lines/findParallelLineFromCartesianEquation.js

@@ -11,7 +11,7 @@ import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
 import { doWhile } from "../../../../utils/doWhile.js";
 import { alignTex } from "../../../../utils/latex/alignTex.js";
 const getFakeEquation = (identifiers) => {
-    const { aIds, bIds, cIds, colinearityCoeffIds, fakeCIds } = identifiers;
+    const { aIds, bIds, colinearityCoeffIds, fakeCIds } = identifiers;
     const a = reifyAlgebraic(aIds);
     const b = reifyAlgebraic(bIds);
     const fakeC = reifyAlgebraic(fakeCIds);
@@ -52,14 +52,13 @@ $$
 
 Parmi les équations cartésiennes suivantes, laquelle est celle d'une droite parallèle à $d$ ?`;
 };
-const getHint = (identifiers) => {
+const getHint = () => {
     return `Deux droites sont parallèles si un vecteur directeur de l'une est colinéaire à un vecteur directeur de l'autre. Détermine donc un vecteur directeur $\\overrightarrow{u}$ de $d$, puis un vecteur directeur de chacune des droites proposées, afin de trouver celui qui est colinéaire à $\\overrightarrow{u}$.`;
 };
 const getCorrection = (identifiers) => {
-    const { aIds, bIds, cIds, colinearityCoeffIds, fakeCIds } = identifiers;
+    const { aIds, bIds, colinearityCoeffIds } = identifiers;
     const a = reifyAlgebraic(aIds);
     const b = reifyAlgebraic(bIds);
-    const fakeC = reifyAlgebraic(fakeCIds);
     const coeff = reifyAlgebraic(colinearityCoeffIds);
     const fakeEqua = getFakeEquation(identifiers);
     const vec = new Vector("u", opposite(b), a).simplify();
@@ -89,7 +88,7 @@ ${fakeEqua.toTex()}
 $$
 `;
 };
-const getFindParallelLineFromCartesianEquationQuestion = (ops) => {
+const getFindParallelLineFromCartesianEquationQuestion = () => {
     const line = LineConstructor.random();
     const [a, b, c] = line.toCartesianCoeffs();
     const coeff = randint(-3, 4, [0, 1]);