math-exercises 1.3.42 → 1.3.43

package/README.md

@@ -1,73 +1,73 @@
-# math-exercises
-
-This is a generator of Math exercises for middle school and high school.
-
-So far, exercises are written in French, but any translation is welcome !
-
-This library is used by [Mathlive.fr](https://www.mathlive.fr) for collaborative quizzes.
-
-## 🚧 Work in progress !
-
-This library is still in beta and the architecture may very well completely change in the future.
-
-Incoming improvements :
-
-- Random images generation using tikZ
-
-- Steps within answers
-
-- Coverage of all topics up to 12th grade
-
-- Better classification of exercises
-
-## Exercises format
-
-Each Exercise has a `generator` that will return distinct questions for this exercise.
-
-The Question in itself has an `instruction`, a `startStatement` and an `answer` (which are all tex strings).
-
-You can see all the exercises implemented so far [by playing with the select input here](https://www.mathlive.fr/teacher/createActivity/quizCollab/623366c277e90f70691aee70/).
-
-## How to use
-
-Example with (ax+b)^2 questions :
-
-```js
-import { firstIdentity } from 'exercises/calculLitteral/distributivity/firstIdentity';
-
-console.log(firstIdentity.instruction);
-const question = firstIdentity.generator(1);
-console.log(question.startStatement);
-console.log(question.answer);
-
-//output :
-// Développer et réduire :
-// (2x+3)^2
-// 4x^2 + 12x + 9
-```
-
-Some exercises do not have instructions, because the instruction is directly in the question itself.
-
-A list of all exercises is exported from root.
-
-## Expression tree and latex parser
-
-Math expressions are implemented via a tree of Nodes that you'll find inside `tree/nodes`.
-
-Any expression can be turned into a valid latex output via the `.toTex()` method.
-
-They also can be simplified via the `simplifyNode` method.
-
-## Math objects
-
-This library also aims to implement pretty much all mathematical objects and notions up to 12th grade : all types of numbers and operations on them, but also points, vectors, polynomials, sets... Thus it can also be used for basic mathematics work.
-
-## Minimal dependencies
-
-We're trying to keep to our dependencies to a minimum. So far we're only using mathjs as an external library, to evaluate and simplify expression trees. We would love to have our own way of simplifying expressions in the future.
-
-## How to contribute
-
-Any contribution is welcomed.
-
-There are tons of exercises left to implement !
+# math-exercises
+
+This is a generator of Math exercises for middle school and high school.
+
+So far, exercises are written in French, but any translation is welcome !
+
+This library is used by [Mathlive.fr](https://www.mathlive.fr) for collaborative quizzes.
+
+## 🚧 Work in progress !
+
+This library is still in beta and the architecture may very well completely change in the future.
+
+Incoming improvements :
+
+- Random images generation using tikZ
+
+- Steps within answers
+
+- Coverage of all topics up to 12th grade
+
+- Better classification of exercises
+
+## Exercises format
+
+Each Exercise has a `generator` that will return distinct questions for this exercise.
+
+The Question in itself has an `instruction`, a `startStatement` and an `answer` (which are all tex strings).
+
+You can see all the exercises implemented so far [by playing with the select input here](https://www.mathlive.fr/teacher/createActivity/quizCollab/623366c277e90f70691aee70/).
+
+## How to use
+
+Example with (ax+b)^2 questions :
+
+```js
+import { firstIdentity } from 'exercises/calculLitteral/distributivity/firstIdentity';
+
+console.log(firstIdentity.instruction);
+const question = firstIdentity.generator(1);
+console.log(question.startStatement);
+console.log(question.answer);
+
+//output :
+// Développer et réduire :
+// (2x+3)^2
+// 4x^2 + 12x + 9
+```
+
+Some exercises do not have instructions, because the instruction is directly in the question itself.
+
+A list of all exercises is exported from root.
+
+## Expression tree and latex parser
+
+Math expressions are implemented via a tree of Nodes that you'll find inside `tree/nodes`.
+
+Any expression can be turned into a valid latex output via the `.toTex()` method.
+
+They also can be simplified via the `simplifyNode` method.
+
+## Math objects
+
+This library also aims to implement pretty much all mathematical objects and notions up to 12th grade : all types of numbers and operations on them, but also points, vectors, polynomials, sets... Thus it can also be used for basic mathematics work.
+
+## Minimal dependencies
+
+We're trying to keep to our dependencies to a minimum. So far we're only using mathjs as an external library, to evaluate and simplify expression trees. We would love to have our own way of simplifying expressions in the future.
+
+## How to contribute
+
+Any contribution is welcomed.
+
+There are tons of exercises left to implement !

package/lib/exercises/calcul/addAndSub.d.ts

@@ -1,7 +1,7 @@
-import { Exercise, Question } from '../exercise';
-/**
- * a±b±c±d
- */
-export declare const addAndSubExercise: Exercise;
-export declare function getAddAndSubQuestions(): Question;
+import { Exercise, Question } from '../exercise';
+/**
+ * a±b±c±d
+ */
+export declare const addAndSubExercise: Exercise;
+export declare function getAddAndSubQuestions(): Question;
 //# sourceMappingURL=addAndSub.d.ts.map

package/lib/exercises/calcul/addAndSub.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"addAndSub.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSub.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D;;GAEG;AACH,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAmDhD"}
+{"version":3,"file":"addAndSub.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSub.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D;;GAEG;AACH,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,qBAAqB,IAAI,QAAQ,CAsDhD"}

package/lib/exercises/calcul/addAndSub.js

@@ -1,68 +1,71 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getAddAndSubQuestions = exports.addAndSubExercise = void 0;
-const randint_1 = require("../../math/utils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const shuffle_1 = require("../../utils/shuffle");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-/**
- * a±b±c±d
- */
-exports.addAndSubExercise = {
-    id: 'addAndSub',
-    connector: '=',
-    instruction: 'Calculer :',
-    label: 'Additions et soustractions',
-    levels: ['6', '5'],
-    section: 'Calculs',
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddAndSubQuestions, nb),
-    keys: [],
-};
-function getAddAndSubQuestions() {
-    const nbOperations = (0, randint_1.randint)(2, 4);
-    const numbers = [];
-    for (let i = 0; i < nbOperations + 1; i++) {
-        numbers.push((0, randint_1.randint)(-15, 15, [0]));
-    }
-    const allNumbersNodes = numbers.map((nb) => new numberNode_1.NumberNode(nb));
-    let statementTree = new addNode_1.AddNode(allNumbersNodes[0], allNumbersNodes[1]);
-    for (let i = 2; i < allNumbersNodes.length; i++) {
-        statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
-    }
-    const answer = numbers.reduce((a, b) => a + b);
-    const getPropositions = (n) => {
-        const res = [];
-        res.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer.toString(),
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const randomOffset = (0, randint_1.randint)(-9, 10, [0]);
-                const wrongAnswer = answer + randomOffset;
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: wrongAnswer.toString(),
-                    isRightAnswer: false,
-                };
-                isDuplicate = res.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            res.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(res);
-    };
-    const question = {
-        startStatement: statementTree.toTex(),
-        answer: answer + '',
-        keys: [],
-        getPropositions,
-    };
-    return question;
-}
-exports.getAddAndSubQuestions = getAddAndSubQuestions;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getAddAndSubQuestions = exports.addAndSubExercise = void 0;
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../utils/shuffle");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+/**
+ * a±b±c±d
+ */
+exports.addAndSubExercise = {
+    id: 'addAndSub',
+    connector: '=',
+    instruction: 'Calculer :',
+    label: 'Additions et soustractions',
+    levels: ['6', '5'],
+    section: 'Calculs',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddAndSubQuestions, nb),
+    keys: [],
+};
+function getAddAndSubQuestions() {
+    const nbOperations = (0, randint_1.randint)(2, 4);
+    const numbers = [];
+    for (let i = 0; i < nbOperations + 1; i++) {
+        numbers.push((0, randint_1.randint)(-15, 15, [0]));
+    }
+    const allNumbersNodes = numbers.map((nb) => new numberNode_1.NumberNode(nb));
+    let statementTree = new addNode_1.AddNode(allNumbersNodes[0], allNumbersNodes[1]);
+    for (let i = 2; i < allNumbersNodes.length; i++) {
+        statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
+    }
+    const answer = numbers.reduce((a, b) => a + b);
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toString(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const randomOffset = (0, randint_1.randint)(-9, 10, [0]);
+                const wrongAnswer = answer + randomOffset;
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toString(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        startStatement: statementTree.toTex(),
+        answer: answer + '',
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getAddAndSubQuestions = getAddAndSubQuestions;

package/lib/exercises/calcul/addAndSubWithoutRelatives.d.ts

@@ -1,7 +1,7 @@
-import { Exercise, Question } from '../exercise';
-/**
- * a±b±c±d
- */
-export declare const addAndSubWithoutRelatives: Exercise;
-export declare function getAddAndSubWithoutRelatives(): Question;
+import { Exercise, Question } from '../exercise';
+/**
+ * a±b±c±d
+ */
+export declare const addAndSubWithoutRelatives: Exercise;
+export declare function getAddAndSubWithoutRelatives(): Question;
 //# sourceMappingURL=addAndSubWithoutRelatives.d.ts.map

package/lib/exercises/calcul/addAndSubWithoutRelatives.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"addAndSubWithoutRelatives.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSubWithoutRelatives.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D;;GAEG;AACH,eAAO,MAAM,yBAAyB,EAAE,QAUvC,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CAgEvD"}
+{"version":3,"file":"addAndSubWithoutRelatives.d.ts","sourceRoot":"","sources":["../../../src/exercises/calcul/addAndSubWithoutRelatives.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI9D;;GAEG;AACH,eAAO,MAAM,yBAAyB,EAAE,QAUvC,CAAC;AAEF,wBAAgB,4BAA4B,IAAI,QAAQ,CAmEvD"}

package/lib/exercises/calcul/addAndSubWithoutRelatives.js

@@ -1,77 +1,80 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getAddAndSubWithoutRelatives = exports.addAndSubWithoutRelatives = void 0;
-const randint_1 = require("../../math/utils/random/randint");
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const shuffle_1 = require("../../utils/shuffle");
-const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
-const uuid_1 = require("uuid");
-/**
- * a±b±c±d
- */
-exports.addAndSubWithoutRelatives = {
-    id: 'addAndSubWithoutRelatives',
-    connector: '=',
-    instruction: 'Calculer :',
-    label: 'Additions et soustractions sans les nombres relatifs',
-    levels: ['6', '5'],
-    section: 'Calculs',
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddAndSubWithoutRelatives, nb),
-    keys: [],
-};
-function getAddAndSubWithoutRelatives() {
-    let answer = -1;
-    let statementTree;
-    while (answer < 0) {
-        const nbOperations = (0, randint_1.randint)(2, 4);
-        let numbers = [];
-        do {
-            numbers = [];
-            numbers.push((0, randint_1.randint)(1, 15));
-            let sum = numbers[0];
-            for (let i = 1; i < nbOperations + 1; i++) {
-                numbers.push((0, randint_1.randint)(-sum, 15, [0]));
-                sum += numbers[i];
-            }
-        } while (numbers.every((a) => a > 0));
-        const allNumbersNodes = numbers.map((nb) => new numberNode_1.NumberNode(nb));
-        statementTree = new addNode_1.AddNode(allNumbersNodes[0], allNumbersNodes[1]);
-        for (let i = 2; i < allNumbersNodes.length; i++) {
-            statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
-        }
-        answer = numbers.reduce((a, b) => a + b);
-    }
-    const getPropositions = (n) => {
-        const propositions = [];
-        propositions.push({
-            id: (0, uuid_1.v4)() + '',
-            statement: answer.toString(),
-            isRightAnswer: true,
-        });
-        for (let i = 0; i < n - 1; i++) {
-            let isDuplicate;
-            let proposition;
-            do {
-                const incorrectAnswer = answer + (0, randint_1.randint)(-5, 6, [0]);
-                proposition = {
-                    id: (0, uuid_1.v4)() + '',
-                    statement: incorrectAnswer.toString(),
-                    isRightAnswer: false,
-                };
-                isDuplicate = propositions.some((p) => p.statement === proposition.statement);
-            } while (isDuplicate);
-            propositions.push(proposition);
-        }
-        return (0, shuffle_1.shuffle)(propositions);
-    };
-    const question = {
-        startStatement: statementTree.toTex(),
-        answer: answer.toString(),
-        keys: [],
-        getPropositions,
-    };
-    return question;
-}
-exports.getAddAndSubWithoutRelatives = getAddAndSubWithoutRelatives;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getAddAndSubWithoutRelatives = exports.addAndSubWithoutRelatives = void 0;
+const randint_1 = require("../../math/utils/random/randint");
+const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../tree/nodes/operators/addNode");
+const shuffle_1 = require("../../utils/shuffle");
+const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
+const uuid_1 = require("uuid");
+/**
+ * a±b±c±d
+ */
+exports.addAndSubWithoutRelatives = {
+    id: 'addAndSubWithoutRelatives',
+    connector: '=',
+    instruction: 'Calculer :',
+    label: 'Additions et soustractions sans les nombres relatifs',
+    levels: ['6', '5'],
+    section: 'Calculs',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAddAndSubWithoutRelatives, nb),
+    keys: [],
+};
+function getAddAndSubWithoutRelatives() {
+    let answer = -1;
+    let statementTree;
+    while (answer < 0) {
+        const nbOperations = (0, randint_1.randint)(2, 4);
+        let numbers = [];
+        do {
+            numbers = [];
+            numbers.push((0, randint_1.randint)(1, 15));
+            let sum = numbers[0];
+            for (let i = 1; i < nbOperations + 1; i++) {
+                numbers.push((0, randint_1.randint)(-sum, 15, [0]));
+                sum += numbers[i];
+            }
+        } while (numbers.every((a) => a > 0));
+        const allNumbersNodes = numbers.map((nb) => new numberNode_1.NumberNode(nb));
+        statementTree = new addNode_1.AddNode(allNumbersNodes[0], allNumbersNodes[1]);
+        for (let i = 2; i < allNumbersNodes.length; i++) {
+            statementTree = new addNode_1.AddNode(statementTree, allNumbersNodes[i]);
+        }
+        answer = numbers.reduce((a, b) => a + b);
+    }
+    const getPropositions = (n) => {
+        const propositions = [];
+        propositions.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toString(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const incorrectAnswer = answer + (0, randint_1.randint)(-5, 6, [0]);
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: incorrectAnswer.toString(),
+                    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 = {
+        startStatement: statementTree.toTex(),
+        answer: answer.toString(),
+        keys: [],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getAddAndSubWithoutRelatives = getAddAndSubWithoutRelatives;

package/lib/exercises/calcul/arithmetics/euclideanDivision.d.ts

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

package/lib/exercises/calcul/arithmetics/euclideanDivision.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"euclideanDivision.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/euclideanDivision.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,iBAAiB,EAAE,QAU/B,CAAC;AAEF,wBAAgB,6BAA6B,IAAI,QAAQ,CAgExD"}

package/lib/exercises/calcul/arithmetics/euclideanDivision.js

@@ -0,0 +1,70 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getEuclideanDivisionQuestions = exports.euclideanDivision = void 0;
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const randint_1 = require("../../../math/utils/random/randint");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const addNode_1 = require("../../../tree/nodes/operators/addNode");
+const equalNode_1 = require("../../../tree/nodes/operators/equalNode");
+const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const uuid_1 = require("uuid");
+exports.euclideanDivision = {
+    id: 'euclideanDivision',
+    connector: '=',
+    instruction: '',
+    label: 'Ecrire une division euclidienne',
+    levels: ['6', '5', '4'],
+    section: 'Arithmétique',
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getEuclideanDivisionQuestions, nb),
+    keys: ['equal'],
+};
+function getEuclideanDivisionQuestions() {
+    let dividend = (0, randint_1.randint)(5, 100);
+    let divisor = (0, randint_1.randint)(2, 11);
+    while (dividend % divisor === 0) {
+        dividend = (0, randint_1.randint)(5, 100);
+        divisor = (0, randint_1.randint)(2, 11);
+    }
+    const quotient = Math.floor(dividend / divisor);
+    const remainder = dividend % divisor;
+    const answer = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)));
+    const getPropositions = (n) => {
+        const res = [];
+        res.push({
+            id: (0, uuid_1.v4)() + '',
+            statement: answer.toTex(),
+            isRightAnswer: true,
+            format: 'tex',
+        });
+        for (let i = 0; i < n - 1; i++) {
+            let isDuplicate;
+            let proposition;
+            do {
+                const divisor = (0, randint_1.randint)(2, 11);
+                const quotient = Math.floor((0, randint_1.randint)(5, 100) / divisor);
+                const remainder = (0, randint_1.randint)(5, 100) % divisor;
+                const wrongAnswer = new equalNode_1.EqualNode(new numberNode_1.NumberNode(dividend), new addNode_1.AddNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(divisor), new numberNode_1.NumberNode(quotient)), new numberNode_1.NumberNode(remainder)));
+                proposition = {
+                    id: (0, uuid_1.v4)() + '',
+                    statement: wrongAnswer.toTex(),
+                    isRightAnswer: false,
+                    format: 'tex',
+                };
+                isDuplicate = res.some((p) => p.statement === proposition.statement);
+            } while (isDuplicate);
+            res.push(proposition);
+        }
+        return (0, shuffle_1.shuffle)(res);
+    };
+    const question = {
+        instruction: `Ecrire la division euclidienne de ${dividend} par ${divisor}`,
+        answer: answer.toTex(),
+        keys: ['equal'],
+        getPropositions,
+        answerFormat: 'tex',
+    };
+    return question;
+}
+exports.getEuclideanDivisionQuestions = getEuclideanDivisionQuestions;

package/lib/exercises/calcul/arithmetics/primeNumbers.d.ts

@@ -1,7 +1,7 @@
-import { Exercise, Question } from '../../exercise';
-/**
- * a±b±c±d
- */
-export declare const primeNumbers: Exercise;
-export declare function getPrimeNumbers(): Question;
+import { Exercise, Question } from '../../exercise';
+/**
+ * a±b±c±d
+ */
+export declare const primeNumbers: Exercise;
+export declare function getPrimeNumbers(): Question;
 //# sourceMappingURL=primeNumbers.d.ts.map

package/lib/exercises/calcul/arithmetics/primeNumbers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"primeNumbers.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/primeNumbers.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAGjE;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAQF,wBAAgB,eAAe,IAAI,QAAQ,CAyE1C"}
+{"version":3,"file":"primeNumbers.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calcul/arithmetics/primeNumbers.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAGjE;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,QAU1B,CAAC;AAQF,wBAAgB,eAAe,IAAI,QAAQ,CA4E1C"}