math-exercises 3.0.171 → 3.0.173

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

@@ -1,15 +1,29 @@
-import { addValidProp, addWrongProp, tryToAddWrongProp, } from "../../../../../exercises/exercise.js";
+import { GeneratorOptionTarget, GeneratorOptionType, addValidProp, addWrongProp, tryToAddWrongProp, } from "../../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinctQuestions.js";
 import { Trinom, TrinomConstructor } from "../../../../../math/polynomials/trinom.js";
-import { coinFlip } from "../../../../../utils/alea/coinFlip.js";
+import { random } from "../../../../../utils/alea/random.js";
 import { shuffle } from "../../../../../utils/alea/shuffle.js";
 const getInstruction = (identifiers) => {
-    const { isDevForm, a, b, c } = identifiers;
+    const { form, isDevForm, a, b, c } = identifiers;
     const trinom = new Trinom(a, b, c);
-    return `La fonction $f$ définie par 
+    let trinomTex;
+    if (isDevForm !== undefined) {
+        trinomTex = isDevForm
+            ? trinom.toTree().toTex()
+            : trinom.getCanonicalForm().toTex();
+    }
+    else {
+        trinomTex =
+            form === "dev"
+                ? trinom.toTree().toTex()
+                : form === "cano"
+                    ? trinom.getCanonicalForm().toTex()
+                    : trinom.toFactorized().toTex();
+    }
+    return `La fonction $f$ définie sur $\\mathbb{R}$ par :
   
 $$
-f(x) = ${isDevForm ? trinom.toTree().toTex() : trinom.getCanonicalForm().toTex()}
+f(x) = ${trinomTex}
 $$ 
 
 admet-elle un maximum ou un minimum ?`;
@@ -18,22 +32,69 @@ const getAnswer = (identifiers) => {
     const answer = identifiers.a > 0 ? "Un minimum" : "Un maximum";
     return answer;
 };
-const getQuestionFromIdentifiers = (identifiers) => {
+const getQuestionFromIdentifiers = (identifiers, opts) => {
     const question = {
         answer: getAnswer(identifiers),
-        instruction: getInstruction(identifiers),
+        instruction: getInstruction(identifiers, opts),
         answerFormat: "raw",
         keys: [],
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
-const getExtremumTypeFromAlgebricFormQuestion = () => {
-    const isDevForm = coinFlip();
-    const trinom = isDevForm
+const getHint = () => {
+    return `La fonction $f$ est un polynôme du second degré. Sa courbe représentative est donc une parabole. Cette parabole est tournée vers le bas si le coefficient $a$ est positif. Dans ce cas, elle admet un minmum. Si $a$ est négatif, alors la parabole est tournée vers le haut, et elle admet donc un maximum.`;
+};
+const getCorrection = (identifiers) => {
+    const { form, a } = identifiers;
+    return `La fonction $f$ est un polynôme du second degré donnée sous sa forme ${form === "dev"
+        ? "développée"
+        : form === "facto"
+            ? "factorisée"
+            : "canonique"} :
+  
+$$
+f(x) = ${form === "dev"
+        ? "ax^2+bx+c"
+        : form === "facto"
+            ? "a(x-x_1)(x-x_2)"
+            : "a(x-\\alpha)^2+\\beta)"}
+$$
+
+Son coefficient $a$ vaut donc $${a.frenchify()}$.
+
+Puisque $${a
+        .toTree()
+        .toSignInequationTex()}$, la parabole représentative de $f$ est tournée vers ${a > 0 ? "le bas" : "le haut"} : cela signifie que $f$ est admet un ${a > 0 ? "minimum" : "maximum"} sur $\\mathbb{R}$.`;
+};
+const getExtremumTypeFromAlgebricFormQuestion = (opts) => {
+    const formalForm = opts?.form
+        ? random(opts.form)
+        : random(["Forme canonique", "Forme factorisée", "Forme développée"]);
+    const form = (() => {
+        switch (formalForm) {
+            case "Forme canonique":
+                return "cano";
+            case "Forme factorisée":
+                return "facto";
+            case "Forme développée":
+            default:
+                return "dev";
+        }
+    })();
+    const trinom = form === "dev"
         ? TrinomConstructor.random()
-        : TrinomConstructor.randomCanonical();
-    const identifiers = { isDevForm, a: trinom.a, b: trinom.b, c: trinom.c };
+        : form === "cano"
+            ? TrinomConstructor.randomCanonical()
+            : TrinomConstructor.randomNiceRoots(2);
+    const identifiers = {
+        form,
+        a: trinom.a,
+        b: trinom.b,
+        c: trinom.c,
+    };
     return getQuestionFromIdentifiers(identifiers);
 };
 const getPropositions = (_n, { answer, a }) => {
@@ -45,15 +106,39 @@ const getPropositions = (_n, { answer, a }) => {
     addWrongProp(propositions, "Ni l'un ni l'autre", "raw");
     return propositions;
 };
+const options = [
+    {
+        id: "form",
+        label: "Forme donnée",
+        target: GeneratorOptionTarget.generation,
+        type: GeneratorOptionType.multiselect,
+        values: ["Forme canonique", "Forme factorisée", "Forme développée"],
+        defaultValue: ["Forme canonique", "Forme factorisée", "Forme développée"],
+    },
+];
+const validateOptions = (opts) => {
+    if (!opts?.form?.length)
+        return {
+            valid: false,
+            message: "Veuillez choisir au moins un type de forme algébrique.",
+        };
+    return {
+        valid: true,
+        message: "",
+    };
+};
 export const extremumTypeFromAlgebricForm = {
     id: "extremumTypeFromAlgebricForm",
     label: "Déterminer le type d'extremum d'une fonction du second degré via sa forme algébrique",
     isSingleStep: true,
-    generator: (nb) => getDistinctQuestions(getExtremumTypeFromAlgebricFormQuestion, nb),
+    generator: (nb, opts) => getDistinctQuestions(() => getExtremumTypeFromAlgebricFormQuestion(opts), nb),
     answerType: "QCU",
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    validateOptions,
+    options,
+    hasHintAndCorrection: true,
 };

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,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"}
+{"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;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;AA2LF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAmB1D,CAAC"}

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

@@ -1,4 +1,5 @@
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { varTableVEA } from "../../../../exercises/vea/varTableVEA.js";
 import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js";
 import { Polynomial } from "../../../../math/polynomials/polynomial.js";
 import { randint } from "../../../../math/utils/random/randint.js";
@@ -111,7 +112,7 @@ const getKeys = () => {
 };
 const isAnswerTableValid = (ans, { answerTable }) => {
     try {
-        return ans.every((row, i) => row.every((cell, j) => cell === answerTable[i][j]));
+        return varTableVEA(ans, answerTable);
     }
     catch (err) {
         return handleVEAError(err);

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,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"}
+{"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;AAWrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;CACvB,CAAC;AAwKF,eAAO,MAAM,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAmBnD,CAAC"}

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

@@ -1,4 +1,5 @@
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { varTableVEA } from "../../../../exercises/vea/varTableVEA.js";
 import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js";
 import { Polynomial } from "../../../../math/polynomials/polynomial.js";
 import { randint } from "../../../../math/utils/random/randint.js";
@@ -106,7 +107,7 @@ const getKeys = () => {
 };
 const isAnswerTableValid = (ans, { answerTable }) => {
     try {
-        return ans.every((row, i) => row.every((cell, j) => cell === answerTable[i][j]));
+        return varTableVEA(ans, answerTable);
     }
     catch (err) {
         return handleVEAError(err);

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

@@ -1 +1 @@
-{"version":3,"file":"varTableFromSentences.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/varTableFromSentences.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AAIrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAI7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,EAAE,EAAE,eAAe,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;CACvB,CAAC;AAwLF,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,WAAW,CAkBvD,CAAC"}
+{"version":3,"file":"varTableFromSentences.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/variations/varTableFromSentences.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AAKrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAI7C,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,EAAE,EAAE,eAAe,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;CACvB,CAAC;AAsLF,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,WAAW,CAkBvD,CAAC"}

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

@@ -1,4 +1,5 @@
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { varTableVEA } from "../../../../exercises/vea/varTableVEA.js";
 import { randint } from "../../../../math/utils/random/randint.js";
 import { randTupleInt } from "../../../../math/utils/random/randTupleInt.js";
 import { reifyAlgebraic, } from "../../../../tree/nodes/nodeConstructor.js";
@@ -98,7 +99,7 @@ const getKeys = () => {
 };
 const isAnswerTableValid = (ans, { answerTable }) => {
     try {
-        return ans.every((row, i) => row.every((cell, j) => cell === answerTable[i][j]));
+        return varTableVEA(ans, answerTable);
     }
     catch (err) {
         return handleVEAError(err);

package/lib/exercises/math/geometry/circles/circleCenterAndRadiusFromEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"circleCenterAndRadiusFromEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/circles/circleCenterAndRadiusFromEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAQrC,OAAO,EAEL,oBAAoB,EACrB,MAAM,yCAAyC,CAAC;AAWjD,KAAK,WAAW,GAAG;IACjB,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,EAAE,oBAAoB,CAAC;CACnC,CAAC;AAqJF,KAAK,OAAO,GAAG;IACb,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;AAWF,eAAO,MAAM,iCAAiC,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAwB1E,CAAC"}
+{"version":3,"file":"circleCenterAndRadiusFromEquation.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/circles/circleCenterAndRadiusFromEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAQrC,OAAO,EAEL,oBAAoB,EACrB,MAAM,yCAAyC,CAAC;AAWjD,KAAK,WAAW,GAAG;IACjB,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,EAAE,oBAAoB,CAAC;CACnC,CAAC;AAmJF,KAAK,OAAO,GAAG;IACb,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;AAWF,eAAO,MAAM,iCAAiC,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAwB1E,CAAC"}

package/lib/exercises/math/geometry/circles/circleCenterAndRadiusFromEquation.js

@@ -29,7 +29,6 @@ const getPropositions = (n, { answer, isAskingRadius }) => {
 const getAnswer = (identifiers) => {
     const { equationIds, isAskingRadius } = identifiers;
     const equation = reifyAlgebraic(equationIds);
-    console.log(equation.toTex());
     if (isAskingRadius)
         return sqrt(equation.rightChild).simplify().toTex();
     const left = equation.leftChild;
@@ -112,7 +111,6 @@ const getCircleCenterAndRadiusFromEquationQuestion = (opts) => {
         ? randint(1, 10).toTree()
         : SquareRootConstructor.randomIrreductible(20).toTree();
     const eq = CircleConstructor.cartesianEquation(center, radius);
-    console.log("rad ", radius.toTex(), "eq ", eq.toTex());
     const identifiers = {
         isAskingRadius,
         equationIds: eq.toIdentifiers(),

package/lib/exercises/math/geometry/lines/index.d.ts

@@ -16,4 +16,5 @@ export * from "./drawLineFromPointAndVector.js";
 export * from "./cartesianEquationsIntersection.js";
 export * from "./directorVectorFromAnother.js";
 export * from "./cartesianEquationOfTriangleHeight.js";
+export * from "./readLineNormalVectorOnGraph.js";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,wCAAwC,CAAC;AACvD,cAAc,iCAAiC,CAAC;AAChD,cAAc,2CAA2C,CAAC;AAC1D,cAAc,oBAAoB,CAAC;AACnC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,oCAAoC,CAAC;AACnD,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,kCAAkC,CAAC;AACjD,cAAc,uCAAuC,CAAC;AACtD,cAAc,yCAAyC,CAAC;AACxD,cAAc,4CAA4C,CAAC;AAC3D,cAAc,iCAAiC,CAAC;AAChD,cAAc,qCAAqC,CAAC;AACpD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,wCAAwC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,wCAAwC,CAAC;AACvD,cAAc,iCAAiC,CAAC;AAChD,cAAc,2CAA2C,CAAC;AAC1D,cAAc,oBAAoB,CAAC;AACnC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,oCAAoC,CAAC;AACnD,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,kCAAkC,CAAC;AACjD,cAAc,uCAAuC,CAAC;AACtD,cAAc,yCAAyC,CAAC;AACxD,cAAc,4CAA4C,CAAC;AAC3D,cAAc,iCAAiC,CAAC;AAChD,cAAc,qCAAqC,CAAC;AACpD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,wCAAwC,CAAC;AACvD,cAAc,kCAAkC,CAAC"}

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

@@ -16,3 +16,4 @@ export * from "./drawLineFromPointAndVector.js";
 export * from "./cartesianEquationsIntersection.js";
 export * from "./directorVectorFromAnother.js";
 export * from "./cartesianEquationOfTriangleHeight.js";
+export * from "./readLineNormalVectorOnGraph.js";

package/lib/exercises/math/geometry/lines/readLineNormalVectorOnGraph.d.ts

@@ -0,0 +1,13 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { PointIdentifiers } from "../../../../math/geometry/point.js";
+type Identifiers = {
+    point1Ids: PointIdentifiers;
+    point2Ids: PointIdentifiers;
+    point3Ids?: PointIdentifiers;
+};
+type Options = {
+    withoutPerp: boolean;
+};
+export declare const readLineNormalVectorOnGraph: Exercise<Identifiers, Options>;
+export {};
+//# sourceMappingURL=readLineNormalVectorOnGraph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"readLineNormalVectorOnGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/geometry/lines/readLineNormalVectorOnGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAmBT,MAAM,6BAA6B,CAAC;AAKrC,OAAO,EAGL,gBAAgB,EACjB,MAAM,8BAA8B,CAAC;AAQtC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,gBAAgB,CAAC;IAC5B,SAAS,EAAE,gBAAgB,CAAC;IAC5B,SAAS,CAAC,EAAE,gBAAgB,CAAC;CAC9B,CAAC;AA8KF,KAAK,OAAO,GAAG;IACb,WAAW,EAAE,OAAO,CAAC;CACtB,CAAC;AAaF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAwBtE,CAAC"}

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

@@ -0,0 +1,195 @@
+import { addValidProp, shuffleProps, GeneratorOptionType, GeneratorOptionTarget, propWhile, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { colinearVectorVEA } from "../../../../exercises/vea/colinearVectorVEA.js";
+import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js";
+import { Line } from "../../../../math/geometry/line.js";
+import { PointConstructor, } from "../../../../math/geometry/point.js";
+import { Vector, VectorConstructor } from "../../../../math/geometry/vector.js";
+import { RationalConstructor } from "../../../../math/numbers/rationals/rational.js";
+import { opposite } from "../../../../tree/nodes/functions/oppositeNode.js";
+import { vectorParser } from "../../../../tree/parsers/vectorParser.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    propWhile(propositions, n, () => {
+        const vec = VectorConstructor.random("v");
+        const sol = vectorParser(answer);
+        if (!sol)
+            throw new Error("answer malformed in readLineNormalVectorOnGraph");
+        if (vec.isColinear(sol))
+            return;
+        tryToAddWrongProp(propositions, vec.toBinomCoords().toTex());
+    });
+    return shuffleProps(propositions, n);
+};
+const getAnswer = (identifiers) => {
+    const { point1Ids, point2Ids, point3Ids } = identifiers;
+    const point1 = PointConstructor.fromIdentifiers(point1Ids);
+    const point2 = PointConstructor.fromIdentifiers(point2Ids);
+    if (point3Ids) {
+        //perp tracée
+        const point3 = PointConstructor.fromIdentifiers(point3Ids);
+        const vector = VectorConstructor.fromPoints(point2, point3);
+        return vector.simplify().toBinomCoords().toTex();
+    }
+    else {
+        const vector = VectorConstructor.fromPoints(point1, point2);
+        const normal = vector.getOrthogonal();
+        return normal.toBinomCoords().toTex();
+    }
+};
+const getInstruction = (_identifiers, opts) => {
+    if (opts?.withoutPerp) {
+        return `Ci-dessous est tracée une droite $d$.
+        
+Déterminer graphiquement les coordonnées d'un vecteur normal à $d$.`;
+    }
+    return `Ci-dessous sont tracées deux droites perpendiculaires $d$ et $d'$.
+    
+Déterminer graphiquement les coordonnées d'un vecteur normal à $d$.`;
+};
+const getHint = (_identifiers, opts) => {
+    if (opts?.withoutPerp) {
+        const u = new Vector("u", "a".toTree(), "b".toTree());
+        const v = new Vector("v", opposite("b"), "a".toTree());
+        return `Détermine un vecteur directeur de $d$. Puis, utilise la propriété suivante : si $${u.toTexWithBinomCoords()}$ est un vecteur directeur de $d$, alors $${v.toTexWithBinomCoords()}$ est un vecteur normal à $d$.`;
+    }
+    return `Un vecteur normal d'une droite est un vecteur qui est orthogonal à un vecteur directeur de cette droite. 
+  
+Ici, un vecteur normal à $d$ est donc également un vecteur directeur de $d'$.`;
+};
+const getCorrection = (identifiers) => {
+    const { point1Ids, point2Ids, point3Ids } = identifiers;
+    const point1 = PointConstructor.fromIdentifiers(point1Ids);
+    const point2 = PointConstructor.fromIdentifiers(point2Ids);
+    if (point3Ids) {
+        const point3 = PointConstructor.fromIdentifiers(point3Ids);
+        return `Un vecteur normal à la droite $d$ est un vecteur directeur de la droite $d'$.
+    
+On lit donc graphiquement un vecteur directeur de $d'$.
+
+Cette droite passe par les points de coordonnées $${point2.toCoords()}$ et $${point3.toCoords()}$. Un vecteur directeur de $d'$ est donc : 
+
+$$
+${VectorConstructor.fromPoints(point2, point3).toBinomCoords().toTex()}
+$$
+
+C'est un vecteur normal à $d$.`;
+    }
+    const u = new Vector("u", "a".toTree(), "b".toTree());
+    const v = new Vector("v", opposite("b"), "a".toTree());
+    return `La droite $d$ passe par les points de coordonnées $${point1.toCoords()}$ et $${point2.toCoords()}$. Un vecteur directeur de $d$ est donc :
+  
+$$
+${VectorConstructor.fromPoints(point1, point2).toBinomCoords().toTex()}
+$$
+
+On sait que si $${u.toTexWithBinomCoords()}$ est un vecteur directeur de $d$, alors $${v.toTexWithBinomCoords()}$ est un vecteur normal à $d$.
+
+Ici, les coordonnées d'un vecteur normal à $d$ sont donc : 
+
+$$
+${getAnswer(identifiers)}
+$$`;
+};
+const getGGBOptions = (identifiers) => {
+    const { point1Ids, point2Ids, point3Ids } = identifiers;
+    const point1 = PointConstructor.fromIdentifiers(point1Ids);
+    const point2 = PointConstructor.fromIdentifiers(point2Ids);
+    const line = new Line(point1, point2, "d");
+    const ggb = new GeogebraConstructor({
+        commands: line.toGGBCommands(true, {
+            isFixed: true,
+            isSelectionnable: false,
+            showLabel: true,
+            showUnderlyingPoints: false,
+        }),
+    });
+    if (point3Ids) {
+        const point3 = PointConstructor.fromIdentifiers(point3Ids);
+        ggb.commands?.push(`d' = PerpendicularLine(${point2.name}, d)`);
+        ggb.commands?.push(`alpha = Angle(d,d')`);
+        ggb.commands?.push(`ShowLabel(d', true)`);
+        ggb.commands?.push(`ShowLabel(alpha, false)`);
+        return ggb.getOptions({
+            coords: ggb.getCoordsForPoints([point1, point2, point3]),
+        });
+    }
+    else {
+        return ggb.getOptions({
+            coords: ggb.getCoordsForPoints([point1, point2]),
+        });
+    }
+};
+const getKeys = () => {
+    return ["binom", "semicolon"];
+};
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        return colinearVectorVEA(ans, answer);
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+const getReadLineNormalVectorOnGraphQuestion = (opts) => {
+    const point1 = PointConstructor.random("A");
+    const ratio = RationalConstructor.randomIrreductibleWithSign(6);
+    const translation = new Vector("u", ratio.num.toTree(), ratio.denum.toTree());
+    const point2 = translation.getEndPoint(point1);
+    let point3;
+    if (!opts?.withoutPerp) {
+        const vector = VectorConstructor.fromPoints(point1, point2);
+        const normal = vector.getOrthogonal();
+        point3 = normal.getEndPoint(point2);
+    }
+    const identifiers = {
+        point1Ids: point1.toIdentifiers(),
+        point2Ids: point2.toIdentifiers(),
+        point3Ids: point3?.toIdentifiers(),
+    };
+    return getQuestionFromIdentifiers(identifiers, opts);
+};
+const getQuestionFromIdentifiers = (identifiers, opts) => {
+    return {
+        answer: getAnswer(identifiers, opts),
+        instruction: getInstruction(identifiers, opts),
+        keys: getKeys(identifiers, opts),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers, opts),
+        correction: getCorrection(identifiers, opts),
+        ggbOptions: getGGBOptions(identifiers, opts),
+    };
+};
+const options = [
+    {
+        id: "withoutPerp",
+        label: "Ne pas tracer de droite perpendiculaire",
+        type: GeneratorOptionType.checkbox,
+        target: GeneratorOptionTarget.generation,
+        defaultValue: false,
+        tooltipText: "S'il n'y a pas de droite perpendiculaire tracée, l'élève devra utiliser le vecteur directeur de la droite puis la propriété qui donne un vecteur normal à partir d'un vecteur directeur.",
+    },
+];
+export const readLineNormalVectorOnGraph = {
+    id: "readLineNormalVectorOnGraph",
+    label: "Déterminer graphiquement les coordonnées d'un vecteur normal à une droite",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getReadLineNormalVectorOnGraphQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getHint,
+    getCorrection,
+    getInstruction,
+    getAnswer,
+    getGGBOptions,
+    hasGeogebra: true,
+    getQuestionFromIdentifiers,
+    options,
+    hasHintAndCorrection: true,
+};

package/lib/exercises/math/geometry/vectors/scalarProduct/alKashi/scalarProductAlKashiAngle.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"scalarProductAlKashiAngle.d.ts","sourceRoot":"","sources":["../../../../../../../src/exercises/math/geometry/vectors/scalarProduct/alKashi/scalarProductAlKashiAngle.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAEL,mBAAmB,EACpB,MAAM,2CAA2C,CAAC;AAkBnD,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,mBAAmB,CAAC;IACjC,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAmSF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAoB3D,CAAC"}
+{"version":3,"file":"scalarProductAlKashiAngle.d.ts","sourceRoot":"","sources":["../../../../../../../src/exercises/math/geometry/vectors/scalarProduct/alKashi/scalarProductAlKashiAngle.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAErC,OAAO,EAEL,mBAAmB,EACpB,MAAM,2CAA2C,CAAC;AAyBnD,KAAK,WAAW,GAAG;IACjB,WAAW,EAAE,mBAAmB,CAAC;IACjC,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AA8SF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAmB3D,CAAC"}