math-exercises 3.0.157 → 3.0.159

package/lib/exercises/math/sequences/arithmetic/arithmeticFindExplicitFormulaFirstTermRandom.js

@@ -0,0 +1,118 @@
+import { addValidProp, propWhile, tryToAddWrongProp, } 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 { add } from "../../../../tree/nodes/operators/addNode.js";
+import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
+import { substract } from "../../../../tree/nodes/operators/substractNode.js";
+import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
+import { shuffle } from "../../../../utils/alea/shuffle.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
+import { alignTex } from "../../../../utils/latex/alignTex.js";
+const getHint = () => {
+    return `Utilise la formule générale d'une suite arithmétique : 
+    
+$$
+u_n = u_k + (n-k) \\times r
+$$
+
+où $r$ la raison et $k$ est un entier.`;
+};
+const getCorrection = (identifiers) => {
+    const { firstRank, firstValue, reason } = identifiers;
+    const answer = getAnswer(identifiers);
+    return `La formule générale d'une suite arithmétique est :
+    
+$$
+u_n = u_k + (n-k) \\times r
+$$
+
+où $r$ la raison et $k$ est un entier.
+
+Ici, puisque $u_${firstRank} = ${firstValue}$ et $r = ${reason}$, on a : 
+
+${alignTex([
+        [
+            "u_n",
+            "=",
+            add(firstValue, multiply(substract("n", firstRank), reason)).toTex(),
+        ],
+        ["", "=", answer.split("=")[1]],
+    ])}
+`;
+};
+const getInstruction = (identifiers) => {
+    const { firstRank, firstValue, reason } = identifiers;
+    return `$(u_n)$ est une suite arithmétique de premier terme $u_{${firstRank}} = ${firstValue}$ et de raison $r = ${reason}$.
+  
+Donner l'expression de $u_n$ en fonction de $n$.`;
+};
+const getAnswer = (identifiers) => {
+    const { firstRank, firstValue, reason } = identifiers;
+    const formula = new Polynomial([firstValue - firstRank * reason, reason], "n");
+    const answer = "u_n=" + formula.toTex();
+    return answer;
+};
+const getArithmeticFindExplicitFormulaFirstTermRandom = () => {
+    const firstRank = randint(0, 8);
+    const firstValue = randint(-10, 10);
+    const reason = randint(-10, 10, [0]);
+    const identifiers = { firstValue, reason, firstRank };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    const question = {
+        instruction: getInstruction(identifiers),
+        answer: getAnswer(identifiers),
+        keys: ["un", "equal", "n"],
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+    return question;
+};
+const getPropositions = (n, { answer, firstValue, reason }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    propWhile(propositions, n, () => {
+        tryToAddWrongProp(propositions, "u_n=" +
+            new Polynomial([firstValue + randint(-3, 4), reason + randint(-3, 4, [-reason])], "n")
+                .toTree()
+                .toTex());
+    });
+    return shuffle(propositions);
+};
+const isAnswerValid = (ans, { answer }) => {
+    try {
+        const formated = ans.replaceAll("u_n", "").replaceAll("=", "");
+        const parsed = parseAlgebraic(formated);
+        return (parsed
+            .simplify({
+            towardsDistribute: true,
+            forbidFactorize: true,
+        })
+            .toTex() === answer.split("=")[1]);
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+export const arithmeticFindExplicitFormulaFirstTermRandom = {
+    id: "arithmeticFindExplicitFormulaFirstTermRandom",
+    connector: "=",
+    label: "Déterminer la formule générale d'une suite arithmétique (premier rang aléatoire)",
+    isSingleStep: false,
+    generator: (nb) => getDistinctQuestions(getArithmeticFindExplicitFormulaFirstTermRandom, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getAnswer,
+    getInstruction,
+    getHint,
+    getCorrection,
+    hasHintAndCorrection: true,
+    getQuestionFromIdentifiers,
+};

package/lib/exercises/math/sequences/arithmetic/arithmeticFindRandomTermFromTwoTerms.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFindRandomTermFromTwoTerms.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticFindRandomTermFromTwoTerms.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAKrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA6DF,eAAO,MAAM,oCAAoC,EAAE,QAAQ,CAAC,WAAW,CActE,CAAC"}
+{"version":3,"file":"arithmeticFindRandomTermFromTwoTerms.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticFindRandomTermFromTwoTerms.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAqGF,eAAO,MAAM,oCAAoC,EAAE,QAAQ,CAAC,WAAW,CAetE,CAAC"}

package/lib/exercises/math/sequences/arithmetic/arithmeticFindRandomTermFromTwoTerms.js

@@ -1,12 +1,19 @@
 import { addValidProp, shuffleProps, tryToAddWrongProp, propWhile, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { numberVEA } from "../../../../exercises/vea/numberVEA.js";
 import { randint } from "../../../../math/utils/random/randint.js";
 import { round } from "../../../../math/utils/round.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../../tree/nodes/operators/fractionNode.js";
+import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
+import { substract } from "../../../../tree/nodes/operators/substractNode.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
+import { alignTex } from "../../../../utils/latex/alignTex.js";
 const getInstruction = (identifiers) => {
     const { rank1, value1, rankAsked, rank2, value2 } = identifiers;
     return `Soit $u$ une suite arithmétique telle que $u_{${rank1}} = ${value1}$ et $u_{${rank2}} = ${value2}$. 
   
-Quelle est la valeur de $u_{${rankAsked}}$ ?`;
+Que vaut $u_{${rankAsked}}$ ?`;
 };
 const getAnswer = (identifiers) => {
     const { rank1, value1, rankAsked, rank2, value2 } = identifiers;
@@ -14,10 +21,44 @@ const getAnswer = (identifiers) => {
     const value3 = reason * (rankAsked - rank2) + value2;
     return value3.frenchify();
 };
-// const getHint: GetHint<Identifiers> =(identifiers)=>{
-// }
-// const getCorrection: GetCorrection<Identifiers> = (identifiers)=>{
-// }
+const getHint = (identifiers) => {
+    const { rankAsked } = identifiers;
+    return `Commence par déterminer la raison $r$ de la suite $u$. 
+  
+Puis, utilise cette raison et un des termes connus de la suite pour déterminer $u_{${rankAsked}}$.`;
+};
+const getCorrection = (identifiers) => {
+    const { rank1, value1, rankAsked, rank2, value2 } = identifiers;
+    const reason = round((value2 - value1) / (rank2 - rank1), 0);
+    const closest = Math.abs(rankAsked - rank1) < Math.abs(rankAsked - rank2) ? rank1 : rank2;
+    const diff = rankAsked - closest;
+    const closestValue = closest === rank1 ? value1 : value2;
+    return `On commence par déterminer la raison $r$ de la suite $u$ : 
+  
+${alignTex([
+        ["r", "=", `\\frac{u_{${rank2}} - u_{${rank1}}}{${rank2}-${rank1}}`],
+        [
+            "",
+            "=",
+            frac(substract(value2, value1), substract(rank2, rank1).simplify()).toTex(),
+        ],
+        [
+            "",
+            "=",
+            frac(substract(value2, value1), substract(rank2, rank1)).simplify().toTex(),
+        ],
+    ])}
+
+On peut alors déterminer $u_{${rankAsked}}$ en utilisant $u_{${closest}}$ et $r$. En effet, on a : 
+
+${alignTex([
+        [`u_{${rankAsked}}`, "=", add(`u_{${closest}}`, multiply(diff, "r")).toTex()],
+        ["", "=", add(closestValue, multiply(diff, reason)).toTex()],
+        ["", "=", add(closestValue, multiply(diff, reason)).simplify().toTex()],
+    ])}
+
+  `;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -25,6 +66,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: [],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -47,7 +90,12 @@ const getPropositions = (n, { answer }) => {
     return shuffleProps(propositions, n);
 };
 const isAnswerValid = (ans, { answer }) => {
-    return ans === answer;
+    try {
+        return numberVEA(ans, answer);
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
 };
 export const arithmeticFindRandomTermFromTwoTerms = {
     id: "arithmeticFindRandomTermFromTwoTerms",
@@ -61,4 +109,5 @@ export const arithmeticFindRandomTermFromTwoTerms = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/sequences/arithmetic/arithmeticFindReasonRandomRange.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFindReasonRandomRange.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticFindReasonRandomRange.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAIrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAmDF,eAAO,MAAM,+BAA+B,EAAE,QAAQ,CAAC,WAAW,CAajE,CAAC"}
+{"version":3,"file":"arithmeticFindReasonRandomRange.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticFindReasonRandomRange.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAOrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAyFF,eAAO,MAAM,+BAA+B,EAAE,QAAQ,CAAC,WAAW,CAcjE,CAAC"}

package/lib/exercises/math/sequences/arithmetic/arithmeticFindReasonRandomRange.js

@@ -1,11 +1,16 @@
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { randint } from "../../../../math/utils/random/randint.js";
+import { frac } from "../../../../tree/nodes/operators/fractionNode.js";
+import { substract } from "../../../../tree/nodes/operators/substractNode.js";
 import { shuffle } from "../../../../utils/alea/shuffle.js";
+import { alignTex } from "../../../../utils/latex/alignTex.js";
 const getInstruction = (identifiers) => {
     const { rank1, value1, rank2, reason } = identifiers;
     const value2 = reason * (rank2 - rank1) + value1;
-    return `$(u_n)$ est une suite arithmétique. On sait que $u_{${rank1}} = ${value1}$ et $u_{${rank2}} = ${value2}$. 
+    return `$(u_n)$ est une suite arithmétique. 
+  
+On sait que $u_{${rank1}} = ${value1}$ et $u_{${rank2}} = ${value2}$. 
   
 Quelle est la raison de la suite $(u_n)$ ?`;
 };
@@ -13,6 +18,39 @@ const getAnswer = (identifiers) => {
     const { reason } = identifiers;
     return reason.frenchify();
 };
+const getHint = () => {
+    return `Si $u$ est une suite arithmétique, alors la raison de $u$ est le nombre qu'on ajoute (ou soustrait) à un terme pour obtenir le suivant.`;
+};
+const getCorrection = (identifiers) => {
+    const { rank1, value1, rank2, reason } = identifiers;
+    const value2 = reason * (rank2 - rank1) + value1;
+    return `Puisque $u$ est une suite arithmétique, et puisque :
+  
+$$
+${rank2} - ${rank1} = ${rank2 - rank1}
+$$
+
+alors on a : 
+
+$$
+u_{${rank2}} = ${rank2 - rank1}\\times r + u_{${rank1}}
+$$
+
+où $r$ est la raison. 
+
+On en déduit donc : 
+
+${alignTex([
+        ["r", "=", `\\frac{u_{${rank2}} - u_{${rank1}}}{${rank2 - rank1}}`],
+        [
+            "",
+            "=",
+            frac(substract(value2, value1), substract(rank2, rank1).simplify()).toTex(),
+        ],
+        ["", "=", getAnswer(identifiers)],
+    ])}
+`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         instruction: getInstruction(identifiers),
@@ -21,6 +59,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: [],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -55,4 +95,5 @@ export const arithmeticFindReasonRandomRange = {
     generator: (nb) => getDistinctQuestions(getArithmeticFindReasonRandomRange, nb),
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/sequences/arithmetic/arithmeticFirstTermsSum.d.ts

@@ -5,6 +5,9 @@ type Identifiers = {
     reason: number;
     nbTerms: number;
 };
-export declare const arithmeticFirstTermsSum: Exercise<Identifiers>;
+type Options = {
+    firstTermRank: string;
+};
+export declare const arithmeticFirstTermsSum: Exercise<Identifiers, Options>;
 export {};
 //# sourceMappingURL=arithmeticFirstTermsSum.d.ts.map

package/lib/exercises/math/sequences/arithmetic/arithmeticFirstTermsSum.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticFirstTermsSum.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticFirstTermsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAKrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AA0DF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAezD,CAAC"}
+{"version":3,"file":"arithmeticFirstTermsSum.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticFirstTermsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAqGF,KAAK,OAAO,GAAG;IACb,aAAa,EAAE,MAAM,CAAC;CACvB,CAAC;AAeF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAelE,CAAC"}

package/lib/exercises/math/sequences/arithmetic/arithmeticFirstTermsSum.js

@@ -1,10 +1,44 @@
-import { addValidProp, propWhile, shuffleProps, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
+import { GeneratorOptionTarget, GeneratorOptionType, addValidProp, propWhile, shuffleProps, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { randint } from "../../../../math/utils/random/randint.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../../tree/nodes/operators/fractionNode.js";
+import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
 import { random } from "../../../../utils/alea/random.js";
+const getHint = () => {
+    return `La somme $S$ des $n$ premiers termes d'une suite arithmétique s'obtient par la formule : 
+  
+$$
+S = n \\times \\frac{1^{\\text{er}}\\text{terme} + \\text{dernier terme}}{2}
+$$`;
+};
+const getCorrection = (identifiers) => {
+    const { firstRank, firstValue, nbTerms, reason } = identifiers;
+    const lastRank = firstRank + nbTerms - 1;
+    const lastValue = firstValue + reason * (nbTerms - 1);
+    return `La somme $S$ des $n$ premiers termes d'une suite arithmétique s'obtient par la formule : 
+  
+$$
+S = n \\times \\frac{1^{\\text{er}}\\text{terme} + \\text{dernier terme}}{2}
+$$
+
+On calcule le dernier terme de la somme : 
+
+$$
+u_{${lastRank}} = ${add(firstValue, multiply(nbTerms - 1, reason)).toTex()} = ${lastValue}
+$$
+
+La somme des $${nbTerms}$ premiers termes de $u$ vaut donc :
+
+$$
+${multiply(nbTerms, frac(add(firstValue, lastValue), 2)).toTex()} = ${getAnswer(identifiers)}
+$$`;
+};
 const getInstruction = (identifiers) => {
     const { firstRank, firstValue, reason, nbTerms } = identifiers;
-    return `Soit $u$ une suite arithmétique de premier terme $u_${firstRank} = ${firstValue}$ et de raison $${reason}$. Calculer la somme des $${nbTerms}$ premiers termes de $u$.`;
+    return `Soit $u$ une suite arithmétique de premier terme $u_${firstRank} = ${firstValue}$ et de raison $${reason}$. 
+
+Calculer la somme des $${nbTerms}$ premiers termes de $u$.`;
 };
 const getAnswer = (identifiers) => {
     const { firstRank, firstValue, reason, nbTerms } = identifiers;
@@ -15,8 +49,12 @@ const getAnswer = (identifiers) => {
     const answerTex = answer + "";
     return answerTex;
 };
-const getArithmeticFirstTermsSumQuestion = () => {
-    const firstRank = random([0, 1]);
+const getArithmeticFirstTermsSumQuestion = (opts) => {
+    const firstRank = opts?.firstTermRank === "$u_{0}$"
+        ? 0
+        : opts?.firstTermRank === "$u_{1}$"
+            ? 1
+            : random([0, 1]);
     const firstValue = randint(-9, 10);
     const reason = randint(-5, 5, [0]);
     const nbTerms = randint(4, 9);
@@ -30,6 +68,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: [],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -41,6 +81,16 @@ const getPropositions = (n, { answer }) => {
     });
     return shuffleProps(propositions, n);
 };
+const options = [
+    {
+        id: "firstTermRank",
+        label: "Rang du premier terme",
+        target: GeneratorOptionTarget.generation,
+        type: GeneratorOptionType.select,
+        values: ["$u_{0}$", "$u_{1}$", "L'un ou l'autre"],
+        defaultValue: "L'un ou l'autre",
+    },
+];
 const isAnswerValid = (ans, { answer }) => {
     return ans === answer;
 };
@@ -49,13 +99,13 @@ export const arithmeticFirstTermsSum = {
     connector: "=",
     label: "Calculer la somme des premiers termes d'une suite arithmétique",
     isSingleStep: true,
-    generator: (nb) => getDistinctQuestions(getArithmeticFirstTermsSumQuestion, nb),
+    generator: (nb, opts) => getDistinctQuestions(() => getArithmeticFirstTermsSumQuestion(opts), nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
     isAnswerValid,
     subject: "Mathématiques",
-    getAnswer,
-    getInstruction,
+    hasHintAndCorrection: true,
     getQuestionFromIdentifiers,
+    options,
 };

package/lib/exercises/math/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAaT,MAAM,6BAA6B,CAAC;AAIrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAwEF,eAAO,MAAM,gCAAgC,EAAE,QAAQ,CAAC,WAAW,CAalE,CAAC"}
+{"version":3,"file":"arithmeticRecurrenceFormulaUsage.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAMrC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAkGF,eAAO,MAAM,gCAAgC,EAAE,QAAQ,CAAC,WAAW,CAclE,CAAC"}

package/lib/exercises/math/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.js

@@ -1,11 +1,30 @@
 import { addValidProp, tryToAddWrongProp, propWhile, } from "../../../../exercises/exercise.js";
 import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
 import { randint } from "../../../../math/utils/random/randint.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
 import { shuffle } from "../../../../utils/alea/shuffle.js";
+import { alignTex } from "../../../../utils/latex/alignTex.js";
+const getHint = (identifiers) => {
+    const { firstRank } = identifiers;
+    const askedRank = firstRank + 1;
+    return `Il suffit de remplacer $n$ par $${askedRank - 1}$ dans la formule de récurrence de la suite $u$.`;
+};
+const getCorrection = (identifiers) => {
+    const { firstRank, firstValue, reason } = identifiers;
+    const askedRank = firstRank + 1;
+    return `On remplace $n$ par $${askedRank - 1}$ dans la formule de récurrence : 
+  
+${alignTex([
+        [`u_{${firstRank}+1}`, "=", `${reason} + u_{${firstRank}}`],
+        [`u_{${askedRank}}`, "=", add(reason, firstValue).toTex()],
+        ["", "=", getAnswer(identifiers)],
+    ])}
+`;
+};
 const getInstruction = (identifiers) => {
     const { firstRank, firstValue, reason } = identifiers;
     const askedRank = firstRank + 1;
-    return `$(u_n)$ est une suite définie par :
+    return `$(u_n)$ est une suite définie par, pour $n\\geq 1$ :
   
 $$
 u_{n+1} = ${reason} + u_n
@@ -25,9 +44,11 @@ const getQuestionFromIdentifiers = (identifiers) => {
         instruction: getInstruction(identifiers),
         startStatement: getStartStatement(identifiers),
         answer: getAnswer(identifiers),
-        keys: ["u", "underscore", "equal"],
+        keys: [],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -70,4 +91,5 @@ export const arithmeticRecurrenceFormulaUsage = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/sequences/arithmetic/arithmeticThresholdFind.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmeticThresholdFind.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticThresholdFind.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,QAAQ,EAYT,MAAM,sBAAsB,CAAC;AAG9B,KAAK,WAAW,GAAG;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA+EF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAazD,CAAC"}
+{"version":3,"file":"arithmeticThresholdFind.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/arithmeticThresholdFind.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,QAAQ,EAcT,MAAM,sBAAsB,CAAC;AAG9B,KAAK,WAAW,GAAG;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AA6GF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAczD,CAAC"}

package/lib/exercises/math/sequences/arithmetic/arithmeticThresholdFind.js

@@ -1,31 +1,51 @@
+import { Affine } from "../../../../math/polynomials/affine.js";
 import { Polynomial } from "../../../../math/polynomials/polynomial.js";
 import { randint } from "../../../../math/utils/random/randint.js";
+import { firstDegreeInequationResolutionTex } from "../../../../tree/nodes/inequations/inequationNode.js";
 import { shuffle } from "../../../../utils/alea/shuffle.js";
 import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercise.js";
 import { getDistinctQuestions } from "../../../utils/getDistinctQuestions.js";
 const getInstruction = (identifiers) => {
     const { firstValue, reason, randValue } = identifiers;
     const formula = new Polynomial([firstValue, reason], "n");
-    let instruction = `$(u_n)$ est une suite arithmétique définie par 
+    return `$(u_n)$ est une suite arithmétique définie par :
   
 $$
 u_n = ${formula.toTree().toTex()}
 $$
 
+À partir de quel rang $n$ a-t-on $u_n ${reason > 0 ? ">" : "<"} ${randValue}$ ?
 `;
-    if (reason > 0) {
-        instruction += `À partir de quel rang $n$ a-t-on $u_n > ${randValue}$ ?`;
-    }
-    else {
-        instruction += `À partir de quel rang $n$ a-t-on $u_n < ${randValue}$ ?`;
-    }
-    return instruction;
 };
 const getAnswer = (identifiers) => {
     const { firstValue, reason, randValue } = identifiers;
     const answer = (Math.floor((randValue - firstValue) / reason) + 1).toString();
     return answer;
 };
+const getHint = (identifiers) => {
+    const { firstValue, reason, randValue } = identifiers;
+    const formula = new Polynomial([firstValue, reason], "n");
+    return `Résous l'inéquation : 
+  
+$$
+${formula.toTree().toTex()} ${reason > 0 ? ">" : "<"} ${randValue}
+$$
+
+Attention, le rang $n$ recherché doit être un nombre entier.`;
+};
+const getCorrection = (identifiers) => {
+    const { firstValue, reason, randValue } = identifiers;
+    return `On résous l'inéquation : 
+
+
+
+$$
+${firstDegreeInequationResolutionTex(new Affine(reason, firstValue, "n"), reason > 0 ? "<" : ">", randValue.toTree())}
+$$
+
+Puisque $n$ doit être entier, le rang $n$ recherché est donc $${getAnswer(identifiers)}$.
+`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         instruction: getInstruction(identifiers),
@@ -34,6 +54,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["r", "n", "u", "underscore", "inf", "sup", "approx"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -73,4 +95,5 @@ export const arithmeticThresholdFind = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

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

@@ -11,7 +11,7 @@ export * from "./recognizeReasonFromFirstTerms.js";
 export * from "./recognizeReasonFromGraph.js";
 export * from "./recognizeArithmeticFromGraph.js";
 export * from "./arithmeticFirstTermsSum.js";
-export * from "./arithmeticFindExplictFormulaFirstTermRandom.js";
+export * from "./arithmeticFindExplicitFormulaFirstTermRandom.js";
 export * from "./arithmeticFindReasonRandomRange.js";
 export * from "./arithmeticFindRandomTermFromTwoTerms.js";
 export * from "./arithmeticFindTerm.js";

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/index.ts"],"names":[],"mappings":"AAAA,cAAc,qCAAqC,CAAC;AAEpD,cAAc,oCAAoC,CAAC;AACnD,cAAc,gDAAgD,CAAC;AAE/D,cAAc,2BAA2B,CAAC;AAC1C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,uCAAuC,CAAC;AACtD,cAAc,8BAA8B,CAAC;AAC7C,cAAc,uBAAuB,CAAC;AACtC,cAAc,wCAAwC,CAAC;AACvD,cAAc,oCAAoC,CAAC;AACnD,cAAc,+BAA+B,CAAC;AAC9C,cAAc,mCAAmC,CAAC;AAClD,cAAc,8BAA8B,CAAC;AAC7C,cAAc,kDAAkD,CAAC;AACjE,cAAc,sCAAsC,CAAC;AACrD,cAAc,2CAA2C,CAAC;AAC1D,cAAc,yBAAyB,CAAC;AACxC,cAAc,qCAAqC,CAAC;AACpD,cAAc,+BAA+B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/index.ts"],"names":[],"mappings":"AAAA,cAAc,qCAAqC,CAAC;AAEpD,cAAc,oCAAoC,CAAC;AACnD,cAAc,gDAAgD,CAAC;AAE/D,cAAc,2BAA2B,CAAC;AAC1C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,uCAAuC,CAAC;AACtD,cAAc,8BAA8B,CAAC;AAC7C,cAAc,uBAAuB,CAAC;AACtC,cAAc,wCAAwC,CAAC;AACvD,cAAc,oCAAoC,CAAC;AACnD,cAAc,+BAA+B,CAAC;AAC9C,cAAc,mCAAmC,CAAC;AAClD,cAAc,8BAA8B,CAAC;AAC7C,cAAc,mDAAmD,CAAC;AAClE,cAAc,sCAAsC,CAAC;AACrD,cAAc,2CAA2C,CAAC;AAC1D,cAAc,yBAAyB,CAAC;AACxC,cAAc,qCAAqC,CAAC;AACpD,cAAc,+BAA+B,CAAC"}

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

@@ -11,7 +11,7 @@ export * from "./recognizeReasonFromFirstTerms.js";
 export * from "./recognizeReasonFromGraph.js";
 export * from "./recognizeArithmeticFromGraph.js";
 export * from "./arithmeticFirstTermsSum.js";
-export * from "./arithmeticFindExplictFormulaFirstTermRandom.js";
+export * from "./arithmeticFindExplicitFormulaFirstTermRandom.js";
 export * from "./arithmeticFindReasonRandomRange.js";
 export * from "./arithmeticFindRandomTermFromTwoTerms.js";
 export * from "./arithmeticFindTerm.js";

package/lib/exercises/math/sequences/arithmetic/recognizeArithmeticFromGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"recognizeArithmeticFromGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/recognizeArithmeticFromGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB,CAAC;AAiGF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAa9D,CAAC"}
+{"version":3,"file":"recognizeArithmeticFromGraph.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/arithmetic/recognizeArithmeticFromGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAQrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB,CAAC;AA6GF,eAAO,MAAM,4BAA4B,EAAE,QAAQ,CAAC,WAAW,CAc9D,CAAC"}

package/lib/exercises/math/sequences/arithmetic/recognizeArithmeticFromGraph.js

@@ -28,14 +28,23 @@ const getGGBOptions = (identifiers) => {
         coords: [-1, 7, Math.min(-1, yMin - 2), Math.max(1, yMax + 2)],
     });
 };
+// const getHint: GetHint<Identifiers> = () => {
+//   return `Une suite est arithmétique si, pour passer d'un terme au suivant, on ajoute toujours le même nombre (appelé la raison de la suite).
+// Sur le graphique, les points `;
+// };
+// const getCorrection: GetCorrection<Identifiers> = (identifiers) => {
+//   return ``;
+// };
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
         instruction: getInstruction(identifiers),
         keys: [],
         ggbOptions: getGGBOptions(identifiers),
-        answerFormat: "tex",
+        answerFormat: "raw",
         identifiers,
+        // hint: getHint(identifiers),
+        // correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -97,4 +106,5 @@ export const recognizeArithmeticFromGraph = {
     hasGeogebra: true,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    // hasHintAndCorrection: true,
 };

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

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/generation/index.ts"],"names":[],"mappings":""}

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

@@ -0,0 +1 @@
+export {};

package/lib/exercises/math/sequences/generation/recognizeRecurrenceOrExplicit.d.ts

@@ -0,0 +1,8 @@
+import { Exercise } from '../../../../exercises/exercise.js';
+import { NodeIdentifiers } from '../../../../tree/nodes/nodeConstructor.js';
+type Identifiers = {
+    relations: NodeIdentifiers[];
+};
+export declare const recognizeRecurrenceOrExplicit: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=recognizeRecurrenceOrExplicit.d.ts.map

package/lib/exercises/math/sequences/generation/recognizeRecurrenceOrExplicit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recognizeRecurrenceOrExplicit.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/generation/recognizeRecurrenceOrExplicit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAErC,OAAO,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAC;AAGtE,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,eAAe,EAAE,CAAA;CAC7B,CAAC;AA2DF,eAAO,MAAM,6BAA6B,EAAE,QAAQ,CAAC,WAAW,CAiB/D,CAAC"}