math-exercises 3.0.202 → 3.0.203

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

@@ -0,0 +1,175 @@
+import { nodeBySubstitutingVar } from "../../../../math/utils/functions/functionComposition.js";
+import { randint } from "../../../../math/utils/random/randint.js";
+import { EqualNode } from "../../../../tree/nodes/equations/equalNode.js";
+import { reifyAlgebraic, } from "../../../../tree/nodes/nodeConstructor.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 { power } from "../../../../tree/nodes/operators/powerNode.js";
+import { substract } from "../../../../tree/nodes/operators/substractNode.js";
+import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
+import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
+import { coinFlip } from "../../../../utils/alea/coinFlip.js";
+import { random } from "../../../../utils/alea/random.js";
+const buildGeneralFormulaOfArithmeticoGeometricSequenceParams = () => {
+    const n0 = randint(0, 3);
+    const valueInitial = randint(-5, 6, [0]);
+    const a = randint(-5, 6, [0, 1, valueInitial]);
+    const b = randint(-5, 6, [0, valueInitial, a]);
+    const nodeInitial = valueInitial.toTree();
+    const nodeA = a.toTree();
+    const nodeB = b.toTree();
+    return {
+        n0,
+        nodeIdsInitial: nodeInitial.toIdentifiers(),
+        nodeIdsA: nodeA.toIdentifiers(),
+        nodeIdsB: nodeB.toIdentifiers(),
+    };
+};
+export const getGeneralFormulaOfArithmeticoGeometricSequenceSituation = (params) => {
+    const { n0, nodeIdsInitial, nodeIdsA, nodeIdsB } = params;
+    const [nodeInitial, nodeA, nodeB] = [nodeIdsInitial, nodeIdsA, nodeIdsB].map((nodeIds) => reifyAlgebraic(nodeIds));
+    const nodeR = frac(nodeB, substract(1, nodeA).simplify()).simplify();
+    const nodeUN = new VariableNode("u_{n}");
+    const nodeVarN = new VariableNode("n");
+    const arrNodeAlid = [
+        new EqualNode(nodeUN, add(multiply(power(nodeA, substract(nodeVarN, n0).simplify()), substract(nodeInitial, nodeR).simplify()), nodeR)),
+        new EqualNode(nodeUN, add(nodeR, multiply(power(nodeA, substract(nodeVarN, n0).simplify()), substract(nodeInitial, nodeR).simplify()))),
+        new EqualNode(nodeUN, add(multiply(power(nodeA, substract(nodeVarN, n0).simplify()), nodeInitial), multiply(nodeR, substract(1, power(nodeA, substract(nodeVarN, n0).simplify()))))),
+        new EqualNode(nodeUN, add(multiply(nodeR, substract(1, power(nodeA, substract(nodeVarN, n0).simplify()))), multiply(power(nodeA, substract(nodeVarN, n0).simplify()), nodeInitial))),
+        new EqualNode(nodeUN, substract(multiply(power(nodeA, substract(nodeVarN, n0).simplify()), add(nodeInitial, nodeR).simplify()), nodeR)),
+        new EqualNode(nodeUN, add(add(nodeR, nodeInitial).simplify(), multiply(power(nodeA, substract(nodeVarN, n0).simplify()), substract(nodeInitial, nodeR).simplify()))),
+        new EqualNode(nodeUN, multiply(power(nodeA, substract(nodeVarN, n0).simplify()), add(nodeInitial, nodeR).simplify())),
+        new EqualNode(nodeUN, add(multiply(nodeR, substract(1, power(add(nodeA, nodeInitial).simplify(), substract(nodeVarN, n0).simplify()))), multiply(power(nodeA, substract(nodeVarN, n0).simplify()), nodeInitial))),
+    ];
+    const { arrNodeValid, arrNodeInvalid } = arrNodeAlid.reduce((acc, equalNode) => {
+        const nodeSubstituted = nodeBySubstitutingVar(equalNode.rightChild, n0.toTree(), nodeVarN);
+        if (NodeComparator.isEqualViaSub(nodeSubstituted, nodeInitial) ||
+            NodeComparator.isEqualViaFrac(nodeSubstituted, nodeInitial)) {
+            acc.arrNodeValid.push(equalNode);
+        }
+        else {
+            acc.arrNodeInvalid.push(equalNode);
+        }
+        return acc;
+    }, {
+        arrNodeValid: [],
+        arrNodeInvalid: [],
+    });
+    return {
+        id: "generalFormulaOfArithmeticoGeometricSequence",
+        strContext: `Soit $u$ la suite définie par :
+  
+$$
+u_{${n0.frenchify()}} = ${nodeInitial.toTex()}
+$$
+
+et, pour tout $n \\geq ${n0}$ :
+
+$$
+u_{n+1} = ${add(multiply(nodeA, new VariableNode("u_{n}")), nodeB).toTex()}
+$$
+
+`,
+        n0,
+        baseCase: "",
+        inductionHypothesis: "",
+        inductionStep: "",
+        conclusion: "",
+        keys: [],
+        params,
+        arrNodeValid,
+        arrNodeInvalid,
+        //specific
+        nodeA,
+        nodeB,
+        nodeR,
+        nodeInitial,
+    };
+};
+const buildMultipleFromPolynomialParams = () => {
+    const n0 = randint(0, 3);
+    const nbMod = randint(2, 4);
+    const isValid = coinFlip();
+    const rootMin = randint(-4, 5);
+    const arrValueRoot = [...Array(nbMod).keys()].map((i) => i + rootMin);
+    return {
+        n0,
+        isValid,
+        nbMod,
+        arrValueRoot,
+    };
+};
+export const getMultipleFromPolynomialSituation = (params) => {
+    const { n0, isValid, arrValueRoot } = params;
+    const nodeVarN = new VariableNode("n");
+    const nodeP = (() => {
+        const nodeP = arrValueRoot.reduce((acc, valueRoot, i) => {
+            const nodeFactor = substract(nodeVarN, valueRoot);
+            if (i === 0) {
+                return nodeFactor;
+            }
+            else {
+                return multiply(acc, nodeFactor);
+            }
+        }, (0).toTree());
+        return (isValid ? nodeP : add(nodeP, 1)).simplify({
+            towardsDistribute: true,
+            calculatePowers: true,
+            forbidFactorize: true,
+        });
+    })();
+    return {
+        id: "multipleFromPolynomial",
+        strContext: `Soit $f$ la fonction définie pour tout $n \\geq ${n0}$ par  :
+
+$$
+f(n) = ${nodeP.toTex()}
+$$
+
+`,
+        n0,
+        baseCase: "",
+        inductionHypothesis: "",
+        inductionStep: "",
+        conclusion: "",
+        keys: [],
+        params,
+        arrNodeValid: isValid ? [nodeP] : [],
+        arrNodeInvalid: isValid ? [] : [nodeP],
+    };
+};
+export const getHydratedProofByInductionSituation = (params) => {
+    switch (params.id) {
+        case "generalFormulaOfArithmeticoGeometricSequence":
+            return getGeneralFormulaOfArithmeticoGeometricSequenceSituation(params);
+        case "multipleFromPolynomial":
+            return getMultipleFromPolynomialSituation(params);
+    }
+};
+export const getRandomProofByInductionSituationParams = () => {
+    return random([
+        {
+            ...buildGeneralFormulaOfArithmeticoGeometricSequenceParams(),
+            id: "generalFormulaOfArithmeticoGeometricSequence",
+        },
+        // { ...buildIneqOfConsecutiveTermsParams(), id: "ineqOfConsecutiveTerms" },
+        {
+            ...buildMultipleFromPolynomialParams(),
+            id: "multipleFromPolynomial",
+        },
+    ]);
+};
+export const getArrProofByInductionSituationParams = (arrId) => {
+    return [
+        {
+            ...buildGeneralFormulaOfArithmeticoGeometricSequenceParams(),
+            id: "generalFormulaOfArithmeticoGeometricSequence",
+        },
+        // { ...buildIneqOfConsecutiveTermsParams(), id: "ineqOfConsecutiveTerms" },
+        {
+            ...buildMultipleFromPolynomialParams(),
+            id: "multipleFromPolynomial",
+        },
+    ].filter(({ id }) => arrId.includes(id));
+};

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

@@ -0,0 +1,13 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { NodeIdentifiers } from "../../../../tree/nodes/nodeConstructor.js";
+import { ProofByInductionSituationParams } from "./proofByInductionSituations.js";
+type Identifiers = {
+    situationParams: ProofByInductionSituationParams;
+    isValid: boolean;
+    indexForNodeProperty: number;
+    nodeIdsVarStepDefinition: NodeIdentifiers;
+    nodeIdsVarStepInduction: NodeIdentifiers;
+};
+export declare const proofByInductionWriteMissingStep: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=proofByInductionWriteMissingStep.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"proofByInductionWriteMissingStep.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/proofByInduction/proofByInductionWriteMissingStep.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAcT,MAAM,6BAA6B,CAAC;AAQrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAO7C,OAAO,EAGL,+BAA+B,EAChC,MAAM,iCAAiC,CAAC;AAWzC,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,+BAA+B,CAAC;IACjD,OAAO,EAAE,OAAO,CAAC;IACjB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,wBAAwB,EAAE,eAAe,CAAC;IAC1C,uBAAuB,EAAE,eAAe,CAAC;CAC1C,CAAC;AAweF,eAAO,MAAM,gCAAgC,EAAE,QAAQ,CAAC,WAAW,CAiBlE,CAAC"}

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

@@ -0,0 +1,317 @@
+import { tryToAddWrongProp, addValidProp, shuffleProps, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { nodeBySubstitutingVar } from "../../../../math/utils/functions/functionComposition.js";
+import { randint } from "../../../../math/utils/random/randint.js";
+import { EqualNode, isEqualNode, } from "../../../../tree/nodes/equations/equalNode.js";
+import { NodeConstructor, } from "../../../../tree/nodes/nodeConstructor.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
+import { parseAlgebraic } from "../../../../tree/parsers/latexParser.js";
+import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
+import { randomMany } from "../../../../utils/alea/random.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
+import { getArrProofByInductionSituationParams, getHydratedProofByInductionSituation, } from "./proofByInductionSituations.js";
+import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
+import { alignTex } from "../../../../utils/latex/alignTex.js";
+import { splitAndKeep } from "../../../../utils/strings/splitAndKeep.js";
+import { isFractionNode } from "../../../../tree/nodes/operators/fractionNode.js";
+import { opposite } from "../../../../tree/nodes/functions/oppositeNode.js";
+import { substract } from "../../../../tree/nodes/operators/substractNode.js";
+const getHydrated = (identifiers) => {
+    const { situationParams, isValid, indexForNodeProperty, nodeIdsVarStepDefinition, nodeIdsVarStepInduction, } = identifiers;
+    const situation = getHydratedProofByInductionSituation(situationParams);
+    const [nodeVarStepDefinition, nodeVarStepInduction] = [
+        nodeIdsVarStepDefinition,
+        nodeIdsVarStepInduction,
+    ].map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    switch (situation.id) {
+        case "generalFormulaOfArithmeticoGeometricSequence": {
+            const { nodeA, nodeB } = situation;
+            function createNodeBySubstitutingVar(nodeCarrier, nodeInjected, variableNodeOfCarrier) {
+                return nodeBySubstitutingVar(nodeBySubstitutingVar(nodeBySubstitutingVar(nodeCarrier, nodeInjected, variableNodeOfCarrier), new VariableNode(`u_{${add(nodeInjected, 1).toTex()}}`), new VariableNode(`u_{${add(variableNodeOfCarrier, 1).toTex()}}`)), new VariableNode(`u_{${nodeInjected.toTex()}}`), new VariableNode(`u_{${variableNodeOfCarrier.toTex()}}`));
+            }
+            const nodePropertyWithN = (isValid ? situation.arrNodeValid : situation.arrNodeInvalid)[indexForNodeProperty];
+            const [nodePropertyDefinition, nodePropertyDefinitionPlus1, nodePropertyInduction, nodePropertyInductionPlus1,] = [
+                nodeVarStepDefinition,
+                add(nodeVarStepDefinition, 1),
+                nodeVarStepInduction,
+                add(nodeVarStepInduction, 1),
+            ].map((node) => createNodeBySubstitutingVar(nodePropertyWithN, node, new VariableNode("n")));
+            const nodeSequenceDefinition = new EqualNode(new VariableNode(`u_{${add(nodeVarStepDefinition, 1).toTex()}}`), add(multiply(nodeA, new VariableNode(`u_{${nodeVarStepDefinition.toTex()}}`)), nodeB));
+            const nodeSequenceDefinitionMinus1 = new EqualNode(new VariableNode(`u_{${nodeVarStepDefinition.toTex()}}`), add(multiply(nodeA, new VariableNode(`u_{${substract(nodeVarStepDefinition, 1).toTex()}}`)), nodeB));
+            const arrNodeInductionSteps = [
+                //by def:
+                createNodeBySubstitutingVar(nodeSequenceDefinition, nodeVarStepInduction, nodeVarStepDefinition),
+                //subst by using induction property
+                nodeBySubstitutingVar(nodeBySubstitutingVar(nodeSequenceDefinition, nodePropertyInduction.rightChild, new VariableNode(`u_{${nodeVarStepDefinition.toTex()}}`)), new VariableNode(`u_{${add(nodeVarStepInduction, 1).toTex()}}`), new VariableNode(`u_{${add(nodeVarStepDefinition, 1).toTex()}}`)),
+                //rewrite to exhibit induction + 1
+                nodePropertyInductionPlus1,
+            ];
+            return {
+                situation,
+                nodeVarStepDefinition,
+                nodeSequenceDefinition,
+                nodeVarStepInduction,
+                nodePropertyInduction,
+                nodePropertyDefinition,
+                nodePropertyDefinitionPlus1,
+                nodePropertyInductionPlus1,
+                arrNodeInductionSteps,
+                nodeSequenceDefinitionMinus1,
+            };
+        }
+        default:
+            throw new Error("Unsupported situation.id: " + situation.id);
+    }
+};
+const getInstruction = (identifiers) => {
+    const { situation, nodePropertyDefinition, nodeVarStepDefinition, nodeVarStepInduction, arrNodeInductionSteps, } = getHydrated(identifiers);
+    const { n0 } = situation;
+    switch (situation.id) {
+        case "generalFormulaOfArithmeticoGeometricSequence": {
+            return `${situation.strContext}
+
+Pour $${nodeVarStepDefinition.toTex()} \\geq ${n0}$, on note $\\mathcal{P}(${nodeVarStepDefinition.toTex()})$ la propriété : 
+
+$$
+\\mathcal{P}(${nodeVarStepDefinition.toTex()}) :\\ \\ ${nodePropertyDefinition.toTex()}  
+$$
+
+Donner l'étape manquante de la démonstration de l'hérédité de $\\mathcal{P}$ : 
+
+Soit $${nodeVarStepInduction.toTex()}$ un entier tel que $${nodeVarStepInduction.toTex()} \\geq ${n0}$.
+On suppose la propriété $\\mathcal{P}(${nodeVarStepInduction.toTex()})$ vraie.
+
+${alignTex([
+                arrNodeInductionSteps[0],
+                new VariableNode("..."),
+                arrNodeInductionSteps[2],
+            ].map((node) => splitAndKeep(node.toTex(), "=")))}
+
+`;
+        }
+        default:
+            throw new Error("Unsupported situation.id: " + situation.id);
+    }
+};
+const getAnswerNode = (identifiers) => {
+    const { arrNodeInductionSteps } = getHydrated(identifiers);
+    return arrNodeInductionSteps[1];
+};
+const getAnswer = (identifiers) => {
+    return getAnswerNode(identifiers).toTex();
+};
+const getHint = (identifiers) => {
+    const { nodeIdsVarStepInduction } = identifiers;
+    const [nodeVarStepInduction] = [nodeIdsVarStepInduction].map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    return `Utilise $\\mathcal{P}(${nodeVarStepInduction.toTex()})$ pour substituer $u_{${nodeVarStepInduction.toTex()}}$ dans l'égalité juste avant l'étape manquante.`;
+};
+const getCorrection = (identifiers) => {
+    const { situation, nodeVarStepInduction, arrNodeInductionSteps } = getHydrated(identifiers);
+    const { n0 } = situation;
+    switch (situation.id) {
+        case "generalFormulaOfArithmeticoGeometricSequence": {
+            return `Voici la rédaction complète de la démonstration de l'hérédité de $\\mathcal{P}$ :
+      
+Soit $${nodeVarStepInduction.toTex()}$ un entier tel que $${nodeVarStepInduction.toTex()} \\geq ${n0}$.
+On suppose la propriété $\\mathcal{P}(${nodeVarStepInduction.toTex()})$ vraie.
+
+Par définition : 
+
+$$
+${arrNodeInductionSteps[0].toTex()}
+$$
+
+On utilise $\\mathcal{P}(${nodeVarStepInduction.toTex()})$ : 
+
+$$
+${arrNodeInductionSteps[1].toTex()}
+$$
+
+On réécrit l'égalité pour faire apparaître $\\mathcal{P}(${add(nodeVarStepInduction, 1).toTex()})$ :
+
+$$
+${arrNodeInductionSteps[2].toTex()}
+$$
+
+On vient de montrer que si $\\mathcal{P}(${nodeVarStepInduction.toTex()})$ est vraie alors $\\mathcal{P}(${add(nodeVarStepInduction, 1).toTex()})$ est vraie, 
+autrement dit que $\\mathcal{P}$ est héréditaire.
+
+`;
+        }
+        default:
+            throw new Error("Unsupported situation.id: " + situation.id);
+    }
+};
+const getPropositions = (n, { answer, ...identifiers }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    const { nodeSequenceDefinition, nodePropertyDefinition, nodeSequenceDefinitionMinus1, nodeVarStepDefinition, nodeVarStepInduction, arrNodeInductionSteps, } = getHydrated(identifiers);
+    //student: uses def prop again
+    {
+        const equalNodeWrong = nodeBySubstitutingVar(nodeBySubstitutingVar(nodeSequenceDefinition, nodeSequenceDefinitionMinus1.rightChild, new VariableNode(`u_{${nodeVarStepDefinition.toTex()}}`)), new VariableNode(`u_{${add(nodeVarStepInduction, 1).toTex()}}`), new VariableNode(`u_{${add(nodeVarStepDefinition, 1).toTex()}}`));
+        tryToAddWrongProp(propositions, equalNodeWrong.toTex());
+    }
+    //student: wrong variable
+    {
+        const equalNodeWrong = nodeBySubstitutingVar(nodeBySubstitutingVar(nodeSequenceDefinition, nodePropertyDefinition.rightChild, new VariableNode(`u_{${nodeVarStepDefinition.toTex()}}`)), new VariableNode(`u_{${add(nodeVarStepInduction, 1).toTex()}}`), new VariableNode(`u_{${add(nodeVarStepDefinition, 1).toTex()}}`));
+        tryToAddWrongProp(propositions, equalNodeWrong.toTex());
+    }
+    //student: forgets to add b
+    {
+        const equalNodeValid = arrNodeInductionSteps[1];
+        const equalNodeWrong = new EqualNode(equalNodeValid.leftChild, equalNodeValid.rightChild.leftChild);
+        tryToAddWrongProp(propositions, equalNodeWrong.toTex());
+    }
+    return shuffleProps(propositions, n);
+};
+const getKeys = (identifiers) => {
+    const { nodeIdsVarStepDefinition, nodeIdsVarStepInduction } = identifiers;
+    const [nodeVarStepDefinition, nodeVarStepInduction] = [
+        nodeIdsVarStepDefinition,
+        nodeIdsVarStepInduction,
+    ].map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+    const arrLetter = [nodeVarStepDefinition, nodeVarStepInduction].map((nodeVar) => nodeVar.name);
+    return ["u", ...arrLetter, "underscore", "equal"];
+};
+const isAnswerValid = (ans, { answer, ...identifiers }) => {
+    try {
+        //TODO faire fonctionner parseAlgebraic("u_n=3+2n") (token _ not implemented)
+        const nodeAnswer = getAnswerNode(identifiers);
+        if (!ans.includes("=")) {
+            // return false;
+            ans = nodeAnswer.leftChild.toTex() + "=" + ans;
+        }
+        // const nodeAns = parseAlgebraic(ans);
+        const nodeAns = (() => {
+            const [lhs, rhs] = ans.split("=");
+            const nodeLhs = lhs.toTree();
+            const nodeRhs = parseAlgebraic(rhs);
+            return new EqualNode(nodeLhs, nodeRhs);
+        })();
+        if (!isEqualNode(nodeAns)) {
+            return false;
+        }
+        const isValidLhs = () => nodeAns.leftChild.toTex() === nodeAnswer.leftChild.toTex();
+        const isValidRhs = () => {
+            const nodeAnsRhs = nodeAns.rightChild;
+            const nodeAnswerRhs = nodeAnswer.rightChild;
+            const { nodeIdsVarStepInduction } = identifiers;
+            const [nodeVarStepInduction] = [nodeIdsVarStepInduction].map((nodeIds) => NodeConstructor.fromIdentifiers(nodeIds));
+            return NodeComparator.isEqualViaRandomEvaluations(nodeAnsRhs, nodeAnswerRhs, 3, 6, nodeVarStepInduction, () => randint(0, 20));
+        };
+        return isValidLhs() && isValidRhs();
+    }
+    catch (e) {
+        handleVEAError(e);
+        return false;
+    }
+};
+const createRandomIdentifiers = () => {
+    const [situationParams] = getArrProofByInductionSituationParams([
+        "generalFormulaOfArithmeticoGeometricSequence",
+    ]);
+    const [isValid, indexForNodeProperty] = [true, 0];
+    const [nodeVarStepDefinition, nodeVarStepInduction] = randomMany(["n", "k", "p", "m"], 2).map((letter) => new VariableNode(letter));
+    const identifiers = {
+        situationParams,
+        isValid,
+        indexForNodeProperty,
+        nodeIdsVarStepDefinition: nodeVarStepDefinition.toIdentifiers(),
+        nodeIdsVarStepInduction: nodeVarStepInduction.toIdentifiers(),
+    };
+    return identifiers;
+};
+const isIdentifiersQCPassed = (identifiers) => {
+    const isExploding = (identifiers) => {
+        let isExploding = false;
+        try {
+            //ensure r is an integer
+            {
+                const { situationParams } = identifiers;
+                const situation = getHydratedProofByInductionSituation(situationParams);
+                switch (situation.id) {
+                    case "generalFormulaOfArithmeticoGeometricSequence":
+                        {
+                            const { nodeR, nodeInitial } = situation;
+                            if (isFractionNode(nodeR) ||
+                                isFractionNode(opposite(nodeR).simplify())) {
+                                isExploding = true;
+                            }
+                            if (NodeComparator.isEqualViaSub(nodeInitial, nodeR)) {
+                                isExploding = true;
+                            }
+                        }
+                        break;
+                    default:
+                        throw new Error("Unsupported situation.id: " + situation.id);
+                }
+            }
+            getAnswer(identifiers);
+        }
+        catch (_) {
+            isExploding = true;
+        }
+        return isExploding;
+    };
+    return !isExploding(identifiers);
+};
+const createQCPassedIdentifiers = () => {
+    let identifiers;
+    let counter = -1;
+    let isValid = false;
+    while (!isValid && counter < 100) {
+        counter++;
+        const identifiersCandidate = createRandomIdentifiers();
+        isValid = isIdentifiersQCPassed(identifiersCandidate);
+        if (isValid) {
+            identifiers = identifiersCandidate;
+        }
+    }
+    if (!isValid) {
+        const [situationParams] = getArrProofByInductionSituationParams([
+            "generalFormulaOfArithmeticoGeometricSequence",
+        ]);
+        const [nodeVarStepDefinition, nodeVarStepInduction] = randomMany(["n", "k", "p", "m"], 2).map((letter) => new VariableNode(letter));
+        const identifiersDefault = (() => {
+            return {
+                situationParams,
+                isValid: true,
+                indexForNodeProperty: 0,
+                nodeIdsVarStepDefinition: nodeVarStepDefinition.toIdentifiers(),
+                nodeIdsVarStepInduction: nodeVarStepInduction.toIdentifiers(),
+            };
+        })();
+        identifiers = identifiersDefault;
+    }
+    return identifiers;
+};
+const getProofByInductionWriteMissingStepQuestion = () => {
+    const identifiers = createQCPassedIdentifiers();
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    return {
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: getKeys(identifiers),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+    };
+};
+export const proofByInductionWriteMissingStep = {
+    id: "proofByInductionWriteMissingStep",
+    connector: "=",
+    label: "Hérédité : Compléter une étape manquante",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getProofByInductionWriteMissingStepQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    isAnswerValid,
+    getPropositions,
+    subject: "Mathématiques",
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+};

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

@@ -0,0 +1,13 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+import { NodeIdentifiers } from "../../../../tree/nodes/nodeConstructor.js";
+import { ProofByInductionSituationParams } from "./proofByInductionSituations.js";
+type Identifiers = {
+    situationParams: ProofByInductionSituationParams;
+    isValid: boolean;
+    indexForNodeProperty: number;
+    nodeIdsVarStepDefinition: NodeIdentifiers;
+    nodeIdsVarStepInduction: NodeIdentifiers;
+};
+export declare const proofByInductionWritePropAtRankKPlus1: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=proofByInductionWritePropAtRankKPlus1.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"proofByInductionWritePropAtRankKPlus1.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sequences/proofByInduction/proofByInductionWritePropAtRankKPlus1.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAeT,MAAM,6BAA6B,CAAC;AAQrC,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAQ7C,OAAO,EAGL,+BAA+B,EAChC,MAAM,iCAAiC,CAAC;AAMzC,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,+BAA+B,CAAC;IACjD,OAAO,EAAE,OAAO,CAAC;IACjB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,wBAAwB,EAAE,eAAe,CAAC;IAC1C,uBAAuB,EAAE,eAAe,CAAC;CAC1C,CAAC;AAwWF,eAAO,MAAM,qCAAqC,EAAE,QAAQ,CAAC,WAAW,CAiBvE,CAAC"}