math-exercises 3.0.177 → 3.0.179

package/lib/math/utils/polynomial/polynomialUtils.js

@@ -0,0 +1,223 @@
+import { opposite } from "../../../tree/nodes/functions/oppositeNode.js";
+import { sqrt } from "../../../tree/nodes/functions/sqrtNode.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 { alignTex } from "../../../utils/latex/alignTex.js";
+import { factorial } from "../arithmetic/factorial.js";
+import { nodeBySubstitutingVar } from "../functions/functionComposition.js";
+import { round } from "../round.js";
+/**
+ *
+ * @param nodeA
+ * @param arrNodeRoot
+ * @returns a(x - root1)...(x - rootn)
+ */
+export function createNodeFPolynomialFromRoots(nodeA, arrNodeRoot) {
+    const nodeVarX = "x".toTree();
+    const nodePolynomial = arrNodeRoot.reduce((acc, nodeCoeff) => {
+        return multiply(acc, substract(nodeVarX, nodeCoeff));
+    }, nodeA);
+    return nodePolynomial;
+}
+/**
+ *
+ * @param nodePolynomial
+ * @returns for example: [nodeCoeffC, nodeCoeffB, nodeCoeffA] if nodePolynomial is a trinom
+ */
+export function getArrNodeCoeffOfPolynomialNode(nodePolynomial) {
+    const arrNodeCoeff = [];
+    let nodeWork = nodePolynomial;
+    let counter = 0;
+    do {
+        const nodeVarX = "x".toTree();
+        const nodeCoeff = frac(nodeBySubstitutingVar(nodeWork, (0).toTree(), nodeVarX).simplify(), factorial(counter)).simplify();
+        arrNodeCoeff.push(nodeCoeff);
+        nodeWork = nodeWork.derivative().simplify();
+        counter++;
+    } while (nodeWork.evaluate({ x: 0 }) !== 0);
+    return arrNodeCoeff;
+}
+/**
+ *
+ * @param arrNodeCoeff
+ * @returns coeffN x^N + ... + coeff2 x^2 + coeff1 x^1 + coeff0
+ */
+export function createNodeFPolynomialFromCoeffs(arrNodeCoeff) {
+    const nodeVarX = "x".toTree();
+    const nodePolynomial = arrNodeCoeff
+        .map((nodeCoeff, i) => {
+        switch (i) {
+            case 0:
+                return nodeCoeff;
+            case 1:
+                return multiply(nodeCoeff, nodeVarX);
+            default:
+                return multiply(nodeCoeff, power(nodeVarX, i));
+        }
+    })
+        .toReversed()
+        .reduce((acc, node) => add(acc, node));
+    return nodePolynomial;
+}
+/**
+ *
+ * @param arrNodeCoeff
+ * @returns discriminator
+ */
+export function createNodeDiscriminator(arrNodeCoeff) {
+    const [nodeC, nodeB, nodeA] = arrNodeCoeff;
+    return substract(power(nodeB, 2), multiply(4, multiply(nodeA, nodeC)));
+}
+const tryToSimplify = (node, simplifyOptions) => {
+    try {
+        return node.simplify(simplifyOptions);
+    }
+    catch (_) {
+        return node;
+    }
+};
+export const getTexSolveSecondDegreeEquation = (nodePolynomial, opts = {
+    nodeVar: "x".toTree(),
+    isShouldApprox: false,
+}) => {
+    const nodeVarX = "x".toTree();
+    const { nodeVar, isShouldApprox } = opts;
+    const arrNodeCoeff = getArrNodeCoeffOfPolynomialNode(nodePolynomial);
+    const nodePolynomialExpanded = createNodeFPolynomialFromCoeffs(arrNodeCoeff);
+    const degree = arrNodeCoeff.length - 1;
+    return `On veut résoudre l'équation :
+
+$$
+${nodeBySubstitutingVar(nodePolynomialExpanded, nodeVar, nodeVarX).toTex()} = 0
+$$
+
+${(() => {
+        if (degree === 2) {
+            const [_nodeC, nodeB, nodeA] = arrNodeCoeff;
+            const nodeDiscr = createNodeDiscriminator(arrNodeCoeff);
+            const discr = nodeDiscr.evaluate();
+            if (discr > 0) {
+                const [nodeX1, nodeX2] = [add, substract].map((addSub) => frac(addSub(opposite(nodeB), sqrt(tryToSimplify(nodeDiscr, {}))), multiply(2, nodeA)));
+                return `On a :
+
+${alignTex([
+                    ["\\Delta", "=", nodeDiscr.toTex()],
+                    ["\\Delta", "=", nodeDiscr.simplify().toTex()],
+                    ["\\Delta", ">", "0"],
+                ])}
+
+Les deux racines sont : 
+
+${alignTex([
+                    [`${nodeVar.name}_1`, "=", nodeX1.toTex()],
+                    isShouldApprox
+                        ? ["", "\\approx", round(nodeX1.evaluate(), 2).frenchify()]
+                        : ["", "=", tryToSimplify(nodeX1, {}).toTex()],
+                    [`${nodeVar.name}_2`, "=", nodeX2.toTex()],
+                    isShouldApprox
+                        ? ["", "\\approx", round(nodeX2.evaluate(), 2).frenchify()]
+                        : ["", "=", tryToSimplify(nodeX2, {}).toTex()],
+                ])}
+
+`;
+            }
+            else if (discr === 0) {
+                const nodeX = frac(opposite(nodeB), multiply(2, nodeA));
+                return `On a :
+
+${alignTex([
+                    ["\\Delta", "=", nodeDiscr.toTex()],
+                    ["\\Delta", "=", tryToSimplify(nodeDiscr, {}).toTex()],
+                    ["\\Delta", "=", "0"],
+                ])}
+
+Il y a une racine double : 
+
+${alignTex([
+                    [`${nodeVar.name}`, "=", nodeX.toTex()],
+                    isShouldApprox
+                        ? ["", "\\approx", round(nodeX.evaluate(), 2).frenchify()]
+                        : ["", "=", tryToSimplify(nodeX, {}).toTex()],
+                ])}
+
+`;
+            }
+            else {
+                return `On a :
+
+${alignTex([
+                    ["\\Delta", "=", nodeDiscr.toTex()],
+                    ["\\Delta", "=", tryToSimplify(nodeDiscr, {}).toTex()],
+                    ["\\Delta", "<", "0"],
+                ])}
+
+Il n'y a pas de solutions réelles.
+
+`;
+            }
+        }
+        else if (degree === 1) {
+            const [nodeB, nodeA] = arrNodeCoeff;
+            const nodeX = frac(opposite(nodeB), nodeA);
+            return `On a :
+
+${alignTex([
+                [`${nodeVar.name}`, "=", nodeX.toTex()],
+                ["", "=", tryToSimplify(nodeX, {}).toTex()],
+            ])}
+
+`;
+        }
+        else {
+            throw new Error("Unsupported degree: " + degree);
+        }
+    })()}
+
+`;
+};
+export const getAnswerStuffSolveSecondDegreePolynomial = (nodePolynomial) => {
+    const arrNodeCoeff = getArrNodeCoeffOfPolynomialNode(nodePolynomial);
+    const degree = arrNodeCoeff.length - 1;
+    const arrNodeX = (() => {
+        if (degree === 2) {
+            const [nodeC, nodeB, nodeA] = arrNodeCoeff;
+            const nodeDiscr = substract(power(nodeB, 2), multiply(4, multiply(nodeA, nodeC)));
+            const discr = nodeDiscr.evaluate();
+            if (discr > 0) {
+                const [nodeX1, nodeX2] = [add, substract].map((addSub) => tryToSimplify(frac(addSub(opposite(nodeB), sqrt(nodeDiscr)), multiply(2, nodeA)), {}));
+                return [nodeX1, nodeX2];
+            }
+            else if (discr === 0) {
+                const nodeX = tryToSimplify(frac(opposite(nodeB), multiply(2, nodeA)), {});
+                return [nodeX];
+            }
+            else {
+                return [];
+            }
+        }
+        else if (degree === 1) {
+            const [nodeB, nodeA] = arrNodeCoeff;
+            const nodeX = tryToSimplify(frac(opposite(nodeB), nodeA), {});
+            return [nodeX];
+        }
+        else {
+            return [];
+        }
+    })();
+    const arrNodeXSortedAsc = arrNodeX.toSorted((nodeX1, nodeX2) => nodeX1.evaluate() - nodeX2.evaluate());
+    return {
+        nodePolynomial,
+        arrNodeX: arrNodeXSortedAsc,
+    };
+};
+export function createIntegratedPolynomialNode(nodePolynomial, nodeC) {
+    const arrNodeCoeff = getArrNodeCoeffOfPolynomialNode(nodePolynomial);
+    const nodeVarX = "x".toTree();
+    return arrNodeCoeff.reduce((acc, nodeCoeff, i) => {
+        const nodeTerm = frac(multiply(nodeCoeff, power(nodeVarX, i + 1)), i + 1);
+        return add(nodeTerm, acc).simplify();
+    }, nodeC);
+}

package/lib/math/utils/sequences/situations/seqArithmeticSituations.d.ts

@@ -5,6 +5,19 @@ export type SituationArithmeticVariation = {
     getHint: (firstRank: number, ...otherArgs: unknown[]) => string;
     getCorrectionStuff: (initial: number, reason: number, firstRank: number, ...otherArgs: unknown[]) => Record<string, unknown>;
 };
+export type RankDecoder = {
+    rankFromTarget: (nodeTarget: AlgebraicNode, firstRank: number) => number;
+    targetFromRank: (rank: number, firstRank: number) => AlgebraicNode;
+};
+export type SituationArithmeticVariationUsingRankDecoder = {
+    getStrQuestion?: (initial: number, reason: number, firstRank: number, ...otherArgs: unknown[]) => string;
+    getAnswerStuff: (initial: number, reason: number, firstRank: number, ...otherArgs: unknown[]) => {
+        answerNode: AlgebraicNode;
+        rankNode: AlgebraicNode;
+    };
+    getHint: (firstRank: number, ...otherArgs: unknown[]) => string;
+    getCorrectionStuff: (initial: number, reason: number, firstRank: number, ...otherArgs: unknown[]) => Record<string, unknown>;
+};
 export type SituationArithmeticSuperfluousData = {
     rand: number;
     values: number[];
@@ -14,12 +27,13 @@ export type SituationArithmetic = {
     randReason: () => number;
     randSuperfluousData: () => SituationArithmeticSuperfluousData;
     randThreshold: (initial: number, reason: number, firstRank: number) => number;
+    rankDecoder: RankDecoder;
     getStrSituation: (initial: number, reason: number, firstRank: number, superfluousData?: SituationArithmeticSuperfluousData) => string;
     variationFindExplicitFormula: SituationArithmeticVariation;
     variationFindRecurrenceFormula: SituationArithmeticVariation;
     variationFindRandomTerm: SituationArithmeticVariation;
-    variationFindRank: SituationArithmeticVariation;
-    variationFindThreshold: SituationArithmeticVariation;
+    variationFindRank: SituationArithmeticVariationUsingRankDecoder;
+    variationFindThreshold: SituationArithmeticVariationUsingRankDecoder;
 };
 export declare const situationsArithmetic: (SituationArithmetic & {
     variationFindExplicitFormula: SituationArithmeticVariation & {
@@ -39,12 +53,12 @@ export declare const situationsArithmetic: (SituationArithmetic & {
             str: string;
         };
     };
-    variationFindRank: SituationArithmeticVariation & {
+    variationFindRank: SituationArithmeticVariationUsingRankDecoder & {
         getCorrectionStuff: (initial: number, reason: number, firstRank: number, ...otherArgs: unknown[]) => {
             str: string;
         };
     };
-    variationFindThreshold: SituationArithmeticVariation & {
+    variationFindThreshold: SituationArithmeticVariationUsingRankDecoder & {
         getCorrectionStuff: (initial: number, reason: number, firstRank: number, ...otherArgs: unknown[]) => {
             str: string;
         };

package/lib/math/utils/sequences/situations/seqArithmeticSituations.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"seqArithmeticSituations.d.ts","sourceRoot":"","sources":["../../../../../src/math/utils/sequences/situations/seqArithmeticSituations.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAiBlE,MAAM,MAAM,4BAA4B,GAAG;IACzC,cAAc,CAAC,EAAE,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,MAAM,CAAC;IAEZ,aAAa,EAAE,CACb,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,aAAa,CAAC;IACnB,OAAO,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,OAAO,EAAE,KAAK,MAAM,CAAC;IAChE,kBAAkB,EAAE,CAClB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,kCAAkC,GAAG;IAC/C,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG;IAChC,WAAW,EAAE,MAAM,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,MAAM,CAAC;IACzB,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;IAC9D,aAAa,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC;IAE9E,eAAe,EAAE,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,eAAe,CAAC,EAAE,kCAAkC,KACjD,MAAM,CAAC;IAEZ,4BAA4B,EAAE,4BAA4B,CAAC;IAC3D,8BAA8B,EAAE,4BAA4B,CAAC;IAC7D,uBAAuB,EAAE,4BAA4B,CAAC;IAEtD,iBAAiB,EAAE,4BAA4B,CAAC;IAChD,sBAAsB,EAAE,4BAA4B,CAAC;CACtD,CAAC;AAw8FF,eAAO,MAAM,oBAAoB;;sCAr7Fd,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;;sCA2Bd,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;;;;sCAiChB,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;;sCAsCd,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;;sCA0Cd,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;IA4xF9B,CAAC"}
+{"version":3,"file":"seqArithmeticSituations.d.ts","sourceRoot":"","sources":["../../../../../src/math/utils/sequences/situations/seqArithmeticSituations.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAiBlE,MAAM,MAAM,4BAA4B,GAAG;IACzC,cAAc,CAAC,EAAE,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,MAAM,CAAC;IAEZ,aAAa,EAAE,CACb,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,aAAa,CAAC;IAEnB,OAAO,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,OAAO,EAAE,KAAK,MAAM,CAAC;IAChE,kBAAkB,EAAE,CAClB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,WAAW,GAAG;IACxB,cAAc,EAAE,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC;IACzE,cAAc,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,aAAa,CAAC;CACpE,CAAC;AAEF,MAAM,MAAM,4CAA4C,GAAG;IACzD,cAAc,CAAC,EAAE,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,MAAM,CAAC;IAEZ,cAAc,EAAE,CACd,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB;QAAE,UAAU,EAAE,aAAa,CAAC;QAAC,QAAQ,EAAE,aAAa,CAAA;KAAE,CAAC;IAE5D,OAAO,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,OAAO,EAAE,KAAK,MAAM,CAAC;IAChE,kBAAkB,EAAE,CAClB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,kCAAkC,GAAG;IAC/C,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG;IAChC,WAAW,EAAE,MAAM,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,MAAM,CAAC;IACzB,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;IAC9D,aAAa,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC;IAC9E,WAAW,EAAE,WAAW,CAAC;IAEzB,eAAe,EAAE,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,eAAe,CAAC,EAAE,kCAAkC,KACjD,MAAM,CAAC;IAEZ,4BAA4B,EAAE,4BAA4B,CAAC;IAC3D,8BAA8B,EAAE,4BAA4B,CAAC;IAE7D,uBAAuB,EAAE,4BAA4B,CAAC;IAEtD,iBAAiB,EAAE,4CAA4C,CAAC;IAChE,sBAAsB,EAAE,4CAA4C,CAAC;CACtE,CAAC;AA0jHF,eAAO,MAAM,oBAAoB;;sCAviHd,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;;sCA2Bd,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;;;;sCAiChB,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;;sCAsCd,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;;sCAoDd,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;;IAo4G9B,CAAC"}