math-exercises 3.0.177 → 3.0.179

package/lib/exercises/math/sequences/geometric/situations/geometricFindExplicitFormulaFromSituation.js

@@ -101,8 +101,10 @@ const getPropositions = (n, { answer, ...identifiers }, optsIn) => {
 const isAnswerValid = (ans, { answer, ...identifiers }, optsIn) => {
     const opts = optsIn ?? optsDefault;
     try {
+        const nodeAnswer = getAnswerNode(identifiers, opts);
         if (!ans.includes("=")) {
-            return false;
+            // return false;
+            ans = nodeAnswer.leftChild.toTex() + "=" + ans;
         }
         //TODO faire fonctionner parseAlgebraic("u_n = 3 \\times 2^n") (token _ not implemented)
         // const nodeAns = parseAlgebraic(ans);
@@ -115,7 +117,6 @@ const isAnswerValid = (ans, { answer, ...identifiers }, optsIn) => {
         if (!isEqualNode(nodeAns)) {
             return false;
         }
-        const nodeAnswer = getAnswerNode(identifiers, opts);
         const isValidLhs = () => nodeAns.leftChild.toTex() === nodeAnswer.leftChild.toTex();
         const isValidRhs = () => {
             const nodeAnsRhs = nodeAns.rightChild;

package/lib/exercises/math/sequences/geometric/situations/geometricFindTermFromSituation.js

@@ -24,7 +24,7 @@ const getInstruction = (identifiers, optsIn) => {
     const situation = situations[situationIndex];
     return `${situation.getStrSituation(initial, reason, firstRank, superfluousData)}
 
-Que vaut $u_{${rankAsked}}$ ?`;
+Quel calcul permet de trouver $u_{${rankAsked}}$ ?`;
 };
 const getAnswerNode = (identifiers, opts) => {
     const firstRank = opts?.firstTermRankOne ? 1 : 0;

package/lib/exercises/math/sequences/geometric/situations/index.d.ts

@@ -1,4 +1,3 @@
-export * from "./geometricFindExplicitFormulaFromSituation.js";
 export * from "./geometricFindRecurrenceFormulaFromSituation.js";
 export * from "./geometricFindTermFromSituation.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/sequences/geometric/situations/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/sequences/geometric/situations/index.ts"],"names":[],"mappings":"AAAA,cAAc,gDAAgD,CAAC;AAC/D,cAAc,kDAAkD,CAAC;AACjE,cAAc,qCAAqC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/sequences/geometric/situations/index.ts"],"names":[],"mappings":"AACA,cAAc,kDAAkD,CAAC;AACjE,cAAc,qCAAqC,CAAC"}

package/lib/exercises/math/sequences/geometric/situations/index.js

@@ -1,4 +1,4 @@
-export * from "./geometricFindExplicitFormulaFromSituation.js";
+// export * from "./geometricFindExplicitFormulaFromSituation.js";
 export * from "./geometricFindRecurrenceFormulaFromSituation.js";
 export * from "./geometricFindTermFromSituation.js";
 // export * from "./geometricFindRankFromSituation.js";

package/lib/exercises/math/sequences/geometric/sum/geometricComputeSumWithDots.js

@@ -185,7 +185,7 @@ const createRandomIdentifiers = (opts) => {
     const initial = randint(-9, 10, [0]);
     const signReason = coinFlip() ? 1 : -1;
     const reason = signReason * randint(2, 6);
-    const nbTerms = randint(7, 15);
+    const nbTerms = randint(5, 9);
     const minRankDots = firstRank + 2;
     const lastRank = firstRank + nbTerms - 1;
     const lowRankDots = randint(minRankDots, Math.min(minRankDots + randint(1, 3), lastRank));
@@ -225,7 +225,7 @@ const options = [
     generatorOptionFirstTermRankOne,
     {
         id: "isGiveCount",
-        label: "Donner $n$",
+        label: "Donner le nombre de termes de la somme dans la consigne",
         target: GeneratorOptionTarget.generation,
         type: GeneratorOptionType.checkbox,
         defaultValue: optsDefault.isGiveCount,

package/lib/exercises/math/sequences/graph/placeFirstSequencePoints.js

@@ -102,12 +102,12 @@ export const placeFirstSequencePoints = {
     isGGBAnswerValid,
     subject: "Mathématiques",
     getHint,
-    getInstruction,
     getCorrection,
+    hasHintAndCorrection: true,
+    getInstruction,
     getGGBAnswer,
     getStudentGGBOptions,
     answerType: "GGB",
     getQuestionFromIdentifiers,
     options,
-    hasHintAndCorrection: true,
 };

package/lib/exercises/math/sequences/index.d.ts

@@ -7,5 +7,6 @@ export * from "./sequenceEvaluation.js";
 export * from "./sequencePlot.js";
 export * from "./graph/index.js";
 export * from "./notation/index.js";
+export * from "./seqArithmGeom/index.js";
 export * from "./variations/index.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/sequences/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/sequences/index.ts"],"names":[],"mappings":"AAAA,cAAc,uBAAuB,CAAC;AACtC,cAAc,sBAAsB,CAAC;AACrC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,yBAAyB,CAAC;AACxC,cAAc,mBAAmB,CAAC;AAClC,cAAc,kBAAkB,CAAC;AACjC,cAAc,qBAAqB,CAAC;AAEpC,cAAc,uBAAuB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/sequences/index.ts"],"names":[],"mappings":"AAAA,cAAc,uBAAuB,CAAC;AACtC,cAAc,sBAAsB,CAAC;AACrC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,yBAAyB,CAAC;AACxC,cAAc,mBAAmB,CAAC;AAClC,cAAc,kBAAkB,CAAC;AACjC,cAAc,qBAAqB,CAAC;AACpC,cAAc,0BAA0B,CAAC;AAEzC,cAAc,uBAAuB,CAAC"}

package/lib/exercises/math/sequences/index.js

@@ -7,5 +7,6 @@ export * from "./sequenceEvaluation.js";
 export * from "./sequencePlot.js";
 export * from "./graph/index.js";
 export * from "./notation/index.js";
+export * from "./seqArithmGeom/index.js";
 // export * from "./limits/index.js";
 export * from "./variations/index.js";

package/lib/exercises/math/sequences/recurrenceFormulaUsage.d.ts

@@ -4,6 +4,10 @@ type Identifiers = {
     u0: number;
     coeffs: number[];
 };
-export declare const recurrenceFormulaUsage: Exercise<Identifiers>;
+type Options = {
+    functionType: string[];
+    askedRank: string[];
+};
+export declare const recurrenceFormulaUsage: Exercise<Identifiers, Options>;
 export {};
 //# sourceMappingURL=recurrenceFormulaUsage.d.ts.map

package/lib/exercises/math/sequences/recurrenceFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"recurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/sequences/recurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAKrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAwEF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAaxD,CAAC"}
+{"version":3,"file":"recurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/sequences/recurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAwIF,KAAK,OAAO,GAAG;IACb,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB,CAAC;AAmBF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAejE,CAAC"}

package/lib/exercises/math/sequences/recurrenceFormulaUsage.js

@@ -1,7 +1,8 @@
-import { shuffleProps, tryToAddWrongProp, addValidProp, propWhile, } from "../../../exercises/exercise.js";
+import { shuffleProps, tryToAddWrongProp, addValidProp, propWhile, GeneratorOptionType, GeneratorOptionTarget, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Polynomial } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
+import { random } from "../../../utils/alea/random.js";
 const getInstruction = (identifiers) => {
     const { rank, u0, coeffs } = identifiers;
     const u = new Polynomial(coeffs, "u_n");
@@ -27,21 +28,80 @@ const getAnswer = (identifiers) => {
     return answer;
 };
 const getQuestionFromIdentifiers = (identifiers) => {
-    const question = {
+    return {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
-        keys: ["u", "underscore", "equal"],
+        keys: [],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
-    return question;
 };
-const getRecurrenceFormulaUsageQuestion = () => {
-    const coeffs = [randint(-5, 6), randint(-5, 6), randint(-3, 4, [0])];
+const getHint = (identifiers) => {
+    const { rank } = identifiers;
+    let corr = `La formule qui est donnée est une formule de récurrence. Pour calculer $u_1$, tu peux remplacer $n$ par $0$ dans la formule.`;
+    if (rank > 1) {
+        corr += `
+    
+Tu peux ensuite répéter cette méthode : remplace $n$ par $1$ et utilise la valeur de $u_1$ que tu as trouvée pour déterminer $u_2$.`;
+    }
+    return corr;
+};
+const getCorrection = (identifiers) => {
+    const { rank, u0, coeffs } = identifiers;
+    const u = new Polynomial(coeffs, "u_n");
+    let currentValue = u0;
+    const values = [u0];
+    for (let i = 0; i < rank; i++) {
+        currentValue = u.calculate(currentValue);
+        values.push(currentValue);
+    }
+    let corr = `On remplace $n$ par $0$ : 
+  
+$$
+u_1 = ${u.toTree().toDetailedEvaluation({ u_n: u0.toTree() }).toTex()}
+$$
+
+donc $u_1 = ${values[1].frenchify()}$.
+
+`;
+    if (rank > 1) {
+        corr += `Puis, on se sert de ce résultat pour trouver $u_2$ : on remplace $n$ par $1$ dans la formule de récurrence :
+
+$$
+u_2 = ${u.toTree().toDetailedEvaluation({ u_n: values[1].toTree() }).toTex()}
+$$
+
+donc $u_2 = ${values[2].frenchify()}$.
+
+`;
+    }
+    if (rank > 2) {
+        corr += `De même pour trouver $u_3$ : 
+    
+$$
+u_2 = ${u.toTree().toDetailedEvaluation({ u_n: values[2].toTree() }).toTex()}
+$$
+
+donc $u_2 = ${values[3].frenchify()}$.`;
+    }
+    return corr;
+};
+const getRecurrenceFormulaUsageQuestion = (opts) => {
+    const type = opts?.functionType?.length
+        ? random(opts.functionType)
+        : random(["Affine", "Second degré"]);
+    const coeffs = type === "Affine"
+        ? [randint(-5, 6), randint(-5, 6, [0])]
+        : [randint(-5, 6), randint(-5, 6), randint(-3, 4, [0])];
     const u0 = randint(-2, 3, [0]);
-    const rank = randint(1, 4);
+    const texRank = opts?.askedRank?.length
+        ? random(opts.askedRank)
+        : random(["$1$", "$2$", "$3$"]);
+    const rank = Number(texRank[1]);
     const identifiers = { rank, u0, coeffs };
-    return getQuestionFromIdentifiers(identifiers);
+    return getQuestionFromIdentifiers(identifiers, opts);
 };
 const getPropositions = (n, { answer, rank, coeffs }) => {
     const propositions = [];
@@ -57,16 +117,36 @@ const getPropositions = (n, { answer, rank, coeffs }) => {
 const isAnswerValid = (ans, { answer, rank }) => {
     return [answer, `u_{${rank}}=${answer}`, `u_${rank}=${answer}`].includes(ans);
 };
+const options = [
+    {
+        id: "functionType",
+        label: "Type de fonction",
+        values: ["Affine", "Second degré"],
+        target: GeneratorOptionTarget.generation,
+        type: GeneratorOptionType.multiselect,
+        defaultValue: ["Affine", "Second degré"],
+    },
+    {
+        id: "askedRank",
+        label: "Rang demandé",
+        values: ["$1$", "$2$", "$3$"],
+        target: GeneratorOptionTarget.generation,
+        type: GeneratorOptionType.multiselect,
+        defaultValue: ["$1$", "$2$", "$3$"],
+    },
+];
 export const recurrenceFormulaUsage = {
     id: "recurrenceFormulaUsage",
     connector: "=",
     label: "Utiliser la formule de récurrence d'une suite",
     isSingleStep: true,
-    generator: (nb) => getDistinctQuestions(getRecurrenceFormulaUsageQuestion, nb),
+    generator: (nb, opts) => getDistinctQuestions(() => getRecurrenceFormulaUsageQuestion(opts), nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    options,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/sequences/seqArithmGeom/seqArithmGeomRecurrenceFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"seqArithmGeomRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/seqArithmGeom/seqArithmGeomRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAEL,sBAAsB,EACvB,MAAM,mDAAmD,CAAC;AA8C3D,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAoMF,KAAK,OAAO,GAAG,sBAAsB,GAAG;IAAE,mBAAmB,EAAE,MAAM,CAAA;CAAE,CAAC;AAkBxE,eAAO,MAAM,mCAAmC,EAAE,QAAQ,CACxD,WAAW,EACX,OAAO,CAoBR,CAAC"}
+{"version":3,"file":"seqArithmGeomRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/seqArithmGeom/seqArithmGeomRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAiBT,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAEL,sBAAsB,EACvB,MAAM,mDAAmD,CAAC;AA8C3D,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA+LF,KAAK,OAAO,GAAG,sBAAsB,GAAG;IAAE,mBAAmB,EAAE,MAAM,CAAA;CAAE,CAAC;AAkBxE,eAAO,MAAM,mCAAmC,EAAE,QAAQ,CACxD,WAAW,EACX,OAAO,CAoBR,CAAC"}

package/lib/exercises/math/sequences/seqArithmGeom/seqArithmGeomRecurrenceFormulaUsage.js

@@ -26,9 +26,11 @@ const getDictSequenceSlice = (coeffs, rank1, value1, rankAsked) => {
         return acc;
     }, { [rank1]: value1.toTree() });
 };
-const getInstruction = (identifiers) => {
+const getInstruction = (identifiers, optsIn) => {
+    const opts = optsIn ?? optsDefault;
+    const firstRank = opts.firstTermRankOne ? 1 : 0;
     const { rank1, value1, coeffs, rankAsked } = identifiers;
-    return `$(u_n)$ est une suite définie par, pour $n\\geq 1$ :
+    return `$(u_n)$ est une suite définie par, pour $n\\geq ${firstRank}$ :
   
 $$
 u_{n+1} = ${getNodeUNext(coeffs).toTex()}
@@ -38,11 +40,6 @@ et $u_{${rank1}} = ${value1}$.
 
 Calculer le terme $u_{${rankAsked}}$.`;
 };
-const getStartStatement = (identifiers) => {
-    const { rank1 } = identifiers;
-    const askedRank = rank1 + 1;
-    return `u_{${askedRank}}`;
-};
 const getAnswerStuff = (identifiers) => {
     const { rank1, value1, coeffs, rankAsked } = identifiers;
     const dictSequenceSlice = getDictSequenceSlice(coeffs, rank1, value1, rankAsked);
@@ -149,7 +146,7 @@ const getSeqArithmGeomRecurrenceFormulaUsageQuestion = (optsIn) => {
     const distanceOfRankAsked = Number(opts.distanceOfRankAsked);
     const rank1 = randint(firstRank, 20);
     const value1 = randint(-10, 10);
-    const a = randint(-10, 10, [0]);
+    const a = randint(-10, 10, [0, 1]);
     const b = randint(-10, 10, [0]);
     const coeffs = [a, b];
     const rankAsked = rank1 + distanceOfRankAsked;
@@ -159,7 +156,6 @@ const getSeqArithmGeomRecurrenceFormulaUsageQuestion = (optsIn) => {
 const getQuestionFromIdentifiers = (identifiers, opts) => {
     const question = {
         instruction: getInstruction(identifiers, opts),
-        startStatement: getStartStatement(identifiers, opts),
         answer: getAnswer(identifiers, opts),
         keys: [],
         answerFormat: "tex",

package/lib/exercises/math/spaceGeometry/sphere/sphereLatLonReading.2d.js

@@ -152,7 +152,7 @@ const getKeys = () => {
     return ["degree", "N", "O", "S", "E"];
 };
 const isAnswerValid = (ans, { answer }) => {
-    const ansRefined = ans.replace("^{\\circ}", "°");
+    const ansRefined = ans.replace("^{\\circ}", "°").replace("^\\circ", "°");
     return ansRefined === answer;
 };
 const getSphereLatLonReading2dQuestion = () => {

package/lib/exercises/math/trigonometry/circle/associatePoint.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"associatePoint.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/trigonometry/circle/associatePoint.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAK7C,KAAK,WAAW,GAAG;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,gBAAgB,EAAE,eAAe,CAAC;IAClC,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAgFF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAahD,CAAC"}
+{"version":3,"file":"associatePoint.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/trigonometry/circle/associatePoint.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAQ7C,KAAK,WAAW,GAAG;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,gBAAgB,EAAE,eAAe,CAAC;IAClC,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAgIF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAchD,CAAC"}

package/lib/exercises/math/trigonometry/circle/associatePoint.js

@@ -2,6 +2,9 @@ import { addValidProp, propWhile, shuffleProps, tryToAddWrongProp, } from "../..
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { RemarkableValueConstructor } from "../../../../math/trigonometry/remarkableValue.js";
 import { reifyAlgebraic, } from "../../../../tree/nodes/nodeConstructor.js";
+import { PiNode } from "../../../../tree/nodes/numbers/piNode.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
 import { coinFlip } from "../../../../utils/alea/coinFlip.js";
 import { random } from "../../../../utils/alea/random.js";
 const points = [
@@ -32,12 +35,55 @@ const getAnswer = (identifiers) => {
     const { point } = identifiers;
     return point;
 };
-// const getHint: GetHint<Identifiers> = (identifiers) => {
-//   return ``;
-// };
-// const getCorrection: GetCorrection<Identifiers> = (identifiers) => {
-//   return ``;
-// };
+const getHint = (identifiers) => {
+    const { angleIdentifiers } = identifiers;
+    const angle = reifyAlgebraic(angleIdentifiers);
+    const isSimplifiable = angle.evaluate() > Math.PI || angle.evaluate() <= -Math.PI;
+    let hint = "";
+    if (isSimplifiable) {
+        hint += `Commence par te ramener à l'intervalle $]-\\pi; \\pi]$, en ajoutant ou en retirant un multiple de $2\\pi$ à $${angle.toTex()}$.
+    
+`;
+    }
+    return hint + `Le cercle trigonométrique a un périmètre de $2\\pi$.`;
+};
+const getCorrection = (identifiers) => {
+    const { angleIdentifiers } = identifiers;
+    const angle = reifyAlgebraic(angleIdentifiers);
+    const isSimplifiable = angle.evaluate() > Math.PI || angle.evaluate() <= -Math.PI;
+    let corr = "";
+    if (isSimplifiable) {
+        let toAdd = 0;
+        let newAngle = angle;
+        let counter = 0;
+        while (newAngle.evaluate() > Math.PI || newAngle.evaluate() <= -Math.PI) {
+            counter++;
+            if (counter > 1000)
+                throw new Error("too many iterations in remarkable values");
+            if (newAngle.evaluate() > 0)
+                toAdd--;
+            else
+                toAdd++;
+            console.log(newAngle.evaluate(), toAdd);
+            newAngle = add(newAngle, multiply(toAdd > 0 ? 2 : -2, PiNode)).simplify();
+        }
+        // const raw = frac(angle, PiNode).simplify();
+        corr += `On se ramène à l'intervalle $]-\\pi; \\pi]$ :
+
+$$
+${add(angle, multiply(2 * toAdd, PiNode)).toTex()} = ${newAngle.toTex()}
+$$`;
+    }
+    return (corr +
+        `
+  
+On se sert du cercle trigonométrique ci-dessous : 
+
+![](https://heureuxhasarddocsbucket.s3.eu-west-3.amazonaws.com/mathliveV2/activities/quizzes/generator/piCercle_nombres.jpg)
+
+Le point cherché est donc $${getAnswer(identifiers)}$.
+`);
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -45,6 +91,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: points,
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -83,4 +131,5 @@ export const associatePoint = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/trigonometry/circle/selectQuadrantOnTrigoCircle.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"selectQuadrantOnTrigoCircle.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/trigonometry/circle/selectQuadrantOnTrigoCircle.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAIrC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AA2FF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAuB7D,CAAC"}
+{"version":3,"file":"selectQuadrantOnTrigoCircle.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/trigonometry/circle/selectQuadrantOnTrigoCircle.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AAIrC,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AA8FF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAuB7D,CAAC"}

package/lib/exercises/math/trigonometry/circle/selectQuadrantOnTrigoCircle.js

@@ -1,13 +1,12 @@
-import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
+import { addValidProp, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { randint } from "../../../../math/utils/random/randint.js";
-const getPropositions = (n, { answer }) => {
+const getPropositions = (_n, { answer }) => {
     const propositions = [];
-    addValidProp(propositions, answer, "raw");
-    ["Bleu", "Rouge", "Vert", "Jaune"].forEach((color) => {
-        tryToAddWrongProp(propositions, color, "raw");
+    ["Bleu", "Jaune", "Rouge", "Vert"].forEach((color) => {
+        (color === answer ? addValidProp : tryToAddWrongProp)(propositions, color, "raw");
     });
-    return shuffleProps(propositions, n);
+    return propositions;
 };
 const getAnswer = (identifiers) => {
     return ["Bleu", "Rouge", "Vert", "Jaune"][identifiers.quartant];

package/lib/exercises/math/trigonometry/functions/associateAngleSimplification.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"associateAngleSimplification.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/trigonometry/functions/associateAngleSimplification.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAgBrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,OAAO,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAgKF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAsB9D,CAAC"}
+{"version":3,"file":"associateAngleSimplification.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/trigonometry/functions/associateAngleSimplification.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAgBrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,OAAO,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA8JF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAsB9D,CAAC"}

package/lib/exercises/math/trigonometry/functions/associateAngleSimplification.js

@@ -95,9 +95,7 @@ $$`;
         corr += `
 
 $$
-${multiply(d, fct(substract(PiNode, "x"))).toTex()} =  ${isCos
-            ? multiply(-d, cos(substract(PiNode, "x"))).toTex()
-            : multiply(d, sin(substract(PiNode, "x"))).toTex()}
+${multiply(d, fct(substract(PiNode, "x"))).toTex()} =  ${isCos ? multiply(-d, cos("x")).toTex() : multiply(d, sin("x")).toTex()}
 $$`;
     }
     corr += `

package/lib/exercises/math/trigonometry/triangle/trigonometryAngleCalcul.js

@@ -21,7 +21,7 @@ const getAnswer = (identifiers) => {
     const { randAngle, triangleIdentifiers } = identifiers;
     const triangle = RightTriangleConstructor.fromIdentifiers(triangleIdentifiers);
     const answer = round(triangle.angles[randAngle].evaluate(), 0);
-    return answer + "^{\\circ}";
+    return answer + "^\\circ";
 };
 const getHint = () => {
     return `On peut utiliser : 
@@ -149,7 +149,7 @@ const getPropositions = (n, { answer }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     propWhile(propositions, n, () => {
-        tryToAddWrongProp(propositions, randint(20, 80) + "^{\\circ}");
+        tryToAddWrongProp(propositions, randint(20, 80) + "^\\circ");
     });
     return shuffle(propositions);
 };

package/lib/exercises/pc/snellDescartes.js

@@ -73,7 +73,7 @@ const getAnswer = (identifiers) => {
     const angleIncidenceRad = (ramdonAngleIncidenceDeg * Math.PI) / 180;
     const angleRefractionRad = Math.asin((n1 / n2) * Math.sin(angleIncidenceRad));
     const angleRefractionDeg = (angleRefractionRad * 180) / Math.PI;
-    const answer = `${frenchify(round(angleRefractionDeg, 1))}^{\\circ}`;
+    const answer = `${frenchify(round(angleRefractionDeg, 1))}^\\circ`;
     return answer;
 };
 const getQuestionFromIdentifiers = (identifiers) => {
@@ -103,7 +103,7 @@ const getPropositions = (n, { answer }) => {
     const propositions = [];
     addValidProp(propositions, answer);
     propWhile(propositions, n, () => {
-        tryToAddWrongProp(propositions, frenchify(round(randint(100, 900) / 10, 1)) + "^{\\circ}");
+        tryToAddWrongProp(propositions, frenchify(round(randint(100, 900) / 10, 1)) + "^\\circ");
     });
     return shuffle(propositions);
 };

package/lib/exercises/vea/polynomialVEA.d.ts

@@ -0,0 +1,2 @@
+export declare const polynomialVEA: (ans: string, answer: string) => boolean;
+//# sourceMappingURL=polynomialVEA.d.ts.map

package/lib/exercises/vea/polynomialVEA.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"polynomialVEA.d.ts","sourceRoot":"","sources":["../../../src/exercises/vea/polynomialVEA.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,aAAa,GAAI,KAAK,MAAM,EAAE,QAAQ,MAAM,YAmBxD,CAAC"}

package/lib/exercises/vea/polynomialVEA.js

@@ -0,0 +1,17 @@
+import { getArrNodeCoeffOfPolynomialNode } from "../../math/utils/polynomial/polynomialUtils.js";
+import { substract } from "../../tree/nodes/operators/substractNode.js";
+import { parseAlgebraic } from "../../tree/parsers/latexParser.js";
+import { zip } from "../../utils/arrays/arrayZip.js";
+import { handleVEAError } from "../../utils/errors/handleVEAError.js";
+export const polynomialVEA = (ans, answer) => {
+    try {
+        const nodeAns = parseAlgebraic(ans);
+        const nodeAnswer = parseAlgebraic(answer);
+        const [arrNodeCoeffAns, arrNodeCoeffAnswer] = [nodeAns, nodeAnswer].map((node) => getArrNodeCoeffOfPolynomialNode(node));
+        return (arrNodeCoeffAns.length === arrNodeCoeffAnswer.length &&
+            zip(arrNodeCoeffAns, arrNodeCoeffAnswer).every(([nodeCoeffAns, nodeCoeffAnswer]) => substract(nodeCoeffAns, nodeCoeffAnswer).evaluate() === 0));
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};

package/lib/exercises/vea/valueTableVEA.d.ts

@@ -0,0 +1,8 @@
+/**
+ *
+ * @param ans tableau du student
+ * @param answerTable tableau réponse
+ * TODO passer en argument le VEA check qui est ajd fixé à rationalVEA
+ */
+export declare const valueTableVEA: (ans: string[][], answerTable: string[][]) => boolean;
+//# sourceMappingURL=valueTableVEA.d.ts.map

package/lib/exercises/vea/valueTableVEA.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"valueTableVEA.d.ts","sourceRoot":"","sources":["../../../src/exercises/vea/valueTableVEA.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,eAAO,MAAM,aAAa,GAAI,KAAK,MAAM,EAAE,EAAE,EAAE,aAAa,MAAM,EAAE,EAAE,YAOrE,CAAC"}

package/lib/exercises/vea/valueTableVEA.js

@@ -0,0 +1,12 @@
+/**
+ *
+ * @param ans tableau du student
+ * @param answerTable tableau réponse
+ * TODO passer en argument le VEA check qui est ajd fixé à rationalVEA
+ */
+import { rationalVEA } from "./rationalVEA.js";
+export const valueTableVEA = (ans, answerTable) => {
+    return ans.every((row, i) => {
+        return row.every((cell, j) => cell === answerTable[i][j] || rationalVEA(cell, answerTable[i][j]));
+    });
+};