math-exercises 3.0.199 → 3.0.201

package/lib/math/utils/functions/functionComposition.js

@@ -1,6 +1,6 @@
 import { isEqualNode, } from "../../../tree/nodes/equations/equalNode.js";
 import { isFunctionNode, } from "../../../tree/nodes/functions/functionNode.js";
-import { NodeConstructor } from "../../../tree/nodes/nodeConstructor.js";
+import { NodeConstructor, } from "../../../tree/nodes/nodeConstructor.js";
 import { isOperatorNode, } from "../../../tree/nodes/operators/operatorNode.js";
 import { isVariableNode, } from "../../../tree/nodes/variables/variableNode.js";
 export const nodeBySubstitutingVar = (nodeCarrier, nodeInjected, variableNode = "x".toTree()) => {
@@ -50,32 +50,32 @@ export const getAllNodePaths = (node) => {
     }
     return arrNodePaths;
 };
-function functionNodeByReplacingChild(fNode, nodeChildNew) {
+function functionNodeByReplacingChild(fNode, nodeChildNew, fromIdentifiersFunc = (identifiers) => NodeConstructor.fromIdentifiers(identifiers)) {
     const nodeIds = fNode.toIdentifiers();
     nodeIds.child = nodeChildNew.toIdentifiers();
-    return NodeConstructor.fromIdentifiers(nodeIds);
+    return fromIdentifiersFunc(nodeIds);
 }
-function operatorNodeByReplacingLeftChild(opNode, nodeLeftChildNew) {
+function operatorNodeByReplacingLeftChild(opNode, nodeLeftChildNew, fromIdentifiersFunc = (identifiers) => NodeConstructor.fromIdentifiers(identifiers)) {
     const nodeIds = opNode.toIdentifiers();
     nodeIds.leftChild = nodeLeftChildNew.toIdentifiers();
-    return NodeConstructor.fromIdentifiers(nodeIds);
+    return fromIdentifiersFunc(nodeIds);
 }
-function operatorNodeByReplacingRightChild(opNode, nodeRightChildNew) {
+function operatorNodeByReplacingRightChild(opNode, nodeRightChildNew, fromIdentifiersFunc = (identifiers) => NodeConstructor.fromIdentifiers(identifiers)) {
     const nodeIds = opNode.toIdentifiers();
     nodeIds.rightChild = nodeRightChildNew.toIdentifiers();
-    return NodeConstructor.fromIdentifiers(nodeIds);
+    return fromIdentifiersFunc(nodeIds);
 }
-function equalNodeByReplacingLeftChild(equalNode, nodeLeftChildNew) {
+function equalNodeByReplacingLeftChild(equalNode, nodeLeftChildNew, fromIdentifiersFunc = (identifiers) => NodeConstructor.fromIdentifiers(identifiers)) {
     const nodeIds = equalNode.toIdentifiers();
     nodeIds.leftChild = nodeLeftChildNew.toIdentifiers();
-    return NodeConstructor.fromIdentifiers(nodeIds);
+    return fromIdentifiersFunc(nodeIds);
 }
-function equalNodeByReplacingRightChild(equalNode, nodeRightChildNew) {
+function equalNodeByReplacingRightChild(equalNode, nodeRightChildNew, fromIdentifiersFunc = (identifiers) => NodeConstructor.fromIdentifiers(identifiers)) {
     const nodeIds = equalNode.toIdentifiers();
     nodeIds.rightChild = nodeRightChildNew.toIdentifiers();
-    return NodeConstructor.fromIdentifiers(nodeIds);
+    return fromIdentifiersFunc(nodeIds);
 }
-export function nodeByReplacingNodeAtPath(nodeCarrier, path, nodeInjected, simplifyUpToLevel = -1, simplifyOptions = {}) {
+export function nodeByReplacingNodeAtPath(nodeCarrier, path, nodeInjected, simplifyUpToLevel = -1, simplifyOptions = {}, fromIdentifiersFunc = (identifiers) => NodeConstructor.fromIdentifiers(identifiers)) {
     function getNodeForKey(node, key) {
         if (key === "leftChild" || key === "rightChild") {
             return node[key];
@@ -89,19 +89,19 @@ export function nodeByReplacingNodeAtPath(nodeCarrier, path, nodeInjected, simpl
     }
     function nodeByReplacingChildAtKey(node, key, nodeInjected) {
         if (key === "leftChild" && isOperatorNode(node)) {
-            return operatorNodeByReplacingLeftChild(node, nodeInjected);
+            return operatorNodeByReplacingLeftChild(node, nodeInjected, fromIdentifiersFunc);
         }
         else if (key === "rightChild" && isOperatorNode(node)) {
-            return operatorNodeByReplacingRightChild(node, nodeInjected);
+            return operatorNodeByReplacingRightChild(node, nodeInjected, fromIdentifiersFunc);
         }
         else if (key === "leftChild" && isEqualNode(node)) {
-            return equalNodeByReplacingLeftChild(node, nodeInjected);
+            return equalNodeByReplacingLeftChild(node, nodeInjected, fromIdentifiersFunc);
         }
         else if (key === "rightChild" && isEqualNode(node)) {
-            return equalNodeByReplacingRightChild(node, nodeInjected);
+            return equalNodeByReplacingRightChild(node, nodeInjected, fromIdentifiersFunc);
         }
         else if (key === "child" && isFunctionNode(node)) {
-            return functionNodeByReplacingChild(node, nodeInjected);
+            return functionNodeByReplacingChild(node, nodeInjected, fromIdentifiersFunc);
         }
         else {
             throw new Error("Either key and node type are incompatible or Unsupported key: " + key);

package/lib/math/utils/integration/rectanglesMethod.d.ts

@@ -0,0 +1,6 @@
+import { AlgebraicNode } from "../../../tree/nodes/algebraicNode.js";
+export declare const lowerSum: (nodeF: AlgebraicNode, nodeIntegralBoundLow: AlgebraicNode, nodeIntegralBoundHigh: AlgebraicNode, nbRectangles: number, isShouldSimplifyAbscissa: boolean) => AlgebraicNode;
+export declare const upperSum: (nodeF: AlgebraicNode, nodeIntegralBoundLow: AlgebraicNode, nodeIntegralBoundHigh: AlgebraicNode, nbRectangles: number, isShouldSimplifyAbscissa: boolean) => AlgebraicNode;
+export declare const lowerSumSameAsGGB: (nodeF: AlgebraicNode, nodeIntegralBoundLow: AlgebraicNode, nodeIntegralBoundHigh: AlgebraicNode, nbRectangles: number) => number;
+export declare const upperSumSameAsGGB: (nodeF: AlgebraicNode, nodeIntegralBoundLow: AlgebraicNode, nodeIntegralBoundHigh: AlgebraicNode, nbRectangles: number) => number;
+//# sourceMappingURL=rectanglesMethod.d.ts.map

package/lib/math/utils/integration/rectanglesMethod.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rectanglesMethod.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/integration/rectanglesMethod.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAkElE,eAAO,MAAM,QAAQ,GACnB,OAAO,aAAa,EACpB,sBAAsB,aAAa,EACnC,uBAAuB,aAAa,EACpC,cAAc,MAAM,EACpB,0BAA0B,OAAO,kBAelC,CAAC;AAEF,eAAO,MAAM,QAAQ,GACnB,OAAO,aAAa,EACpB,sBAAsB,aAAa,EACnC,uBAAuB,aAAa,EACpC,cAAc,MAAM,EACpB,0BAA0B,OAAO,kBAelC,CAAC;AA4CF,eAAO,MAAM,iBAAiB,GAC5B,OAAO,aAAa,EACpB,sBAAsB,aAAa,EACnC,uBAAuB,aAAa,EACpC,cAAc,MAAM,WAcrB,CAAC;AAEF,eAAO,MAAM,iBAAiB,GAC5B,OAAO,aAAa,EACpB,sBAAsB,aAAa,EACnC,uBAAuB,aAAa,EACpC,cAAc,MAAM,WAcrB,CAAC"}

package/lib/math/utils/integration/rectanglesMethod.js

@@ -0,0 +1,66 @@
+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 { substract } from "../../../tree/nodes/operators/substractNode.js";
+import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
+import { nodeBySubstitutingVar } from "../functions/functionComposition.js";
+const rectanglesSum = (nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles, funcNodeAbscissa, isShouldSimplifyAbscissa = true) => {
+    const nodeIntegralBoundLength = substract(nodeIntegralBoundHigh, nodeIntegralBoundLow).simplify({ towardsDistribute: true, forceAddFractions: true });
+    const nodeRectangleLength = frac(nodeIntegralBoundLength, nbRectangles).simplify({ towardsDistribute: true, forceAddFractions: true });
+    const arrNodeImageRectangleBound = [...Array(nbRectangles).keys()].map((i) => {
+        const nodeRectangleBound = (() => {
+            const nodeRaw = funcNodeAbscissa(nodeIntegralBoundLow, nodeRectangleLength, i);
+            if (isShouldSimplifyAbscissa) {
+                return nodeRaw.simplify({ towardsDistribute: true });
+            }
+            else {
+                return nodeRaw;
+            }
+        })();
+        const nodeImageRectangleBound = nodeBySubstitutingVar(nodeF, nodeRectangleBound, new VariableNode("x"));
+        return nodeImageRectangleBound;
+    });
+    return arrNodeImageRectangleBound.reduce((acc, nodeImageRectangleBound, i) => {
+        const nodeRectangleArea = multiply(nodeImageRectangleBound, nodeRectangleLength);
+        if (i === 0) {
+            return nodeRectangleArea;
+        }
+        return add(acc, nodeRectangleArea);
+    }, (0).toTree());
+};
+export const lowerSum = (nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles, isShouldSimplifyAbscissa) => {
+    const funcNodeAbscissa = (nodeIntegralBoundLow, nodeRectangleLength, i) => add(nodeIntegralBoundLow, multiply(i, nodeRectangleLength));
+    return rectanglesSum(nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles, funcNodeAbscissa, isShouldSimplifyAbscissa);
+};
+export const upperSum = (nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles, isShouldSimplifyAbscissa) => {
+    const funcNodeAbscissa = (nodeIntegralBoundLow, nodeRectangleLength, i) => add(nodeIntegralBoundLow, multiply(i + 1, nodeRectangleLength));
+    return rectanglesSum(nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles, funcNodeAbscissa, isShouldSimplifyAbscissa);
+};
+//GGB's algorithm
+const rectanglesSumSameAsGGB = (nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles, funcValueAbscissa) => {
+    const valueIntegralBoundLow = nodeIntegralBoundLow.evaluate();
+    const valueIntegralBoundHigh = nodeIntegralBoundHigh.evaluate();
+    const valueIntegralBoundLength = valueIntegralBoundHigh - valueIntegralBoundLow;
+    const valueRectangleLength = (1.0 * valueIntegralBoundLength) / nbRectangles;
+    const arrValueImageRectangleBound = [...Array(nbRectangles).keys()].map((i) => {
+        const valueAbscissa = funcValueAbscissa(valueIntegralBoundLow, valueRectangleLength, i);
+        const valueRaw = nodeF.evaluate({ x: valueAbscissa });
+        return valueRaw;
+    });
+    const valueSumImage = arrValueImageRectangleBound.reduce((acc, valueImageRectangleBound, i) => {
+        if (i === 0) {
+            return valueImageRectangleBound;
+        }
+        return acc + valueImageRectangleBound;
+    });
+    const valueSumRaw = valueSumImage * valueRectangleLength;
+    return valueSumRaw;
+};
+export const lowerSumSameAsGGB = (nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles) => {
+    const funcValueAbscissa = (valueIntegralBoundLow, valueRectangleLength, i) => valueIntegralBoundLow + i * valueRectangleLength;
+    return rectanglesSumSameAsGGB(nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles, funcValueAbscissa);
+};
+export const upperSumSameAsGGB = (nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles) => {
+    const funcValueAbscissa = (valueIntegralBoundLow, valueRectangleLength, i) => valueIntegralBoundLow + (i + 1) * valueRectangleLength;
+    return rectanglesSumSameAsGGB(nodeF, nodeIntegralBoundLow, nodeIntegralBoundHigh, nbRectangles, funcValueAbscissa);
+};

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

@@ -1,3 +1,4 @@
+import { Point } from "../../../math/geometry/point.js";
 import { AlgebraicNode } from "../../../tree/nodes/algebraicNode.js";
 import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
 /**
@@ -18,7 +19,14 @@ export declare function getArrNodeCoeffOfPolynomialNode(nodePolynomial: Algebrai
  * @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;
+export declare function createNodeFPolynomialFromCoeffs(arrNodeCoeff: AlgebraicNode[], isFilterOutTopZeroCoeffs?: boolean): AlgebraicNode | import("../../../tree/nodes/operators/multiplyNode.js").MultiplyNode;
+/**
+ *
+ * @param nodeA
+ * @param arrPoint
+ * @returns coeffN x^N + ... + coeff2 x^2 + coeff1 x^1 + coeff0
+ */
+export declare function createNodeFTrinomFromPoints(nodeA: AlgebraicNode, arrPoint: Point[]): AlgebraicNode | import("../../../tree/nodes/operators/multiplyNode.js").MultiplyNode;
 /**
  *
  * @param arrNodeCoeff

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

@@ -1 +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"}
+{"version":3,"file":"polynomialUtils.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/polynomial/polynomialUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AACrD,OAAO,EACL,aAAa,EAEd,MAAM,mCAAmC,CAAC;AAQ3C,OAAO,EAAE,YAAY,EAAE,MAAM,4CAA4C,CAAC;AAO1E;;;;;GAKG;AACH,wBAAgB,8BAA8B,CAC5C,KAAK,EAAE,aAAa,EACpB,WAAW,EAAE,aAAa,EAAE,iBAO7B;AAED;;;;GAIG;AACH,wBAAgB,+BAA+B,CAAC,cAAc,EAAE,aAAa,mBA4B5E;AAED;;;;GAIG;AACH,wBAAgB,+BAA+B,CAC7C,YAAY,EAAE,aAAa,EAAE,EAC7B,wBAAwB,GAAE,OAAc,qFA8CzC;AAED;;;;;GAKG;AACH,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,aAAa,EACpB,QAAQ,EAAE,KAAK,EAAE,qFA6BlB;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

@@ -3,8 +3,9 @@ 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 { power, square } from "../../../tree/nodes/operators/powerNode.js";
 import { substract } from "../../../tree/nodes/operators/substractNode.js";
+import { NodeComparator } from "../../../tree/utilities/nodeComparator.js";
 import { alignTex } from "../../../utils/latex/alignTex.js";
 import { factorial } from "../arithmetic/factorial.js";
 import { nodeBySubstitutingVar } from "../functions/functionComposition.js";
@@ -31,13 +32,27 @@ export function getArrNodeCoeffOfPolynomialNode(nodePolynomial) {
     const arrNodeCoeff = [];
     let nodeWork = nodePolynomial;
     let counter = 0;
+    const maxCounterOfConsecutiveZeroes = 10; //we stop when we find 10 consecutives coeffs equal to 0
+    let arrNodeCoeffTmp = [];
     do {
         const nodeVarX = "x".toTree();
         const nodeCoeff = frac(nodeBySubstitutingVar(nodeWork, (0).toTree(), nodeVarX).simplify(), factorial(counter)).simplify();
-        arrNodeCoeff.push(nodeCoeff);
+        if (NodeComparator.isEqualViaSub(nodeCoeff, (0).toTree())) {
+            if (arrNodeCoeff.length === 0) {
+                arrNodeCoeff.push(nodeCoeff);
+            }
+            else {
+                arrNodeCoeffTmp.push(nodeCoeff);
+            }
+        }
+        else {
+            arrNodeCoeff.push(...arrNodeCoeffTmp);
+            arrNodeCoeff.push(nodeCoeff);
+            arrNodeCoeffTmp = [];
+        }
         nodeWork = nodeWork.derivative().simplify();
         counter++;
-    } while (nodeWork.evaluate({ x: 0 }) !== 0);
+    } while (arrNodeCoeffTmp.length < maxCounterOfConsecutiveZeroes);
     return arrNodeCoeff;
 }
 /**
@@ -45,9 +60,32 @@ export function getArrNodeCoeffOfPolynomialNode(nodePolynomial) {
  * @param arrNodeCoeff
  * @returns coeffN x^N + ... + coeff2 x^2 + coeff1 x^1 + coeff0
  */
-export function createNodeFPolynomialFromCoeffs(arrNodeCoeff) {
+export function createNodeFPolynomialFromCoeffs(arrNodeCoeff, isFilterOutTopZeroCoeffs = true) {
     const nodeVarX = "x".toTree();
-    const nodePolynomial = arrNodeCoeff
+    const arrNodeCoeffRefined = (() => isFilterOutTopZeroCoeffs
+        ? (() => {
+            const [nodeCoeff0, ...arrNodeRest] = arrNodeCoeff;
+            return [
+                nodeCoeff0,
+                ...arrNodeRest
+                    .toReversed()
+                    .reduce((acc, node) => {
+                    acc.isHasFoundNonZero =
+                        acc.isHasFoundNonZero ||
+                            !NodeComparator.isEqualViaSub(node, (0).toTree());
+                    if (acc.isHasFoundNonZero) {
+                        acc.arr = [...acc.arr, node];
+                    }
+                    return acc;
+                }, {
+                    isHasFoundNonZero: false,
+                    arr: [],
+                })
+                    .arr.toReversed(),
+            ];
+        })()
+        : arrNodeCoeff)();
+    const nodePolynomial = arrNodeCoeffRefined
         .map((nodeCoeff, i) => {
         switch (i) {
             case 0:
@@ -62,6 +100,27 @@ export function createNodeFPolynomialFromCoeffs(arrNodeCoeff) {
         .reduce((acc, node) => add(acc, node));
     return nodePolynomial;
 }
+/**
+ *
+ * @param nodeA
+ * @param arrPoint
+ * @returns coeffN x^N + ... + coeff2 x^2 + coeff1 x^1 + coeff0
+ */
+export function createNodeFTrinomFromPoints(nodeA, arrPoint) {
+    const [[nodeX1, nodeY1], [nodeX2, nodeY2]] = arrPoint.map((point) => [
+        point.x,
+        point.y,
+    ]);
+    //{P(x1)=y1
+    //{P(x2)=y2
+    //<=>
+    //{b=((y1-y2)-a(x1^2-x2^2))/(x1-x2)
+    //{c=y1-(ax1^2+bx1)
+    const nodeB = frac(substract(substract(nodeY1, nodeY2), multiply(nodeA, substract(square(nodeX1), square(nodeX2)))), substract(nodeX1, nodeX2));
+    const nodeC = substract(nodeY1, add(multiply(nodeA, square(nodeX1)), multiply(nodeB, nodeX1)));
+    const nodePolynomial = createNodeFPolynomialFromCoeffs([nodeC, nodeB, nodeA], true);
+    return nodePolynomial;
+}
 /**
  *
  * @param arrNodeCoeff
@@ -217,7 +276,7 @@ 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();
+        const nodeTerm = multiply(nodeCoeff, frac(power(nodeVarX, i + 1), i + 1));
+        return add(nodeTerm, acc);
     }, nodeC);
 }

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

@@ -13,6 +13,15 @@ export type SituationGeometricSuperfluousData = {
     rand: number;
     values: number[];
 };
+export type SituationGeometricVariationUsingRankDecoder = {
+    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 SituationGeometric = {
     type: "factor" | "factorPercentage" | "evo" | "evoPercentage";
     randInitial: () => number;
@@ -20,12 +29,15 @@ export type SituationGeometric = {
     randSuperfluousData: () => SituationGeometricSuperfluousData;
     randThreshold: (initial: number, reason: number, firstRank: number) => number;
     rankDecoder: RankDecoder;
+    digitsValue: number;
+    digitsTarget: number;
     getStrSituation: (initial: number, reason: number, firstRank: number, superfluousData?: SituationGeometricSuperfluousData) => string;
     variationFindExplicitFormula: SituationGeometricVariation;
     variationFindRecurrenceFormula: SituationGeometricVariation;
     variationFindRandomTerm: SituationGeometricVariation;
+    variationFindRank: SituationGeometricVariationUsingRankDecoder;
 };
-export declare const situationsGeometric: (SituationGeometric & {
+export declare const situationsGeometric: {
     variationFindExplicitFormula: SituationGeometricVariation & {
         getCorrectionStuff: (initial: number, reason: number, firstRank: number, ...otherArgs: unknown[]) => {
             str: string;
@@ -43,5 +55,25 @@ export declare const situationsGeometric: (SituationGeometric & {
             str: string;
         };
     };
-})[];
+    variationFindRank: {
+        getCorrectionStuff: (initial: number, reason: number, firstRank: number, ...otherArgs: unknown[]) => {
+            str: string;
+        };
+        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;
+    };
+    type: "factor" | "factorPercentage" | "evo" | "evoPercentage";
+    randInitial: () => number;
+    randReason: () => number;
+    randSuperfluousData: () => SituationGeometricSuperfluousData;
+    randThreshold: (initial: number, reason: number, firstRank: number) => number;
+    rankDecoder: RankDecoder;
+    digitsValue: number;
+    digitsTarget: number;
+    getStrSituation: (initial: number, reason: number, firstRank: number, superfluousData?: SituationGeometricSuperfluousData) => string;
+}[];
 //# sourceMappingURL=seqGeometricSituations.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"seqGeometricSituations.d.ts","sourceRoot":"","sources":["../../../../../src/math/utils/sequences/situations/seqGeometricSituations.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAalE,MAAM,MAAM,2BAA2B,GAAG;IACxC,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,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,iCAAiC,GAAG;IAC9C,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG;IAC/B,IAAI,EAAE,QAAQ,GAAG,kBAAkB,GAAG,KAAK,GAAG,eAAe,CAAC;IAC9D,WAAW,EAAE,MAAM,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,MAAM,CAAC;IACzB,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;IAC7D,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,iCAAiC,KAChD,MAAM,CAAC;IAEZ,4BAA4B,EAAE,2BAA2B,CAAC;IAC1D,8BAA8B,EAAE,2BAA2B,CAAC;IAE5D,uBAAuB,EAAE,2BAA2B,CAAC;CAItD,CAAC;AA42CF,eAAO,MAAM,mBAAmB;;sCAz1Cb,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;;;;IAsxC9B,CAAC"}
+{"version":3,"file":"seqGeometricSituations.d.ts","sourceRoot":"","sources":["../../../../../src/math/utils/sequences/situations/seqGeometricSituations.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAgBlE,MAAM,MAAM,2BAA2B,GAAG;IACxC,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,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,iCAAiC,GAAG;IAC9C,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAEF,MAAM,MAAM,2CAA2C,GAAG;IACxD,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,kBAAkB,GAAG;IAC/B,IAAI,EAAE,QAAQ,GAAG,kBAAkB,GAAG,KAAK,GAAG,eAAe,CAAC;IAC9D,WAAW,EAAE,MAAM,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,MAAM,CAAC;IACzB,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;IAC7D,aAAa,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC;IAC9E,WAAW,EAAE,WAAW,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IAErB,eAAe,EAAE,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,eAAe,CAAC,EAAE,iCAAiC,KAChD,MAAM,CAAC;IAEZ,4BAA4B,EAAE,2BAA2B,CAAC;IAC1D,8BAA8B,EAAE,2BAA2B,CAAC;IAE5D,uBAAuB,EAAE,2BAA2B,CAAC;IAErD,iBAAiB,EAAE,2CAA2C,CAAC;CAEhE,CAAC;AAozDF,eAAO,MAAM,mBAAmB;;sCA/xDX,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;;;;;sCAsCZ,MAAM,UACP,MAAM,aACH,MAAM,gBACH,OAAO,EAAE;;;yBAlLhB,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB,MAAM;wBAEK,CACd,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,GAAG,SAAS,EAAE,OAAO,EAAE,KACpB;YAAE,UAAU,EAAE,aAAa,CAAC;YAAC,QAAQ,EAAE,aAAa,CAAA;SAAE;iBAElD,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,OAAO,EAAE,KAAK,MAAM;;UAUzD,QAAQ,GAAG,kBAAkB,GAAG,KAAK,GAAG,eAAe;iBAChD,MAAM,MAAM;gBACb,MAAM,MAAM;yBACH,MAAM,iCAAiC;mBAC7C,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,MAAM;iBAChE,WAAW;iBACX,MAAM;kBACL,MAAM;qBAEH,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,eAAe,CAAC,EAAE,iCAAiC,KAChD,MAAM;GA+zDZ,CAAC"}