math-exercises 2.1.21 → 2.1.23

package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.js

@@ -1,91 +0,0 @@
-"use strict";
-/**
- *  type (ax+b)(cx+d) ± (ax+b)(ex+f)
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.factoType1Exercise = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const affine_1 = require("../../../math/polynomials/affine");
-const addNode_1 = require("../../../tree/nodes/operators/addNode");
-const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
-const substractNode_1 = require("../../../tree/nodes/operators/substractNode");
-const random_1 = require("../../../utils/random");
-const shuffle_1 = require("../../../utils/shuffle");
-const getFactoType1Question = () => {
-    const affines = affine_1.AffineConstructor.differentRandoms(3);
-    const permut = [
-        (0, shuffle_1.shuffle)([affines[0], affines[1]]),
-        (0, shuffle_1.shuffle)([affines[0], affines[2]]),
-    ];
-    const operation = (0, random_1.random)(["add", "substract"]);
-    const statementTree = operation === "add"
-        ? new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(permut[0][0].toTree(), permut[0][1].toTree()), new multiplyNode_1.MultiplyNode(permut[1][0].toTree(), permut[1][1].toTree()))
-        : new substractNode_1.SubstractNode(new multiplyNode_1.MultiplyNode(permut[0][0].toTree(), permut[0][1].toTree()), new multiplyNode_1.MultiplyNode(permut[1][0].toTree(), permut[1][1].toTree()));
-    const affine1 = affines[0];
-    const affine2 = affines[1].add(operation === "add" ? affines[2] : affines[2].opposite());
-    const answerTree = affine2.coefficients[0] === 0
-        ? affine1.coefficients[0] === 0
-            ? affine1.multiply(affine2).toTree()
-            : new multiplyNode_1.MultiplyNode(affine2.toTree(), affine1.toTree())
-        : new multiplyNode_1.MultiplyNode(affine1.toTree(), affine2.toTree());
-    const answer = answerTree.toTex();
-    const question = {
-        instruction: `Factoriser : $${statementTree.toTex()}$`,
-        startStatement: statementTree.toTex(),
-        answer,
-        keys: ["x"],
-        answerFormat: "tex",
-        identifiers: {
-            affinesCoeffs: affines.map((affine) => affine.coefficients),
-            operation,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, affinesCoeffs, operation }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const affines = affinesCoeffs.map((coeffs) => new affine_1.Affine(coeffs[1], coeffs[0]));
-    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1]
-        .add(operation !== "add" ? affines[2] : affines[2].opposite())
-        .toTree()).toTex());
-    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affines[1].toTree(), affines[0]
-        .add(operation === "add" ? affines[2] : affines[2].opposite())
-        .toTree()).toTex());
-    (0, exercise_1.tryToAddWrongProp)(propositions, new multiplyNode_1.MultiplyNode(affines[2].toTree(), affines[0]
-        .add(operation === "add" ? affines[2] : affines[2].opposite())
-        .toTree()).toTex());
-    while (propositions.length < n) {
-        const wrongAnswer = new multiplyNode_1.MultiplyNode(affines[0].toTree(), affines[1].add(affine_1.AffineConstructor.differentRandoms(1)[0]).toTree());
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer.toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { affinesCoeffs, operation }) => {
-    const affines = affinesCoeffs.map((coeffs) => new affine_1.Affine(coeffs[1], coeffs[0]));
-    const affine1 = affines[0];
-    const affine2 = affines[1].add(operation === "add" ? affines[2] : affines[2].opposite());
-    const answerTree = affine2.coefficients[0] === 0
-        ? affine1.coefficients[0] === 0
-            ? affine1.multiply(affine2).toTree()
-            : new multiplyNode_1.MultiplyNode(affine2.toTree(), affine1.toTree())
-        : new multiplyNode_1.MultiplyNode(affine1.toTree(), affine2.toTree());
-    const answer = answerTree.toTex();
-    const validLatexs = answerTree.toAllValidTexs();
-    console.log(ans, validLatexs);
-    return validLatexs.includes(ans);
-};
-exports.factoType1Exercise = {
-    id: "facto1",
-    connector: "=",
-    isSingleStep: false,
-    label: "Factorisation du type $(ax+b)(cx+d) \\pm (ax+b)(ex+f)$",
-    levels: ["3ème", "2nde"],
-    sections: ["Calcul littéral"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFactoType1Question, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

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

@@ -1,5 +0,0 @@
-export * from "./factoIdRmq1";
-export * from "./factoIdRmq2";
-export * from "./factoIdRmq3";
-export * from "./factoType1Exercise";
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/factorisation/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,sBAAsB,CAAC"}

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

@@ -1,20 +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("./factoIdRmq1"), exports);
-__exportStar(require("./factoIdRmq2"), exports);
-__exportStar(require("./factoIdRmq3"), exports);
-__exportStar(require("./factoType1Exercise"), exports);

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

@@ -1,7 +0,0 @@
-export * from "./distributivity";
-export * from "./equation";
-export * from "./factorisation";
-export * from "./inequations";
-export * from "./simplifying";
-export * from "./systems";
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/calculLitteral/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,iBAAiB,CAAC;AAChC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC"}

package/lib/exercises/calculLitteral/index.js

@@ -1,22 +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("./distributivity"), exports);
-__exportStar(require("./equation"), exports);
-__exportStar(require("./factorisation"), exports);
-__exportStar(require("./inequations"), exports);
-__exportStar(require("./simplifying"), exports);
-__exportStar(require("./systems"), exports);

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.d.ts

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

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"firstDegreeInequationsType0.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType0.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AA4DF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.js

@@ -1,64 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.firstDegreeInequationsType0 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
-const inequation_1 = require("../../../math/inequations/inequation");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-/**x +b < c */
-const getFirstDegreeInequationsQuestion = () => {
-    const affine = new affine_1.Affine(1, (0, randint_1.randint)(-10, 11, [0]));
-    const c = (0, randint_1.randint)(-10, 11);
-    const result = c - affine.b;
-    const ineqType = inequation_1.InequationSymbolConstructor.random();
-    const answer = `x${ineqType.symbol}${result}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType.symbol} ${c}$ `,
-        keys: inequationKeys_1.inequationKeys,
-        answerFormat: "tex",
-        identifiers: { ineqType: ineqType.symbol, b: affine.b, c },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, ineqType, b, c }) => {
-    const result = c - b;
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const ineqSymbol = new inequation_1.InequationSymbol(ineqType);
-    const invIneqType = ineqSymbol.reversed();
-    (0, exercise_1.tryToAddWrongProp)(propositions, `x${invIneqType}${result}`);
-    while (propositions.length < n) {
-        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { answer, ineqType, b, c }) => {
-    const result = c - b;
-    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(result)], ineqType);
-    const tree = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval());
-    const texs = tree.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.firstDegreeInequationsType0 = {
-    id: "firstDegreeInequationsType0",
-    connector: "\\iff",
-    label: "Résoudre une inéquation du type $x+b<c$",
-    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
-    isSingleStep: true,
-    sections: ["Inéquations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType1.d.ts

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

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType1.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"firstDegreeInequationsType1.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType1.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAS3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AAqEF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAcjE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType1.js

@@ -1,70 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.firstDegreeInequationsType1 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
-const inequation_1 = require("../../../math/inequations/inequation");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-/**ax<b */
-const getFirstDegreeInequationsQuestion = () => {
-    const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), 0);
-    const b = (0, randint_1.randint)(-10, 11);
-    const result = new rational_1.Rational(b, affine.a).simplify().toTree().toTex();
-    const ineqType = inequation_1.InequationSymbolConstructor.random();
-    const invIneqType = ineqType.reversed();
-    const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType.symbol} ${b}$ `,
-        keys: inequationKeys_1.inequationKeys,
-        answerFormat: "tex",
-        identifiers: { a: affine.a, b, ineqType: ineqType.symbol },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, a, ineqType, b }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const ineq = new inequation_1.InequationSymbol(ineqType);
-    const invIneqType = ineq.reversed();
-    const result = new rational_1.Rational(b, a).simplify().toTree().toTex();
-    (0, exercise_1.tryToAddWrongProp)(propositions, `x${a < 0 ? ineqType : invIneqType}${result}`);
-    while (propositions.length < n) {
-        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, ineqType }) => {
-    const ineqSymbol = new inequation_1.InequationSymbol(ineqType);
-    const invIneqType = ineqSymbol.reversed();
-    const trueIneqType = a < 0 ? invIneqType : ineqType;
-    const result = new rational_1.Rational(b, a).simplify().toTree();
-    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
-    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
-        opts: { allowFractionToDecimal: true },
-    });
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.firstDegreeInequationsType1 = {
-    id: "firstDegreeInequationsType1",
-    connector: "\\iff",
-    getPropositions,
-    label: "Résoudre une inéquation du type $ax<b$",
-    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
-    isSingleStep: true,
-    sections: ["Inéquations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    isAnswerValid,
-};

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.d.ts

@@ -1,11 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { InegalitySymbols } from "../../../math/inequations/inequation";
-type Identifiers = {
-    ineqType: InegalitySymbols;
-    a: number;
-    b: number;
-    c: number;
-};
-export declare const firstDegreeInequationsType2: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=firstDegreeInequationsType2.d.ts.map

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"firstDegreeInequationsType2.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType2.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAc3C,KAAK,WAAW,GAAG;IACjB,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAyEF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.js

@@ -1,73 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.firstDegreeInequationsType2 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
-const inequation_1 = require("../../../math/inequations/inequation");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-/**ax+b<c */
-const getFirstDegreeInequationsQuestion = () => {
-    const affine = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, 1]), (0, randint_1.randint)(-10, 10, [0]));
-    const c = (0, randint_1.randint)(-10, 11);
-    const result = new rational_1.Rational(c - affine.b, affine.a)
-        .simplify()
-        .toTree()
-        .toTex();
-    const ineqType = inequation_1.InequationSymbolConstructor.random();
-    const invIneqType = ineqType.reversed();
-    const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType.symbol} ${c}$ `,
-        keys: inequationKeys_1.inequationKeys,
-        answerFormat: "tex",
-        identifiers: { a: affine.a, b: affine.b, c, ineqType: ineqType.symbol },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, a, ineqType, b, c }) => {
-    const result = new rational_1.Rational(c - b, a).simplify().toTree().toTex();
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const ineq = new inequation_1.InequationSymbol(ineqType);
-    const invIneqType = ineq.reversed();
-    (0, exercise_1.tryToAddWrongProp)(propositions, `x${a < 0 ? ineqType : invIneqType}${result}`);
-    while (propositions.length < n) {
-        const wrongAnswer = `x${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType}${(0, randint_1.randint)(-10, 11)}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, c, ineqType }) => {
-    const ineqSymbol = new inequation_1.InequationSymbol(ineqType);
-    const invIneqType = ineqSymbol.reversed();
-    const trueIneqType = a < 0 ? invIneqType : ineqType;
-    const result = new rational_1.Rational(c - b, a).simplify().toTree();
-    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
-    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
-        opts: { allowFractionToDecimal: true },
-    });
-    const texs = answer.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.firstDegreeInequationsType2 = {
-    id: "firstDegreeInequationsType2",
-    connector: "\\iff",
-    getPropositions,
-    isAnswerValid,
-    label: "Résoudre une inéquation du type $ax+b<c$",
-    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
-    isSingleStep: true,
-    sections: ["Inéquations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-};

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.d.ts

@@ -1,13 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { InegalitySymbols } from "../../../math/inequations/inequation";
-type Identifiers = {
-    coeff: number;
-    ineqType: InegalitySymbols;
-    a: number;
-    b: number;
-    c: number;
-    d: number;
-};
-export declare const firstDegreeInequationsType3: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=firstDegreeInequationsType3.d.ts.map

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"firstDegreeInequationsType3.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType3.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAqFF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}

package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.js

@@ -1,82 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.firstDegreeInequationsType3 = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const inequationKeys_1 = require("../../../exercises/utils/keys/inequationKeys");
-const inequation_1 = require("../../../math/inequations/inequation");
-const rational_1 = require("../../../math/numbers/rationals/rational");
-const affine_1 = require("../../../math/polynomials/affine");
-const randint_1 = require("../../../math/utils/random/randint");
-const inequationNode_1 = require("../../../tree/nodes/inequations/inequationNode");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-/**ax+b<cx+d */
-const getFirstDegreeInequationsQuestion = () => {
-    const affine1 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0]), (0, randint_1.randint)(-10, 10));
-    const affine2 = new affine_1.Affine((0, randint_1.randint)(-10, 10, [0, affine1.a]), (0, randint_1.randint)(-10, 10));
-    const result = new rational_1.Rational(affine2.b - affine1.b, affine1.a - affine2.a)
-        .simplify()
-        .toTree()
-        .toTex();
-    const coeff = affine1.a - affine2.a;
-    const ineqType = inequation_1.InequationSymbolConstructor.random();
-    const invIneqType = ineqType.reversed();
-    const answer = `x${coeff > 0 ? ineqType.symbol : invIneqType}${result}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'inéquation : $${affine1.toTex()} ${ineqType.symbol} ${affine2.toTex()}$ `,
-        keys: inequationKeys_1.inequationKeys,
-        answerFormat: "tex",
-        identifiers: {
-            coeff,
-            ineqType: ineqType.symbol,
-            a: affine1.a,
-            b: affine1.b,
-            c: affine2.a,
-            d: affine2.b,
-        },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, coeff, ineqType, a, b, c, d }) => {
-    const result = new rational_1.Rational(d - b, a - c).simplify().toTree().toTex();
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const ineq = new inequation_1.InequationSymbol(ineqType);
-    const invIneqType = ineq.reversed();
-    (0, exercise_1.tryToAddWrongProp)(propositions, `x${coeff < 0 ? ineqType : invIneqType}${result}`);
-    while (propositions.length < n) {
-        const wrongAnswer = `x ${(0, coinFlip_1.coinFlip)() ? ineqType : invIneqType} ${(0, randint_1.randint)(-10, 11)}`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-const isAnswerValid = (ans, { a, b, c, d, ineqType }) => {
-    const ineqSymbol = new inequation_1.InequationSymbol(ineqType);
-    const invIneqType = ineqSymbol.reversed();
-    const trueIneqType = a - c < 0 ? invIneqType : ineqType;
-    const result = new rational_1.Rational(d - b, a - c).simplify().toTree();
-    const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), result], trueIneqType);
-    const answer = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval(), {
-        opts: { allowFractionToDecimal: true },
-    });
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.firstDegreeInequationsType3 = {
-    id: "firstDegreeInequationsType3",
-    connector: "\\iff",
-    label: "Résoudre une inéquation du type $ax+b<cx+d$",
-    levels: ["3ème", "2ndPro", "2nde", "1reESM", "1rePro", "1reTech"],
-    isSingleStep: true,
-    sections: ["Inéquations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getFirstDegreeInequationsQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

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

@@ -1,6 +0,0 @@
-export * from "./firstDegreeInequationsType0";
-export * from "./firstDegreeInequationsType1";
-export * from "./firstDegreeInequationsType2";
-export * from "./firstDegreeInequationsType3";
-export * from "./squareFunctionInequation";
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/index.ts"],"names":[],"mappings":"AAAA,cAAc,+BAA+B,CAAC;AAC9C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,+BAA+B,CAAC;AAE9C,cAAc,+BAA+B,CAAC;AAC9C,cAAc,4BAA4B,CAAC"}

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

@@ -1,21 +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("./firstDegreeInequationsType0"), exports);
-__exportStar(require("./firstDegreeInequationsType1"), exports);
-__exportStar(require("./firstDegreeInequationsType2"), exports);
-__exportStar(require("./firstDegreeInequationsType3"), exports);
-__exportStar(require("./squareFunctionInequation"), exports);

package/lib/exercises/calculLitteral/inequations/squareFunctionInequation.d.ts

@@ -1,9 +0,0 @@
-import { MathExercise } from "../../../exercises/exercise";
-import { InegalitySymbols } from "../../../math/inequations/inequation";
-type Identifiers = {
-    k: number;
-    inequationSymbol: InegalitySymbols;
-};
-export declare const squareFunctionInequation: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=squareFunctionInequation.d.ts.map

package/lib/exercises/calculLitteral/inequations/squareFunctionInequation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"squareFunctionInequation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/squareFunctionInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAc3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,gBAAgB,EAAE,gBAAgB,CAAC;CACpC,CAAC;AAoEF,eAAO,MAAM,wBAAwB,EAAE,YAAY,CAAC,WAAW,CAY9D,CAAC"}

package/lib/exercises/calculLitteral/inequations/squareFunctionInequation.js

@@ -1,65 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.squareFunctionInequation = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const inequation_1 = require("../../../math/inequations/inequation");
-const randint_1 = require("../../../math/utils/random/randint");
-const oppositeNode_1 = require("../../../tree/nodes/functions/oppositeNode");
-const sqrtNode_1 = require("../../../tree/nodes/functions/sqrtNode");
-const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
-const closure_1 = require("../../../tree/nodes/sets/closure");
-const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const getAnswer = (k, ineqSymbol) => {
-    const sqrt = Math.sqrt(k);
-    const sqrtTree = Math.floor(sqrt) === sqrt ? sqrt.toTree() : new sqrtNode_1.SqrtNode(k.toTree());
-    const inequationSymbol = new inequation_1.InequationSymbol(ineqSymbol);
-    const isStrict = inequationSymbol.isStrict;
-    const insideInterval = new intervalNode_1.IntervalNode(new oppositeNode_1.OppositeNode(sqrtTree), sqrtTree, isStrict ? closure_1.ClosureType.OO : closure_1.ClosureType.FF);
-    const set = inequationSymbol.isSup
-        ? insideInterval.toReversedClosure().toComplement()
-        : insideInterval;
-    const solution = new inequationSolutionNode_1.InequationSolutionNode(set);
-    return solution;
-};
-const getSquareFunctionInequationQuestion = () => {
-    const k = (0, coinFlip_1.coinFlip)() ? (0, randint_1.randint)(1, 11) ** 2 : (0, randint_1.randint)(1, 100);
-    const inequationSymbol = inequation_1.InequationSymbolConstructor.random();
-    const solution = getAnswer(k, inequationSymbol.symbol);
-    const question = {
-        answer: solution.toTex(),
-        instruction: `Résoudre l'inéquation suivante : $x^2 ${inequationSymbol.symbol} ${k}$`,
-        keys: ["S", "equal", "lbracket", "rbracket", "semicolon", "infty", "cup"],
-        answerFormat: "tex",
-        identifiers: { k, inequationSymbol: inequationSymbol.symbol },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, k, inequationSymbol }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer(k ** 2, inequationSymbol).toTex());
-    (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer(k, new inequation_1.InequationSymbol(inequationSymbol).reversed()).toTex());
-    while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, getAnswer((0, randint_1.randint)(1, 100), inequationSymbol).toTex());
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-const isAnswerValid = (ans, { answer, k, inequationSymbol }) => {
-    const solution = getAnswer(k, inequationSymbol);
-    const texs = solution.toAllValidTexs();
-    return texs.includes(ans);
-};
-exports.squareFunctionInequation = {
-    id: "squareFunctionInequation",
-    label: "Résoudre une inéquation du type $x^2 < k$",
-    levels: ["2nde"],
-    isSingleStep: true,
-    sections: ["Fonctions de référence", "Inéquations"],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSquareFunctionInequationQuestion, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};