math-exercises 1.3.54 → 1.3.56

package/lib/exercises/primitve/logarithmePrimitive.js

@@ -1,74 +1,74 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getLogarithmePrimitive = exports.logarithmePrimitive = void 0;
-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 uuid_1 = require("uuid");
-exports.logarithmePrimitive = {
-    id: 'logarithmePrimitive',
-    connector: '=',
-    instruction: '',
-    label: 'Primitive de la fonction logarithme',
-    levels: ['TermSpé'],
-    sections: ['Primitives', 'Logarithme népérien'],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLogarithmePrimitive, nb),
-    keys: ['x', 'C', 'ln', 'abs'],
-};
-function getLogarithmePrimitive() {
-    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
-    const selectedFunction = new fractionNode_1.FractionNode(u.derivate().toTree(), u.toTree());
-    const integratedFuction = `ln\|${u.toTex()}\|`;
-    const getPropositions = (n) => {
-        const propositions = [];
-        propositions.push({
-            id: (0, uuid_1.v4)(),
-            statement: `${integratedFuction} + C`,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            let wrongIntegral;
-            do {
-                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()})`,
-                    new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2)).toTex(),
-                    `ln\|${(0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3)).toTex()}\|`,
-                ];
-                wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
-                proposition = {
-                    id: (0, uuid_1.v4)(),
-                    statement: `${wrongIntegral} + C`,
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            propositions.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(propositions);
-    };
-    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: `${integratedFuction} + C`,
-        keys: ['x', 'C', 'ln', 'abs'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getLogarithmePrimitive = getLogarithmePrimitive;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getLogarithmePrimitive = exports.logarithmePrimitive = void 0;
+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 uuid_1 = require("uuid");
+exports.logarithmePrimitive = {
+    id: 'logarithmePrimitive',
+    connector: '=',
+    instruction: '',
+    label: 'Primitive de la fonction logarithme',
+    levels: ['TermSpé', 'MathComp'],
+    sections: ['Primitives', 'Logarithme népérien'],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getLogarithmePrimitive, nb),
+    keys: ['x', 'C', 'ln', 'abs'],
+};
+function getLogarithmePrimitive() {
+    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
+    const selectedFunction = new fractionNode_1.FractionNode(u.derivate().toTree(), u.toTree());
+    const integratedFuction = `ln\|${u.toTex()}\|`;
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: `${integratedFuction} + C`,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            let wrongIntegral;
+            do {
+                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()})`,
+                    new powerNode_1.PowerNode(u.toTree(), new numberNode_1.NumberNode(2)).toTex(),
+                    `ln\|${(0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3)).toTex()}\|`,
+                ];
+                wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: `${wrongIntegral} + C`,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    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: `${integratedFuction} + C`,
+        keys: ['x', 'C', 'ln', 'abs'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getLogarithmePrimitive = getLogarithmePrimitive;

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

@@ -1,4 +1,4 @@
-import { Exercise, Question } from '../../exercises/exercise';
-export declare const polynomialPrimitive: Exercise;
-export declare function getPolynomialPrimitive(): Question;
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const polynomialPrimitive: Exercise;
+export declare function getPolynomialPrimitive(): Question;
 //# sourceMappingURL=polynomialPrimitive.d.ts.map

package/lib/exercises/primitve/polynomialPrimitive.js

@@ -1,80 +1,80 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getPolynomialPrimitive = exports.polynomialPrimitive = void 0;
-const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
-const polynomial_1 = require("../../math/polynomials/polynomial");
-const randint_1 = require("../../math/utils/random/randint");
-const constantNode_1 = require("../../tree/nodes/numbers/constantNode");
-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 shuffle_1 = require("../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.polynomialPrimitive = {
-    id: 'polynomialPrimitive',
-    connector: '=',
-    instruction: '',
-    label: "Primitive d'une fonction polynomiale",
-    levels: ['TermSpé'],
-    sections: ['Primitives'],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPolynomialPrimitive, nb),
-    keys: ['x', 'C'],
-};
-function getIntegratedPolynomialNode(polynomial) {
-    let integralPolynomial = new constantNode_1.ConstantNode('C', 'C');
-    for (let i = 0; i < polynomial.degree + 1; i++) {
-        const coeff = polynomial.coefficients[i];
-        if (coeff === 0)
-            continue;
-        const nodeCoeff = new fractionNode_1.FractionNode(new numberNode_1.NumberNode(coeff), new numberNode_1.NumberNode(i + 1));
-        const terme = new multiplyNode_1.MultiplyNode((0, simplify_1.simplifyNode)(nodeCoeff), i + 1 === 1 ? new variableNode_1.VariableNode('x') : new powerNode_1.PowerNode(new variableNode_1.VariableNode('x'), new numberNode_1.NumberNode(i + 1)));
-        integralPolynomial = new addNode_1.AddNode(terme, integralPolynomial);
-    }
-    return integralPolynomial;
-}
-function getPolynomialPrimitive() {
-    const degree = (0, randint_1.randint)(1, 4);
-    const polynomial = (0, polynomial_1.createRandomPolynomialWithOrder)(degree);
-    const integralPolynomial = getIntegratedPolynomialNode(polynomial);
-    const getPropositions = (n) => {
-        const propositions = [];
-        propositions.push({
-            id: (0, uuid_1.v4)(),
-            statement: `${integralPolynomial.toTex()}`,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const wrongPolynomial = (0, polynomial_1.createRandomPolynomialWithOrder)(degree);
-                const wrongIntegral = getIntegratedPolynomialNode(wrongPolynomial);
-                proposition = {
-                    id: (0, uuid_1.v4)(),
-                    statement: wrongIntegral.toTex(),
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            propositions.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(propositions);
-    };
-    const question = {
-        instruction: `Déterminer la forme générale des primitives de la fonction polynomiale $f$ définie par $f(x) = ${polynomial.toTex()}$.`,
-        startStatement: `F(x)`,
-        answer: `${integralPolynomial.toTex()}`,
-        keys: ['x', 'C'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getPolynomialPrimitive = getPolynomialPrimitive;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getPolynomialPrimitive = exports.polynomialPrimitive = void 0;
+const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../math/polynomials/polynomial");
+const randint_1 = require("../../math/utils/random/randint");
+const constantNode_1 = require("../../tree/nodes/numbers/constantNode");
+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 shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.polynomialPrimitive = {
+    id: 'polynomialPrimitive',
+    connector: '=',
+    instruction: '',
+    label: "Primitive d'une fonction polynomiale",
+    levels: ['TermSpé', 'MathComp'],
+    sections: ['Primitives'],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getPolynomialPrimitive, nb),
+    keys: ['x', 'C'],
+};
+function getIntegratedPolynomialNode(polynomial) {
+    let integralPolynomial = new constantNode_1.ConstantNode('C', 'C');
+    for (let i = 0; i < polynomial.degree + 1; i++) {
+        const coeff = polynomial.coefficients[i];
+        if (coeff === 0)
+            continue;
+        const nodeCoeff = new fractionNode_1.FractionNode(new numberNode_1.NumberNode(coeff), new numberNode_1.NumberNode(i + 1));
+        const terme = new multiplyNode_1.MultiplyNode((0, simplify_1.simplifyNode)(nodeCoeff), i + 1 === 1 ? new variableNode_1.VariableNode('x') : new powerNode_1.PowerNode(new variableNode_1.VariableNode('x'), new numberNode_1.NumberNode(i + 1)));
+        integralPolynomial = new addNode_1.AddNode(terme, integralPolynomial);
+    }
+    return integralPolynomial;
+}
+function getPolynomialPrimitive() {
+    const degree = (0, randint_1.randint)(1, 4);
+    const polynomial = (0, polynomial_1.createRandomPolynomialWithOrder)(degree);
+    const integralPolynomial = getIntegratedPolynomialNode(polynomial);
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: `${integralPolynomial.toTex()}`,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const wrongPolynomial = (0, polynomial_1.createRandomPolynomialWithOrder)(degree);
+                const wrongIntegral = getIntegratedPolynomialNode(wrongPolynomial);
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: wrongIntegral.toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    const question = {
+        instruction: `Déterminer la forme générale des primitives de la fonction polynomiale $f$ définie par $f(x) = ${polynomial.toTex()}$.`,
+        startStatement: `F(x)`,
+        answer: `${integralPolynomial.toTex()}`,
+        keys: ['x', 'C'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getPolynomialPrimitive = getPolynomialPrimitive;

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

@@ -1,4 +1,4 @@
-import { Exercise, Question } from '../../exercises/exercise';
-export declare const sinCosPrimitive: Exercise;
-export declare function getSinCosPrimitive(): Question;
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const sinCosPrimitive: Exercise;
+export declare function getSinCosPrimitive(): Question;
 //# sourceMappingURL=sinCosPrimitive.d.ts.map

package/lib/exercises/primitve/sinCosPrimitive.js

@@ -1,112 +1,112 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getSinCosPrimitive = exports.sinCosPrimitive = void 0;
-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 sinNode_1 = require("../../tree/nodes/functions/sinNode");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const variableNode_1 = require("../../tree/nodes/variables/variableNode");
-const simplify_1 = require("../../tree/parsers/simplify");
-const coinFlip_1 = require("../../utils/coinFlip");
-const shuffle_1 = require("../../utils/shuffle");
-const uuid_1 = require("uuid");
-exports.sinCosPrimitive = {
-    id: 'sinCosPrimitive',
-    connector: '=',
-    instruction: '',
-    label: 'Primitive de sin et cos',
-    levels: ['TermSpé'],
-    sections: ['Primitives', 'Trigonométrie'],
-    isSingleStep: false,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSinCosPrimitive, nb),
-    keys: ['x', 'C', 'sin', 'cos'],
-};
-function getSinCosPrimitive() {
-    const rand = (0, coinFlip_1.coinFlip)();
-    const a = (0, randint_1.randint)(-9, 10, [0]);
-    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
-    let selectedFunction;
-    let integratedFuction;
-    if (rand) {
-        // a * cos(x) ou a* sin(x)
-        const oneOrTwo = (0, coinFlip_1.coinFlip)();
-        selectedFunction = oneOrTwo
-            ? 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 = oneOrTwo
-            ? 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')));
-    }
-    else {
-        // u'(x) * cos(u(x))
-        const oneOrTwo = (0, coinFlip_1.coinFlip)();
-        selectedFunction = oneOrTwo
-            ? 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 = oneOrTwo
-            ? new sinNode_1.SinNode(u.toTree())
-            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-1), new cosNode_1.CosNode(u.toTree()));
-    }
-    const getPropositions = (n) => {
-        const propositions = [];
-        propositions.push({
-            id: (0, uuid_1.v4)(),
-            statement: `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()} + C`,
-            isRightAnswer: true,
-            format: 'tex',
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            let wrongIntegral;
-            do {
-                if (rand) {
-                    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'))),
-                    ];
-                    wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
-                }
-                else {
-                    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'))),
-                    ];
-                    wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
-                }
-                proposition = {
-                    id: (0, uuid_1.v4)(),
-                    statement: `${(0, simplify_1.simplifyNode)(wrongIntegral).toTex()} + C`,
-                    isRightAnswer: false,
-                    format: 'tex',
-                };
-                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            propositions.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(propositions);
-    };
-    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: `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()} + C`,
-        keys: ['x', 'C', 'sin', 'cos'],
-        getPropositions,
-        answerFormat: 'tex',
-    };
-    return question;
-}
-exports.getSinCosPrimitive = getSinCosPrimitive;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSinCosPrimitive = exports.sinCosPrimitive = void 0;
+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 sinNode_1 = require("../../tree/nodes/functions/sinNode");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+const variableNode_1 = require("../../tree/nodes/variables/variableNode");
+const simplify_1 = require("../../tree/parsers/simplify");
+const coinFlip_1 = require("../../utils/coinFlip");
+const shuffle_1 = require("../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.sinCosPrimitive = {
+    id: 'sinCosPrimitive',
+    connector: '=',
+    instruction: '',
+    label: 'Primitive de sin et cos',
+    levels: ['TermSpé', 'MathComp'],
+    sections: ['Primitives', 'Trigonométrie'],
+    isSingleStep: false,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getSinCosPrimitive, nb),
+    keys: ['x', 'C', 'sin', 'cos'],
+};
+function getSinCosPrimitive() {
+    const rand = (0, coinFlip_1.coinFlip)();
+    const a = (0, randint_1.randint)(-9, 10, [0]);
+    const u = (0, polynomial_1.createRandomPolynomialWithOrder)((0, randint_1.randint)(1, 3));
+    let selectedFunction;
+    let integratedFuction;
+    if (rand) {
+        // a * cos(x) ou a* sin(x)
+        const oneOrTwo = (0, coinFlip_1.coinFlip)();
+        selectedFunction = oneOrTwo
+            ? 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 = oneOrTwo
+            ? 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')));
+    }
+    else {
+        // u'(x) * cos(u(x))
+        const oneOrTwo = (0, coinFlip_1.coinFlip)();
+        selectedFunction = oneOrTwo
+            ? 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 = oneOrTwo
+            ? new sinNode_1.SinNode(u.toTree())
+            : new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(-1), new cosNode_1.CosNode(u.toTree()));
+    }
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)(),
+            statement: `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()} + C`,
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            let wrongIntegral;
+            do {
+                if (rand) {
+                    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'))),
+                    ];
+                    wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
+                }
+                else {
+                    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'))),
+                    ];
+                    wrongIntegral = wrongIntegrals[(0, randint_1.randint)(0, wrongIntegrals.length)];
+                }
+                proposition = {
+                    id: (0, uuid_1.v4)(),
+                    statement: `${(0, simplify_1.simplifyNode)(wrongIntegral).toTex()} + C`,
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            propositions.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(propositions);
+    };
+    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: `${(0, simplify_1.simplifyNode)(integratedFuction).toTex()} + C`,
+        keys: ['x', 'C', 'sin', 'cos'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getSinCosPrimitive = getSinCosPrimitive;

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

@@ -1,4 +1,4 @@
-import { Exercise, Question } from '../../exercises/exercise';
-export declare const usualPrimitives: Exercise;
-export declare function getUsualPrimitives(): Question;
+import { Exercise, Question } from '../../exercises/exercise';
+export declare const usualPrimitives: Exercise;
+export declare function getUsualPrimitives(): Question;
 //# sourceMappingURL=usualPrimitives.d.ts.map