math-exercises 2.1.21 → 2.1.23

package/lib/exercises/primitive/sinCosPrimitive.js

@@ -1,79 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sinCosPrimitive = exports.isSinCosPrimitiveAnswerValid = exports.getSinCosPrimitivePropositions = exports.getSinCosPrimitive = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../math/utils/random/randint");
-const cosNode_1 = require("../../tree/nodes/functions/cosNode");
-const sinNode_1 = require("../../tree/nodes/functions/sinNode");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-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 shuffle_1 = require("../../utils/shuffle");
-const getSinCosPrimitive = () => {
-    const a = (0, randint_1.randint)(-9, 10, [0]);
-    let selectedFunction;
-    let integratedFuction;
-    const isCos = (0, coinFlip_1.coinFlip)();
-    selectedFunction = isCos
-        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new cosNode_1.CosNode(new variableNode_1.VariableNode("x")))
-        : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new sinNode_1.SinNode(new variableNode_1.VariableNode("x")));
-    integratedFuction = isCos
-        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new sinNode_1.SinNode(new variableNode_1.VariableNode("x")))
-        : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), new cosNode_1.CosNode(new variableNode_1.VariableNode("x")));
-    const answer = new addNode_1.AddNode(integratedFuction, new variableNode_1.VariableNode("C")).toTex();
-    const question = {
-        instruction: `Déterminer la forme générale des primitives de la fonction $f$ définie par $f(x) = ${selectedFunction.toTex()}$.`,
-        startStatement: `F(x)`,
-        answer,
-        keys: ["x", "C", "sin", "cos"],
-        answerFormat: "tex",
-        identifiers: { a, isCos },
-    };
-    return question;
-};
-exports.getSinCosPrimitive = getSinCosPrimitive;
-const getSinCosPrimitivePropositions = (n, { answer, a }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const wrongIntegrals = [
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new sinNode_1.SinNode(new variableNode_1.VariableNode("x"))),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), new cosNode_1.CosNode(new variableNode_1.VariableNode("x"))),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new cosNode_1.CosNode(new variableNode_1.VariableNode("x"))),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), new sinNode_1.SinNode(new variableNode_1.VariableNode("x"))),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [a, 0])), new cosNode_1.CosNode(new variableNode_1.VariableNode("x"))),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [a, 0])), new sinNode_1.SinNode(new variableNode_1.VariableNode("x"))),
-    ];
-    const cNode = new variableNode_1.VariableNode("C");
-    while (propositions.length < n) {
-        let wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
-        (0, exercise_1.tryToAddWrongProp)(propositions, new addNode_1.AddNode(wrongIntegral, cNode).toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.getSinCosPrimitivePropositions = getSinCosPrimitivePropositions;
-const isSinCosPrimitiveAnswerValid = (ans, { isCos, a }) => {
-    const integratedFuction = isCos
-        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new sinNode_1.SinNode(new variableNode_1.VariableNode("x")))
-        : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), new cosNode_1.CosNode(new variableNode_1.VariableNode("x")));
-    const answer = new addNode_1.AddNode(integratedFuction, new variableNode_1.VariableNode("C"));
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.isSinCosPrimitiveAnswerValid = isSinCosPrimitiveAnswerValid;
-exports.sinCosPrimitive = {
-    id: "sinCosPrimitive",
-    connector: "=",
-    label: "Primitive de sin et cos",
-    levels: ["TermSpé", "MathComp"],
-    sections: ["Primitives", "Trigonométrie"],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(exports.getSinCosPrimitive, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions: exports.getSinCosPrimitivePropositions,
-    isAnswerValid: exports.isSinCosPrimitiveAnswerValid,
-};

package/lib/exercises/primitive/sinUCosUPrimitive.d.ts

@@ -1,11 +0,0 @@
-import { MathExercise, QCMGenerator, QuestionGenerator, VEA } from "../../exercises/exercise";
-type Identifiers = {
-    coeffs: number[];
-    isCos: boolean;
-};
-export declare const getSinUCosUPrimitive: QuestionGenerator<Identifiers>;
-export declare const getSinUCosUPrimitivePropositions: QCMGenerator<Identifiers>;
-export declare const isSinUCosUPrimitiveAnswerValid: VEA<Identifiers>;
-export declare const sinUCosUPrimitive: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=sinUCosUPrimitive.d.ts.map

package/lib/exercises/primitive/sinUCosUPrimitive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sinUCosUPrimitive.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitive/sinUCosUPrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAEZ,YAAY,EAEZ,iBAAiB,EACjB,GAAG,EAGJ,MAAM,0BAA0B,CAAC;AAmBlC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,KAAK,EAAE,OAAO,CAAC;CAChB,CAAC;AAEF,eAAO,MAAM,oBAAoB,EAAE,iBAAiB,CAAC,WAAW,CA0B/D,CAAC;AAEF,eAAO,MAAM,gCAAgC,EAAE,YAAY,CAAC,WAAW,CA8BtE,CAAC;AACF,eAAO,MAAM,8BAA8B,EAAE,GAAG,CAAC,WAAW,CAa3D,CAAC;AAEF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,WAAW,CAYvD,CAAC"}

package/lib/exercises/primitive/sinUCosUPrimitive.js

@@ -1,85 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sinUCosUPrimitive = exports.isSinUCosUPrimitiveAnswerValid = exports.getSinUCosUPrimitivePropositions = exports.getSinUCosUPrimitive = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const polynomial_1 = require("../../math/polynomials/polynomial");
-const randint_1 = require("../../math/utils/random/randint");
-const cosNode_1 = require("../../tree/nodes/functions/cosNode");
-const oppositeNode_1 = require("../../tree/nodes/functions/oppositeNode");
-const sinNode_1 = require("../../tree/nodes/functions/sinNode");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-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 shuffle_1 = require("../../utils/shuffle");
-const getSinUCosUPrimitive = () => {
-    const u = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(1, 3));
-    let selectedFunction;
-    let integratedFuction;
-    const isCos = (0, coinFlip_1.coinFlip)();
-    selectedFunction = isCos
-        ? new multiplyNode_1.MultiplyNode(u.derivate().toTree(), new cosNode_1.CosNode(u.toTree()))
-        : new multiplyNode_1.MultiplyNode(u.derivate().toTree(), new sinNode_1.SinNode(u.toTree()));
-    integratedFuction = isCos
-        ? new sinNode_1.SinNode(u.toTree())
-        : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-1), new cosNode_1.CosNode(u.toTree()));
-    const answer = new addNode_1.AddNode(integratedFuction, new variableNode_1.VariableNode("C")).toTex();
-    const question = {
-        instruction: `Déterminer la forme générale des primitives de la fonction $f$ définie par $f(x) = ${selectedFunction.toTex()}$.`,
-        startStatement: `F(x)`,
-        answer,
-        keys: ["x", "C", "sin", "cos"],
-        answerFormat: "tex",
-        identifiers: { coeffs: u.coefficients, isCos },
-    };
-    return question;
-};
-exports.getSinUCosUPrimitive = getSinUCosUPrimitive;
-const getSinUCosUPrimitivePropositions = (n, { answer, coeffs }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const u = new polynomial_1.Polynomial(coeffs);
-    const wrongIntegrals = [
-        new multiplyNode_1.MultiplyNode(u.toTree(), new cosNode_1.CosNode(u.toTree())),
-        new multiplyNode_1.MultiplyNode(u.toTree(), new sinNode_1.SinNode(u.toTree())),
-        new sinNode_1.SinNode(u.toTree()),
-        new cosNode_1.CosNode(u.toTree()),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-1), new cosNode_1.CosNode(u.toTree())),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-1), new sinNode_1.SinNode(u.toTree())),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [0])), new cosNode_1.CosNode(new variableNode_1.VariableNode("x"))),
-        new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [0])), new sinNode_1.SinNode(new variableNode_1.VariableNode("x"))),
-    ];
-    const cNode = new variableNode_1.VariableNode("C");
-    while (propositions.length < n) {
-        let wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
-        (0, exercise_1.tryToAddWrongProp)(propositions, new addNode_1.AddNode(wrongIntegral, cNode).toTex());
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.getSinUCosUPrimitivePropositions = getSinUCosUPrimitivePropositions;
-const isSinUCosUPrimitiveAnswerValid = (ans, { isCos, coeffs }) => {
-    const u = new polynomial_1.Polynomial(coeffs);
-    const integratedFuction = isCos
-        ? new sinNode_1.SinNode(u.toTree({ forbidPowerToProduct: true }))
-        : new oppositeNode_1.OppositeNode(new cosNode_1.CosNode(u.toTree({ forbidPowerToProduct: true })));
-    const answer = new addNode_1.AddNode(integratedFuction, new variableNode_1.VariableNode("C"));
-    const texs = answer.toAllValidTexs();
-    console.log(texs);
-    return texs.includes(ans);
-};
-exports.isSinUCosUPrimitiveAnswerValid = isSinUCosUPrimitiveAnswerValid;
-exports.sinUCosUPrimitive = {
-    id: "sinUCosUPrimitive",
-    connector: "=",
-    label: "Primitive de $u'\\sin(u)$ et $u'\\cos(u)$",
-    levels: ["TermSpé", "MathComp"],
-    sections: ["Primitives", "Trigonométrie"],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(exports.getSinUCosUPrimitive, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions: exports.getSinUCosUPrimitivePropositions,
-    isAnswerValid: exports.isSinUCosUPrimitiveAnswerValid,
-};

package/lib/exercises/primitive/usualPrimitives.d.ts

@@ -1,11 +0,0 @@
-import { MathExercise } from "../../exercises/exercise";
-type Identifiers = {
-    type: number;
-    a?: number;
-    coeffs?: number[];
-    isCos?: boolean;
-    c?: number;
-};
-export declare const usualPrimitives: MathExercise<Identifiers>;
-export {};
-//# sourceMappingURL=usualPrimitives.d.ts.map

package/lib/exercises/primitive/usualPrimitives.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"usualPrimitives.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitive/usualPrimitives.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAMb,MAAM,0BAA0B,CAAC;AAwBlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,CAAC,CAAC,EAAE,MAAM,CAAC;CACZ,CAAC;AAiGF,eAAO,MAAM,eAAe,EAAE,YAAY,CAAC,WAAW,CAYrD,CAAC"}

package/lib/exercises/primitive/usualPrimitives.js

@@ -1,108 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.usualPrimitives = void 0;
-const constantPrimitive_1 = require("../../exercises/primitive/constantPrimitive");
-const exponentialPrimitive_1 = require("../../exercises/primitive/exponentialPrimitive");
-const polynomialPrimitive_1 = require("../../exercises/primitive/polynomialPrimitive");
-const sinCosPrimitive_1 = require("../../exercises/primitive/sinCosPrimitive");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../math/utils/random/randint");
-const getUsualPrimitives = () => {
-    const rand = (0, randint_1.randint)(1, 5);
-    let question;
-    let identifiers;
-    switch (rand) {
-        case 1:
-            question = (0, constantPrimitive_1.getConstantPrimitive)();
-            identifiers = { ...question.identifiers, type: 1 };
-            break;
-        case 2:
-            question = (0, polynomialPrimitive_1.getPolynomialPrimitive)();
-            identifiers = { ...question.identifiers, type: 2 };
-            break;
-        case 3:
-            question = (0, sinCosPrimitive_1.getSinCosPrimitive)();
-            identifiers = { ...question.identifiers, type: 3 };
-            break;
-        case 4:
-            question = (0, exponentialPrimitive_1.getExponentialPrimitive)();
-            identifiers = { ...question.identifiers, type: 4 };
-            break;
-        default:
-            throw Error("erreur");
-    }
-    return { ...question, identifiers };
-};
-const getPropositions = (n, { answer, type, a, c, coeffs, isCos }) => {
-    let props;
-    switch (type) {
-        case 1:
-            props = (0, constantPrimitive_1.getConstantPrimitivePropositions)(n, { answer, c: c });
-            break;
-        case 2:
-            props = (0, polynomialPrimitive_1.getPolynomialPrimitivePropositions)(n, {
-                answer,
-                coeffs: coeffs,
-            });
-            break;
-        case 3:
-            props = (0, sinCosPrimitive_1.getSinCosPrimitivePropositions)(n, {
-                a: a,
-                answer,
-                isCos: isCos,
-            });
-            break;
-        case 4:
-            props = (0, exponentialPrimitive_1.getExponentialPrimitivePropositions)(n, {
-                a: a,
-                answer,
-            });
-            break;
-        default:
-            throw Error("erreur");
-    }
-    return props;
-};
-const isAnswerValid = (ans, { type, a, coeffs, isCos, c, answer }) => {
-    let res = false;
-    switch (type) {
-        case 1:
-            res = (0, constantPrimitive_1.isConstantPrimitiveAnswerValid)(ans, { c: c, answer });
-            break;
-        case 2:
-            res = (0, polynomialPrimitive_1.isPolynomialPrimitiveAnswerValid)(ans, {
-                coeffs: coeffs,
-                answer,
-            });
-            break;
-        case 3:
-            res = (0, sinCosPrimitive_1.isSinCosPrimitiveAnswerValid)(ans, {
-                a: a,
-                isCos: isCos,
-                answer,
-            });
-            break;
-        case 4:
-            res = (0, exponentialPrimitive_1.isExponentialPrimitiveAnswerValid)(ans, {
-                a: a,
-                answer,
-            });
-            break;
-        default:
-            throw Error("erreur");
-    }
-    return res;
-};
-exports.usualPrimitives = {
-    id: "usualPrimitives",
-    connector: "=",
-    label: "Primitives des fonctions de référence",
-    levels: ["TermSpé", "MathComp"],
-    sections: ["Primitives"],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getUsualPrimitives, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-    isAnswerValid,
-};

package/lib/exercises/primitve/constantPrimitive.d.ts

@@ -1,10 +0,0 @@
-import { MathExercise, QCMGenerator, QuestionGenerator } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-};
-type VEAProps = {};
-export declare const getConstantPrimitive: QuestionGenerator<QCMProps, VEAProps>;
-export declare const getConstantPrimitivePropositions: QCMGenerator<QCMProps>;
-export declare const constantPrimitive: MathExercise<QCMProps, VEAProps>;
-export {};
-//# sourceMappingURL=constantPrimitive.d.ts.map

package/lib/exercises/primitve/constantPrimitive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"constantPrimitive.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitve/constantPrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAEZ,YAAY,EAEZ,iBAAiB,EAGlB,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAEnB,eAAO,MAAM,oBAAoB,EAAE,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CActE,CAAC;AACF,eAAO,MAAM,gCAAgC,EAAE,YAAY,CAAC,QAAQ,CAWnE,CAAC;AAEF,eAAO,MAAM,iBAAiB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW9D,CAAC"}

package/lib/exercises/primitve/constantPrimitive.js

@@ -1,45 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.constantPrimitive = exports.getConstantPrimitivePropositions = exports.getConstantPrimitive = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const monom_1 = require("../../math/polynomials/monom");
-const randint_1 = require("../../math/utils/random/randint");
-const shuffle_1 = require("../../utils/shuffle");
-const getConstantPrimitive = () => {
-    const c = (0, randint_1.randint)(-19, 20, [0]);
-    const monom = new monom_1.Monom(1, c);
-    const answer = `${monom.toTex()}+C`;
-    const question = {
-        instruction: `Déterminer la forme générale des primitives de la fonction constante $f$ définie par $f(x) = ${c}$.`,
-        startStatement: `F(x)`,
-        answer,
-        keys: ['x', 'C'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer },
-    };
-    return question;
-};
-exports.getConstantPrimitive = getConstantPrimitive;
-const getConstantPrimitivePropositions = (n, { answer }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    while (propositions.length < n) {
-        const wrongAnswer = `${(0, randint_1.randint)(-9, 10, [-1, 0, 1])}x + C`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.getConstantPrimitivePropositions = getConstantPrimitivePropositions;
-exports.constantPrimitive = {
-    id: 'constantPrimitive',
-    connector: '=',
-    label: "Primitive d'une constante",
-    levels: ['TermSpé', 'MathComp'],
-    sections: ['Primitives'],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(exports.getConstantPrimitive, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions: exports.getConstantPrimitivePropositions,
-};

package/lib/exercises/primitve/exponentialPrimitive.d.ts

@@ -1,13 +0,0 @@
-import { MathExercise, QCMGenerator, QuestionGenerator } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-    rand: boolean;
-    a: number;
-    coeffs: number[];
-};
-type VEAProps = {};
-export declare const getExponentialPrimitive: QuestionGenerator<QCMProps, VEAProps>;
-export declare const getExponentialPrimitivePropositions: QCMGenerator<QCMProps>;
-export declare const exponentialPrimitive: MathExercise<QCMProps, VEAProps>;
-export {};
-//# sourceMappingURL=exponentialPrimitive.d.ts.map

package/lib/exercises/primitve/exponentialPrimitive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"exponentialPrimitive.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitve/exponentialPrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAEZ,YAAY,EAEZ,iBAAiB,EAIlB,MAAM,0BAA0B,CAAC;AAelC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,OAAO,CAAC;IACd,CAAC,EAAE,MAAM,CAAC;IACV,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AACnB,eAAO,MAAM,uBAAuB,EAAE,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CA+BzE,CAAC;AAEF,eAAO,MAAM,mCAAmC,EAAE,YAAY,CAAC,QAAQ,CAwCtE,CAAC;AAEF,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWjE,CAAC"}

package/lib/exercises/primitve/exponentialPrimitive.js

@@ -1,98 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.exponentialPrimitive = exports.getExponentialPrimitivePropositions = exports.getExponentialPrimitive = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const polynomial_1 = require("../../math/polynomials/polynomial");
-const randint_1 = require("../../math/utils/random/randint");
-const expNode_1 = require("../../tree/nodes/functions/expNode");
-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 variableNode_1 = require("../../tree/nodes/variables/variableNode");
-const simplify_1 = require("../../tree/parsers/simplify");
-const coinFlip_1 = require("../../utils/coinFlip");
-const getExponentialPrimitive = () => {
-    const rand = (0, coinFlip_1.coinFlip)();
-    const a = (0, randint_1.randint)(-9, 10);
-    const u = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(1, 3));
-    let selectedFunction;
-    let integratedFuction;
-    if (rand) {
-        // a * e^(x)
-        const node = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new variableNode_1.VariableNode('x')));
-        selectedFunction = (0, simplify_1.simplifyNode)(node); // le simplify ici a pour but de éviter les 1*e / -1*e
-        integratedFuction = node;
-    }
-    else {
-        // u'(x) * e^(u(x))
-        const expUTree = new expNode_1.ExpNode(u.toTree());
-        selectedFunction = new multiplyNode_1.MultiplyNode(u.derivate().toTree(), expUTree);
-        integratedFuction = expUTree;
-    }
-    const answer = `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()}+C`;
-    const question = {
-        instruction: `Déterminer la forme générale des primitives de la fonction f définie par $f(x) = ${selectedFunction.toTex()}$.`,
-        startStatement: `F(x)`,
-        answer,
-        keys: ['x', 'C', 'epower', 'exp'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, a, rand, coeffs: u.coefficients },
-    };
-    return question;
-};
-exports.getExponentialPrimitive = getExponentialPrimitive;
-const getExponentialPrimitivePropositions = (n, { answer, a, rand, coeffs }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    if (rand) {
-        const aNode = new numberNode_1.NumberNode(a);
-        const xNode = new variableNode_1.VariableNode('x');
-        const expXTree = new expNode_1.ExpNode(new variableNode_1.VariableNode('x'));
-        const wrongIntegrals = [
-            new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-a), expXTree),
-            new multiplyNode_1.MultiplyNode(aNode, new expNode_1.ExpNode(new multiplyNode_1.MultiplyNode(aNode, xNode))),
-            new multiplyNode_1.MultiplyNode(aNode, new expNode_1.ExpNode(new fractionNode_1.FractionNode(xNode, aNode))),
-            new multiplyNode_1.MultiplyNode(aNode, new expNode_1.ExpNode(new addNode_1.AddNode(xNode, aNode))),
-            new multiplyNode_1.MultiplyNode(aNode, new expNode_1.ExpNode(new powerNode_1.PowerNode(xNode, aNode))),
-            expXTree,
-        ];
-        wrongIntegrals.forEach((node) => (0, exercise_1.tryToAddWrongProp)(propositions, (0, simplify_1.simplifyNode)(node).toTex()));
-    }
-    else {
-        const u = new polynomial_1.Polynomial(coeffs);
-        const uTree = u.toTree();
-        const expXTree = new expNode_1.ExpNode(new variableNode_1.VariableNode('x'));
-        const expUTree = new expNode_1.ExpNode(uTree);
-        const invUTree = new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), uTree);
-        const wrongIntegrals = [
-            new multiplyNode_1.MultiplyNode(uTree, expUTree),
-            new multiplyNode_1.MultiplyNode(u.derivate().toTree(), expUTree),
-            new multiplyNode_1.MultiplyNode(uTree, expXTree),
-            new multiplyNode_1.MultiplyNode(invUTree, expXTree),
-            new multiplyNode_1.MultiplyNode(invUTree, expUTree),
-            new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-9, 10, [0])), expUTree),
-        ];
-        wrongIntegrals.forEach((node) => (0, exercise_1.tryToAddWrongProp)(propositions, (0, simplify_1.simplifyNode)(node).toTex()));
-    }
-    while (propositions.length < n) {
-        let wrongIntegral = (0, randint_1.randint)(-10, 10) + 'e^x';
-        (0, exercise_1.tryToAddWrongProp)(propositions, `${wrongIntegral} + C`);
-    }
-    return (0, exercise_1.shuffleProps)(propositions, n);
-};
-exports.getExponentialPrimitivePropositions = getExponentialPrimitivePropositions;
-exports.exponentialPrimitive = {
-    id: 'exponentialPrimitive',
-    connector: '=',
-    label: 'Primitive de la fonction exponentielle',
-    levels: ['TermSpé', 'MathComp'],
-    sections: ['Primitives', 'Exponentielle'],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(exports.getExponentialPrimitive, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions: exports.getExponentialPrimitivePropositions,
-};

package/lib/exercises/primitve/logarithmePrimitive.d.ts

@@ -1,11 +0,0 @@
-import { MathExercise, QCMGenerator, QuestionGenerator } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-    coeffs: number[];
-};
-type VEAProps = {};
-export declare const getLogarithmePrimitive: QuestionGenerator<QCMProps, VEAProps>;
-export declare const getLogarithmePrimitivePropositions: QCMGenerator<QCMProps>;
-export declare const logarithmePrimitive: MathExercise<QCMProps, VEAProps>;
-export {};
-//# sourceMappingURL=logarithmePrimitive.d.ts.map

package/lib/exercises/primitve/logarithmePrimitive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"logarithmePrimitive.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitve/logarithmePrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAEZ,YAAY,EAEZ,iBAAiB,EAGlB,MAAM,0BAA0B,CAAC;AAUlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AACnB,eAAO,MAAM,sBAAsB,EAAE,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAkBxE,CAAC;AAEF,eAAO,MAAM,kCAAkC,EAAE,YAAY,CAAC,QAAQ,CA4BrE,CAAC;AAEF,eAAO,MAAM,mBAAmB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWhE,CAAC"}

package/lib/exercises/primitve/logarithmePrimitive.js

@@ -1,62 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.logarithmePrimitive = exports.getLogarithmePrimitivePropositions = exports.getLogarithmePrimitive = void 0;
-const exercise_1 = require("../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const polynomial_1 = require("../../math/polynomials/polynomial");
-const randint_1 = require("../../math/utils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-const powerNode_1 = require("../../tree/nodes/operators/powerNode");
-const simplify_1 = require("../../tree/parsers/simplify");
-const shuffle_1 = require("../../utils/shuffle");
-const getLogarithmePrimitive = () => {
-    const u = polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(1, 3));
-    const selectedFunction = new fractionNode_1.FractionNode(u.derivate().toTree(), u.toTree());
-    const integratedFuction = `\\ln\\left|${u.toTex()}\\right|`;
-    const answer = `${integratedFuction}+C`;
-    const question = {
-        instruction: `Déterminer la forme générale des primitives de la fonction f définie par $f(x) = ${(0, simplify_1.simplifyNode)(selectedFunction).toTex()}$.`,
-        startStatement: `F(x)`,
-        answer,
-        keys: ['x', 'C', 'ln', 'abs'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, coeffs: u.coefficients },
-    };
-    return question;
-};
-exports.getLogarithmePrimitive = getLogarithmePrimitive;
-const getLogarithmePrimitivePropositions = (n, { answer, coeffs }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const u = new polynomial_1.Polynomial(coeffs);
-    const wrongIntegrals = [
-        new fractionNode_1.FractionNode(u.derivate().toTree(), new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2))).toTex(),
-        new fractionNode_1.FractionNode(u
-            .derivate()
-            .multiply(new polynomial_1.Polynomial([-1]))
-            .toTree(), new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2))).toTex(),
-        `ln(${new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2)).toTex()})`,
-    ];
-    while (propositions.length < n) {
-        wrongIntegrals.push(new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2)).toTex(), `ln\|${polynomial_1.PolynomialConstructor.randomWithOrder((0, randint_1.randint)(1, 3)).toTex()}\|`);
-        let wrongIntegral;
-        wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
-        (0, exercise_1.tryToAddWrongProp)(propositions, `${wrongIntegral} + C`);
-        wrongIntegrals.pop();
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.getLogarithmePrimitivePropositions = getLogarithmePrimitivePropositions;
-exports.logarithmePrimitive = {
-    id: 'logarithmePrimitive',
-    connector: '=',
-    label: 'Primitive de la fonction logarithme',
-    levels: ['TermSpé', 'MathComp'],
-    sections: ['Primitives', 'Logarithme népérien'],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(exports.getLogarithmePrimitive, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions: exports.getLogarithmePrimitivePropositions,
-};

package/lib/exercises/primitve/polynomialPrimitive.d.ts

@@ -1,11 +0,0 @@
-import { MathExercise, QCMGenerator, QuestionGenerator } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-    degree: number;
-};
-type VEAProps = {};
-export declare const getPolynomialPrimitive: QuestionGenerator<QCMProps, VEAProps>;
-export declare const getPolynomialPrimitivePropositions: QCMGenerator<QCMProps>;
-export declare const polynomialPrimitive: MathExercise<QCMProps, VEAProps>;
-export {};
-//# sourceMappingURL=polynomialPrimitive.d.ts.map

package/lib/exercises/primitve/polynomialPrimitive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"polynomialPrimitive.d.ts","sourceRoot":"","sources":["../../../src/exercises/primitve/polynomialPrimitive.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAEZ,YAAY,EAEZ,iBAAiB,EAGlB,MAAM,0BAA0B,CAAC;AAiBlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA0BnB,eAAO,MAAM,sBAAsB,EAAE,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAiBxE,CAAC;AAEF,eAAO,MAAM,kCAAkC,EAAE,YAAY,CAAC,QAAQ,CAUrE,CAAC;AAEF,eAAO,MAAM,mBAAmB,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWhE,CAAC"}