math-exercises 2.0.34 → 2.0.36

package/lib/exercises/calculLitteral/simplifying/distributeAndSimplify.d.ts

@@ -0,0 +1,14 @@
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    firstTermIsAffine: boolean;
+    a: number;
+    b: number;
+    c: number;
+    d: number;
+    e: number;
+    f: number;
+    g: number;
+};
+export declare const distributeAndSimplify: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=distributeAndSimplify.d.ts.map

package/lib/exercises/calculLitteral/simplifying/distributeAndSimplify.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"distributeAndSimplify.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/distributeAndSimplify.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA2DF,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,WAAW,CAa3D,CAAC"}

package/lib/exercises/calculLitteral/simplifying/distributeAndSimplify.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.distributeAndSimplify = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const affine_1 = require("../../../math/polynomials/affine");
+const randint_1 = require("../../../math/utils/random/randint");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+//[a]|[b*(cx+d)] +- e*(fx+g)]
+// c & f > 0
+const getDistributeAndSimplifyQuestion = () => {
+    const firstTermIsAffine = (0, coinFlip_1.coinFlip)();
+    const a = (0, randint_1.randint)(-5, 6, [0]);
+    const b = (0, randint_1.randint)(-5, 6, [0]);
+    const c = (0, randint_1.randint)(1, 6);
+    const d = (0, randint_1.randint)(-5, 6, [0]);
+    const e = (0, randint_1.randint)(-5, 6, [0, 1]);
+    let f = 0;
+    do {
+        f = (0, randint_1.randint)(1, 6);
+    } while (b * c + e * f === 0);
+    const g = (0, randint_1.randint)(-5, 6, [0]);
+    const statement = new addNode_1.AddNode(firstTermIsAffine
+        ? new multiplyNode_1.MultiplyNode(b.toTree(), new affine_1.Affine(c, d).toTree())
+        : a.toTree(), new multiplyNode_1.MultiplyNode(e.toTree(), new affine_1.Affine(f, g).toTree())).simplify();
+    const answer = firstTermIsAffine
+        ? new affine_1.Affine(b * c + e * f, b * d + e * g).toTree().toTex()
+        : new affine_1.Affine(e * f, a + e * g).toTree().toTex();
+    const question = {
+        answer,
+        instruction: `Développer et réduire : $${statement.toTex()}$`,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: { firstTermIsAffine, a, b, c, d, e, f, g },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, affine_1.AffineConstructor.random().toTree().toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, firstTermIsAffine, a, b, c, d, e, f, g }) => {
+    const answerNode = firstTermIsAffine
+        ? new affine_1.Affine(b * c + e * f, b * d + e * g).toTree()
+        : new affine_1.Affine(e * f, a + e * g).toTree();
+    const texs = answerNode.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.distributeAndSimplify = {
+    id: "distributeAndSimplify",
+    connector: "=",
+    label: "Développer et réduire une expression",
+    levels: ["4ème", "3ème", "2nde"],
+    isSingleStep: true,
+    sections: ["Calcul littéral"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getDistributeAndSimplifyQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/calculLitteral/simplifying/index.d.ts

@@ -1,3 +1,4 @@
 export * from "./evaluateExpression";
 export * from "./reduceExpression";
+export * from "./distributeAndSimplify";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/calculLitteral/simplifying/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/simplifying/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC;AACnC,cAAc,yBAAyB,CAAC"}

package/lib/exercises/calculLitteral/simplifying/index.js

@@ -16,3 +16,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./evaluateExpression"), exports);
 __exportStar(require("./reduceExpression"), exports);
+__exportStar(require("./distributeAndSimplify"), exports);

package/lib/exercises/equaDiff/equaDiffCheckSolutionFirstOrder.d.ts

@@ -0,0 +1,10 @@
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
+    type: string;
+    d: number;
+    e: number;
+    f: number | undefined;
+};
+export declare const equaDiffCheckSolutionFirstOrder: MathExercise<Identifiers>;
+export {};
+//# sourceMappingURL=equaDiffCheckSolutionFirstOrder.d.ts.map

package/lib/exercises/equaDiff/equaDiffCheckSolutionFirstOrder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equaDiffCheckSolutionFirstOrder.d.ts","sourceRoot":"","sources":["../../../src/exercises/equaDiff/equaDiffCheckSolutionFirstOrder.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAgBlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AAkHF,eAAO,MAAM,+BAA+B,EAAE,YAAY,CAAC,WAAW,CAcrE,CAAC"}

package/lib/exercises/equaDiff/equaDiffCheckSolutionFirstOrder.js

@@ -0,0 +1,101 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.equaDiffCheckSolutionFirstOrder = void 0;
+const exercise_1 = require("../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const affine_1 = require("../../math/polynomials/affine");
+const trinom_1 = require("../../math/polynomials/trinom");
+const randint_1 = require("../../math/utils/random/randint");
+const equalNode_1 = require("../../tree/nodes/equations/equalNode");
+const expNode_1 = require("../../tree/nodes/functions/expNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const coinFlip_1 = require("../../utils/coinFlip");
+const doWhile_1 = require("../../utils/doWhile");
+const random_1 = require("../../utils/random");
+const getEquaDiffCheckSolutionFirstOrderQuestion = () => {
+    //types : constante, affine, tirnom, exp
+    const type = (0, random_1.random)(["affine", "trinom", "exp"]);
+    const isSolution = (0, coinFlip_1.coinFlip)();
+    const answer = isSolution ? "Oui" : "Non";
+    let equaDiff;
+    let randomFunc;
+    let d;
+    let e;
+    let f;
+    switch (type) {
+        case "affine":
+            // y = y' + dx+e, alors y = ax+b
+            //ax+b = a + dx + e
+            //a = d et e = b-a
+            const affineSolution = affine_1.AffineConstructor.random();
+            d = affineSolution.a;
+            e = affineSolution.b - affineSolution.a;
+            const affine = new affine_1.Affine(d, e);
+            equaDiff = new equalNode_1.EqualNode(new variableNode_1.VariableNode("y"), new addNode_1.AddNode(new variableNode_1.VariableNode("y'"), affine.toTree()));
+            randomFunc = isSolution
+                ? affineSolution.toTree()
+                : (0, doWhile_1.doWhile)(() => affine_1.AffineConstructor.random(), (P) => P.equals(affineSolution)).toTree();
+            break;
+        case "trinom":
+            /**y = y' + dx^2+ex+f, alors y = ax^2+bx+c */
+            const trinomSolution = trinom_1.TrinomConstructor.random();
+            d = trinomSolution.a;
+            e = trinomSolution.b - 2 * trinomSolution.a;
+            f = trinomSolution.c - trinomSolution.b;
+            const trinom = new trinom_1.Trinom(d, e, f);
+            equaDiff = new equalNode_1.EqualNode(new variableNode_1.VariableNode("y"), new addNode_1.AddNode(new variableNode_1.VariableNode("y'"), trinom.toTree()));
+            randomFunc = isSolution
+                ? trinomSolution.toTree()
+                : (0, doWhile_1.doWhile)(() => trinom_1.TrinomConstructor.random(), (P) => P.equals(trinomSolution)).toTree();
+            break;
+        case "exp":
+            /**y = y' +d exp(e*x), alors y = a exp(e*x) */
+            //a exp(ex) = ae*exp(ex) + dexp(e*x)
+            //a = ae + d
+            //d/(1-e) == a
+            e = (0, randint_1.randint)(-4, 5, [0, 1]);
+            const a = (0, randint_1.randint)(-5, 5, [0]);
+            d = a - a * e;
+            const expSolution = new multiplyNode_1.MultiplyNode(a.toTree(), new expNode_1.ExpNode(new multiplyNode_1.MultiplyNode(e.toTree(), new variableNode_1.VariableNode("x"))));
+            const exp = new multiplyNode_1.MultiplyNode(d.toTree(), new expNode_1.ExpNode(new multiplyNode_1.MultiplyNode(e.toTree(), new variableNode_1.VariableNode("x"))));
+            equaDiff = new equalNode_1.EqualNode(new variableNode_1.VariableNode("y"), new addNode_1.AddNode(new variableNode_1.VariableNode("y'"), exp));
+            randomFunc = isSolution
+                ? expSolution
+                : (0, doWhile_1.doWhile)(() => new multiplyNode_1.MultiplyNode((0, randint_1.randint)(-5, 5, [0]).toTree(), new expNode_1.ExpNode(new multiplyNode_1.MultiplyNode(e.toTree(), new variableNode_1.VariableNode("x")))), (P) => P.equals(expSolution));
+            break;
+    }
+    const question = {
+        answer,
+        instruction: `Soit l'équation différentielle suivante : $${equaDiff.toTex()}$. La fonction $y = ${randomFunc.toTex()}$ est-elle solution de cette équation ?`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { type, d, e, f },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer, "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Oui", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "Non", "raw");
+    (0, exercise_1.tryToAddWrongProp)(propositions, "On ne peut pas savoir", "raw");
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
+exports.equaDiffCheckSolutionFirstOrder = {
+    id: "equaDiffCheckSolutionFirstOrder",
+    label: "Vérifier si une fonction est solution d'une équation différentielle du premier ordre",
+    levels: ["TermTech", "MathComp", "TermSpé"],
+    isSingleStep: true,
+    sections: ["Équations différentielles"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEquaDiffCheckSolutionFirstOrderQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+    answerType: "QCM",
+};

package/lib/exercises/equaDiff/index.d.ts

@@ -1,3 +1,4 @@
 export * from "./equaDiffGeneralForme";
 export * from "./equaDiffGeneralFormeWithIC";
+export * from "./equaDiffCheckSolutionFirstOrder";
 //# sourceMappingURL=index.d.ts.map

package/lib/exercises/equaDiff/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/equaDiff/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,8BAA8B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/equaDiff/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,8BAA8B,CAAC;AAC7C,cAAc,mCAAmC,CAAC"}

package/lib/exercises/equaDiff/index.js

@@ -16,3 +16,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./equaDiffGeneralForme"), exports);
 __exportStar(require("./equaDiffGeneralFormeWithIC"), exports);
+__exportStar(require("./equaDiffCheckSolutionFirstOrder"), exports);

package/lib/exercises/exercise.d.ts

@@ -25,6 +25,7 @@ export interface Question<TIdentifiers = {}> {
         isGridBold?: boolean;
         isGridSimple?: boolean;
         isAxesRatioFixed?: boolean;
+        isXAxesNatural?: boolean;
     };
     divisionFormat?: "fraction" | "obelus";
     identifiers: TIdentifiers;

package/lib/exercises/exercise.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,iBAAiB,UACrB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAUtB,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ,CAAC,YAAY,GAAG,EAAE;IACzC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE;QACR,YAAY,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;QACxC,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,UAAU,CAAC,EAAE,OAAO,CAAC;QACrB,YAAY,CAAC,EAAE,OAAO,CAAC;QACvB,gBAAgB,CAAC,EAAE,OAAO,CAAC;KAC5B,CAAC;IACF,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,WAAW,EAAE,YAAY,CAAC;CAC3B;AAED,MAAM,MAAM,YAAY,CAAC,YAAY,IAAI,CACvC,CAAC,EAAE,MAAM,EACT,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,WAAW,EAAE,CAAC;AACnB,MAAM,MAAM,GAAG,CAAC,YAAY,IAAI,CAC9B,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,OAAO,CAAC;AACb,MAAM,MAAM,iBAAiB,CAAC,YAAY,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,IAAI,CAChE,IAAI,CAAC,EAAE,QAAQ,KACZ,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC5B,MAAM,WAAW,YAAY,CAAC,YAAY,GAAG,EAAE;IAC7C,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,YAAY,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC;IAClE,aAAa,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;CACnC;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,8BAA8B,GAC9B,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,oBAAoB,GACpB,UAAU,GACV,mBAAmB,GACnB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,uBAAuB,GACvB,oBAAoB,GACpB,eAAe,GACf,gBAAgB,GAChB,UAAU,CAAC"}
+{"version":3,"file":"exercise.d.ts","sourceRoot":"","sources":["../../src/exercises/exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAI3C,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,YAAY,UAChB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAQtB,CAAC;AACF,eAAO,MAAM,iBAAiB,UACrB,WAAW,EAAE,aACT,MAAM,WACT,KAAK,GAAG,KAAK,SAUtB,CAAC;AAEF,eAAO,MAAM,YAAY,UAAW,WAAW,EAAE,KAAK,MAAM,kBAE3D,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAElC,MAAM,MAAM,WAAW,GAAG;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,OAAO,CAAC;IACvB,MAAM,EAAE,KAAK,GAAG,KAAK,CAAC;CACvB,CAAC;AACF,MAAM,WAAW,QAAQ,CAAC,YAAY,GAAG,EAAE;IACzC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,CAAC,EAAE;QACR,YAAY,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;QACxC,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,UAAU,CAAC,EAAE,OAAO,CAAC;QACrB,YAAY,CAAC,EAAE,OAAO,CAAC;QACvB,gBAAgB,CAAC,EAAE,OAAO,CAAC;QAC3B,cAAc,CAAC,EAAE,OAAO,CAAC;KAC1B,CAAC;IACF,cAAc,CAAC,EAAE,UAAU,GAAG,QAAQ,CAAC;IACvC,WAAW,EAAE,YAAY,CAAC;CAC3B;AAED,MAAM,MAAM,YAAY,CAAC,YAAY,IAAI,CACvC,CAAC,EAAE,MAAM,EACT,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,WAAW,EAAE,CAAC;AACnB,MAAM,MAAM,GAAG,CAAC,YAAY,IAAI,CAC9B,aAAa,EAAE,MAAM,EACrB,IAAI,EAAE;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,GAAG,YAAY,KACpC,OAAO,CAAC;AACb,MAAM,MAAM,iBAAiB,CAAC,YAAY,GAAG,EAAE,EAAE,QAAQ,GAAG,EAAE,IAAI,CAChE,IAAI,CAAC,EAAE,QAAQ,KACZ,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC5B,MAAM,WAAW,YAAY,CAAC,YAAY,GAAG,EAAE;IAC7C,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,OAAO,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,SAAS,CAAC,EAAE,GAAG,GAAG,OAAO,GAAG,UAAU,CAAC;IACvC,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,UAAU,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,YAAY,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC;IAClE,aAAa,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;CACnC;AAED,MAAM,MAAM,SAAS,GACjB,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,UAAU,GACV,SAAS,GACT,UAAU,GACV,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,SAAS,CAAC;AAEd,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,cAAc,GACd,iBAAiB,GACjB,SAAS,GACT,8BAA8B,GAC9B,aAAa,GACb,YAAY,GACZ,SAAS,GACT,0BAA0B,GAC1B,WAAW,GACX,2BAA2B,GAC3B,eAAe,GACf,eAAe,GACf,kBAAkB,GAClB,WAAW,GACX,mBAAmB,GACnB,wBAAwB,GACxB,WAAW,GACX,uBAAuB,GACvB,uBAAuB,GACvB,aAAa,GACb,aAAa,GACb,SAAS,GACT,qBAAqB,GACrB,oBAAoB,GACpB,UAAU,GACV,mBAAmB,GACnB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,kBAAkB,GAClB,kBAAkB,GAClB,YAAY,GACZ,iBAAiB,GACjB,cAAc,GACd,cAAc,GACd,QAAQ,GACR,uBAAuB,GACvB,oBAAoB,GACpB,eAAe,GACf,gBAAgB,GAChB,UAAU,CAAC"}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"factorizedFormFromRoots.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/factorizedFormFromRoots.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA8EF,eAAO,MAAM,uBAAuB,EAAE,YAAY,CAAC,WAAW,CAa7D,CAAC"}

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

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.factorizedFormFromRoots = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
+const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
+const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
+const probaFlip_1 = require("../../../utils/probaFlip");
+const getAnswer = (roots, a) => {
+    const isSingleRoot = roots.length === 1;
+    return isSingleRoot
+        ? new multiplyNode_1.MultiplyNode(a.toTree(), new powerNode_1.SquareNode(new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), roots[0].toTree()))).simplify({ keepPowers: true })
+        : new multiplyNode_1.MultiplyNode(new multiplyNode_1.MultiplyNode(a.toTree(), new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), roots[0].toTree())), new substractNode_1.SubstractNode(new variableNode_1.VariableNode("x"), roots[1].toTree())).simplify();
+};
+const getFactorizedFormFromRootsQuestion = () => {
+    const a = (0, randint_1.randint)(-10, 10, [0]);
+    const firstRoot = (0, randint_1.randint)(-10, 10);
+    const secondRoot = (0, randint_1.randint)(-10, 10, [firstRoot]);
+    const isSingleRoot = (0, probaFlip_1.probaFlip)(0.3);
+    const roots = isSingleRoot
+        ? [firstRoot]
+        : [firstRoot, secondRoot].sort((a, b) => a - b);
+    const answer = getAnswer(roots, a);
+    const answerTex = answer.toTex();
+    const question = {
+        answer: answerTex,
+        instruction: `Soit $f(x) = ax^2 + bx + c$ un polynôme du second degré avec $a = ${a}$ et qui a ${roots.length === 1
+            ? `une racine : $${roots[0]}$`
+            : `deux racines : $${roots[0]}$ et $${roots[1]}$`}. Déterminer la forme factorisée de $f$.`,
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: { a, roots },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, roots }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer(roots.map((r) => -r), a).toTex());
+    while (propositions.length < n) {
+        const x1 = (0, randint_1.randint)(-10, 10);
+        const x2 = (0, randint_1.randint)(-10, 10, [x1]);
+        (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer([x1, x2].sort((a, b) => a - b), (0, randint_1.randint)(-10, 10, [0])).toTex());
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, a, roots }) => {
+    const answerNode = getAnswer(roots, a);
+    const texs = answerNode.toAllValidTexs();
+    return texs.includes(ans);
+};
+exports.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) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactorizedFormFromRootsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

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

@@ -9,4 +9,9 @@ export * from "./rootsFromDevForm";
 export * from "./rootsFromFactorizedForm";
 export * from "./variationsFromAlgebricForm";
 export * from "./secondDegreeInequation";
+export * from "./rootsReading";
+export * from "./factorizedFormFromRoots";
+export * from "./summitReading";
+export * from "./summitAbscissFromRoots";
+export * from "./summitAbscissFromDevForm";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,wBAAwB,CAAC;AACvC,cAAc,eAAe,CAAC;AAC9B,cAAc,6BAA6B,CAAC;AAC5C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,wBAAwB,CAAC;AACvC,cAAc,oBAAoB,CAAC;AACnC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,0BAA0B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,4BAA4B,CAAC;AAC3C,cAAc,wBAAwB,CAAC;AACvC,cAAc,eAAe,CAAC;AAC9B,cAAc,6BAA6B,CAAC;AAC5C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,wBAAwB,CAAC;AACvC,cAAc,oBAAoB,CAAC;AACnC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,0BAA0B,CAAC;AACzC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,2BAA2B,CAAC;AAC1C,cAAc,iBAAiB,CAAC;AAChC,cAAc,0BAA0B,CAAC;AACzC,cAAc,4BAA4B,CAAC"}

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

@@ -25,3 +25,8 @@ __exportStar(require("./rootsFromDevForm"), exports);
 __exportStar(require("./rootsFromFactorizedForm"), exports);
 __exportStar(require("./variationsFromAlgebricForm"), exports);
 __exportStar(require("./secondDegreeInequation"), exports);
+__exportStar(require("./rootsReading"), exports);
+__exportStar(require("./factorizedFormFromRoots"), exports);
+__exportStar(require("./summitReading"), exports);
+__exportStar(require("./summitAbscissFromRoots"), exports);
+__exportStar(require("./summitAbscissFromDevForm"), exports);

package/lib/exercises/functions/trinoms/rootsReading.d.ts

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

package/lib/exercises/functions/trinoms/rootsReading.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rootsReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/rootsReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAuDF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAWlD,CAAC"}

package/lib/exercises/functions/trinoms/rootsReading.js

@@ -0,0 +1,67 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.rootsReading = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const colors_1 = require("../../../geogebra/colors");
+const geogebraConstructor_1 = require("../../../geogebra/geogebraConstructor");
+const trinom_1 = require("../../../math/polynomials/trinom");
+const randint_1 = require("../../../math/utils/random/randint");
+const getRootsReadingQuestion = () => {
+    const trinom = trinom_1.TrinomConstructor.randomNiceRoots((0, randint_1.randint)(1, 3));
+    const roots = trinom.getRoots();
+    const commands = [
+        `f(x) = ${trinom.toString()}`,
+        `SetColor(f, "${(0, colors_1.randomColor)()}")`,
+    ];
+    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
+        isGridSimple: true,
+        isAxesRatioFixed: false,
+        gridDistance: false,
+    });
+    const answer = roots.length === 1 ? roots[0].toString() : roots.join("\\text{ et }");
+    const question = {
+        answer,
+        instruction: `Déterminer graphiquement le ou les racine(s) du polynôme du second degré représenté ci-dessous : `,
+        keys: ["et", "aucun"],
+        answerFormat: "tex",
+        commands: ggb.commands,
+        options: ggb.getOptions(),
+        coords: trinom.getCoords(),
+        identifiers: { a: trinom.a, b: trinom.b, c: trinom.c },
+    };
+    return question;
+};
+const getPropositions = (n, { answer }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    while (propositions.length < n) {
+        const x1 = (0, randint_1.randint)(-10, 10);
+        const x2 = (0, randint_1.randint)(-10, 10, [x1]);
+        const fakeRoots = x1 > x2 ? [x2, x1] : [x1, x2];
+        (0, exercise_1.tryToAddWrongProp)(propositions, fakeRoots.join("\\text{ et }"));
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, a, b, c }) => {
+    const roots = new trinom_1.Trinom(a, b, c).getRoots();
+    const studentNumbers = ans
+        .split("\\text{ et }")
+        .map((n) => Number(n.replace(",", ".")))
+        .filter((n) => !isNaN(n))
+        .sort((a, b) => a - b);
+    return (!!studentNumbers.length &&
+        studentNumbers.every((nb, index) => Math.abs(nb - roots[index]) < 0.2));
+};
+exports.rootsReading = {
+    id: "rootsReading",
+    label: "Lire graphiquement les racines d'un trinôme",
+    levels: ["1reSpé", "1rePro"],
+    isSingleStep: true,
+    sections: ["Second degré"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRootsReadingQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/trinoms/summitAbscissFromDevForm.d.ts

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

package/lib/exercises/functions/trinoms/summitAbscissFromDevForm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"summitAbscissFromDevForm.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/summitAbscissFromDevForm.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AA8CF,eAAO,MAAM,wBAAwB,EAAE,YAAY,CAAC,WAAW,CAc9D,CAAC"}

package/lib/exercises/functions/trinoms/summitAbscissFromDevForm.js

@@ -0,0 +1,54 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.summitAbscissFromDevForm = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const trinom_1 = require("../../../math/polynomials/trinom");
+const randint_1 = require("../../../math/utils/random/randint");
+const getSummitAbscissFromDevFormQuestion = () => {
+    const trinom = trinom_1.TrinomConstructor.random();
+    const alpha = trinom.getAlphaNode();
+    const answer = alpha.toTex();
+    const question = {
+        answer,
+        instruction: `Soit $f(x) = ${trinom
+            .toTree()
+            .toTex()}$ une fonction polynôme du second degré. Quelle est l'abscisse du sommet de la parabole représentant $f$ ?`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { a: trinom.a, b: trinom.b, c: trinom.c },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b, c }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(-b, a).simplify().toTree().toTex());
+    (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(b, a).simplify().toTree().toTex());
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 10) + "");
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { a, b, c }) => {
+    const node = new rational_1.Rational(-b, 2 * a).simplify().toTree();
+    const texs = node.toAllValidTexs({
+        allowFractionToDecimal: true,
+        allowMinusAnywhereInFraction: true,
+    });
+    return texs.includes(ans);
+};
+exports.summitAbscissFromDevForm = {
+    id: "summitAbscissFromDevForm",
+    connector: "=",
+    label: "Déterminer l'abscisse du sommet d'une parabole en connaissant la forme développée",
+    levels: ["1rePro", "1reSpé", "1reTech"],
+    isSingleStep: true,
+    sections: ["Second degré"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSummitAbscissFromDevFormQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/trinoms/summitAbscissFromRoots.d.ts

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

package/lib/exercises/functions/trinoms/summitAbscissFromRoots.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"summitAbscissFromRoots.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/summitAbscissFromRoots.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAOlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAgDF,eAAO,MAAM,sBAAsB,EAAE,YAAY,CAAC,WAAW,CAc5D,CAAC"}

package/lib/exercises/functions/trinoms/summitAbscissFromRoots.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.summitAbscissFromRoots = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const rational_1 = require("../../../math/numbers/rationals/rational");
+const trinom_1 = require("../../../math/polynomials/trinom");
+const randint_1 = require("../../../math/utils/random/randint");
+const getSummitAbscissFromRootsQuestion = () => {
+    const trinom = trinom_1.TrinomConstructor.randomNiceRoots(2);
+    const roots = trinom.getRoots();
+    console.log("roots", roots);
+    const answer = new rational_1.Rational(roots[0] + roots[1], 2)
+        .simplify()
+        .toTree()
+        .toTex();
+    const question = {
+        answer,
+        instruction: `Soit $f(x) = ax^2+bx+c$ une fonction polynôme du second degé, dont les racines sont $${roots[0]}$ et $${roots[1]}$. Quelle est l'abscisse du sommet de la parabole représentant $f$ ?`,
+        keys: [],
+        answerFormat: "tex",
+        identifiers: { a: trinom.a, b: trinom.b, c: trinom.c },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, a, b, c }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const roots = new trinom_1.Trinom(a, b, c).getRoots();
+    (0, exercise_1.tryToAddWrongProp)(propositions, roots[0] + roots[1] + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, new rational_1.Rational(roots[0] - roots[1], 2).simplify().toTree().toTex());
+    while (propositions.length < n) {
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 11) + "");
+    }
+    return (0, exercise_1.shuffleProps)(propositions, n);
+};
+const isAnswerValid = (ans, { answer, a, b, c }) => {
+    const trinom = new trinom_1.Trinom(a, b, c);
+    console.log(ans, answer);
+    const node = trinom.getAlphaNode();
+    const texs = node.toAllValidTexs({
+        allowFractionToDecimal: true,
+        allowMinusAnywhereInFraction: true,
+    });
+    return texs.includes(ans);
+};
+exports.summitAbscissFromRoots = {
+    id: "summitAbscissFromRoots",
+    connector: "=",
+    label: "Déterminer l'abscisse du sommet d'une parabole en connaissant ses racines",
+    levels: ["1reSpé", "1rePro", "1reTech"],
+    isSingleStep: true,
+    sections: ["Second degré"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSummitAbscissFromRootsQuestion, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/trinoms/summitReading.d.ts

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

package/lib/exercises/functions/trinoms/summitReading.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"summitReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/summitReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAsDF,eAAO,MAAM,aAAa,EAAE,YAAY,CAAC,WAAW,CAWnD,CAAC"}