math-exercises 3.0.178 → 3.0.180

package/lib/math/utils/polynomial/polynomialUtils.d.ts

@@ -0,0 +1,37 @@
+import { AlgebraicNode } from "../../../tree/nodes/algebraicNode.js";
+import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
+/**
+ *
+ * @param nodeA
+ * @param arrNodeRoot
+ * @returns a(x - root1)...(x - rootn)
+ */
+export declare function createNodeFPolynomialFromRoots(nodeA: AlgebraicNode, arrNodeRoot: AlgebraicNode[]): AlgebraicNode;
+/**
+ *
+ * @param nodePolynomial
+ * @returns for example: [nodeCoeffC, nodeCoeffB, nodeCoeffA] if nodePolynomial is a trinom
+ */
+export declare function getArrNodeCoeffOfPolynomialNode(nodePolynomial: AlgebraicNode): AlgebraicNode[];
+/**
+ *
+ * @param arrNodeCoeff
+ * @returns coeffN x^N + ... + coeff2 x^2 + coeff1 x^1 + coeff0
+ */
+export declare function createNodeFPolynomialFromCoeffs(arrNodeCoeff: AlgebraicNode[]): AlgebraicNode | import("../../../tree/nodes/operators/multiplyNode.js").MultiplyNode;
+/**
+ *
+ * @param arrNodeCoeff
+ * @returns discriminator
+ */
+export declare function createNodeDiscriminator(arrNodeCoeff: AlgebraicNode[]): import("../../../tree/nodes/operators/substractNode.js").SubstractNode;
+export declare const getTexSolveSecondDegreeEquation: (nodePolynomial: AlgebraicNode, opts?: {
+    nodeVar: VariableNode;
+    isShouldApprox: boolean;
+}) => string;
+export declare const getAnswerStuffSolveSecondDegreePolynomial: (nodePolynomial: AlgebraicNode) => {
+    nodePolynomial: AlgebraicNode;
+    arrNodeX: AlgebraicNode[];
+};
+export declare function createIntegratedPolynomialNode(nodePolynomial: AlgebraicNode, nodeC: AlgebraicNode): AlgebraicNode;
+//# sourceMappingURL=polynomialUtils.d.ts.map

package/lib/math/utils/polynomial/polynomialUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"polynomialUtils.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/polynomial/polynomialUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,aAAa,EAEd,MAAM,mCAAmC,CAAC;AAQ3C,OAAO,EAAE,YAAY,EAAE,MAAM,4CAA4C,CAAC;AAM1E;;;;;GAKG;AACH,wBAAgB,8BAA8B,CAC5C,KAAK,EAAE,aAAa,EACpB,WAAW,EAAE,aAAa,EAAE,iBAO7B;AAED;;;;GAIG;AACH,wBAAgB,+BAA+B,CAAC,cAAc,EAAE,aAAa,mBAe5E;AAED;;;;GAIG;AACH,wBAAgB,+BAA+B,CAAC,YAAY,EAAE,aAAa,EAAE,qFAgB5E;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,YAAY,EAAE,aAAa,EAAE,uEAGpE;AAaD,eAAO,MAAM,+BAA+B,GAC1C,gBAAgB,aAAa,EAC7B,OAAM;IAAE,OAAO,EAAE,YAAY,CAAC;IAAC,cAAc,EAAE,OAAO,CAAA;CAGrD,WAoGF,CAAC;AAEF,eAAO,MAAM,yCAAyC,GACpD,gBAAgB,aAAa;;;CA+C9B,CAAC;AAEF,wBAAgB,8BAA8B,CAC5C,cAAc,EAAE,aAAa,EAC7B,KAAK,EAAE,aAAa,iBAQrB"}

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.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;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;AA8jHF,eAAO,MAAM,oBAAoB;;sCA3iHd,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;;;;IAw4G9B,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"}

package/lib/math/utils/sequences/situations/seqArithmeticSituations.js

@@ -193,7 +193,7 @@ const templatesSituationsArithmetic = [
         },
         getStrSituation: (initial, reason, firstRank, superfluousData) => {
             if (superfluousData === undefined) {
-                return `On suppose qu'une plante, d'une hauteur initiale (jour $${firstRank.frPretty(2)}$) de $${initial.frPretty(2)}\\ \\textrm{cm}$, 
+                return `On suppose qu'une plante, d'une hauteur initiale (jour $${firstRank.frenchify()}$) de $${initial.frPretty(2)}\\ \\textrm{cm}$, 
 croît chaque jour de $${reason.frPretty(2)}\\ \\textrm{cm}$.
 On note $u_n$ la hauteur de la plante relevée le jour $n$, en $\\textrm{cm}$.`;
             }
@@ -202,7 +202,7 @@ On note $u_n$ la hauteur de la plante relevée le jour $n$, en $\\textrm{cm}$.`;
                     case 0:
                         {
                             const [wateringPeriodInDays] = superfluousData.values;
-                            return `On suppose qu'une plante, d'une hauteur initiale (jour $${firstRank.frPretty(2)}$) de $${initial.frPretty(2)}\\ \\textrm{cm}$ et
+                            return `On suppose qu'une plante, d'une hauteur initiale (jour $${firstRank.frenchify()}$) de $${initial.frPretty(2)}\\ \\textrm{cm}$ et
 arrosée en moyenne tous les $${wateringPeriodInDays.frPretty(2)}$ jours,
 croît chaque jour de $${reason.frPretty(2)}\\ \\textrm{cm}$.
 On note $u_n$ la hauteur de la plante relevée le jour $n$, en $\\textrm{cm}$.`;
@@ -212,7 +212,7 @@ On note $u_n$ la hauteur de la plante relevée le jour $n$, en $\\textrm{cm}$.`;
                         {
                             const [potDiameterInCm] = superfluousData.values;
                             return `On suppose qu'on a mis une plante dans un pot de diamètre $${potDiameterInCm.frPretty(2)} \\ \\textrm{cm}$.
-La plante a alors une hauteur initiale (jour $${firstRank.frPretty(2)}$) de $${initial.frPretty(2)}\\ \\textrm{cm}$. 
+La plante a alors une hauteur initiale (jour $${firstRank.frenchify()}$) de $${initial.frPretty(2)}\\ \\textrm{cm}$. 
 La plante croît chaque jour de $${reason.frPretty(2)}\\ \\textrm{cm}$.
 On note $u_n$ la hauteur de la plante relevée le jour $n$, en $\\textrm{cm}$.`;
                         }
@@ -1189,7 +1189,7 @@ Par exemple, le montant de ses économies après $${target2.frPretty(2)}$ semain
                 const target = rankAsked - firstRank;
                 return `Quelle est la nature de la suite $u_n$ ?
 
-Utilise le terme général de $u_n$ pour déterminer le montant des économies de Manon $${target.frPretty(2)}$ semaines après le début de septembre.`;
+Utilise le terme général de $u_n$ pour déterminer le montant des économies de Manon $${target.frenchify()}$ semaines après le début de septembre.`;
             },
             getCorrectionStuff: (initial, reason, _firstRank, ..._otherArgs) => {
                 const target1 = 10;
@@ -1680,8 +1680,8 @@ Le niveau de charge est donc une suite arithmétique de premier terme $${initial
         },
         getStrSituation: (initial, reason, firstRank, superfluousData) => {
             if (superfluousData === undefined) {
-                return `Un gigantesque buffet est organisé. Au départ, sur les tables de service, il y a $${initial.frPretty(2)}$ amuse-bouches.
-$${(-reason).frPretty(2)}$ amuse-bouches sont mangés toutes les minutes.
+                return `Un gigantesque buffet est organisé. Au départ, sur les tables de service, il y a $${initial.frenchify()}$ amuse-bouches.
+$${(-reason).frenchify()}$ amuse-bouches sont mangés toutes les minutes.
 On note $u_n$ le nombre d'amuse-bouches restant après $${getStrFactor(firstRank)} \\ \\textrm{min}$.`;
             }
             else {

package/lib/tree/nodes/operators/multiplyNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"multiplyNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/multiplyNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EACL,uBAAuB,EACvB,WAAW,EAEZ,MAAM,mBAAmB,CAAC;AAgB3B,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAYrE,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,QAAQ,GACnB,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,OAAO,WAAW,iBAOnB,CAAC;AACF,eAAO,MAAM,iBAAiB,GAAI,KAAK,aAAa,EAAE,SAYrD,CAAC;AACF,qBAAa,YAAa,YAAW,uBAAuB;IAC1D,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAUpB;;OAEG;IACH,OAAO,qBAIL;IAEF,UAAU,qBAER;IACF,YAAY,IAAI,MAAM;IAItB,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IAgFrC,SAAS;IAkDT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,YAAY,EAAE;IAyFrD,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAG5C,aAAa;;;;;;;;;IAYb,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAItC,IAAI;IAGJ,cAAc;IACd,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,EAAE,GAAG,UAAQ,GAAG,aAAa;IAiK5D,mBAAmB,CAAC,IAAI,CAAC,EAAE,eAAe;IAM1C,mBAAmB;IAOnB,MAAM,CAAC,IAAI,EAAE,aAAa;IAU1B,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAQxD,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;CAMxD"}
+{"version":3,"file":"multiplyNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/multiplyNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EACL,uBAAuB,EACvB,WAAW,EAEZ,MAAM,mBAAmB,CAAC;AAgB3B,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAYrE,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,QAAQ,GACnB,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,OAAO,WAAW,iBAOnB,CAAC;AACF,eAAO,MAAM,iBAAiB,GAAI,KAAK,aAAa,EAAE,SAYrD,CAAC;AACF,qBAAa,YAAa,YAAW,uBAAuB;IAC1D,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAUpB;;OAEG;IACH,OAAO,qBAIL;IAEF,UAAU,qBAER;IACF,YAAY,IAAI,MAAM;IAItB,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IAgFrC,SAAS;IAkDT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,YAAY,EAAE;IAyFrD,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAG5C,aAAa;;;;;;;;;IAYb,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAOtC,IAAI;IAGJ,cAAc;IACd,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,EAAE,GAAG,UAAQ,GAAG,aAAa;IAiK5D,mBAAmB,CAAC,IAAI,CAAC,EAAE,eAAe;IAM1C,mBAAmB;IAOnB,MAAM,CAAC,IAAI,EAAE,aAAa;IAU1B,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAQxD,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;CAMxD"}

package/lib/tree/nodes/operators/multiplyNode.js

@@ -249,7 +249,7 @@ export class MultiplyNode {
     //   return multiply(this.leftChild.toMathjs(), this.rightChild.toMathjs());
     // }
     evaluate(vars) {
-        return this.leftChild.evaluate(vars) * this.rightChild.evaluate(vars);
+        return round(this.leftChild.evaluate(vars) * this.rightChild.evaluate(vars), 12);
     }
     copy() {
         return new MultiplyNode(this.leftChild, this.rightChild, this.opts);

package/lib/tree/nodes/operators/substractNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"substractNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/substractNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,mBAAmB,CAAC;AAE9E,OAAO,EAAO,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAGrE,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,aAAa,CAE3D;AAED,eAAO,MAAM,SAAS,GACpB,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,kBAOnC,CAAC;AAEF,qBAAa,aAAc,YAAW,YAAY;IAChD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;IACnB,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,YAAY,IAAI,MAAM;IAGtB,aAAa;;;;;;;;;IAOb,mBAAmB;IAOnB,iBAAiB,IAAI,aAAa,EAAE;IAapC,cAAc,IAAI,MAAM,EAAE;IAG1B,kBAAkB;IAIlB,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IAoBrC,mBAAmB,CAAC,IAAI,CAAC,EAAE,eAAe;IAK1C,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMtC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAM/B,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAOpC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAMxD,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;IAMvD,OAAO,uBAGL;CACH"}
+{"version":3,"file":"substractNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/substractNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,mBAAmB,CAAC;AAE9E,OAAO,EAAO,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAIrE,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,aAAa,CAE3D;AAED,eAAO,MAAM,SAAS,GACpB,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,kBAOnC,CAAC;AAEF,qBAAa,aAAc,YAAW,YAAY;IAChD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;IACnB,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,YAAY,IAAI,MAAM;IAGtB,aAAa;;;;;;;;;IAOb,mBAAmB;IAOnB,iBAAiB,IAAI,aAAa,EAAE;IAapC,cAAc,IAAI,MAAM,EAAE;IAG1B,kBAAkB;IAIlB,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IAoBrC,mBAAmB,CAAC,IAAI,CAAC,EAAE,eAAe;IAK1C,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAStC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAM/B,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAOpC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAMxD,UAAU,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;IAMvD,OAAO,uBAGL;CACH"}

package/lib/tree/nodes/operators/substractNode.js

@@ -5,6 +5,7 @@ import { opposite, OppositeNode } from "../functions/oppositeNode.js";
 import { add, AddNode } from "./addNode.js";
 import { coinFlip } from "../../../utils/alea/coinFlip.js";
 import { colorize } from "../../../utils/latex/colorize.js";
+import { round } from "../../../math/utils/round.js";
 export function isSubstractNode(a) {
     return isOperatorNode(a) && a.id === OperatorIds.substract;
 }
@@ -86,7 +87,7 @@ export class SubstractNode {
         return this.toTex();
     }
     evaluate(vars) {
-        return this.leftChild.evaluate(vars) - this.rightChild.evaluate(vars);
+        return round(this.leftChild.evaluate(vars) - this.rightChild.evaluate(vars), 12);
     }
     // toMathjs() {
     //   return subtract(this.leftChild.toMathjs(), this.rightChild.toMathjs());

package/lib/tree/utilities/nodeUtils.d.ts

@@ -0,0 +1,6 @@
+import { AlgebraicNode } from "../nodes/algebraicNode.js";
+export declare abstract class NodeUtils {
+    static getDepth: <T extends AlgebraicNode>(algebraicNode: T) => number;
+    static getChildren(algebraicNode: AlgebraicNode): AlgebraicNode[];
+}
+//# sourceMappingURL=nodeUtils.d.ts.map

package/lib/tree/utilities/nodeUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeUtils.d.ts","sourceRoot":"","sources":["../../../src/tree/utilities/nodeUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAI1D,8BAAsB,SAAS;IAC7B,MAAM,CAAC,QAAQ,GAAI,CAAC,SAAS,aAAa,EAAE,eAAe,CAAC,KAAG,MAAM,CASnE;IAEF,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,aAAa;CAShD"}

package/lib/tree/utilities/nodeUtils.js

@@ -0,0 +1,24 @@
+import { isFunctionNode } from "../nodes/functions/functionNode.js";
+import { isOperatorNode } from "../nodes/operators/operatorNode.js";
+export class NodeUtils {
+    static getDepth = (algebraicNode) => {
+        const children = this.getChildren(algebraicNode);
+        if (children.length === 0) {
+            return 0;
+        }
+        else {
+            return (1 + Math.max(...children.map((nodeChild) => this.getDepth(nodeChild))));
+        }
+    };
+    static getChildren(algebraicNode) {
+        if (isOperatorNode(algebraicNode)) {
+            return [algebraicNode.leftChild, algebraicNode.rightChild];
+        }
+        else if (isFunctionNode(algebraicNode)) {
+            return [algebraicNode.child];
+        }
+        else {
+            return [];
+        }
+    }
+}

package/lib/utils/strings/prependArticle.d.ts

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

package/lib/utils/strings/prependArticle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prependArticle.d.ts","sourceRoot":"","sources":["../../../src/utils/strings/prependArticle.ts"],"names":[],"mappings":""}

package/lib/utils/strings/prependArticle.js

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

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "math-exercises",
   "type": "module",
-  "version": "3.0.178",
+  "version": "3.0.180",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [