math-exercises 2.1.21 → 2.1.23

package/lib/exercises/functions/logarithm/logPowerEquation.js

@@ -1,103 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.log10PowerEquation = exports.logPowerEquation = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const equalNode_1 = require("../../../tree/nodes/equations/equalNode");
-const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
-const log10Node_1 = require("../../../tree/nodes/functions/log10Node");
-const logNode_1 = require("../../../tree/nodes/functions/logNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const powerNode_1 = require("../../../tree/nodes/operators/powerNode");
-const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-/**a*b^x+c=d */
-const getLogPowerEquationQuestion = (opts) => {
-    const powered = (0, randint_1.randint)(2, 8);
-    const a = (0, randint_1.randint)(1, 10, [powered]);
-    const c = (0, randint_1.randint)(-5, 5, [a]);
-    const k = (0, randint_1.randint)(5, 15, [powered]);
-    const d = k * a + c;
-    const xNode = new variableNode_1.VariableNode("x");
-    const poweredNode = new numberNode_1.NumberNode(powered);
-    const LNode = opts?.isLog10 ? log10Node_1.Log10Node : logNode_1.LogNode;
-    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
-        new fractionNode_1.FractionNode(new LNode(new numberNode_1.NumberNode(k)), new LNode(poweredNode)).simplify(),
-    ])).toTex();
-    const equation = new equalNode_1.EqualNode(new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new powerNode_1.PowerNode(poweredNode, xNode)), new numberNode_1.NumberNode(c)).simplify(), new numberNode_1.NumberNode(d));
-    const keys = [
-        "log",
-        "x",
-        "equal",
-        "S",
-        "lbrace",
-        "semicolon",
-        "rbrace",
-    ];
-    keys.push(opts?.isLog10 ? "log" : "ln");
-    const question = {
-        answer,
-        instruction: `Résoudre : $${equation.toTex()}$`,
-        keys,
-        answerFormat: "tex",
-        identifiers: { a, c, k, powered, isLog10: opts?.isLog10 ?? false },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, isLog10, a, c, k, powered }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const LNode = isLog10 ? log10Node_1.Log10Node : logNode_1.LogNode;
-    const withoutLogs = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
-        new fractionNode_1.FractionNode(new numberNode_1.NumberNode(k), new numberNode_1.NumberNode(powered)).simplify(),
-    ]));
-    (0, exercise_1.tryToAddWrongProp)(propositions, withoutLogs.toTex());
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
-            new fractionNode_1.FractionNode(new LNode(new numberNode_1.NumberNode((0, randint_1.randint)(2, 10))), new LNode(new numberNode_1.NumberNode((0, randint_1.randint)(2, 10)))).simplify(),
-        ])).toTex());
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { a, c, k, powered, isLog10 }) => {
-    const LNode = isLog10 ? log10Node_1.Log10Node : logNode_1.LogNode;
-    const poweredNode = new numberNode_1.NumberNode(powered);
-    const answerSimp = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
-        new fractionNode_1.FractionNode(new LNode(new numberNode_1.NumberNode(k)), new LNode(poweredNode)).simplify(),
-    ]));
-    const answer = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([
-        new fractionNode_1.FractionNode(new LNode(new numberNode_1.NumberNode(k)), new LNode(poweredNode)),
-    ]));
-    const texs = [...answerSimp.toAllValidTexs(), ...answer.toAllValidTexs()];
-    return texs.includes(ans);
-};
-exports.logPowerEquation = {
-    id: "logPowerEquation",
-    connector: "\\iff",
-    label: "Résoudre une équation du type $a\\times b^x + c = d$ grâce au logarithme décimal",
-    levels: ["TermSpé", "MathComp"],
-    isSingleStep: true,
-    sections: ["Logarithme népérien", "Puissances"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLogPowerEquationQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};
-exports.log10PowerEquation = {
-    id: "log10PowerEquation",
-    connector: "\\iff",
-    label: "Résoudre une équation du type $a\\times b^x + c = d$ grâce au logarithme népérien",
-    levels: ["TermSpé", "MathComp"],
-    isSingleStep: true,
-    sections: ["Logarithme décimal", "Puissances"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(() => getLogPowerEquationQuestion({ isLog10: true }), nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/functions/logarithm/logSimplifiying.d.ts

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

package/lib/exercises/functions/logarithm/logSimplifiying.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"logSimplifiying.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/logarithm/logSimplifiying.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqEF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAYrD,CAAC"}

package/lib/exercises/functions/logarithm/logSimplifiying.js

@@ -1,77 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.logSimplifiying = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const randint_1 = require("../../../math/utils/random/randint");
-const logNode_1 = require("../../../tree/nodes/functions/logNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const getExpSimplifiying = () => {
-    let expression;
-    let simplifiedExpression;
-    let pm = (0, coinFlip_1.coinFlip)() ? 1 : -1;
-    const a = (0, randint_1.randint)(1, 10);
-    let b;
-    do {
-        b = (0, randint_1.randint)(1, 10);
-    } while (pm === -1 && a === b);
-    const opts = { allowLnOfOne: true };
-    if (pm === 1) {
-        expression = new addNode_1.AddNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a), opts), new logNode_1.LogNode(new numberNode_1.NumberNode(b), opts));
-        simplifiedExpression = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
-    }
-    else {
-        expression = new substractNode_1.SubstractNode(new logNode_1.LogNode(new numberNode_1.NumberNode(a), opts), new logNode_1.LogNode(new numberNode_1.NumberNode(b), opts));
-        simplifiedExpression = new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree());
-    }
-    const answer = simplifiedExpression.toTex();
-    const question = {
-        instruction: `Ecrire le nombre suivant sous la forme $\\ln\\left(a\\right)$ : $\\newline ${expression.toTex()}$.`,
-        answer,
-        keys: ["ln"],
-        answerFormat: "tex",
-        identifiers: { pm, a, b },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, pm }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const a = (0, randint_1.randint)(1, 10);
-        const b = (0, randint_1.randint)(1, 10);
-        (0, exercise_1.tryToAddWrongProp)(propositions, pm > 0
-            ? new logNode_1.LogNode(new numberNode_1.NumberNode(a * b)).toTex()
-            : new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree()).toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, pm }) => {
-    let answer;
-    if (pm === 1) {
-        answer = new logNode_1.LogNode(new numberNode_1.NumberNode(a * b));
-    }
-    else {
-        answer = new logNode_1.LogNode(new rational_1.Rational(a, b).simplify().toTree({ allowFractionToDecimal: true }));
-    }
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.logSimplifiying = {
-    id: "logSimplifiying",
-    connector: "\\iff",
-    label: "Simplifier des expressions avec $\\ln$",
-    levels: ["1reSpé", "TermSpé", "MathComp"],
-    sections: ["Logarithme népérien"],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpSimplifiying, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/parity/index.ts"],"names":[],"mappings":"AAAA,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC"}

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

@@ -1,18 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./parityFromAlgebra"), exports);
-__exportStar(require("./parityFromGraph"), exports);

package/lib/exercises/functions/parity/parityFromAlgebra.d.ts

@@ -1,8 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    type: string;
-    fctTex: string;
-};
-export declare const parityFromAlgebra: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=parityFromAlgebra.d.ts.map

package/lib/exercises/functions/parity/parityFromAlgebra.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"parityFromAlgebra.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/parity/parityFromAlgebra.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAYlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAoGF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAavD,CAAC"}

package/lib/exercises/functions/parity/parityFromAlgebra.js

@@ -1,117 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.parityFromAlgebra = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const affine_1 = require("../../../math/polynomials/affine");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const rationalFrac_1 = require("../../../math/polynomials/rationalFrac");
-const trinom_1 = require("../../../math/polynomials/trinom");
-const randint_1 = require("../../../math/utils/random/randint");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const doWhile_1 = require("../../../utils/doWhile");
-const probaFlip_1 = require("../../../utils/probaFlip");
-const probaLawFlip_1 = require("../../../utils/probaLawFlip");
-const getParityFromAlgebraQuestion = () => {
-    //paires : ax^2 + b   , frac ratio trinom/tirnom
-    //impaires : linéaires, ax^3, linéaire/trinom
-    // ni l'un ni l'autre : affines, trinomes avec ax, x^3 + b
-    const type = (0, probaLawFlip_1.probaLawFlip)([
-        ["even", 0.33],
-        ["uneven", 0.33],
-        ["neither", 0.33],
-    ]);
-    let fct;
-    let answer = "";
-    switch (type) {
-        case "even":
-            if ((0, coinFlip_1.coinFlip)()) {
-                fct = new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), 0, (0, randint_1.randint)(-9, 10))
-                    .toTree()
-                    .toTex();
-            }
-            else {
-                let num = new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), 0, (0, randint_1.randint)(-9, 10));
-                let denum = (0, doWhile_1.doWhile)(() => new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), 0, (0, randint_1.randint)(-9, 10)), (P) => (num.c === 0 ? P.c !== 0 : P.a / num.a === P.c / num.c));
-                fct = new rationalFrac_1.RationalFrac(num, denum).toTree().toTex();
-            }
-            answer = "Paire";
-            break;
-        case "uneven":
-            if ((0, probaFlip_1.probaFlip)(0.33)) {
-                fct = new affine_1.Affine((0, randint_1.randint)(-10, 11, [0]), 0).toTree().toTex();
-            }
-            else {
-                if ((0, coinFlip_1.coinFlip)()) {
-                    fct = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-10, 11), 0, (0, randint_1.randint)(-10, 11, [0])])
-                        .toTree()
-                        .toTex();
-                }
-                else {
-                    let num = new affine_1.Affine((0, randint_1.randint)(-9, 10, [0]), 0);
-                    let denum = new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), 0, (0, randint_1.randint)(-9, 10, [0]));
-                    fct = new rationalFrac_1.RationalFrac(num, denum).toTree().toTex();
-                }
-            }
-            answer = "Impaire";
-            break;
-        case "neither":
-            if ((0, probaFlip_1.probaFlip)(0.33)) {
-                fct = new affine_1.Affine((0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10, [0]))
-                    .toTree()
-                    .toTex();
-            }
-            else {
-                if ((0, coinFlip_1.coinFlip)()) {
-                    fct = new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10))
-                        .toTree()
-                        .toTex();
-                }
-                else {
-                    fct = new polynomial_1.Polynomial([
-                        (0, randint_1.randint)(-9, 10),
-                        (0, randint_1.randint)(-9, 10),
-                        (0, randint_1.randint)(-9, 10, [0]),
-                        (0, randint_1.randint)(-9, 10, [0]),
-                    ])
-                        .toTree()
-                        .toTex();
-                }
-            }
-            answer = "Ni paire, ni impaire";
-            break;
-    }
-    const question = {
-        answer,
-        instruction: `Soit $f(x) = ${fct}$. La fonction $f$ est-elle paire, impaire, ou ni paire ni impaire ?`,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: { type, fctTex: fct },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer, "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "Paire", "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "Impaire", "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "Ni paire ni impaire", "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.parityFromAlgebra = {
-    id: "parityFromAlgebra",
-    label: "Déterminer algébriquement la parité d'une fonction",
-    levels: ["2nde", "1reSpé"],
-    isSingleStep: true,
-    sections: ["Fonctions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getParityFromAlgebraQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    answerType: "QCM",
-};

package/lib/exercises/functions/parity/parityFromGraph.d.ts

@@ -1,8 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-type Identifiers = {
-    type: string;
-    fctCmd: string;
-};
-export declare const parityFromGraph: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=parityFromGraph.d.ts.map

package/lib/exercises/functions/parity/parityFromGraph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"parityFromGraph.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/parity/parityFromGraph.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAclC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AA4GF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAcrD,CAAC"}

package/lib/exercises/functions/parity/parityFromGraph.js

@@ -1,128 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.parityFromGraph = 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 affine_1 = require("../../../math/polynomials/affine");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const rationalFrac_1 = require("../../../math/polynomials/rationalFrac");
-const trinom_1 = require("../../../math/polynomials/trinom");
-const randint_1 = require("../../../math/utils/random/randint");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const doWhile_1 = require("../../../utils/doWhile");
-const probaFlip_1 = require("../../../utils/probaFlip");
-const probaLawFlip_1 = require("../../../utils/probaLawFlip");
-const getParityFromGraphQuestion = () => {
-    //paires : ax^2 + b   , frac ratio trinom/tirnom
-    //impaires : linéaires, ax^3, linéaire/trinom
-    // ni l'un ni l'autre : affines, trinomes avec ax, x^3 + b
-    const type = (0, probaLawFlip_1.probaLawFlip)([
-        ["even", 0.33],
-        ["uneven", 0.33],
-        ["neither", 0.33],
-    ]);
-    let fct;
-    let answer = "";
-    switch (type) {
-        case "even":
-            if ((0, coinFlip_1.coinFlip)()) {
-                fct = new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), 0, (0, randint_1.randint)(-9, 10))
-                    .toTree()
-                    .toMathString();
-            }
-            else {
-                let num = new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), 0, (0, randint_1.randint)(-9, 10));
-                let denum = (0, doWhile_1.doWhile)(() => new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), 0, (0, randint_1.randint)(-9, 10)), (P) => (num.c === 0 ? P.c !== 0 : P.a / num.a === P.c / num.c));
-                fct = new rationalFrac_1.RationalFrac(num, denum).toTree().toMathString();
-            }
-            answer = "Paire";
-            break;
-        case "uneven":
-            if ((0, probaFlip_1.probaFlip)(0.33)) {
-                fct = new affine_1.Affine((0, randint_1.randint)(-10, 11, [0]), 0).toTree().toMathString();
-            }
-            else {
-                if ((0, coinFlip_1.coinFlip)()) {
-                    fct = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-10, 11), 0, (0, randint_1.randint)(-10, 11, [0])])
-                        .toTree()
-                        .toMathString();
-                }
-                else {
-                    let num = new affine_1.Affine((0, randint_1.randint)(-9, 10, [0]), 0);
-                    let denum = new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), 0, (0, randint_1.randint)(-9, 10, [0]));
-                    fct = new rationalFrac_1.RationalFrac(num, denum).toTree().toMathString();
-                }
-            }
-            answer = "Impaire";
-            break;
-        case "neither":
-            if ((0, probaFlip_1.probaFlip)(0.33)) {
-                fct = new affine_1.Affine((0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10, [0]))
-                    .toTree()
-                    .toMathString();
-            }
-            else {
-                if ((0, coinFlip_1.coinFlip)()) {
-                    fct = new trinom_1.Trinom((0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10, [0]), (0, randint_1.randint)(-9, 10))
-                        .toTree()
-                        .toMathString();
-                }
-                else {
-                    fct = new polynomial_1.Polynomial([
-                        (0, randint_1.randint)(-9, 10),
-                        (0, randint_1.randint)(-9, 10),
-                        (0, randint_1.randint)(-9, 10, [0]),
-                        (0, randint_1.randint)(-9, 10, [0]),
-                    ])
-                        .toTree()
-                        .toMathString();
-                }
-            }
-            answer = "Ni paire, ni impaire";
-            break;
-    }
-    const commands = [`f(x) = ${fct}`, `SetColor(f, "${(0, colors_1.randomColor)()}")`];
-    const ggb = new geogebraConstructor_1.GeogebraConstructor(commands, {
-        isGridSimple: true,
-        isAxesRatioFixed: false,
-    });
-    const question = {
-        answer,
-        instruction: `La fonction $f$ représentée ci-dessous est-elle paire, impaire, ou ni paire ni impaire ?`,
-        keys: [],
-        options: ggb.getOptions(),
-        commands: ggb.commands,
-        coords: [-10, 10, -10, 10],
-        answerFormat: "tex",
-        identifiers: { type, fctCmd: fct },
-    };
-    return question;
-};
-const getPropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer, "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "Paire", "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "Impaire", "raw");
-    (0, exercise_1.tryToAddWrongProp)(propositions, "Ni paire ni impaire", "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.parityFromGraph = {
-    id: "parityFromGraph",
-    label: "Reconnaître graphiquement la parité d'une fonction",
-    levels: ["2nde", "1reSpé"],
-    isSingleStep: true,
-    sections: ["Fonctions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getParityFromGraphQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-    answerType: "QCM",
-    hasGeogebra: true,
-};

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

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

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

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

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

@@ -1,17 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./rationalFractionForbiddenValue"), exports);

package/lib/exercises/functions/rationalFraction/rationalFractionForbiddenValue.d.ts

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

package/lib/exercises/functions/rationalFraction/rationalFractionForbiddenValue.d.ts.map

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

package/lib/exercises/functions/rationalFraction/rationalFractionForbiddenValue.js

@@ -1,64 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.rationalFractionForbiddenValue = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
-const shuffle_1 = require("../../../utils/shuffle");
-const getRationalFractionForbiddenValueQuestion = () => {
-    const a = (0, randint_1.randint)(-10, 11, [0]);
-    const b = (0, randint_1.randint)(-10, 11);
-    //pour éviter affine2 = k*affine1
-    let c, d;
-    do {
-        c = (0, randint_1.randint)(-10, 11, [0]);
-        d = (0, randint_1.randint)(-10, 11);
-    } while (a * d - b * c === 0);
-    const affine1 = new affine_1.Affine(a, b);
-    const affine2 = new affine_1.Affine(c, d);
-    const fct = new fractionNode_1.FractionNode(affine1.toTree(), affine2.toTree());
-    const fctTex = fct.toTex();
-    const answerTree = new rational_1.Rational(-d, c).simplify().toTree();
-    const answer = answerTree.toTex();
-    const question = {
-        answer,
-        instruction: `Soit $f(x)=${fctTex}$. Quelle est la valeur interdite de la fonction $f$ ?`,
-        keys: [],
-        answerFormat: "tex",
-        identifiers: { a, b, c, d },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, a, b, c, d }) => {
-    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, d + "");
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(-10, 11) + "");
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { c, d }) => {
-    const answerTree = new rational_1.Rational(-d, c)
-        .simplify()
-        .toTree({ allowFractionToDecimal: true });
-    const texs = answerTree.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.rationalFractionForbiddenValue = {
-    id: "rationalFractionForbiddenValue",
-    connector: "=",
-    label: "Déterminer la valeur interdite d'un quotient de polynôme",
-    levels: ["2nde", "1reESM", "1reSpé"],
-    isSingleStep: true,
-    sections: ["Fonctions", "Fractions"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getRationalFractionForbiddenValueQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

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

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

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

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

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

@@ -1,17 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./squareImageInterval"), exports);

package/lib/exercises/functions/square/squareImageInterval.d.ts

@@ -1,11 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { ClosureType } from "../../../tree/nodes/sets/closure";
-type Identifiers = {
-    a: number;
-    b: number;
-    closure: ClosureType;
-    type: number;
-};
-export declare const squareImageInterval: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=squareImageInterval.d.ts.map

package/lib/exercises/functions/square/squareImageInterval.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"squareImageInterval.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/square/squareImageInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAKlC,OAAO,EAAW,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAGrE,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,WAAW,CAAC;IACrB,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAgIF,eAAO,MAAM,mBAAmB,EAAE,YAAY,CAAC,WAAW,CAYzD,CAAC"}