math-exercises 3.0.202 → 3.0.203

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

@@ -0,0 +1,116 @@
+import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
+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");
+    return `Déterminer la limite de la suite $u$ définie par : 
+  
+$$
+u_n = ${poly.toTree().toTex()}
+$$`;
+};
+const getAnswer = (identifiers) => {
+    const to = "+\\infty";
+    const poly = new Polynomial(identifiers.coeffs, "n");
+    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),
+        instruction: getInstruction(identifiers),
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+    return question;
+};
+const getSequencePolynomLimitQuestion = () => {
+    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 }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    tryToAddWrongProp(propositions, "+\\infty");
+    tryToAddWrongProp(propositions, "-\\infty");
+    tryToAddWrongProp(propositions, "0");
+    tryToAddWrongProp(propositions, coeffs[coeffs.length - 1] + "");
+    propWhile(propositions, n, () => {
+        const wrongAnswer = randint(-10, 10) + "";
+        tryToAddWrongProp(propositions, wrongAnswer);
+    });
+    return shuffle(propositions);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+export const sequencePolynomLimit = {
+    id: "sequencePolynomLimit",
+    connector: "=",
+    label: "Limite d'une suite polynomiale (avec F.I.)",
+    isSingleStep: true,
+    generator: (nb) => getDistinctQuestions(getSequencePolynomLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+};

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

@@ -0,0 +1,7 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+type Identifiers = {
+    coeffs: number[];
+};
+export declare const sequencePolynomNoFILimit: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=sequencePolynomNoFILimit.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequencePolynomNoFILimit.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/limits/sequences/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/sequences/sequencePolynomNoFILimit.js

@@ -0,0 +1,95 @@
+import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
+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");
+    return `Déterminer la limite de la suite $u$ définie par :
+  
+$$
+u_n = ${poly.toTree().toTex()}
+$$`;
+};
+const getAnswer = (identifiers) => {
+    const to = "+\\infty";
+    const poly = new Polynomial(identifiers.coeffs, "n");
+    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),
+        instruction: getInstruction(identifiers),
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+    return question;
+};
+const getSequencePolynomNoFILimitQuestion = () => {
+    const length = randint(2, 5);
+    const poly = PolynomialConstructor.randomWithLengthAndSameSigns(4, length, "n");
+    const identifiers = { coeffs: poly.coefficients };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getPropositions = (n, { answer, coeffs }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    tryToAddWrongProp(propositions, "+\\infty");
+    tryToAddWrongProp(propositions, "-\\infty");
+    tryToAddWrongProp(propositions, "0");
+    tryToAddWrongProp(propositions, coeffs[coeffs.length - 1] + "");
+    propWhile(propositions, n, () => {
+        tryToAddWrongProp(propositions, randint(-10, 10) + "");
+    });
+    return shuffle(propositions);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+export const sequencePolynomNoFILimit = {
+    id: "sequencePolynomNoFILimit",
+    connector: "=",
+    label: "Limite d'une suite polynomiale (sans F.I.)",
+    isSingleStep: true,
+    generator: (nb) => getDistinctQuestions(getSequencePolynomNoFILimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+};

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

@@ -0,0 +1,8 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+type Identifiers = {
+    polyNumCoeffs: number[];
+    polyDenumCoeffs: number[];
+};
+export declare const sequencePolynomProductLimit: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=sequencePolynomProductLimit.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequencePolynomProductLimit.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/limits/sequences/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/sequences/sequencePolynomProductLimit.js

@@ -0,0 +1,111 @@
+import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { Rational } from "../../../../math/numbers/rationals/rational.js";
+import { Monom } from "../../../../math/polynomials/monom.js";
+import { Polynomial, PolynomialConstructor, } from "../../../../math/polynomials/polynomial.js";
+import { randint } from "../../../../math/utils/random/randint.js";
+import { shuffle } from "../../../../utils/alea/shuffle.js";
+const getInstruction = (identifiers) => {
+    const { polyNumCoeffs, polyDenumCoeffs } = identifiers;
+    const polyNum = new Polynomial(polyNumCoeffs, "n");
+    const polyDenum = new Polynomial(polyDenumCoeffs, "n");
+    return `Déterminer la limite de la suite $u$ définie par : 
+
+$$
+u_n = (${polyNum.toTree().toTex()})(${polyDenum.toTree().toTex()})
+$$`;
+};
+const getAnswer = (identifiers) => {
+    const { polyNumCoeffs, polyDenumCoeffs } = identifiers;
+    const polyNum = new Polynomial(polyNumCoeffs, "n");
+    const polyDenum = new Polynomial(polyDenumCoeffs, "n");
+    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
+    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
+    const product = new Monom(polyNum.degree + polyDenum.degree, numLeadingCoeff * denumLeadingCoeff, "n");
+    const to = "+\\infty";
+    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),
+        instruction: getInstruction(identifiers),
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+    return question;
+};
+const getSequencePolynomProductLimitQuestion = () => {
+    const polyNum = PolynomialConstructor.randomWithLengthAndSameSigns(3, 2, "n");
+    const polyDenum = PolynomialConstructor.randomWithLengthAndSameSigns(3, 2, "n");
+    const identifiers = {
+        polyDenumCoeffs: polyDenum.coefficients,
+        polyNumCoeffs: polyNum.coefficients,
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getPropositions = (n, { answer, polyDenumCoeffs, polyNumCoeffs }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    const numLeadingCoeff = polyNumCoeffs[polyNumCoeffs.length - 1];
+    const denumLeadingCoeff = polyDenumCoeffs[polyDenumCoeffs.length - 1];
+    const leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    tryToAddWrongProp(propositions, "+\\infty");
+    tryToAddWrongProp(propositions, "-\\infty");
+    tryToAddWrongProp(propositions, "0");
+    tryToAddWrongProp(propositions, leadingCoeffsRational);
+    propWhile(propositions, n, () => {
+        tryToAddWrongProp(propositions, randint(-10, 10) + "");
+    });
+    return shuffle(propositions);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+export const sequencePolynomProductLimit = {
+    id: "sequencePolynomProductLimit",
+    connector: "=",
+    label: "Limite d'un produit de suites polynomiales (sans F.I.)",
+    isSingleStep: true,
+    generator: (nb) => getDistinctQuestions(getSequencePolynomProductLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+};

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

@@ -0,0 +1,8 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+type Identifiers = {
+    numCoeffs: number[];
+    denumCoeffs: number[];
+};
+export declare const sequenceRationalFracLimit: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=sequenceRationalFracLimit.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceRationalFracLimit.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/limits/sequences/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/sequences/sequenceRationalFracLimit.js

@@ -0,0 +1,114 @@
+import { addValidProp, propWhile, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { Rational } from "../../../../math/numbers/rationals/rational.js";
+import { Monom } from "../../../../math/polynomials/monom.js";
+import { Polynomial, PolynomialConstructor, } from "../../../../math/polynomials/polynomial.js";
+import { randint } from "../../../../math/utils/random/randint.js";
+import { NumberNode } from "../../../../tree/nodes/numbers/numberNode.js";
+import { shuffle } from "../../../../utils/alea/shuffle.js";
+const getInstruction = (identifiers) => {
+    const { numCoeffs, denumCoeffs } = identifiers;
+    const polyNum = new Polynomial(numCoeffs, "n");
+    const polyDenum = new Polynomial(denumCoeffs, "n");
+    return `Déterminer la limite de la suite $u$ définie par : 
+  
+$$
+u_n = \\dfrac{${polyNum.toTree().toTex()}}{${polyDenum.toTree().toTex()}}
+$$`;
+};
+const getAnswer = (identifiers) => {
+    const { numCoeffs, denumCoeffs } = identifiers;
+    const polyNum = new Polynomial(numCoeffs, "n");
+    const polyDenum = new Polynomial(denumCoeffs, "n");
+    let answer = "";
+    const to = "+\\infty";
+    const numLeadingCoeff = polyNum.coefficients[polyNum.degree];
+    const denumLeadingCoeff = polyDenum.coefficients[polyDenum.degree];
+    const leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    if (polyDenum.degree === polyNum.degree) {
+        answer = leadingCoeffsRational;
+    }
+    else if (polyDenum.degree > polyNum.degree) {
+        answer = "0";
+    }
+    else {
+        const tempPoly = new Monom(polyNum.degree - polyDenum.degree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1, "n");
+        answer = tempPoly.getLimit(to);
+    }
+    return answer;
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    const question = {
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: ["infty"],
+        answerFormat: "tex",
+        identifiers,
+    };
+    return question;
+};
+const getSequenceRationalFracLimitQuestion = () => {
+    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,
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getPropositions = (n, { answer, numCoeffs, denumCoeffs }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    const numLeadingCoeff = numCoeffs[numCoeffs.length - 1];
+    const denumLeadingCoeff = denumCoeffs[denumCoeffs.length - 1];
+    const leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree()
+        .toTex();
+    tryToAddWrongProp(propositions, "+\\infty");
+    tryToAddWrongProp(propositions, "-\\infty");
+    tryToAddWrongProp(propositions, "0");
+    tryToAddWrongProp(propositions, leadingCoeffsRational);
+    propWhile(propositions, n, () => {
+        tryToAddWrongProp(propositions, randint(-10, 10) + "");
+    });
+    return shuffle(propositions);
+};
+const isAnswerValid = (ans, { denumCoeffs, numCoeffs }) => {
+    const numDegree = numCoeffs.length - 1;
+    const denumDegree = denumCoeffs.length - 1;
+    const numLeadingCoeff = numCoeffs[numDegree];
+    const denumLeadingCoeff = denumCoeffs[denumDegree];
+    const leadingCoeffsRational = new Rational(numLeadingCoeff, denumLeadingCoeff)
+        .simplify()
+        .toTree({ allowFractionToDecimal: true });
+    let answer;
+    if (denumDegree === numDegree) {
+        answer = leadingCoeffsRational;
+    }
+    else if (denumDegree > numDegree) {
+        answer = new NumberNode(0);
+    }
+    else {
+        const tempPoly = new Monom(numDegree - denumDegree, numLeadingCoeff * denumLeadingCoeff > 0 ? 1 : -1);
+        answer = tempPoly.getLimitNode("+\\infty");
+    }
+    const texs = answer.toAllValidTexs();
+    return texs.includes(ans);
+};
+export const sequenceRationalFracLimit = {
+    id: "sequenceRationalFracLimit",
+    connector: "=",
+    label: "Limite d'une suite rationnelle",
+    isSingleStep: true,
+    generator: (nb) => getDistinctQuestions(getSequenceRationalFracLimitQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getQuestionFromIdentifiers,
+};

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

@@ -9,4 +9,5 @@ export * from "./notation/index.js";
 export * from "./seqArithmGeom/index.js";
 export * from "./limits/index.js";
 export * from "./variations/index.js";
+export * from "./proofByInduction/index.js";
 //# sourceMappingURL=index.d.ts.map

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

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

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

@@ -9,3 +9,4 @@ export * from "./notation/index.js";
 export * from "./seqArithmGeom/index.js";
 export * from "./limits/index.js";
 export * from "./variations/index.js";
+export * from "./proofByInduction/index.js";

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

@@ -0,0 +1,5 @@
+export * from "./proofByInductionCheckInitialization.js";
+export * from "./proofByInductionWritePropAtRankKPlus1.js";
+export * from "./proofByInductionWriteMissingStep.js";
+export * from "./proofByInductionReorderProof.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/proofByInduction/index.ts"],"names":[],"mappings":"AAAA,cAAc,0CAA0C,CAAC;AACzD,cAAc,4CAA4C,CAAC;AAC3D,cAAc,uCAAuC,CAAC;AACtD,cAAc,mCAAmC,CAAC"}

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

@@ -0,0 +1,4 @@
+export * from "./proofByInductionCheckInitialization.js";
+export * from "./proofByInductionWritePropAtRankKPlus1.js";
+export * from "./proofByInductionWriteMissingStep.js";
+export * from "./proofByInductionReorderProof.js";

package/lib/exercises/math/sequences/proofByInduction/proofByInductionCheckInitialization.d.ts

@@ -0,0 +1,10 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { ProofByInductionSituationParams } from "./proofByInductionSituations.js";
+type Identifiers = {
+    situationParams: ProofByInductionSituationParams;
+    isValid: boolean;
+    indexForNodeProperty: number;
+};
+export declare const proofByInductionCheckInitialization: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=proofByInductionCheckInitialization.d.ts.map

package/lib/exercises/math/sequences/proofByInduction/proofByInductionCheckInitialization.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proofByInductionCheckInitialization.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/proofByInduction/proofByInductionCheckInitialization.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,6BAA6B,CAAC;AASrC,OAAO,EAGL,+BAA+B,EAChC,MAAM,iCAAiC,CAAC;AAEzC,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,+BAA+B,CAAC;IACjD,OAAO,EAAE,OAAO,CAAC;IACjB,oBAAoB,EAAE,MAAM,CAAC;CAC9B,CAAC;AA8PF,eAAO,MAAM,mCAAmC,EAAE,QAAQ,CAAC,WAAW,CAkBrE,CAAC"}