math-exercises 3.0.201 → 3.0.203

package/lib/exercises/math/limits/limitReading.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"limitReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/limitReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAmBrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;IAC5B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;CACzB,CAAC;AAoKF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAa9C,CAAC"}
+{"version":3,"file":"limitReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/limitReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAgBT,MAAM,6BAA6B,CAAC;AAmBrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;IAC5B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;CACzB,CAAC;AAgPF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAc9C,CAAC"}

package/lib/exercises/math/limits/limitReading.js

@@ -79,6 +79,73 @@ const getAnswer = (identifiers) => {
         }
     }
 };
+const getHint = (identifiers) => {
+    const { from, to } = identifiers;
+    switch (to) {
+        case "-\\infty":
+            return `Observe les valeurs de $f(x)$ lorsque $x$ se rapproche de $-\\infty$ (c'est à dire, lorsque $x$ prend des valeurs de plus en plus grande dans les négatifs). Si $f(x)$ semble se rapprocher d'une valeur, alors cette valeur est la limite recherchée. Si $f(x)$ semble devenir de plus en plus grand, alors la limite est $+\\infty$ (ou $-\\infty$ si les valeurs sont négatives).`;
+            break;
+        case "+\\infty":
+            return `Observe les valeurs de $f(x)$ lorsque $x$ se rapproche de $+\\infty$ (c'est à dire, lorsque $x$ prend des valeurs de plus en plus grande dans les positifs). Si $f(x)$ semble se rapprocher d'une valeur, alors cette valeur est la limite recherchée. Si $f(x)$ semble devenir de plus en plus grand, alors la limite est $+\\infty$ (ou $-\\infty$ si les valeurs sont négatives).`;
+            break;
+        default:
+            if (from === "+") {
+                return `On cherche la limite de $f(x)$ lorsque $x$ se rapproche de $${to}$, tout en restant supérieur à $${to}$. Observe donc les valeurs de $f(x)$ en partant des valeurs de $x$ supérieures à $${to}$, et en te rapprochant de plus en plus de $${to}$.`;
+            }
+            else {
+                return `On cherche la limite de $f(x)$ lorsque $x$ se rapproche de $${to}$, tout en restant inférieur à $${to}$. Observe donc les valeurs de $f(x)$ en partant des valeurs de $x$ inférieures à $${to}$, et en te rapprochant de plus en plus de $${to}$.`;
+            }
+    }
+    return ``;
+};
+const getCorrection = (identifiers) => {
+    const { from, to } = identifiers;
+    const answer = getAnswer(identifiers);
+    let corr = "";
+    switch (to) {
+        case "-\\infty":
+            corr += `On observe les valeurs de $f(x)$ lorsque $x$ se rapproche de $-\\infty$ (c'est à dire, lorsque $x$ prend des valeurs de plus en plus grande dans les négatifs).`;
+            break;
+        case "+\\infty":
+            corr += `On observe les valeurs de $f(x)$ lorsque $x$ se rapproche de $+\\infty$ (c'est à dire, lorsque $x$ prend des valeurs de plus en plus grande dans les positifs).`;
+            break;
+        default:
+            if (from === "+") {
+                corr += `On cherche la limite de $f(x)$ lorsque $x$ se rapproche de $${to}$, tout en restant supérieur à $${to}$. On observe donc les valeurs de $f(x)$ en partant des valeurs de $x$ supérieures à $${to}$, et en se rapprochant de plus en plus de $${to}$.`;
+            }
+            else {
+                corr += `On cherche la limite de $f(x)$ lorsque $x$ se rapproche de $${to}$, tout en restant inférieur à $${to}$. On observe donc les valeurs de $f(x)$ en partant des valeurs de $x$ inférieures à $${to}$, et en se rapprochant de plus en plus de $${to}$.`;
+            }
+    }
+    switch (answer) {
+        case "+\\infty":
+            corr += `
+     
+On lit graphiquement que $f(x)$ prend des valeurs de plus en plus grandes dans les positifs, c'est à dire que ces valeurs semblent se rapprocher de $+\\infty$.
+`;
+            break;
+        case "-\\infty":
+            corr += `
+
+On lit graphiquement que $f(x)$ prend des valeurs de plus en plus grandes dans les négatifs, c'est à dire que ces valeurs semblent se rapprocher de $-\\infty$.
+`;
+            break;
+        default:
+            corr += `
+      
+On lit graphiquement que $f(x)$ prend des valeurs de plus en plus proches de $${answer}$.
+`;
+            break;
+    }
+    return (corr +
+        `
+  
+On en conclut donc que : 
+
+$$
+${new LimitNode(parseLatex(to), new VariableNode("f(x)"), from).toTex()} = ${answer}
+$$`);
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -87,6 +154,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         ggbOptions: getGGBOptions(identifiers),
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -176,4 +245,5 @@ export const limitReading = {
     hasGeogebra: true,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/limits/polynomLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"polynomLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/polynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,EAAE,EAAE,UAAU,GAAG,UAAU,CAAC;CAC7B,CAAC;AA6DF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAY9C,CAAC"}
+{"version":3,"file":"polynomLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/polynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAcrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,EAAE,EAAE,UAAU,GAAG,UAAU,CAAC;CAC7B,CAAC;AAiHF,eAAO,MAAM,YAAY,EAAE,QAAQ,CAAC,WAAW,CAa9C,CAAC"}

package/lib/exercises/math/limits/polynomLimit.js

@@ -2,6 +2,11 @@ import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
+import { AddNode } from "../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../tree/nodes/operators/fractionNode.js";
+import { multiply } from "../../../tree/nodes/operators/multiplyNode.js";
+import { power } from "../../../tree/nodes/operators/powerNode.js";
+import { operatorComposition } from "../../../tree/utilities/operatorComposition.js";
 import { coinFlip } from "../../../utils/alea/coinFlip.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
 const getInstruction = (identifiers) => {
@@ -19,8 +24,44 @@ const getAnswer = (identifiers) => {
     const answer = poly.getLimit(to);
     return answer;
 };
-// const getHint: GetHint<Identifiers> = (identifiers) => {};
-// const getCorrection: GetCorrection<Identifiers> = (identifiers) => {};
+const getHint = () => {
+    return `Attention ! Ici, on est en présence d'une forme indéterminée du type "$\\infty - \\infty"$. 
+  
+On ne peut pas immédiatemment déterminer la limite de $f(x)$.
+
+Pour s'en sortir, il faut d'abord factoriser $f(x)$ par son terme de plus haut degré.`;
+};
+const getCorrection = (identifiers) => {
+    const { coeffs, to } = identifiers;
+    const order = coeffs.length - 1;
+    const highCoeff = coeffs[order];
+    const high = power("x", order);
+    const factoNodes = [...coeffs].reverse().map((e, i) => {
+        //coeff / n^(order-i)
+        return frac(e, power("x", i)).simplify();
+    });
+    const facto = operatorComposition(AddNode, factoNodes);
+    return `Ici, on est en présence d'une forme indéterminée du type "$\\infty - \\infty"$. 
+
+Pour déterminer la limite de $f(x)$, on factorise par son terme de plus haut degré :
+
+$$
+f(x) = ${multiply(high, facto).toTex()}
+$$
+
+On a alors : 
+
+
+- $\\displaystyle \\lim_{x \\to ${to}} ${high.toTex()} = ${to === "-\\infty" && order % 2 === 1 ? "-" : "+"}\\infty$
+
+- $\\displaystyle  \\lim_{x \\to ${to}} ${facto.toTex()} = ${highCoeff}$
+
+Par produit des limites, on obtient donc : 
+
+$$
+\\lim_{x \\to ${to}} f(x) = ${getAnswer(identifiers)}
+$$`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -28,11 +69,20 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["infty"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
 const getPolynomLimitQuestion = () => {
-    const poly = PolynomialConstructor.random(4);
+    const order = randint(2, 5);
+    const poly = PolynomialConstructor.randomWithOrder(order, "n");
+    const coeffs = [...poly.coefficients];
+    const signs = coeffs.slice(1).map((e) => (e > 0 ? "+" : "-"));
+    if (signs.every((s) => s === signs[0])) {
+        const index = randint(1, order);
+        coeffs[index] *= -1;
+    }
     const to = coinFlip() ? "+\\infty" : "-\\infty";
     const identifiers = { coeffs: poly.coefficients, to };
     return getQuestionFromIdentifiers(identifiers);
@@ -56,7 +106,7 @@ const isAnswerValid = (ans, { answer }) => {
 export const polynomLimit = {
     id: "polynomLimit",
     connector: "=",
-    label: "Limite d'une fonction polynomiale",
+    label: "Limite d'une fonction polynomiale (avec F.I.)",
     isSingleStep: true,
     generator: (nb) => getDistinctQuestions(getPolynomLimitQuestion, nb),
     qcmTimer: 60,
@@ -65,4 +115,5 @@ export const polynomLimit = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/limits/polynomLimitNoFI.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"polynomLimitNoFI.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/polynomLimitNoFI.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,EAAE,EAAE,UAAU,GAAG,UAAU,CAAC;CAC7B,CAAC;AAgEF,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,CAalD,CAAC"}
+{"version":3,"file":"polynomLimitNoFI.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/polynomLimitNoFI.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,EAAE,EAAE,UAAU,GAAG,UAAU,CAAC;CAC7B,CAAC;AAgGF,eAAO,MAAM,gBAAgB,EAAE,QAAQ,CAAC,WAAW,CAclD,CAAC"}

package/lib/exercises/math/limits/polynomLimitNoFI.js

@@ -2,6 +2,8 @@ import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
+import { multiply } from "../../../tree/nodes/operators/multiplyNode.js";
+import { power } from "../../../tree/nodes/operators/powerNode.js";
 import { coinFlip } from "../../../utils/alea/coinFlip.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
 const getInstruction = (identifiers) => {
@@ -19,8 +21,36 @@ const getAnswer = (identifiers) => {
     const answer = poly.getLimit(to);
     return answer;
 };
-// const getHint: GetHint<Identifiers> = (identifiers) => {};
-// const getCorrection: GetCorrection<Identifiers> = (identifiers) => {};
+const getHint = (identifiers) => {
+    const { to } = identifiers;
+    return `Détermine la limite quand $x$ tend vers $${to}$ de chaque terme de la somme composant $f(x)$. 
+  
+Puis, déduis-en la limite de $f(x)$ en "additionnant" les limites obtenues.`;
+};
+const getCorrection = (identifiers) => {
+    const { to, coeffs } = identifiers;
+    const texs = coeffs
+        .map((coeff, i) => {
+        if (coeff === 0)
+            return "";
+        if (i === 0)
+            return `$\\displaystyle \\lim_{x \\to ${to}} ${coeff} = ${coeff}$`;
+        const monom = multiply(coeff, power("x", i)).simplify();
+        const value = to === "+\\infty" ? 100 : -100;
+        const sign = monom.evaluate({ x: value }) > 0 ? "+" : "-";
+        return `$\\displaystyle \\lim_{x \\to ${to}} ${monom.toTex()} = ${sign}\\infty$`;
+    })
+        .filter(Boolean);
+    return `On détermine la limite de chaque terme de la somme composant $f(x)$ : 
+  
+${texs.reverse().join("\n \n")}
+
+Par addition des limites, on obtient donc : 
+
+$$
+\\lim_{x \\to ${to}} f(x) = ${getAnswer(identifiers)}
+$$`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -28,6 +58,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["infty"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -65,4 +97,5 @@ export const polynomLimitNoFI = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/limits/sequenceGeometricLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequenceGeometricLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequenceGeometricLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAE7C,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,eAAe,CAAC;IACxB,SAAS,EAAE,eAAe,CAAC;CAC5B,CAAC;AA4EF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAgBxD,CAAC"}
+{"version":3,"file":"sequenceGeometricLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequenceGeometricLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAG7C,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,eAAe,CAAC;IACxB,SAAS,EAAE,eAAe,CAAC;CAC5B,CAAC;AAoHF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAgBxD,CAAC"}

package/lib/exercises/math/limits/sequenceGeometricLimit.js

@@ -2,6 +2,7 @@ import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../exercis
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { GeometricSequence, GeometricSequenceConstructor, } from "../../../math/sequences/geometricSequence.js";
 import { reifyAlgebraic, } from "../../../tree/nodes/nodeConstructor.js";
+import { power } from "../../../tree/nodes/operators/powerNode.js";
 const getInstruction = (identifiers) => {
     const { reason, firstTerm } = identifiers;
     const sequence = new GeometricSequence(reifyAlgebraic(firstTerm), reifyAlgebraic(reason));
@@ -17,12 +18,47 @@ const getAnswer = (identifiers) => {
     const answer = sequence.getLimit();
     return answer.toTex();
 };
-// const getHint: GetHint<Identifiers> = (identifiers)=>{
-//   return ``
-// }
-// const getCorrection: GetCorrection<Identifiers> = (identifiers)=>{
-//   return ``
-// }
+const getHint = () => {
+    return `Soit $u$ la suite géométrique définie par : 
+  
+$$
+u_n = q^n
+$$
+
+Alors : 
+
+- si $q>1$, la limite de $u_n$ est $+\\infty$ ;
+- si $-1<q<1$, la limite de $u_n$ est $0$.
+- si $q<-1$, $u_n$ n'admet pas de limite.
+
+`;
+};
+const getCorrection = (identifiers) => {
+    const { reason } = identifiers;
+    const reasonNode = reifyAlgebraic(reason);
+    const reasonEv = reasonNode.evaluate({});
+    const reasonTex = reasonEv > 1
+        ? `Puisque $${reasonNode.toTex()}>1$, on a : 
+  
+$$
+\\lim_{n \\to +\\infty} ${power(reasonNode, "n").toTex()} = +\\infty
+$$
+
+ `
+        : `Puisque $-1<${reasonNode.toTex()}<1$, on a : 
+  
+$$
+\\lim_{n \\to +\\infty} ${power(reasonNode, "n").toTex()} = 0
+$$`;
+    return (reasonTex +
+        `
+  
+On en déduit donc : 
+
+$$
+\\lim_{n \\to +\\infty} u_n = ${getAnswer(identifiers)}
+$$`);
+};
 const getSequenceGeometricLimitQuestion = () => {
     const sequence = GeometricSequenceConstructor.randomWithLimit();
     const identifiers = {
@@ -38,8 +74,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["infty"],
         answerFormat: "tex",
         identifiers,
-        // hint: getHint(identifiers),
-        // correction: getCorrection(identifiers),
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -70,5 +106,5 @@ export const sequenceGeometricLimit = {
     getAnswer,
     getInstruction,
     getQuestionFromIdentifiers,
-    // hasHintAndCorrection: true,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/limits/sequencePolynomLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAyDF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAatD,CAAC"}
+{"version":3,"file":"sequencePolynomLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAcrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AA2GF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CActD,CAAC"}

package/lib/exercises/math/limits/sequencePolynomLimit.js

@@ -2,6 +2,11 @@ import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
+import { AddNode } from "../../../tree/nodes/operators/addNode.js";
+import { frac } from "../../../tree/nodes/operators/fractionNode.js";
+import { multiply } from "../../../tree/nodes/operators/multiplyNode.js";
+import { power } from "../../../tree/nodes/operators/powerNode.js";
+import { operatorComposition } from "../../../tree/utilities/operatorComposition.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
 const getInstruction = (identifiers) => {
     const poly = new Polynomial(identifiers.coeffs, "n");
@@ -17,6 +22,44 @@ const getAnswer = (identifiers) => {
     const answer = poly.getLimit(to);
     return answer;
 };
+const getHint = () => {
+    return `Attention ! Ici, on est en présence d'une forme indéterminée du type "$\\infty - \\infty"$. 
+  
+On ne peut pas immédiatemment déterminer la limite de $u_n$.
+
+Pour s'en sortir, il faut d'abord factoriser $u_n$ par son terme de plus haut degré.`;
+};
+const getCorrection = (identifiers) => {
+    const { coeffs } = identifiers;
+    const order = coeffs.length - 1;
+    const highCoeff = coeffs[order];
+    const high = power("n", order);
+    const factoNodes = [...coeffs].reverse().map((e, i) => {
+        //coeff / n^(order-i)
+        return frac(e, power("n", i)).simplify();
+    });
+    const facto = operatorComposition(AddNode, factoNodes);
+    return `Ici, on est en présence d'une forme indéterminée du type "$\\infty - \\infty"$. 
+
+Pour déterminer la limite de $u_n$, on factorise par son terme de plus haut degré :
+
+$$
+u_n = ${multiply(high, facto).toTex()}
+$$
+
+On a alors : 
+
+
+- $\\displaystyle \\lim_{n \\to +\\infty} ${high.toTex()} = +\\infty$
+
+- $\\displaystyle  \\lim_{n \\to +\\infty} ${facto.toTex()} = ${highCoeff}$
+
+Par produit des limites, on obtient donc : 
+
+$$
+\\lim_{n \\to +\\infty} u_{n} = ${getAnswer(identifiers)}
+$$`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -24,12 +67,21 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["infty"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
 const getSequencePolynomLimitQuestion = () => {
-    const poly = PolynomialConstructor.random(4, "n");
-    const identifiers = { coeffs: poly.coefficients };
+    const order = randint(2, 5);
+    const poly = PolynomialConstructor.randomWithOrder(order, "n");
+    const coeffs = [...poly.coefficients];
+    const signs = coeffs.slice(1).map((e) => (e > 0 ? "+" : "-"));
+    if (signs.every((s) => s === signs[0])) {
+        const index = randint(1, order);
+        coeffs[index] *= -1;
+    }
+    const identifiers = { coeffs: coeffs };
     return getQuestionFromIdentifiers(identifiers);
 };
 const getPropositions = (n, { answer, coeffs }) => {
@@ -51,7 +103,7 @@ const isAnswerValid = (ans, { answer }) => {
 export const sequencePolynomLimit = {
     id: "sequencePolynomLimit",
     connector: "=",
-    label: "Limite d'une suite polynomiale",
+    label: "Limite d'une suite polynomiale (avec F.I.)",
     isSingleStep: true,
     generator: (nb) => getDistinctQuestions(getSequencePolynomLimitQuestion, nb),
     qcmTimer: 60,
@@ -60,4 +112,5 @@ export const sequencePolynomLimit = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/limits/sequencePolynomNoFILimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomNoFILimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomNoFILimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AASrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AA+DF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAa1D,CAAC"}
+{"version":3,"file":"sequencePolynomNoFILimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomNoFILimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AA4FF,eAAO,MAAM,wBAAwB,EAAE,QAAQ,CAAC,WAAW,CAc1D,CAAC"}

package/lib/exercises/math/limits/sequencePolynomNoFILimit.js

@@ -2,6 +2,8 @@ import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../exercises/
 import { getDistinctQuestions } from "../../../exercises/utils/getDistinctQuestions.js";
 import { Polynomial, PolynomialConstructor, } from "../../../math/polynomials/polynomial.js";
 import { randint } from "../../../math/utils/random/randint.js";
+import { multiply } from "../../../tree/nodes/operators/multiplyNode.js";
+import { power } from "../../../tree/nodes/operators/powerNode.js";
 import { shuffle } from "../../../utils/alea/shuffle.js";
 const getInstruction = (identifiers) => {
     const poly = new Polynomial(identifiers.coeffs, "n");
@@ -17,6 +19,33 @@ const getAnswer = (identifiers) => {
     const answer = poly.getLimit(to);
     return answer;
 };
+const getHint = () => {
+    return `Détermine la limite quand $n$ tend vers $+\\infty$ de chaque terme de la somme composant $u_n$. 
+  
+Puis, déduis-en la limite de $u_n$ en "additionnant" les limites obtenues.`;
+};
+const getCorrection = (identifiers) => {
+    const texs = identifiers.coeffs
+        .map((coeff, i) => {
+        if (coeff === 0)
+            return "";
+        if (i === 0)
+            return `$\\displaystyle \\lim_{n \\to +\\infty} ${coeff} = ${coeff}$`;
+        const monom = multiply(coeff, power("n", i)).simplify().toTex();
+        const sign = coeff > 0 ? "+" : "-";
+        return `$\\displaystyle \\lim_{n \\to +\\infty} ${monom} = ${sign}\\infty$`;
+    })
+        .filter(Boolean);
+    return `On détermine la limite de chaque terme de la somme composant $u_n$ : 
+  
+${texs.reverse().join("\n \n")}
+
+Par addition des limites, on obtient donc : 
+
+$$
+\\lim_{n \\to +\\infty} u_{n} = ${getAnswer(identifiers)}
+$$`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -24,6 +53,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["infty"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
@@ -60,4 +91,5 @@ export const sequencePolynomNoFILimit = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/limits/sequencePolynomProductLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC;AAoFF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAa7D,CAAC"}
+{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequencePolynomProductLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC;AAwHF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAc7D,CAAC"}

package/lib/exercises/math/limits/sequencePolynomProductLimit.js

@@ -26,6 +26,33 @@ const getAnswer = (identifiers) => {
     const answer = product.getLimit(to);
     return answer;
 };
+const getHint = () => {
+    return `Détermine la limite quand $n$ tend vers $+\\infty$ de chaque facteur du produit composant $u_n$. 
+  
+Puis, déduis-en la limite de $u_n$ en "multipliant" les limites obtenues.`;
+};
+const getCorrection = (identifiers) => {
+    const { polyNumCoeffs, polyDenumCoeffs } = identifiers;
+    const polyNum = new Polynomial(polyNumCoeffs, "n");
+    const polyDenum = new Polynomial(polyDenumCoeffs, "n");
+    const numLim = polyNum.getLimit("+\\infty");
+    const denumLim = polyDenum.getLimit("+\\infty");
+    return `On détermine la limite de chaque facteur du produit composant $u_n$ : 
+  
+- $\\displaystyle \\lim_{n \\to +\\infty} ${polyNum
+        .toTree()
+        .toTex()} = ${numLim}$
+
+- $\\displaystyle \\lim_{n \\to +\\infty} ${polyDenum
+        .toTree()
+        .toTex()} = ${denumLim}$
+
+Par produit des limites, on obtient donc : 
+
+$$
+\\lim_{n \\to +\\infty} u_{n} = ${getAnswer(identifiers)}
+$$`;
+};
 const getQuestionFromIdentifiers = (identifiers) => {
     const question = {
         answer: getAnswer(identifiers),
@@ -33,12 +60,14 @@ const getQuestionFromIdentifiers = (identifiers) => {
         keys: ["infty"],
         answerFormat: "tex",
         identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
     };
     return question;
 };
 const getSequencePolynomProductLimitQuestion = () => {
-    const polyNum = PolynomialConstructor.randomWithLength(3, 2, "n");
-    const polyDenum = PolynomialConstructor.randomWithLength(3, 2, "n");
+    const polyNum = PolynomialConstructor.randomWithLengthAndSameSigns(3, 2, "n");
+    const polyDenum = PolynomialConstructor.randomWithLengthAndSameSigns(3, 2, "n");
     const identifiers = {
         polyDenumCoeffs: polyDenum.coefficients,
         polyNumCoeffs: polyNum.coefficients,
@@ -69,7 +98,7 @@ const isAnswerValid = (ans, { answer }) => {
 export const sequencePolynomProductLimit = {
     id: "sequencePolynomProductLimit",
     connector: "=",
-    label: "Limite d'un produit de suites polynomiales",
+    label: "Limite d'un produit de suites polynomiales (sans F.I.)",
     isSingleStep: true,
     generator: (nb) => getDistinctQuestions(getSequencePolynomProductLimitQuestion, nb),
     qcmTimer: 60,
@@ -78,4 +107,5 @@ export const sequencePolynomProductLimit = {
     isAnswerValid,
     subject: "Mathématiques",
     getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
 };

package/lib/exercises/math/limits/sequenceRationalFracLimit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAwHF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../src/exercises/math/limits/sequenceRationalFracLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAarC,KAAK,WAAW,GAAG;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AAgIF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAa3D,CAAC"}

package/lib/exercises/math/limits/sequenceRationalFracLimit.js

@@ -51,8 +51,8 @@ const getQuestionFromIdentifiers = (identifiers) => {
     return question;
 };
 const getSequenceRationalFracLimitQuestion = () => {
-    const polyNum = PolynomialConstructor.random(4, "n");
-    const polyDenum = PolynomialConstructor.random(4, "n");
+    const polyNum = PolynomialConstructor.randomWithLengthAndSameSigns(3, randint(2, 4), "n");
+    const polyDenum = PolynomialConstructor.randomWithLengthAndSameSigns(3, randint(2, 4), "n");
     const identifiers = {
         numCoeffs: polyNum.coefficients,
         denumCoeffs: polyDenum.coefficients,

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

@@ -0,0 +1,6 @@
+export * from "./sequenceGeometricLimit.js";
+export * from "./sequencePolynomLimit.js";
+export * from "./sequencePolynomNoFILimit.js";
+export * from "./sequencePolynomProductLimit.js";
+export * from "./sequenceRationalFracLimit.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/limits/sequences/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,kCAAkC,CAAC;AACjD,cAAc,gCAAgC,CAAC"}

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

@@ -0,0 +1,5 @@
+export * from "./sequenceGeometricLimit.js";
+export * from "./sequencePolynomLimit.js";
+export * from "./sequencePolynomNoFILimit.js";
+export * from "./sequencePolynomProductLimit.js";
+export * from "./sequenceRationalFracLimit.js";

package/lib/exercises/math/limits/sequences/sequenceGeometricLimit.d.ts

@@ -0,0 +1,9 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { NodeIdentifiers } from "../../../../tree/nodes/nodeConstructor.js";
+type Identifiers = {
+    reason: NodeIdentifiers;
+    firstTerm: NodeIdentifiers;
+};
+export declare const sequenceGeometricLimit: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=sequenceGeometricLimit.d.ts.map

package/lib/exercises/math/limits/sequences/sequenceGeometricLimit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceGeometricLimit.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/limits/sequences/sequenceGeometricLimit.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAMrC,OAAO,EACL,eAAe,EAEhB,MAAM,qCAAqC,CAAC;AAG7C,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,eAAe,CAAC;IACxB,SAAS,EAAE,eAAe,CAAC;CAC5B,CAAC;AAoHF,eAAO,MAAM,sBAAsB,EAAE,QAAQ,CAAC,WAAW,CAgBxD,CAAC"}