math-exercises 3.0.178 → 3.0.179

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

@@ -1,7 +1,9 @@
-import { shuffleProps, tryToAddWrongProp, addValidProp, propWhile, } from "../../../exercises/exercise.js";
+import { shuffleProps, tryToAddWrongProp, addValidProp, propWhile, GeneratorOptionTarget, GeneratorOptionType, } from "../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
+import { AffineConstructor } from "../../../math/polynomials/affine.js";
 import { Polynomial, PolynomialConstructor, } 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, coeffs } = identifiers;
     const u = new Polynomial(coeffs, "n");
@@ -19,18 +21,44 @@ const getAnswer = (identifiers) => {
     const answer = u.calculate(rank) + "";
     return answer;
 };
+const getHint = (identifiers) => {
+    return `La suite est donnée sous forme explicite. 
+  
+Remplace $n$ par $${identifiers.rank}$ dans la formule donnée.`;
+};
+const getCorrection = (identifiers) => {
+    const { coeffs, rank } = identifiers;
+    const u = new Polynomial(coeffs, "n");
+    return `La suite étant donnée sous forme explicite, il suffit de remplacer $n$ par $${rank}$ dans la formule : 
+  
+$$
+u_{${rank}} = ${u.toTree().toDetailedEvaluation({ n: rank.toTree() }).toTex()}
+$$
+
+donc 
+
+$$
+u_{${rank}} = ${getAnswer(identifiers)}
+$$`;
+};
 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 getExplicitFormulaUsageQuestion = () => {
-    const u = PolynomialConstructor.randomWithOrder(2, "n");
+const getExplicitFormulaUsageQuestion = (opts) => {
+    const type = opts?.functionType?.length
+        ? random(opts.functionType)
+        : random(["Affine", "Second degré"]);
+    const u = type === "Affine"
+        ? AffineConstructor.random()
+        : PolynomialConstructor.randomWithOrder(2, "n");
     const rank = randint(0, 4);
     const identifiers = { rank, coeffs: u.coefficients };
     return getQuestionFromIdentifiers(identifiers);
@@ -50,16 +78,28 @@ 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é"],
+    },
+];
 export const explicitFormulaUsage = {
     id: "explicitFormulaUsage",
     connector: "=",
     label: "Utiliser la formule explicite d'une suite",
     isSingleStep: true,
-    generator: (nb) => getDistinctQuestions(getExplicitFormulaUsageQuestion, nb),
+    generator: (nb, opts) => getDistinctQuestions(() => getExplicitFormulaUsageQuestion(opts), nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+    options,
 };

package/lib/exercises/math/sequences/geometric/geometricFindRandomTermFromTwoTerms.js

@@ -246,7 +246,7 @@ const options = [generatorOptionFirstTermRankOne];
 export const geometricFindRandomTermFromTwoTerms = {
     id: "geometricFindRandomTermFromTwoTerms",
     connector: "=",
-    label: "Connaissant deux termes d'une suite géométrique, en donner une formule générale",
+    label: "Connaissant deux termes d'une suite géométrique, en calculer un troisième",
     isSingleStep: true,
     generator: (nb, opts) => getDistinctQuestions(() => getGeometricFindRandomTermFromTwoTermsQuestion(opts), nb),
     options,

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

@@ -9,10 +9,7 @@ export * from "./geometricFindTerm.js";
 export * from "./geometricFindTermFirstRankOne.js";
 export * from "./geometricRecognizeReasonFromFirstTerms.js";
 export * from "./geometricVariations.js";
-export * from "./geometricFindExplicitFormulaFromTwoTerms.js";
-export * from "./geometricFindExplicitFormulaFromTwoConsecutiveTerms.js";
 export * from "./geometricFindRandomTermFromTwoTerms.js";
-export * from "./geometricFindRandomTermFromTwoConsecutiveTerms.js";
 export * from "./sum/index.js";
 export * from "./situations/index.js";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/geometric/index.ts"],"names":[],"mappings":"AAAA,cAAc,oCAAoC,CAAC;AACnD,cAAc,mCAAmC,CAAC;AAClD,cAAc,+CAA+C,CAAC;AAE9D,cAAc,0BAA0B,CAAC;AACzC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,sCAAsC,CAAC;AACrD,cAAc,kDAAkD,CAAC;AACjE,cAAc,wBAAwB,CAAC;AACvC,cAAc,oCAAoC,CAAC;AAEnD,cAAc,6CAA6C,CAAC;AAC5D,cAAc,0BAA0B,CAAC;AAEzC,cAAc,+CAA+C,CAAC;AAC9D,cAAc,0DAA0D,CAAC;AACzE,cAAc,0CAA0C,CAAC;AACzD,cAAc,qDAAqD,CAAC;AAEpE,cAAc,gBAAgB,CAAC;AAE/B,cAAc,uBAAuB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/geometric/index.ts"],"names":[],"mappings":"AAAA,cAAc,oCAAoC,CAAC;AACnD,cAAc,mCAAmC,CAAC;AAClD,cAAc,+CAA+C,CAAC;AAE9D,cAAc,0BAA0B,CAAC;AACzC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,sCAAsC,CAAC;AACrD,cAAc,kDAAkD,CAAC;AACjE,cAAc,wBAAwB,CAAC;AACvC,cAAc,oCAAoC,CAAC;AAEnD,cAAc,6CAA6C,CAAC;AAC5D,cAAc,0BAA0B,CAAC;AAIzC,cAAc,0CAA0C,CAAC;AAGzD,cAAc,gBAAgB,CAAC;AAE/B,cAAc,uBAAuB,CAAC"}

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

@@ -9,9 +9,9 @@ export * from "./geometricFindTerm.js";
 export * from "./geometricFindTermFirstRankOne.js";
 export * from "./geometricRecognizeReasonFromFirstTerms.js";
 export * from "./geometricVariations.js";
-export * from "./geometricFindExplicitFormulaFromTwoTerms.js";
-export * from "./geometricFindExplicitFormulaFromTwoConsecutiveTerms.js";
+// export * from "./geometricFindExplicitFormulaFromTwoTerms.js";
+// export * from "./geometricFindExplicitFormulaFromTwoConsecutiveTerms.js";
 export * from "./geometricFindRandomTermFromTwoTerms.js";
-export * from "./geometricFindRandomTermFromTwoConsecutiveTerms.js";
+// export * from "./geometricFindRandomTermFromTwoConsecutiveTerms.js";
 export * from "./sum/index.js";
 export * from "./situations/index.js";

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/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/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/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]));
+    });
+};

package/lib/index.d.ts

@@ -1597,13 +1597,6 @@ declare const mathExercises: (Exercise<{
     expBRounded: number;
     precision: number;
 }, Record<string, string | boolean | string[]>> | Exercise<{
-    nodeIdsA: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
-    nodeIdsB: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
-    nodeIdsAOpB: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
-    rand: number;
-}, {
-    isUseExpNotation: boolean;
-}> | Exercise<{
     nodeIdsF: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
     nodeIdsT: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
     x: number;
@@ -1838,8 +1831,6 @@ declare const mathExercises: (Exercise<{
     isMinusInside: boolean;
 }, Record<string, string | boolean | string[]>> | Exercise<{
     k: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
-}, Record<string, string | boolean | string[]>> | Exercise<{
-    nodeIds: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers[];
 }, Record<string, string | boolean | string[]>> | Exercise<{
     isFindU: boolean;
     nodeIds: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers[];
@@ -2861,15 +2852,6 @@ declare const mathExercises: (Exercise<{
     kIds: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
     uCoeffs: number[];
 }, Record<string, string | boolean | string[]>> | Exercise<{
-    flip: number;
-    pA?: number;
-    pB?: number;
-    pAB?: number;
-    pA_B?: number;
-    pB_A?: number;
-}, {
-    probaType: string[];
-}> | Exercise<{
     randomValues: number[];
     randomEffectives: number[];
 }, Record<string, string | boolean | string[]>> | Exercise<{
@@ -3014,6 +2996,7 @@ declare const mathExercises: (Exercise<{
     allowedAnsType: string[];
 }, {
     allowedAnsType: string[];
+    probaTypes: string[];
 }> | Exercise<{
     exerciseVars: {
         n: number;
@@ -3205,6 +3188,25 @@ declare const mathExercises: (Exercise<{
     situationIndex: number;
     dictShuffle: Record<string, string>;
     pType: string;
+}, Record<string, string | boolean | string[]>> | Exercise<{
+    flip: number;
+    pA?: number;
+    pB?: number;
+    pAB?: number;
+    pA_B?: number;
+    pB_A?: number;
+}, {
+    probaType: string[];
+}> | Exercise<{
+    params: import("./exercises/math/probaStat/trees/probaTreeSituations.js").ProbaTreeSituationParams;
+}, Record<string, string | boolean | string[]>> | Exercise<{
+    situationIndex: number;
+    aCapB: number;
+    aCapBBarre: number;
+    aBarreCapB: number;
+    aBarreCapBBarre: number;
+    knowing: "A" | "\\overline{A}" | "B" | "\\overline{B}";
+    asked: "A" | "\\overline{A}" | "B" | "\\overline{B}";
 }, Record<string, string | boolean | string[]>> | Exercise<{
     situationIndex: number;
     values: number[];
@@ -3396,28 +3398,6 @@ declare const mathExercises: (Exercise<{
     value2: number;
     precisionInitial: number;
     precisionReason: number;
-}, import("./exercises/options/optionFirstTermRankOne.js").OptionFirstTermRankOne> | Exercise<{
-    rank1: number;
-    value1: number;
-    rank2: number;
-    value2: number;
-    precisionInitial: number;
-    precisionReason: number;
-}, import("./exercises/options/optionFirstTermRankOne.js").OptionFirstTermRankOne> | Exercise<{
-    rank1: number;
-    value1: number;
-    rank2: number;
-    value2: number;
-    precisionInitial: number;
-    precisionReason: number;
-    rankAsked: number;
-}, import("./exercises/options/optionFirstTermRankOne.js").OptionFirstTermRankOne> | Exercise<{
-    rank1: number;
-    value1: number;
-    rank2: number;
-    value2: number;
-    precisionInitial: number;
-    precisionReason: number;
     rankAsked: number;
 }, import("./exercises/options/optionFirstTermRankOne.js").OptionFirstTermRankOne> | Exercise<{
     raison: number;
@@ -3443,11 +3423,6 @@ declare const mathExercises: (Exercise<{
     initial: number;
     reason: number;
     superfluousData?: import("./math/utils/sequences/situations/seqGeometricSituations.js").SituationGeometricSuperfluousData;
-}, import("./exercises/options/optionFirstTermRankOne.js").OptionFirstTermRankOne & import("./exercises/options/optionIsWithSuperfluousData.js").OptionIsWithSuperfluousData> | Exercise<{
-    situationIndex: number;
-    initial: number;
-    reason: number;
-    superfluousData?: import("./math/utils/sequences/situations/seqGeometricSituations.js").SituationGeometricSuperfluousData;
 }, import("./exercises/options/optionFirstTermRankOne.js").OptionFirstTermRankOne & import("./exercises/options/optionIsWithSuperfluousData.js").OptionIsWithSuperfluousData> | Exercise<{
     situationIndex: number;
     initial: number;
@@ -3457,13 +3432,18 @@ declare const mathExercises: (Exercise<{
 }, import("./exercises/options/optionFirstTermRankOne.js").OptionFirstTermRankOne & import("./exercises/options/optionIsWithSuperfluousData.js").OptionIsWithSuperfluousData> | Exercise<{
     rank: number;
     coeffs: number[];
-}, Record<string, string | boolean | string[]>> | Exercise<{
+}, {
+    functionType: string[];
+}> | Exercise<{
     coeffs: number[];
 }, Record<string, string | boolean | string[]>> | Exercise<{
     rank: number;
     u0: number;
     coeffs: number[];
-}, Record<string, string | boolean | string[]>> | Exercise<{
+}, {
+    functionType: string[];
+    askedRank: string[];
+}> | Exercise<{
     termeid: number;
     affine: number[];
     termeAdd: number;