math-exercises 3.0.9 → 3.0.11

package/lib/exercises/math/functions/trinoms/equation/secondDegreeInequation.js

@@ -0,0 +1,102 @@
+import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinctQuestions.js";
+import { InequationSymbol, InequationSymbolConstructor, } from "../../../../../math/inequations/inequation.js";
+import { Trinom } from "../../../../../math/polynomials/trinom.js";
+import { randint } from "../../../../../math/utils/random/randint.js";
+import { InequationSolutionNode } from "../../../../../tree/nodes/inequations/inequationSolutionNode.js";
+import { MinusInfinityNode, PlusInfinityNode, } from "../../../../../tree/nodes/numbers/infiniteNode.js";
+import { NumberNode } from "../../../../../tree/nodes/numbers/numberNode.js";
+import { ClosureType } from "../../../../../tree/nodes/sets/closure.js";
+import { IntervalNode } from "../../../../../tree/nodes/sets/intervalNode.js";
+import { UnionIntervalNode } from "../../../../../tree/nodes/sets/unionIntervalNode.js";
+import { unionIntervalParser } from "../../../../../tree/parsers/unionIntervalParser.js";
+import { handleVEAError } from "../../../../../utils/errors/handleVEAError.js";
+const getAnswer = ({ a, roots, ineqType }) => {
+    const aPositive = a > 0;
+    const insideInterval = new IntervalNode(roots[0], roots[1], ineqType.isStrict ? ClosureType.OO : ClosureType.FF);
+    const outsideUnion = new UnionIntervalNode([
+        new IntervalNode(MinusInfinityNode, roots[0], ineqType.isStrict ? ClosureType.OO : ClosureType.OF),
+        new IntervalNode(roots[1], PlusInfinityNode, ineqType.isStrict ? ClosureType.OO : ClosureType.FO),
+    ]);
+    const tree = ineqType.isSup
+        ? aPositive
+            ? outsideUnion
+            : insideInterval
+        : aPositive
+            ? insideInterval
+            : outsideUnion;
+    return new InequationSolutionNode(tree);
+};
+const getSecondDegreeInequationQuestion = () => {
+    const a = randint(-5, 6, [0]);
+    const x1 = randint(-5, 6);
+    const x2 = randint(-5, 6, [x1]);
+    const roots = x1 < x2
+        ? [new NumberNode(x1), new NumberNode(x2)]
+        : [new NumberNode(x2), new NumberNode(x1)];
+    const c = a * x1 * x2;
+    const b = -a * x2 - a * x1;
+    const trinom = new Trinom(a, b, c);
+    const ineqType = InequationSymbolConstructor.random();
+    const answer = getAnswer({ a: trinom.a, roots, ineqType }).toTex();
+    const question = {
+        answer,
+        instruction: `Soit $f(x) = ${trinom
+            .toTree()
+            .toTex()}$. Résoudre l'inéquation $f(x) ${ineqType.symbol} 0$.`,
+        keys: [
+            "S",
+            "equal",
+            "lbracket",
+            "semicolon",
+            "rbracket",
+            "cup",
+            "infty",
+            "varnothing",
+        ],
+        answerFormat: "tex",
+        identifiers: {
+            a: trinom.a,
+            b: trinom.b,
+            c: trinom.c,
+            ineqType: ineqType.symbol,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b, c, ineqType }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    const roots = new Trinom(a, b, c).getRootsNode();
+    const ineq = new InequationSymbol(ineqType);
+    tryToAddWrongProp(propositions, getAnswer({ a: -a, ineqType: ineq, roots }).toTex());
+    tryToAddWrongProp(propositions, getAnswer({ a, ineqType: ineq.toStrictnessToggled(), roots }).toTex());
+    tryToAddWrongProp(propositions, getAnswer({ a: -a, ineqType: ineq.toStrictnessToggled(), roots }).toTex());
+    return shuffleProps(propositions, n);
+};
+const isAnswerValid = (ans, { answer, a, b, c, ineqType }) => {
+    try {
+        const parsed = unionIntervalParser(ans.replaceAll("S", "").replaceAll("=", ""));
+        if (!parsed)
+            return false;
+        return "S=\\ " + parsed.simplify().toTex() === answer;
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+export const secondDegreeInequation = {
+    id: "secondDegreeInequation",
+    connector: "\\iff",
+    label: "Résoudre une inéquation du second degré",
+    levels: ["1reSpé"],
+    isSingleStep: true,
+    sections: ["Inéquations", "Second degré"],
+    generator: (nb) => getDistinctQuestions(getSecondDegreeInequationQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    pdfOptions: { shouldSpreadPropositions: true },
+};

package/lib/exercises/math/functions/trinoms/equation/solveSecondDegreeEquationByFactorisation.d.ts

@@ -0,0 +1,9 @@
+import { Exercise } from "../../../../../exercises/exercise.js";
+type Identifiers = {
+    a: number;
+    b: number;
+    type: number;
+};
+export declare const solveSecondDegreeEquationByFactorisation: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=solveSecondDegreeEquationByFactorisation.d.ts.map

package/lib/exercises/math/functions/trinoms/equation/solveSecondDegreeEquationByFactorisation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"solveSecondDegreeEquationByFactorisation.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/equation/solveSecondDegreeEquationByFactorisation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,6BAA6B,CAAC;AAgBrC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAgIF,eAAO,MAAM,wCAAwC,EAAE,QAAQ,CAAC,WAAW,CAiB1E,CAAC"}

package/lib/exercises/math/functions/trinoms/equation/solveSecondDegreeEquationByFactorisation.js

@@ -0,0 +1,131 @@
+import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinctQuestions.js";
+import { equationKeys } from "../../../../../exercises/utils/keys/equationKeys.js";
+import { Rational } from "../../../../../math/numbers/rationals/rational.js";
+import { Trinom } from "../../../../../math/polynomials/trinom.js";
+import { randint } from "../../../../../math/utils/random/randint.js";
+import { EquationSolutionNode } from "../../../../../tree/nodes/equations/equationSolutionNode.js";
+import { DiscreteSetNode } from "../../../../../tree/nodes/sets/discreteSetNode.js";
+import { coinFlip } from "../../../../../utils/alea/coinFlip.js";
+/**
+ * Equation donnée sous forme ax^2 + bx ou bien forme développée d'une identité remarquable
+ * type 1 ax^2 + bx
+ * type 2 (ax+b)^2
+ * type 3 (ax-b)^2
+ * type 4 (ax+b)(ax-b)
+ */
+const getSolveSecondDegreeEquationByFactorisationQuestion = () => {
+    const type = randint(1, 4);
+    let statement = "";
+    let roots = [];
+    let answer = "";
+    let a;
+    let b;
+    switch (type) {
+        case 1:
+            {
+                //ax^2 + bx
+                const trinom = new Trinom(randint(-9, 10, [0]), randint(-9, 10), 0);
+                a = trinom.a;
+                b = trinom.b;
+                statement = trinom.toTex();
+                roots = trinom.getRootsNode();
+            }
+            break;
+        case 2:
+            {
+                //(ax+b)^2
+                a = randint(-9, 10, [0]);
+                b = randint(1, 10);
+                statement = new Trinom(a ** 2, 2 * a * b, b ** 2).toTex();
+                roots = [new Rational(-b, a).simplify().toTree()];
+            }
+            break;
+        case 3:
+            {
+                //(ax-b)^2
+                a = randint(-9, 10, [0]);
+                b = randint(-9, 0, [0]);
+                statement = new Trinom(a ** 2, -2 * a * b, b ** 2).toTex();
+                roots = [new Rational(b, a).simplify().toTree()];
+            }
+            break;
+        case 4:
+        default:
+            {
+                //(ax+b)(ax-b)
+                a = randint(-9, 10, [0]);
+                b = randint(1, 10);
+                statement = new Trinom(a ** 2, 0, -(b ** 2)).toTex();
+                roots = [b, -b].sort((a, b) => a - b).map((x) => x.toTree());
+            }
+            break;
+    }
+    const instruction = `Soit $f(x) = ${statement}$. Factoriser $f(x)$, puis résoudre l'équation $f(x) = 0$.`;
+    answer = new EquationSolutionNode(new DiscreteSetNode(roots)).toTex();
+    const question = {
+        answer,
+        instruction,
+        keys: [...equationKeys],
+        answerFormat: "tex",
+        identifiers: { a, b, type },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    while (propositions.length < n) {
+        const firstRoot = randint(-10, 10);
+        tryToAddWrongProp(propositions, new EquationSolutionNode(new DiscreteSetNode(coinFlip()
+            ? [firstRoot.toTree()]
+            : [firstRoot, randint(-10, 10, [firstRoot])]
+                .sort((a, b) => a - b)
+                .map((x) => x.toTree()))).toTex());
+    }
+    return shuffleProps(propositions, n);
+};
+const isAnswerValid = (ans, { answer, type, a, b }) => {
+    let roots = [];
+    switch (type) {
+        case 1:
+            {
+                const trinom = new Trinom(a, b, 0);
+                roots = trinom.getRootsNode();
+            }
+            break;
+        case 2:
+            {
+                roots = [new Rational(-b, a).simplify().toTree()];
+            }
+            break;
+        case 3:
+            {
+                roots = [new Rational(b, a).simplify().toTree()];
+            }
+            break;
+        case 4:
+            {
+                roots = [b, -b].sort((a, b) => a - b).map((x) => x.toTree());
+            }
+            break;
+    }
+    const answerTree = new EquationSolutionNode(new DiscreteSetNode(roots), {
+        opts: { allowFractionToDecimal: true, allowRawRightChildAsSolution: true },
+    });
+    return answerTree.toAllValidTexs().includes(ans);
+};
+export const solveSecondDegreeEquationByFactorisation = {
+    id: "solveSecondDegreeEquationByFactorisation",
+    connector: "\\iff",
+    label: "Résoudre une équation du second degré par factorisation",
+    levels: [],
+    isSingleStep: true,
+    sections: [],
+    generator: (nb) => getDistinctQuestions(getSolveSecondDegreeEquationByFactorisationQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/functions/trinoms/equation/solveSecondDegreeEquationFromCano.d.ts

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

package/lib/exercises/math/functions/trinoms/equation/solveSecondDegreeEquationFromCano.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"solveSecondDegreeEquationFromCano.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/equation/solveSecondDegreeEquationFromCano.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAUrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AAkEF,eAAO,MAAM,iCAAiC,EAAE,QAAQ,CAAC,WAAW,CAcnE,CAAC"}

package/lib/exercises/math/functions/trinoms/equation/solveSecondDegreeEquationFromCano.js

@@ -0,0 +1,69 @@
+import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinctQuestions.js";
+import { equationKeys } from "../../../../../exercises/utils/keys/equationKeys.js";
+import { TrinomConstructor } from "../../../../../math/polynomials/trinom.js";
+import { randint } from "../../../../../math/utils/random/randint.js";
+import { EquationSolutionNode } from "../../../../../tree/nodes/equations/equationSolutionNode.js";
+import { DiscreteSetNode } from "../../../../../tree/nodes/sets/discreteSetNode.js";
+const getInstruction = (identifiers) => {
+    const { coeffs } = identifiers;
+    const trinom = TrinomConstructor.fromCoeffs(coeffs);
+    const statement = trinom.getCanonicalForm().toTex();
+    return `Soit $f$ la fonction définie sur $\\mathbb{R}$ par : 
+  
+$$
+f(x) = ${statement}
+$$
+
+Résoudre l'équation $f(x) = 0$.`;
+};
+const getAnswer = (identifiers) => {
+    const { coeffs } = identifiers;
+    const trinom = TrinomConstructor.fromCoeffs(coeffs);
+    const roots = trinom.getRootsNode();
+    const answer = new EquationSolutionNode(new DiscreteSetNode(roots)).toTex();
+    return answer;
+};
+const getSolveSecondDegreeEquationFromCanoQuestion = () => {
+    const trinom = TrinomConstructor.randomNiceRootsAndSummit();
+    const identifiers = { coeffs: trinom.coefficients };
+    const question = {
+        answer: getAnswer(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: [...equationKeys],
+        answerFormat: "tex",
+        identifiers,
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    while (propositions.length < n) {
+        tryToAddWrongProp(propositions, new EquationSolutionNode(new DiscreteSetNode([randint(-9, 0), randint(1, 10)].map((e) => e.toTree()))).toTex());
+    }
+    return shuffleProps(propositions, n);
+};
+const isAnswerValid = (ans, { answer, coeffs }) => {
+    const trinom = TrinomConstructor.fromCoeffs(coeffs);
+    const roots = trinom.getRootsNode();
+    const answerTree = new EquationSolutionNode(new DiscreteSetNode(roots), {
+        opts: { allowFractionToDecimal: true, allowRawRightChildAsSolution: true },
+    });
+    const texs = answerTree.toAllValidTexs();
+    return texs.includes(ans);
+};
+export const solveSecondDegreeEquationFromCano = {
+    id: "solveSecondDegreeEquationFromCano",
+    connector: "\\iff",
+    label: "Résoudre une équation du type $a(x-b)^2 + c = 0$",
+    levels: [],
+    isSingleStep: true,
+    sections: [],
+    generator: (nb) => getDistinctQuestions(getSolveSecondDegreeEquationFromCanoQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+};

package/lib/exercises/math/functions/trinoms/factoForm/factorizedFormFromRoots.d.ts

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

package/lib/exercises/math/functions/trinoms/factoForm/factorizedFormFromRoots.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"factorizedFormFromRoots.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/factoForm/factorizedFormFromRoots.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,6BAA6B,CAAC;AAgBrC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA+EF,eAAO,MAAM,uBAAuB,EAAE,QAAQ,CAAC,WAAW,CAezD,CAAC"}

package/lib/exercises/math/functions/trinoms/factoForm/factorizedFormFromRoots.js

@@ -0,0 +1,72 @@
+import { addValidProp, shuffleProps, tryToAddWrongProp, } from "../../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../../exercises/utils/getDistinctQuestions.js";
+import { randint } from "../../../../../math/utils/random/randint.js";
+import { multiply, } from "../../../../../tree/nodes/operators/multiplyNode.js";
+import { square } from "../../../../../tree/nodes/operators/powerNode.js";
+import { substract, } from "../../../../../tree/nodes/operators/substractNode.js";
+import { probaFlip } from "../../../../../utils/alea/probaFlip.js";
+const getAnswerNode = (roots, a) => {
+    const isSingleRoot = roots.length === 1;
+    return isSingleRoot
+        ? multiply(a, square(substract("x", roots[0]))).simplify({
+            keepPowers: true,
+        })
+        : multiply(multiply(a, substract("x", roots[0])), substract("x", roots[1])).simplify();
+};
+const getInstruction = (identifiers) => {
+    const { a, roots } = identifiers;
+    return `Soit $f(x) = ax^2 + bx + c$ un polynôme du second degré avec $a = ${a}$ et qui a ${roots.length === 1
+        ? `pour seule racine : $${roots[0]}$`
+        : `deux racines : $${roots[0]}$ et $${roots[1]}$`}. Déterminer la forme factorisée de $f$.`;
+};
+const getFactorizedFormFromRootsQuestion = () => {
+    const a = randint(-10, 10, [0]);
+    const firstRoot = randint(-10, 10);
+    const secondRoot = randint(-10, 10, [firstRoot]);
+    const isSingleRoot = probaFlip(0.3);
+    const roots = isSingleRoot
+        ? [firstRoot]
+        : [firstRoot, secondRoot].sort((a, b) => a - b);
+    const answer = getAnswerNode(roots, a);
+    const answerTex = answer.toTex();
+    const identifiers = { a, roots };
+    const question = {
+        answer: answerTex,
+        instruction: getInstruction(identifiers),
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers,
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, roots }) => {
+    const propositions = [];
+    addValidProp(propositions, answer);
+    tryToAddWrongProp(propositions, getAnswerNode(roots.map((r) => -r), a).toTex());
+    while (propositions.length < n) {
+        const x1 = randint(-10, 10);
+        const x2 = randint(-10, 10, [x1]);
+        tryToAddWrongProp(propositions, getAnswerNode([x1, x2].sort((a, b) => a - b), randint(-10, 10, [0])).toTex());
+    }
+    return shuffleProps(propositions, n);
+};
+const isAnswerValid = (ans, { answer, a, roots }) => {
+    const answerNode = getAnswerNode(roots, a);
+    const texs = answerNode.toAllValidTexs();
+    return texs.includes(ans);
+};
+export const factorizedFormFromRoots = {
+    id: "factorizedFormFromRoots",
+    connector: "=",
+    label: "Déterminer la forme factorisée en connaissant les racines",
+    levels: ["1rePro", "1reSpé"],
+    isSingleStep: true,
+    sections: ["Second degré"],
+    generator: (nb) => getDistinctQuestions(getFactorizedFormFromRootsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    subject: "Mathématiques",
+    getInstruction,
+};

package/lib/exercises/math/functions/trinoms/factoForm/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./factorizedFormFromRoots.js";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/functions/trinoms/factoForm/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/factoForm/index.ts"],"names":[],"mappings":"AAAA,cAAc,8BAA8B,CAAC"}

package/lib/exercises/math/functions/trinoms/factoForm/index.js

@@ -0,0 +1 @@
+export * from "./factorizedFormFromRoots.js";

package/lib/exercises/math/functions/trinoms/index.d.ts

@@ -1,25 +1,9 @@
-export * from "./alphaBetaFromDevForm.js";
-export * from "./alphaBetaInCanonicalForm.js";
-export * from "./canonicalFromDevForm.js";
-export * from "./deltaTrinom.js";
-export * from "./extremumFromCanonicalForm.js";
-export * from "./extremumTypeFromAlgebricForm.js";
-export * from "./niceRootsFromDevForm.js";
-export * from "./rootsFromDevForm.js";
-export * from "./rootsFromFactorizedForm.js";
-export * from "./variationsFromAlgebricForm.js";
-export * from "./secondDegreeInequation.js";
-export * from "./rootsReading.js";
-export * from "./factorizedFormFromRoots.js";
-export * from "./summitReading.js";
-export * from "./summitAbscissFromRoots.js";
-export * from "./summitAbscissFromDevForm.js";
 export * from "./trinomialMeanValue.js";
-export * from "./solveSecondDegreeEquationByFactorisation.js";
-export * from "./solveSecondDegreeEquationFromCano.js";
-export * from "./trinomSignFromRoots.js";
-export * from "./coefficientsIdentification.js";
-export * from "./rootsSum.js";
-export * from "./rootsProduct.js";
-export * from "./findSecondRoot.js";
+export * from "./devForm/index.js";
+export * from "./equation/index.js";
+export * from "./factoForm/index.js";
+export * from "./roots/index.js";
+export * from "./sign/index.js";
+export * from "./summitAndCanonical/index.js";
+export * from "./parabole/index.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/functions/trinoms/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/trinoms/index.ts"],"names":[],"mappings":"AAAA,cAAc,2BAA2B,CAAC;AAC1C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,kBAAkB,CAAC;AACjC,cAAc,gCAAgC,CAAC;AAC/C,cAAc,mCAAmC,CAAC;AAClD,cAAc,2BAA2B,CAAC;AAC1C,cAAc,uBAAuB,CAAC;AACtC,cAAc,8BAA8B,CAAC;AAC7C,cAAc,iCAAiC,CAAC;AAChD,cAAc,6BAA6B,CAAC;AAC5C,cAAc,mBAAmB,CAAC;AAClC,cAAc,8BAA8B,CAAC;AAC7C,cAAc,oBAAoB,CAAC;AACnC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,yBAAyB,CAAC;AACxC,cAAc,+CAA+C,CAAC;AAC9D,cAAc,wCAAwC,CAAC;AACvD,cAAc,0BAA0B,CAAC;AACzC,cAAc,iCAAiC,CAAC;AAChD,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/functions/trinoms/index.ts"],"names":[],"mappings":"AAAA,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC;AACnC,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC;AACrC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,+BAA+B,CAAC;AAC9C,cAAc,qBAAqB,CAAC"}

package/lib/exercises/math/functions/trinoms/index.js

@@ -1,24 +1,8 @@
-export * from "./alphaBetaFromDevForm.js";
-export * from "./alphaBetaInCanonicalForm.js";
-export * from "./canonicalFromDevForm.js";
-export * from "./deltaTrinom.js";
-export * from "./extremumFromCanonicalForm.js";
-export * from "./extremumTypeFromAlgebricForm.js";
-export * from "./niceRootsFromDevForm.js";
-export * from "./rootsFromDevForm.js";
-export * from "./rootsFromFactorizedForm.js";
-export * from "./variationsFromAlgebricForm.js";
-export * from "./secondDegreeInequation.js";
-export * from "./rootsReading.js";
-export * from "./factorizedFormFromRoots.js";
-export * from "./summitReading.js";
-export * from "./summitAbscissFromRoots.js";
-export * from "./summitAbscissFromDevForm.js";
 export * from "./trinomialMeanValue.js";
-export * from "./solveSecondDegreeEquationByFactorisation.js";
-export * from "./solveSecondDegreeEquationFromCano.js";
-export * from "./trinomSignFromRoots.js";
-export * from "./coefficientsIdentification.js";
-export * from "./rootsSum.js";
-export * from "./rootsProduct.js";
-export * from "./findSecondRoot.js";
+export * from "./devForm/index.js";
+export * from "./equation/index.js";
+export * from "./factoForm/index.js";
+export * from "./roots/index.js";
+export * from "./sign/index.js";
+export * from "./summitAndCanonical/index.js";
+export * from "./parabole/index.js";

package/lib/exercises/math/functions/trinoms/parabole/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./paraboleExpressionReading.js";
+export * from "./trinomSymetryAxisFromFacto.js";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/math/functions/trinoms/parabole/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/parabole/index.ts"],"names":[],"mappings":"AAAA,cAAc,gCAAgC,CAAC;AAC/C,cAAc,iCAAiC,CAAC"}

package/lib/exercises/math/functions/trinoms/parabole/index.js

@@ -0,0 +1,2 @@
+export * from "./paraboleExpressionReading.js";
+export * from "./trinomSymetryAxisFromFacto.js";

package/lib/exercises/math/functions/trinoms/parabole/paraboleExpressionReading.d.ts

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

package/lib/exercises/math/functions/trinoms/parabole/paraboleExpressionReading.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"paraboleExpressionReading.d.ts","sourceRoot":"","sources":["../../../../../../src/exercises/math/functions/trinoms/parabole/paraboleExpressionReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAkBT,MAAM,6BAA6B,CAAC;AAgBrC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;CAIpB,CAAC;AAoSF,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,WAAW,CAmB3D,CAAC"}