math-exercises 1.3.41 → 1.3.43
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/lib/exercises/calcul/addAndSub.d.ts.map +1 -1
- package/lib/exercises/calcul/addAndSub.js +3 -0
- package/lib/exercises/calcul/addAndSubWithoutRelatives.d.ts.map +1 -1
- package/lib/exercises/calcul/addAndSubWithoutRelatives.js +3 -0
- package/lib/exercises/calcul/arithmetics/euclideanDivision.d.ts +4 -0
- package/lib/exercises/calcul/arithmetics/euclideanDivision.d.ts.map +1 -0
- package/lib/exercises/calcul/arithmetics/euclideanDivision.js +70 -0
- package/lib/exercises/calcul/arithmetics/primeNumbers.d.ts.map +1 -1
- package/lib/exercises/calcul/arithmetics/primeNumbers.js +4 -1
- package/lib/exercises/calcul/fractions/fractionAndIntegerDivision.d.ts.map +1 -1
- package/lib/exercises/calcul/fractions/fractionAndIntegerDivision.js +3 -0
- package/lib/exercises/calcul/fractions/fractionAndIntegerProduct.d.ts.map +1 -1
- package/lib/exercises/calcul/fractions/fractionAndIntegerProduct.js +3 -0
- package/lib/exercises/calcul/fractions/fractionAndIntegerSum.d.ts.map +1 -1
- package/lib/exercises/calcul/fractions/fractionAndIntegerSum.js +3 -0
- package/lib/exercises/calcul/fractions/fractionToPercentToDecimal.d.ts.map +1 -1
- package/lib/exercises/calcul/fractions/fractionToPercentToDecimal.js +3 -0
- package/lib/exercises/calcul/fractions/fractionsDivision.d.ts.map +1 -1
- package/lib/exercises/calcul/fractions/fractionsDivision.js +3 -0
- package/lib/exercises/calcul/fractions/fractionsProduct.d.ts.map +1 -1
- package/lib/exercises/calcul/fractions/fractionsProduct.js +3 -0
- package/lib/exercises/calcul/fractions/fractionsSum.d.ts.map +1 -1
- package/lib/exercises/calcul/fractions/fractionsSum.js +3 -0
- package/lib/exercises/calcul/fractions/simplifyFraction.d.ts.map +1 -1
- package/lib/exercises/calcul/fractions/simplifyFraction.js +3 -0
- package/lib/exercises/calcul/mentalCaluls.ts/mentalAddAndSub.d.ts.map +1 -1
- package/lib/exercises/calcul/mentalCaluls.ts/mentalAddAndSub.js +3 -0
- package/lib/exercises/calcul/mentalCaluls.ts/mentalDivisions.d.ts.map +1 -1
- package/lib/exercises/calcul/mentalCaluls.ts/mentalDivisions.js +3 -0
- package/lib/exercises/calcul/mentalCaluls.ts/mentalMultiplications.d.ts.map +1 -1
- package/lib/exercises/calcul/mentalCaluls.ts/mentalMultiplications.js +3 -0
- package/lib/exercises/calcul/mentalCaluls.ts/mentalPercentage.d.ts.map +1 -1
- package/lib/exercises/calcul/mentalCaluls.ts/mentalPercentage.js +3 -0
- package/lib/exercises/calcul/operations/operationsPriorities.d.ts.map +1 -1
- package/lib/exercises/calcul/operations/operationsPriorities.js +3 -0
- package/lib/exercises/calcul/operations/operationsPrioritiesWithoutRelative.d.ts.map +1 -1
- package/lib/exercises/calcul/operations/operationsPrioritiesWithoutRelative.js +3 -0
- package/lib/exercises/calcul/proportionality/proportionalityTable.d.ts.map +1 -1
- package/lib/exercises/calcul/proportionality/proportionalityTable.js +3 -0
- package/lib/exercises/calcul/rounding/rounding.d.ts.map +1 -1
- package/lib/exercises/calcul/rounding/rounding.js +6 -0
- package/lib/exercises/calculLitteral/distributivity/doubleDistributivity.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/distributivity/doubleDistributivity.js +5 -0
- package/lib/exercises/calculLitteral/distributivity/firstIdentity.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/distributivity/firstIdentity.js +6 -0
- package/lib/exercises/calculLitteral/distributivity/secondIdentity.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/distributivity/secondIdentity.js +6 -0
- package/lib/exercises/calculLitteral/distributivity/simpleDistributivity.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/distributivity/simpleDistributivity.js +6 -0
- package/lib/exercises/calculLitteral/distributivity/thirdIdentity.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/distributivity/thirdIdentity.js +6 -0
- package/lib/exercises/calculLitteral/equation/equationSimpleSquare.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/equation/equationSimpleSquare.js +12 -0
- package/lib/exercises/calculLitteral/equation/equationType1Exercise.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/equation/equationType1Exercise.js +3 -0
- package/lib/exercises/calculLitteral/equation/equationType2Exercise.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/equation/equationType2Exercise.js +3 -0
- package/lib/exercises/calculLitteral/equation/equationType3Exercise.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/equation/equationType3Exercise.js +3 -0
- package/lib/exercises/calculLitteral/equation/equationType4Exercise.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/equation/equationType4Exercise.js +3 -0
- package/lib/exercises/calculLitteral/equation/expEquation.d.ts +4 -0
- package/lib/exercises/calculLitteral/equation/expEquation.d.ts.map +1 -0
- package/lib/exercises/calculLitteral/equation/expEquation.js +67 -0
- package/lib/exercises/calculLitteral/equation/firstDegreeEquation.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/equation/firstDegreeEquation.js +3 -0
- package/lib/exercises/calculLitteral/equation/fractionEquation.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/equation/fractionEquation.js +3 -0
- package/lib/exercises/calculLitteral/equation/logEquation.d.ts +4 -0
- package/lib/exercises/calculLitteral/equation/logEquation.d.ts.map +1 -0
- package/lib/exercises/calculLitteral/equation/logEquation.js +67 -0
- package/lib/exercises/calculLitteral/equation/multiplicationEquation.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/equation/multiplicationEquation.js +3 -0
- package/lib/exercises/calculLitteral/factorisation/factoIdRmq1.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/factorisation/factoIdRmq1.js +4 -0
- package/lib/exercises/calculLitteral/factorisation/factoIdRmq2.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/factorisation/factoIdRmq2.js +5 -0
- package/lib/exercises/calculLitteral/factorisation/factoIdRmq3.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/factorisation/factoIdRmq3.js +6 -0
- package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/factorisation/factoType1Exercise.js +6 -0
- package/lib/exercises/calculLitteral/simplifying/evaluateExpression.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/simplifying/evaluateExpression.js +3 -0
- package/lib/exercises/calculLitteral/simplifying/expSimplifiying.d.ts +4 -0
- package/lib/exercises/calculLitteral/simplifying/expSimplifiying.d.ts.map +1 -0
- package/lib/exercises/calculLitteral/simplifying/expSimplifiying.js +96 -0
- package/lib/exercises/calculLitteral/simplifying/logSimplifiying.d.ts +4 -0
- package/lib/exercises/calculLitteral/simplifying/logSimplifiying.d.ts.map +1 -0
- package/lib/exercises/calculLitteral/simplifying/logSimplifiying.js +78 -0
- package/lib/exercises/calculLitteral/simplifying/reduceExpression.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/simplifying/reduceExpression.js +3 -0
- package/lib/exercises/conversion/aeraConversion.d.ts.map +1 -1
- package/lib/exercises/conversion/aeraConversion.js +3 -0
- package/lib/exercises/conversion/capacityConversion.d.ts.map +1 -1
- package/lib/exercises/conversion/capacityConversion.js +3 -0
- package/lib/exercises/conversion/lengthConversion.d.ts.map +1 -1
- package/lib/exercises/conversion/lengthConversion.js +3 -0
- package/lib/exercises/conversion/massConversion.d.ts.map +1 -1
- package/lib/exercises/conversion/massConversion.js +3 -0
- package/lib/exercises/conversion/volumeCapacityConversion.d.ts.map +1 -1
- package/lib/exercises/conversion/volumeCapacityConversion.js +3 -0
- package/lib/exercises/conversion/volumeConversion.d.ts.map +1 -1
- package/lib/exercises/conversion/volumeConversion.js +3 -0
- package/lib/exercises/derivation/derivative/constanteDerivative.d.ts.map +1 -1
- package/lib/exercises/derivation/derivative/constanteDerivative.js +4 -1
- package/lib/exercises/derivation/derivative/expDerivativeOne.d.ts +4 -0
- package/lib/exercises/derivation/derivative/expDerivativeOne.d.ts.map +1 -0
- package/lib/exercises/derivation/derivative/expDerivativeOne.js +65 -0
- package/lib/exercises/derivation/derivative/expDerivativeThree.d.ts +4 -0
- package/lib/exercises/derivation/derivative/expDerivativeThree.d.ts.map +1 -0
- package/lib/exercises/derivation/derivative/expDerivativeThree.js +64 -0
- package/lib/exercises/derivation/derivative/expDerivativeTwo.d.ts +4 -0
- package/lib/exercises/derivation/derivative/expDerivativeTwo.d.ts.map +1 -0
- package/lib/exercises/derivation/derivative/expDerivativeTwo.js +65 -0
- package/lib/exercises/derivation/derivative/firstDegreeDerivative.d.ts.map +1 -1
- package/lib/exercises/derivation/derivative/firstDegreeDerivative.js +3 -0
- package/lib/exercises/derivation/derivative/inverseFunctionDerivative.d.ts.map +1 -1
- package/lib/exercises/derivation/derivative/inverseFunctionDerivative.js +3 -0
- package/lib/exercises/derivation/derivative/lnDerivativeOne.d.ts +4 -0
- package/lib/exercises/derivation/derivative/lnDerivativeOne.d.ts.map +1 -0
- package/lib/exercises/derivation/derivative/lnDerivativeOne.js +63 -0
- package/lib/exercises/derivation/derivative/lnDerivativeThree.d.ts +4 -0
- package/lib/exercises/derivation/derivative/lnDerivativeThree.d.ts.map +1 -0
- package/lib/exercises/derivation/derivative/lnDerivativeThree.js +68 -0
- package/lib/exercises/derivation/derivative/lnDerivativeTwo.d.ts +4 -0
- package/lib/exercises/derivation/derivative/lnDerivativeTwo.d.ts.map +1 -0
- package/lib/exercises/derivation/derivative/lnDerivativeTwo.js +66 -0
- package/lib/exercises/derivation/derivative/powerFunctionDerivative.d.ts.map +1 -1
- package/lib/exercises/derivation/derivative/powerFunctionDerivative.js +3 -0
- package/lib/exercises/derivation/derivative/rootFunctionDerivative.d.ts.map +1 -1
- package/lib/exercises/derivation/derivative/rootFunctionDerivative.js +4 -0
- package/lib/exercises/derivation/derivative/secondDegreeDerivative.d.ts.map +1 -1
- package/lib/exercises/derivation/derivative/secondDegreeDerivative.js +3 -0
- package/lib/exercises/derivation/derivative/thirdDegreeDerivative.d.ts.map +1 -1
- package/lib/exercises/derivation/derivative/thirdDegreeDerivative.js +3 -0
- package/lib/exercises/derivation/derivative/thirdDegreeFunctionVariation.d.ts +4 -0
- package/lib/exercises/derivation/derivative/thirdDegreeFunctionVariation.d.ts.map +1 -0
- package/lib/exercises/derivation/derivative/thirdDegreeFunctionVariation.js +101 -0
- package/lib/exercises/derivation/derivativeNumberReading.d.ts.map +1 -1
- package/lib/exercises/derivation/derivativeNumberReading.js +3 -0
- package/lib/exercises/equaDiff/equaDiffGeneralForme.d.ts +4 -0
- package/lib/exercises/equaDiff/equaDiffGeneralForme.d.ts.map +1 -0
- package/lib/exercises/equaDiff/equaDiffGeneralForme.js +66 -0
- package/lib/exercises/equaDiff/equaDiffGeneralFormeWithIC.d.ts +4 -0
- package/lib/exercises/equaDiff/equaDiffGeneralFormeWithIC.d.ts.map +1 -0
- package/lib/exercises/equaDiff/equaDiffGeneralFormeWithIC.js +80 -0
- package/lib/exercises/exercise.d.ts +2 -0
- package/lib/exercises/exercise.d.ts.map +1 -1
- package/lib/exercises/exercises.d.ts.map +1 -1
- package/lib/exercises/exercises.js +66 -4
- package/lib/exercises/geometry/cartesian/distanceBetweenTwoPoints.d.ts.map +1 -1
- package/lib/exercises/geometry/cartesian/distanceBetweenTwoPoints.js +6 -0
- package/lib/exercises/geometry/cartesian/imageFunction.d.ts +4 -0
- package/lib/exercises/geometry/cartesian/imageFunction.d.ts.map +1 -0
- package/lib/exercises/geometry/cartesian/imageFunction.js +65 -0
- package/lib/exercises/geometry/cartesian/imageFunctionGeogebra.d.ts +4 -0
- package/lib/exercises/geometry/cartesian/imageFunctionGeogebra.d.ts.map +1 -0
- package/lib/exercises/geometry/cartesian/imageFunctionGeogebra.js +89 -0
- package/lib/exercises/geometry/cartesian/inverseImageFunction.d.ts +4 -0
- package/lib/exercises/geometry/cartesian/inverseImageFunction.d.ts.map +1 -0
- package/lib/exercises/geometry/cartesian/inverseImageFunction.js +62 -0
- package/lib/exercises/geometry/cartesian/inverseImageFunctionGeogebra.d.ts +4 -0
- package/lib/exercises/geometry/cartesian/inverseImageFunctionGeogebra.d.ts.map +1 -0
- package/lib/exercises/geometry/cartesian/inverseImageFunctionGeogebra.js +154 -0
- package/lib/exercises/geometry/cartesian/leadingCoefficient.d.ts.map +1 -1
- package/lib/exercises/geometry/cartesian/leadingCoefficient.js +3 -0
- package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV1.d.ts.map +1 -1
- package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV1.js +3 -0
- package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV2.d.ts.map +1 -1
- package/lib/exercises/geometry/cartesian/leadingCoefficientCalculV2.js +3 -0
- package/lib/exercises/geometry/cartesian/midpoint.d.ts.map +1 -1
- package/lib/exercises/geometry/cartesian/midpoint.js +3 -0
- package/lib/exercises/geometry/cartesian/signFunction.d.ts +4 -0
- package/lib/exercises/geometry/cartesian/signFunction.d.ts.map +1 -0
- package/lib/exercises/geometry/cartesian/signFunction.js +84 -0
- package/lib/exercises/geometry/euclidean/circleArea.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/circleArea.js +3 -0
- package/lib/exercises/geometry/euclidean/circleCircumference.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/circleCircumference.js +3 -0
- package/lib/exercises/geometry/euclidean/pythagore.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/pythagore.js +8 -0
- package/lib/exercises/geometry/euclidean/pythagoreCalcul.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/pythagoreCalcul.js +3 -0
- package/lib/exercises/geometry/euclidean/rectangleArea.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/rectangleArea.js +3 -0
- package/lib/exercises/geometry/euclidean/rectanglePerimeter.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/rectanglePerimeter.js +3 -0
- package/lib/exercises/geometry/euclidean/rightTriangleArea.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/rightTriangleArea.js +3 -0
- package/lib/exercises/geometry/euclidean/squareArea.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/squareArea.js +3 -0
- package/lib/exercises/geometry/euclidean/squarePerimeter.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/squarePerimeter.js +3 -0
- package/lib/exercises/geometry/euclidean/thales.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/thales.js +3 -0
- package/lib/exercises/geometry/euclidean/thalesCalcul.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/thalesCalcul.js +3 -0
- package/lib/exercises/geometry/euclidean/triangleArea.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/triangleArea.js +3 -0
- package/lib/exercises/geometry/euclidean/triangleAreaV2.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/triangleAreaV2.js +4 -0
- package/lib/exercises/geometry/euclidean/trianglePerimeter.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/trianglePerimeter.js +3 -0
- package/lib/exercises/geometry/euclidean/trigonometry.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/trigonometry.js +3 -0
- package/lib/exercises/geometry/euclidean/trigonometryAngleCalcul.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/trigonometryAngleCalcul.js +3 -0
- package/lib/exercises/geometry/euclidean/trigonometrySideCalcul.d.ts.map +1 -1
- package/lib/exercises/geometry/euclidean/trigonometrySideCalcul.js +3 -0
- package/lib/exercises/geometry/vectors/scalarProductViaCoords.d.ts.map +1 -1
- package/lib/exercises/geometry/vectors/scalarProductViaCoords.js +3 -0
- package/lib/exercises/limits/polynomeLimit.d.ts +4 -0
- package/lib/exercises/limits/polynomeLimit.d.ts.map +1 -0
- package/lib/exercises/limits/polynomeLimit.js +132 -0
- package/lib/exercises/percent/applyPercent.d.ts.map +1 -1
- package/lib/exercises/percent/applyPercent.js +3 -0
- package/lib/exercises/percent/averageEvolutionRate.d.ts.map +1 -1
- package/lib/exercises/percent/averageEvolutionRate.js +3 -0
- package/lib/exercises/percent/globalPercent.d.ts.map +1 -1
- package/lib/exercises/percent/globalPercent.js +3 -0
- package/lib/exercises/percent/reciprocalPercentage.d.ts.map +1 -1
- package/lib/exercises/percent/reciprocalPercentage.js +3 -0
- package/lib/exercises/powers/powersDivision.d.ts.map +1 -1
- package/lib/exercises/powers/powersDivision.js +3 -0
- package/lib/exercises/powers/powersOfTenToDecimal.d.ts.map +1 -1
- package/lib/exercises/powers/powersOfTenToDecimal.js +3 -0
- package/lib/exercises/powers/powersPower.d.ts.map +1 -1
- package/lib/exercises/powers/powersPower.js +3 -0
- package/lib/exercises/powers/powersProduct.d.ts.map +1 -1
- package/lib/exercises/powers/powersProduct.js +3 -0
- package/lib/exercises/powers/scientificToDecimal.d.ts.map +1 -1
- package/lib/exercises/powers/scientificToDecimal.js +3 -0
- package/lib/exercises/primitve/constantPrimitive.d.ts +4 -0
- package/lib/exercises/primitve/constantPrimitive.d.ts.map +1 -0
- package/lib/exercises/primitve/constantPrimitive.js +56 -0
- package/lib/exercises/primitve/exponentialPrimitive.d.ts +4 -0
- package/lib/exercises/primitve/exponentialPrimitive.d.ts.map +1 -0
- package/lib/exercises/primitve/exponentialPrimitive.js +103 -0
- package/lib/exercises/primitve/logarithmePrimitive.d.ts +4 -0
- package/lib/exercises/primitve/logarithmePrimitive.d.ts.map +1 -0
- package/lib/exercises/primitve/logarithmePrimitive.js +74 -0
- package/lib/exercises/primitve/polynomialPrimitive.d.ts +4 -0
- package/lib/exercises/primitve/polynomialPrimitive.d.ts.map +1 -0
- package/lib/exercises/primitve/polynomialPrimitive.js +80 -0
- package/lib/exercises/primitve/sinCosPrimitive.d.ts +4 -0
- package/lib/exercises/primitve/sinCosPrimitive.d.ts.map +1 -0
- package/lib/exercises/primitve/sinCosPrimitive.js +112 -0
- package/lib/exercises/primitve/usualPrimitives.d.ts +4 -0
- package/lib/exercises/primitve/usualPrimitives.d.ts.map +1 -0
- package/lib/exercises/primitve/usualPrimitives.js +39 -0
- package/lib/exercises/probaStat/conditionalProbability.d.ts +4 -0
- package/lib/exercises/probaStat/conditionalProbability.d.ts.map +1 -0
- package/lib/exercises/probaStat/conditionalProbability.js +102 -0
- package/lib/exercises/probaStat/frequencyTable.d.ts +4 -0
- package/lib/exercises/probaStat/frequencyTable.d.ts.map +1 -0
- package/lib/exercises/probaStat/frequencyTable.js +76 -0
- package/lib/exercises/probaStat/marginalAndConditionalFrequency.d.ts +4 -0
- package/lib/exercises/probaStat/marginalAndConditionalFrequency.d.ts.map +1 -0
- package/lib/exercises/probaStat/marginalAndConditionalFrequency.js +109 -0
- package/lib/exercises/probaStat/median.d.ts +4 -0
- package/lib/exercises/probaStat/median.d.ts.map +1 -0
- package/lib/exercises/probaStat/median.js +82 -0
- package/lib/exercises/probaStat/medianList.d.ts +4 -0
- package/lib/exercises/probaStat/medianList.d.ts.map +1 -0
- package/lib/exercises/probaStat/medianList.js +67 -0
- package/lib/exercises/probaStat/probabilityTree.d.ts +4 -0
- package/lib/exercises/probaStat/probabilityTree.d.ts.map +1 -0
- package/lib/exercises/probaStat/probabilityTree.js +135 -0
- package/lib/exercises/probaStat/quartiles.d.ts +4 -0
- package/lib/exercises/probaStat/quartiles.d.ts.map +1 -0
- package/lib/exercises/probaStat/quartiles.js +96 -0
- package/lib/exercises/probaStat/quartilesList.d.ts +4 -0
- package/lib/exercises/probaStat/quartilesList.d.ts.map +1 -0
- package/lib/exercises/probaStat/quartilesList.js +81 -0
- package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.d.ts.map +1 -1
- package/lib/exercises/sequences/arithmetic/arithmeticExplicitFormulaUsage.js +3 -0
- package/lib/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.d.ts.map +1 -1
- package/lib/exercises/sequences/arithmetic/arithmeticFindExplicitFormula.js +3 -0
- package/lib/exercises/sequences/arithmetic/arithmeticFindReason.d.ts.map +1 -1
- package/lib/exercises/sequences/arithmetic/arithmeticFindReason.js +3 -0
- package/lib/exercises/sequences/arithmetic/arithmeticReasonUsage.d.ts.map +1 -1
- package/lib/exercises/sequences/arithmetic/arithmeticReasonUsage.js +3 -0
- package/lib/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.d.ts.map +1 -1
- package/lib/exercises/sequences/arithmetic/arithmeticRecurrenceFormulaUsage.js +3 -0
- package/lib/exercises/sequences/arithmetic/arithmeticThresholdFind.d.ts.map +1 -1
- package/lib/exercises/sequences/arithmetic/arithmeticThresholdFind.js +3 -0
- package/lib/exercises/sequences/geometric/geometricExplicitFormulaUsage.d.ts.map +1 -1
- package/lib/exercises/sequences/geometric/geometricExplicitFormulaUsage.js +3 -0
- package/lib/exercises/sequences/geometric/geometricFindExplicitFormula.d.ts.map +1 -1
- package/lib/exercises/sequences/geometric/geometricFindExplicitFormula.js +4 -0
- package/lib/exercises/sequences/geometric/geometricFindReason.d.ts.map +1 -1
- package/lib/exercises/sequences/geometric/geometricFindReason.js +4 -0
- package/lib/exercises/sequences/geometric/geometricReasonUsage.d.ts.map +1 -1
- package/lib/exercises/sequences/geometric/geometricReasonUsage.js +4 -0
- package/lib/exercises/sequences/geometric/geometricRecurrenceFormulaUsage.d.ts.map +1 -1
- package/lib/exercises/sequences/geometric/geometricRecurrenceFormulaUsage.js +4 -0
- package/lib/exercises/squareRoots/simpifySquareRoot.d.ts.map +1 -1
- package/lib/exercises/squareRoots/simpifySquareRoot.js +3 -0
- package/lib/index.d.ts +2 -2
- package/lib/index.d.ts.map +1 -1
- package/lib/index.js +3 -3
- package/lib/math/polynomials/polynomial.d.ts +3 -1
- package/lib/math/polynomials/polynomial.d.ts.map +1 -1
- package/lib/math/polynomials/polynomial.js +48 -2
- package/lib/tree/nodes/functions/expNode.d.ts +10 -0
- package/lib/tree/nodes/functions/expNode.d.ts.map +1 -0
- package/lib/tree/nodes/functions/expNode.js +21 -0
- package/lib/tree/nodes/functions/functionNode.d.ts +3 -1
- package/lib/tree/nodes/functions/functionNode.d.ts.map +1 -1
- package/lib/tree/nodes/functions/functionNode.js +2 -0
- package/lib/tree/nodes/functions/logNode.d.ts +10 -0
- package/lib/tree/nodes/functions/logNode.d.ts.map +1 -0
- package/lib/tree/nodes/functions/logNode.js +21 -0
- package/lib/tree/nodes/functions/sinNode.d.ts +9 -0
- package/lib/tree/nodes/functions/sinNode.d.ts.map +1 -1
- package/lib/tree/nodes/functions/sinNode.js +20 -0
- package/lib/tree/parsers/simplify.d.ts.map +1 -1
- package/lib/tree/parsers/simplify.js +12 -0
- package/package.json +1 -1
|
@@ -85,6 +85,7 @@ function getRoundQuestions(precisionAsked = 0) {
|
|
|
85
85
|
id: (0, uuid_1.v4)() + '',
|
|
86
86
|
statement: dec.round(precisionAsked).toTree().toTex(),
|
|
87
87
|
isRightAnswer: true,
|
|
88
|
+
format: 'tex',
|
|
88
89
|
});
|
|
89
90
|
res.push({
|
|
90
91
|
id: (0, uuid_1.v4)() + '',
|
|
@@ -92,12 +93,14 @@ function getRoundQuestions(precisionAsked = 0) {
|
|
|
92
93
|
? (0, round_1.round)(dec.value - 0.5 * 10 ** -precisionAsked, precisionAsked) + ''
|
|
93
94
|
: (0, round_1.round)(dec.value + 0.5 * 10 ** -precisionAsked, precisionAsked) + '',
|
|
94
95
|
isRightAnswer: false,
|
|
96
|
+
format: 'tex',
|
|
95
97
|
});
|
|
96
98
|
if (n > 2)
|
|
97
99
|
res.push({
|
|
98
100
|
id: (0, uuid_1.v4)() + '',
|
|
99
101
|
statement: dec.toTree().toTex(),
|
|
100
102
|
isRightAnswer: false,
|
|
103
|
+
format: 'tex',
|
|
101
104
|
});
|
|
102
105
|
if (n > 3 && dec.decimalPart.length !== precisionAsked + 1)
|
|
103
106
|
res.push({
|
|
@@ -107,6 +110,7 @@ function getRoundQuestions(precisionAsked = 0) {
|
|
|
107
110
|
.toTree()
|
|
108
111
|
.toTex(),
|
|
109
112
|
isRightAnswer: false,
|
|
113
|
+
format: 'tex',
|
|
110
114
|
});
|
|
111
115
|
for (let i = 0; dec.decimalPart.length !== precisionAsked + 1 ? i < n - 4 : i < n - 3; i++) {
|
|
112
116
|
let isDuplicate;
|
|
@@ -116,6 +120,7 @@ function getRoundQuestions(precisionAsked = 0) {
|
|
|
116
120
|
id: (0, uuid_1.v4)() + '',
|
|
117
121
|
statement: decimal_1.DecimalConstructor.random(0, 1000, precision).toTree().toTex(),
|
|
118
122
|
isRightAnswer: false,
|
|
123
|
+
format: 'tex',
|
|
119
124
|
};
|
|
120
125
|
console.log(proposition);
|
|
121
126
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
@@ -130,6 +135,7 @@ function getRoundQuestions(precisionAsked = 0) {
|
|
|
130
135
|
answer: dec.round(precisionAsked).toTree().toTex(),
|
|
131
136
|
keys: [],
|
|
132
137
|
getPropositions,
|
|
138
|
+
answerFormat: 'tex',
|
|
133
139
|
};
|
|
134
140
|
return question;
|
|
135
141
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"doubleDistributivity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/doubleDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"doubleDistributivity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/doubleDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAqE1D"}
|
|
@@ -32,6 +32,7 @@ function getDoubleDistributivityQuestion() {
|
|
|
32
32
|
id: (0, uuid_1.v4)() + '',
|
|
33
33
|
statement: answerTree.toTex(),
|
|
34
34
|
isRightAnswer: true,
|
|
35
|
+
format: 'tex',
|
|
35
36
|
});
|
|
36
37
|
res.push({
|
|
37
38
|
id: (0, uuid_1.v4)() + '',
|
|
@@ -40,6 +41,7 @@ function getDoubleDistributivityQuestion() {
|
|
|
40
41
|
.toTree()
|
|
41
42
|
.toTex(),
|
|
42
43
|
isRightAnswer: false,
|
|
44
|
+
format: 'tex',
|
|
43
45
|
});
|
|
44
46
|
if (n > 2)
|
|
45
47
|
res.push({
|
|
@@ -49,6 +51,7 @@ function getDoubleDistributivityQuestion() {
|
|
|
49
51
|
.toTree()
|
|
50
52
|
.toTex(),
|
|
51
53
|
isRightAnswer: false,
|
|
54
|
+
format: 'tex',
|
|
52
55
|
});
|
|
53
56
|
for (let i = 0; i < n - 3; i++) {
|
|
54
57
|
let isDuplicate;
|
|
@@ -60,6 +63,7 @@ function getDoubleDistributivityQuestion() {
|
|
|
60
63
|
id: (0, uuid_1.v4)() + '',
|
|
61
64
|
statement: wrongAnswer.toTex(),
|
|
62
65
|
isRightAnswer: false,
|
|
66
|
+
format: 'tex',
|
|
63
67
|
};
|
|
64
68
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
65
69
|
} while (isDuplicate);
|
|
@@ -72,6 +76,7 @@ function getDoubleDistributivityQuestion() {
|
|
|
72
76
|
answer: answerTree.toTex(),
|
|
73
77
|
keys: ['x'],
|
|
74
78
|
getPropositions,
|
|
79
|
+
answerFormat: 'tex',
|
|
75
80
|
};
|
|
76
81
|
}
|
|
77
82
|
exports.getDoubleDistributivityQuestion = getDoubleDistributivityQuestion;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"firstIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/firstIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY3E,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"firstIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/firstIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY3E,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAsEnD"}
|
|
@@ -33,23 +33,27 @@ function getFirstIdentityQuestion() {
|
|
|
33
33
|
id: (0, uuid_1.v4)() + '',
|
|
34
34
|
statement: answerTree.toTex(),
|
|
35
35
|
isRightAnswer: true,
|
|
36
|
+
format: 'tex',
|
|
36
37
|
});
|
|
37
38
|
res.push({
|
|
38
39
|
id: (0, uuid_1.v4)() + '',
|
|
39
40
|
statement: new polynomial_1.Polynomial([affine.b ** 2, 0, affine.a ** 2]).toTree().toTex(),
|
|
40
41
|
isRightAnswer: false,
|
|
42
|
+
format: 'tex',
|
|
41
43
|
});
|
|
42
44
|
if (n > 2)
|
|
43
45
|
res.push({
|
|
44
46
|
id: (0, uuid_1.v4)() + '',
|
|
45
47
|
statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a * affine.b, affine.a ** 2]).toTree().toTex(),
|
|
46
48
|
isRightAnswer: false,
|
|
49
|
+
format: 'tex',
|
|
47
50
|
});
|
|
48
51
|
if (n > 3)
|
|
49
52
|
res.push({
|
|
50
53
|
id: (0, uuid_1.v4)() + '',
|
|
51
54
|
statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a ** 2 + affine.b ** 2, affine.a ** 2]).toTree().toTex(),
|
|
52
55
|
isRightAnswer: false,
|
|
56
|
+
format: 'tex',
|
|
53
57
|
});
|
|
54
58
|
for (let i = 0; i < n - 4; i++) {
|
|
55
59
|
let isDuplicate;
|
|
@@ -61,6 +65,7 @@ function getFirstIdentityQuestion() {
|
|
|
61
65
|
id: (0, uuid_1.v4)() + '',
|
|
62
66
|
statement: wrongAnswer.toTex(),
|
|
63
67
|
isRightAnswer: false,
|
|
68
|
+
format: 'tex',
|
|
64
69
|
};
|
|
65
70
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
66
71
|
} while (isDuplicate);
|
|
@@ -73,6 +78,7 @@ function getFirstIdentityQuestion() {
|
|
|
73
78
|
answer: answerTree.toTex(),
|
|
74
79
|
keys: ['x'],
|
|
75
80
|
getPropositions,
|
|
81
|
+
answerFormat: 'tex',
|
|
76
82
|
};
|
|
77
83
|
}
|
|
78
84
|
exports.getFirstIdentityQuestion = getFirstIdentityQuestion;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"secondIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/secondIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY3E,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"secondIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/secondIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAY3E,eAAO,MAAM,cAAc,EAAE,QAU5B,CAAC;AAEF,wBAAgB,yBAAyB,IAAI,QAAQ,CAuEpD"}
|
|
@@ -34,23 +34,27 @@ function getSecondIdentityQuestion() {
|
|
|
34
34
|
id: (0, uuid_1.v4)() + '',
|
|
35
35
|
statement: answerTree.toTex(),
|
|
36
36
|
isRightAnswer: true,
|
|
37
|
+
format: 'tex',
|
|
37
38
|
});
|
|
38
39
|
res.push({
|
|
39
40
|
id: (0, uuid_1.v4)() + '',
|
|
40
41
|
statement: new polynomial_1.Polynomial([-(affine.b ** 2), 0, affine.a ** 2]).toTree().toTex(),
|
|
41
42
|
isRightAnswer: false,
|
|
43
|
+
format: 'tex',
|
|
42
44
|
});
|
|
43
45
|
if (n > 2)
|
|
44
46
|
res.push({
|
|
45
47
|
id: (0, uuid_1.v4)() + '',
|
|
46
48
|
statement: new polynomial_1.Polynomial([affine.b ** 2, affine.a * affine.b, affine.a ** 2]).toTree().toTex(),
|
|
47
49
|
isRightAnswer: false,
|
|
50
|
+
format: 'tex',
|
|
48
51
|
});
|
|
49
52
|
if (n > 3)
|
|
50
53
|
res.push({
|
|
51
54
|
id: (0, uuid_1.v4)() + '',
|
|
52
55
|
statement: new polynomial_1.Polynomial([-(affine.b ** 2), -(affine.a ** 2 + affine.b ** 2), affine.a ** 2]).toTree().toTex(),
|
|
53
56
|
isRightAnswer: false,
|
|
57
|
+
format: 'tex',
|
|
54
58
|
});
|
|
55
59
|
for (let i = 0; i < n - 4; i++) {
|
|
56
60
|
let isDuplicate;
|
|
@@ -62,6 +66,7 @@ function getSecondIdentityQuestion() {
|
|
|
62
66
|
id: (0, uuid_1.v4)() + '',
|
|
63
67
|
statement: wrongAnswer.toTex(),
|
|
64
68
|
isRightAnswer: false,
|
|
69
|
+
format: 'tex',
|
|
65
70
|
};
|
|
66
71
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
67
72
|
} while (isDuplicate);
|
|
@@ -74,6 +79,7 @@ function getSecondIdentityQuestion() {
|
|
|
74
79
|
answer: answerTree.toTex(),
|
|
75
80
|
keys: ['x'],
|
|
76
81
|
getPropositions,
|
|
82
|
+
answerFormat: 'tex',
|
|
77
83
|
};
|
|
78
84
|
}
|
|
79
85
|
exports.getSecondIdentityQuestion = getSecondIdentityQuestion;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"simpleDistributivity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/simpleDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"simpleDistributivity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/simpleDistributivity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAEF,wBAAgB,+BAA+B,IAAI,QAAQ,CAwE1D"}
|
|
@@ -34,23 +34,27 @@ function getSimpleDistributivityQuestion() {
|
|
|
34
34
|
id: (0, uuid_1.v4)() + '',
|
|
35
35
|
statement: answerTree.toTex(),
|
|
36
36
|
isRightAnswer: true,
|
|
37
|
+
format: 'tex',
|
|
37
38
|
});
|
|
38
39
|
res.push({
|
|
39
40
|
id: (0, uuid_1.v4)() + '',
|
|
40
41
|
statement: new affine_1.Affine(coeff.value * affine.a, affine.b).toTree().toTex(),
|
|
41
42
|
isRightAnswer: false,
|
|
43
|
+
format: 'tex',
|
|
42
44
|
});
|
|
43
45
|
if (n > 2)
|
|
44
46
|
res.push({
|
|
45
47
|
id: (0, uuid_1.v4)() + '',
|
|
46
48
|
statement: new affine_1.Affine(affine.a, coeff.value * affine.b).toTree().toTex(),
|
|
47
49
|
isRightAnswer: false,
|
|
50
|
+
format: 'tex',
|
|
48
51
|
});
|
|
49
52
|
if (n > 3)
|
|
50
53
|
res.push({
|
|
51
54
|
id: (0, uuid_1.v4)() + '',
|
|
52
55
|
statement: affine.times(-coeff.value).toTree().toTex(),
|
|
53
56
|
isRightAnswer: false,
|
|
57
|
+
format: 'tex',
|
|
54
58
|
});
|
|
55
59
|
for (let i = 0; i < n - 4; i++) {
|
|
56
60
|
let isDuplicate;
|
|
@@ -61,6 +65,7 @@ function getSimpleDistributivityQuestion() {
|
|
|
61
65
|
id: (0, uuid_1.v4)() + '',
|
|
62
66
|
statement: wrongAnswer.toTex(),
|
|
63
67
|
isRightAnswer: false,
|
|
68
|
+
format: 'tex',
|
|
64
69
|
};
|
|
65
70
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
66
71
|
} while (isDuplicate);
|
|
@@ -73,6 +78,7 @@ function getSimpleDistributivityQuestion() {
|
|
|
73
78
|
answer: answerTree.toTex(),
|
|
74
79
|
keys: ['x'],
|
|
75
80
|
getPropositions,
|
|
81
|
+
answerFormat: 'tex',
|
|
76
82
|
};
|
|
77
83
|
}
|
|
78
84
|
exports.getSimpleDistributivityQuestion = getSimpleDistributivityQuestion;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"thirdIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/thirdIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"thirdIdentity.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/distributivity/thirdIdentity.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E,eAAO,MAAM,aAAa,EAAE,QAU3B,CAAC;AAEF,wBAAgB,wBAAwB,IAAI,QAAQ,CAwEnD"}
|
|
@@ -32,23 +32,27 @@ function getThirdIdentityQuestion() {
|
|
|
32
32
|
id: (0, uuid_1.v4)() + '',
|
|
33
33
|
statement: answerTree.toTex(),
|
|
34
34
|
isRightAnswer: true,
|
|
35
|
+
format: 'tex',
|
|
35
36
|
});
|
|
36
37
|
res.push({
|
|
37
38
|
id: (0, uuid_1.v4)() + '',
|
|
38
39
|
statement: affine.multiply(affine2.opposite()).toTree().toTex(),
|
|
39
40
|
isRightAnswer: false,
|
|
41
|
+
format: 'tex',
|
|
40
42
|
});
|
|
41
43
|
if (n > 2)
|
|
42
44
|
res.push({
|
|
43
45
|
id: (0, uuid_1.v4)() + '',
|
|
44
46
|
statement: affine.multiply(affine).toTree().toTex(),
|
|
45
47
|
isRightAnswer: false,
|
|
48
|
+
format: 'tex',
|
|
46
49
|
});
|
|
47
50
|
if (n > 3)
|
|
48
51
|
res.push({
|
|
49
52
|
id: (0, uuid_1.v4)() + '',
|
|
50
53
|
statement: affine2.multiply(affine2.opposite()).toTree().toTex(),
|
|
51
54
|
isRightAnswer: false,
|
|
55
|
+
format: 'tex',
|
|
52
56
|
});
|
|
53
57
|
for (let i = 0; i < n - 4; i++) {
|
|
54
58
|
let isDuplicate;
|
|
@@ -61,6 +65,7 @@ function getThirdIdentityQuestion() {
|
|
|
61
65
|
id: (0, uuid_1.v4)() + '',
|
|
62
66
|
statement: wrongAnswer.toTex(),
|
|
63
67
|
isRightAnswer: false,
|
|
68
|
+
format: 'tex',
|
|
64
69
|
};
|
|
65
70
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
66
71
|
} while (isDuplicate);
|
|
@@ -73,6 +78,7 @@ function getThirdIdentityQuestion() {
|
|
|
73
78
|
answer: answerTree.toTex(),
|
|
74
79
|
keys: ['x'],
|
|
75
80
|
getPropositions,
|
|
81
|
+
answerFormat: 'tex',
|
|
76
82
|
};
|
|
77
83
|
}
|
|
78
84
|
exports.getThirdIdentityQuestion = getThirdIdentityQuestion;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"equationSimpleSquare.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationSimpleSquare.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAOF,wBAAgB,uBAAuB,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"equationSimpleSquare.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationSimpleSquare.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAO3E,eAAO,MAAM,oBAAoB,EAAE,QAUlC,CAAC;AAOF,wBAAgB,uBAAuB,IAAI,QAAQ,CA+JlD"}
|
|
@@ -46,18 +46,21 @@ function getEquationSimpleSquare() {
|
|
|
46
46
|
id: (0, uuid_1.v4)() + '',
|
|
47
47
|
statement: answer,
|
|
48
48
|
isRightAnswer: true,
|
|
49
|
+
format: 'tex',
|
|
49
50
|
});
|
|
50
51
|
if (ans === Math.floor(ans)) {
|
|
51
52
|
res.push({
|
|
52
53
|
id: (0, uuid_1.v4)() + '',
|
|
53
54
|
statement: `${ans}`,
|
|
54
55
|
isRightAnswer: false,
|
|
56
|
+
format: 'tex',
|
|
55
57
|
});
|
|
56
58
|
if (n > 2)
|
|
57
59
|
res.push({
|
|
58
60
|
id: (0, uuid_1.v4)() + '',
|
|
59
61
|
statement: `${ans + (0, randint_1.randint)(-ans + 1, 7, [0])}`,
|
|
60
62
|
isRightAnswer: false,
|
|
63
|
+
format: 'tex',
|
|
61
64
|
});
|
|
62
65
|
for (let i = 0; i < n - 3; i++) {
|
|
63
66
|
let isDuplicate;
|
|
@@ -68,6 +71,7 @@ function getEquationSimpleSquare() {
|
|
|
68
71
|
id: (0, uuid_1.v4)() + '',
|
|
69
72
|
statement: (0, coinFlip_1.coinFlip)() ? `\\{${tempAns}\\ ; -${tempAns}\\}` : `\\emptyset`,
|
|
70
73
|
isRightAnswer: false,
|
|
74
|
+
format: 'tex',
|
|
71
75
|
};
|
|
72
76
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
73
77
|
} while (isDuplicate);
|
|
@@ -81,18 +85,21 @@ function getEquationSimpleSquare() {
|
|
|
81
85
|
id: (0, uuid_1.v4)() + '',
|
|
82
86
|
statement: `${factor}\\sqrt{${radicand}}`,
|
|
83
87
|
isRightAnswer: false,
|
|
88
|
+
format: 'tex',
|
|
84
89
|
});
|
|
85
90
|
if (n > 2)
|
|
86
91
|
res.push({
|
|
87
92
|
id: (0, uuid_1.v4)() + '',
|
|
88
93
|
statement: `${radicand}\\sqrt{${factor}}`,
|
|
89
94
|
isRightAnswer: false,
|
|
95
|
+
format: 'tex',
|
|
90
96
|
});
|
|
91
97
|
if (n > 3)
|
|
92
98
|
res.push({
|
|
93
99
|
id: (0, uuid_1.v4)() + '',
|
|
94
100
|
statement: `${Math.floor(ans)}`,
|
|
95
101
|
isRightAnswer: false,
|
|
102
|
+
format: 'tex',
|
|
96
103
|
});
|
|
97
104
|
for (let i = 0; i < n - 4; i++) {
|
|
98
105
|
let isDuplicate;
|
|
@@ -106,6 +113,7 @@ function getEquationSimpleSquare() {
|
|
|
106
113
|
? `\\{${tempFactor}\\sqrt{${tempRadicand}}\\ ; -${tempFactor}\\sqrt{${tempRadicand}} \\}`
|
|
107
114
|
: `\\emptyset`,
|
|
108
115
|
isRightAnswer: false,
|
|
116
|
+
format: 'tex',
|
|
109
117
|
};
|
|
110
118
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
111
119
|
} while (isDuplicate);
|
|
@@ -117,12 +125,14 @@ function getEquationSimpleSquare() {
|
|
|
117
125
|
id: (0, uuid_1.v4)() + '',
|
|
118
126
|
statement: `-\\sqrt${-randNbr}`,
|
|
119
127
|
isRightAnswer: false,
|
|
128
|
+
format: 'tex',
|
|
120
129
|
});
|
|
121
130
|
if (n > 2)
|
|
122
131
|
res.push({
|
|
123
132
|
id: (0, uuid_1.v4)() + '',
|
|
124
133
|
statement: `${Math.floor(Math.sqrt(-randNbr))}`,
|
|
125
134
|
isRightAnswer: false,
|
|
135
|
+
format: 'tex',
|
|
126
136
|
});
|
|
127
137
|
for (let i = 0; i < n - 3; i++) {
|
|
128
138
|
let isDuplicate;
|
|
@@ -134,6 +144,7 @@ function getEquationSimpleSquare() {
|
|
|
134
144
|
id: (0, uuid_1.v4)() + '',
|
|
135
145
|
statement: `\\{${factor}\\sqrt{${radicand}}\\ ; -${factor}\\sqrt{${radicand}} \\}`,
|
|
136
146
|
isRightAnswer: false,
|
|
147
|
+
format: 'tex',
|
|
137
148
|
};
|
|
138
149
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
139
150
|
} while (isDuplicate);
|
|
@@ -147,6 +158,7 @@ function getEquationSimpleSquare() {
|
|
|
147
158
|
answer,
|
|
148
159
|
keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
|
|
149
160
|
getPropositions,
|
|
161
|
+
answerFormat: 'tex',
|
|
150
162
|
};
|
|
151
163
|
return question;
|
|
152
164
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"equationType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType1Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"equationType1Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType1Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAW3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAiD3D"}
|
|
@@ -38,6 +38,7 @@ function getEquationType1ExerciseQuestion() {
|
|
|
38
38
|
id: (0, uuid_1.v4)() + '',
|
|
39
39
|
statement: `x = ${solution}`,
|
|
40
40
|
isRightAnswer: true,
|
|
41
|
+
format: 'tex',
|
|
41
42
|
});
|
|
42
43
|
for (let i = 0; i < n - 1; i++) {
|
|
43
44
|
let isDuplicate;
|
|
@@ -48,6 +49,7 @@ function getEquationType1ExerciseQuestion() {
|
|
|
48
49
|
id: (0, uuid_1.v4)() + '',
|
|
49
50
|
statement: `x = ${wrongAnswer}`,
|
|
50
51
|
isRightAnswer: false,
|
|
52
|
+
format: 'tex',
|
|
51
53
|
};
|
|
52
54
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
53
55
|
} while (isDuplicate);
|
|
@@ -60,6 +62,7 @@ function getEquationType1ExerciseQuestion() {
|
|
|
60
62
|
answer: `x = ${solution}`,
|
|
61
63
|
keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
|
|
62
64
|
getPropositions,
|
|
65
|
+
answerFormat: 'tex',
|
|
63
66
|
};
|
|
64
67
|
return question;
|
|
65
68
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"equationType2Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType2Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"equationType2Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType2Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAUnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAqD3D"}
|
|
@@ -41,6 +41,7 @@ function getEquationType2ExerciseQuestion() {
|
|
|
41
41
|
id: (0, uuid_1.v4)() + '',
|
|
42
42
|
statement: answer.toTex(),
|
|
43
43
|
isRightAnswer: true,
|
|
44
|
+
format: 'tex',
|
|
44
45
|
});
|
|
45
46
|
for (let i = 0; i < n - 1; i++) {
|
|
46
47
|
let isDuplicate;
|
|
@@ -51,6 +52,7 @@ function getEquationType2ExerciseQuestion() {
|
|
|
51
52
|
id: (0, uuid_1.v4)() + '',
|
|
52
53
|
statement: new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), wrongAnswer.toTree()).toTex(),
|
|
53
54
|
isRightAnswer: false,
|
|
55
|
+
format: 'tex',
|
|
54
56
|
};
|
|
55
57
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
56
58
|
} while (isDuplicate);
|
|
@@ -63,6 +65,7 @@ function getEquationType2ExerciseQuestion() {
|
|
|
63
65
|
answer: answer.toTex(),
|
|
64
66
|
keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
|
|
65
67
|
getPropositions,
|
|
68
|
+
answerFormat: 'tex',
|
|
66
69
|
};
|
|
67
70
|
return question;
|
|
68
71
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"equationType3Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType3Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAWnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"equationType3Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType3Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAWnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CAwD3D"}
|
|
@@ -42,6 +42,7 @@ function getEquationType3ExerciseQuestion() {
|
|
|
42
42
|
id: (0, uuid_1.v4)() + '',
|
|
43
43
|
statement: answerTree.toTex(),
|
|
44
44
|
isRightAnswer: true,
|
|
45
|
+
format: 'tex',
|
|
45
46
|
});
|
|
46
47
|
for (let i = 0; i < n - 1; i++) {
|
|
47
48
|
let isDuplicate;
|
|
@@ -52,6 +53,7 @@ function getEquationType3ExerciseQuestion() {
|
|
|
52
53
|
id: (0, uuid_1.v4)() + '',
|
|
53
54
|
statement: new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), wrongAnswer.toTree()).toTex(),
|
|
54
55
|
isRightAnswer: false,
|
|
56
|
+
format: 'tex',
|
|
55
57
|
};
|
|
56
58
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
57
59
|
} while (isDuplicate);
|
|
@@ -64,6 +66,7 @@ function getEquationType3ExerciseQuestion() {
|
|
|
64
66
|
answer: answerTree.toTex(),
|
|
65
67
|
keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
|
|
66
68
|
getPropositions,
|
|
69
|
+
answerFormat: 'tex',
|
|
67
70
|
};
|
|
68
71
|
return question;
|
|
69
72
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"equationType4Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType4Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAWnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"equationType4Exercise.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/equationType4Exercise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E;;GAEG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAWnC,CAAC;AAEF,wBAAgB,gCAAgC,IAAI,QAAQ,CA2D3D"}
|
|
@@ -44,6 +44,7 @@ function getEquationType4ExerciseQuestion() {
|
|
|
44
44
|
id: (0, uuid_1.v4)() + '',
|
|
45
45
|
statement: answerTree.toTex(),
|
|
46
46
|
isRightAnswer: true,
|
|
47
|
+
format: 'tex',
|
|
47
48
|
});
|
|
48
49
|
for (let i = 0; i < n - 1; i++) {
|
|
49
50
|
let isDuplicate;
|
|
@@ -54,6 +55,7 @@ function getEquationType4ExerciseQuestion() {
|
|
|
54
55
|
id: (0, uuid_1.v4)() + '',
|
|
55
56
|
statement: new equalNode_1.EqualNode(new variableNode_1.VariableNode('x'), wrongAnswer.toTree()).toTex(),
|
|
56
57
|
isRightAnswer: false,
|
|
58
|
+
format: 'tex',
|
|
57
59
|
};
|
|
58
60
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
59
61
|
} while (isDuplicate);
|
|
@@ -66,6 +68,7 @@ function getEquationType4ExerciseQuestion() {
|
|
|
66
68
|
answer: answerTree.toTex(),
|
|
67
69
|
keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
|
|
68
70
|
getPropositions,
|
|
71
|
+
answerFormat: 'tex',
|
|
69
72
|
};
|
|
70
73
|
return question;
|
|
71
74
|
}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"expEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/expEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAa3E,eAAO,MAAM,WAAW,EAAE,QAUzB,CAAC;AAEF,wBAAgB,cAAc,IAAI,QAAQ,CAuDzC"}
|
|
@@ -0,0 +1,67 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.getExpEquation = exports.expEquation = void 0;
|
|
4
|
+
const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
|
|
5
|
+
const randint_1 = require("../../../math/utils/random/randint");
|
|
6
|
+
const expNode_1 = require("../../../tree/nodes/functions/expNode");
|
|
7
|
+
const logNode_1 = require("../../../tree/nodes/functions/logNode");
|
|
8
|
+
const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
|
|
9
|
+
const equalNode_1 = require("../../../tree/nodes/operators/equalNode");
|
|
10
|
+
const fractionNode_1 = require("../../../tree/nodes/operators/fractionNode");
|
|
11
|
+
const multiplyNode_1 = require("../../../tree/nodes/operators/multiplyNode");
|
|
12
|
+
const variableNode_1 = require("../../../tree/nodes/variables/variableNode");
|
|
13
|
+
const simplify_1 = require("../../../tree/parsers/simplify");
|
|
14
|
+
const shuffle_1 = require("../../../utils/shuffle");
|
|
15
|
+
const uuid_1 = require("uuid");
|
|
16
|
+
exports.expEquation = {
|
|
17
|
+
id: 'expEquation',
|
|
18
|
+
connector: '=',
|
|
19
|
+
instruction: '',
|
|
20
|
+
label: 'Résoudre des équations de type $a \\times exp(x) = k$',
|
|
21
|
+
levels: ['1', '0'],
|
|
22
|
+
section: 'Fonction Exponentielle',
|
|
23
|
+
isSingleStep: false,
|
|
24
|
+
generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getExpEquation, nb),
|
|
25
|
+
keys: ['exp', 'ln'],
|
|
26
|
+
};
|
|
27
|
+
function getExpEquation() {
|
|
28
|
+
const a = (0, randint_1.randint)(-9, 20, [0]);
|
|
29
|
+
const k = a > 0 ? (0, randint_1.randint)(1, 20) : (0, randint_1.randint)(-20, 0);
|
|
30
|
+
const equation = new equalNode_1.EqualNode((0, simplify_1.simplifyNode)(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(a), new expNode_1.ExpNode(new variableNode_1.VariableNode('x')))), new numberNode_1.NumberNode(k));
|
|
31
|
+
const answer = new logNode_1.LogNode((0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(k), new numberNode_1.NumberNode(a))));
|
|
32
|
+
const getPropositions = (numOptions) => {
|
|
33
|
+
const propositions = [];
|
|
34
|
+
propositions.push({
|
|
35
|
+
id: (0, uuid_1.v4)(),
|
|
36
|
+
statement: answer.toTex(),
|
|
37
|
+
isRightAnswer: true,
|
|
38
|
+
format: 'tex',
|
|
39
|
+
});
|
|
40
|
+
for (let i = 0; i < numOptions - 1; i++) {
|
|
41
|
+
let isDuplicate;
|
|
42
|
+
let proposition;
|
|
43
|
+
do {
|
|
44
|
+
const randomA = (0, randint_1.randint)(1, 10);
|
|
45
|
+
const randomK = (0, randint_1.randint)(1, 20);
|
|
46
|
+
proposition = {
|
|
47
|
+
id: (0, uuid_1.v4)(),
|
|
48
|
+
statement: new logNode_1.LogNode((0, simplify_1.simplifyNode)(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(randomK), new numberNode_1.NumberNode(randomA)))).toTex(),
|
|
49
|
+
isRightAnswer: false,
|
|
50
|
+
format: 'tex',
|
|
51
|
+
};
|
|
52
|
+
isDuplicate = propositions.some((p) => p.statement === proposition.statement);
|
|
53
|
+
} while (isDuplicate);
|
|
54
|
+
propositions.push(proposition);
|
|
55
|
+
}
|
|
56
|
+
return (0, shuffle_1.shuffle)(propositions);
|
|
57
|
+
};
|
|
58
|
+
const question = {
|
|
59
|
+
instruction: `Résoudre l'équation $${equation.toTex()}$.`,
|
|
60
|
+
answer: answer.toTex(),
|
|
61
|
+
keys: ['exp', 'ln'],
|
|
62
|
+
getPropositions,
|
|
63
|
+
answerFormat: 'tex',
|
|
64
|
+
};
|
|
65
|
+
return question;
|
|
66
|
+
}
|
|
67
|
+
exports.getExpEquation = getExpEquation;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"firstDegreeEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/firstDegreeEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"firstDegreeEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/firstDegreeEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAQ3E,eAAO,MAAM,mBAAmB,EAAE,QAUjC,CAAC;AAEF,wBAAgB,sBAAsB,IAAI,QAAQ,CA6CjD"}
|
|
@@ -27,6 +27,7 @@ function getFirstDegreeEquation() {
|
|
|
27
27
|
id: (0, uuid_1.v4)() + '',
|
|
28
28
|
statement: (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)).toTex(),
|
|
29
29
|
isRightAnswer: true,
|
|
30
|
+
format: 'tex',
|
|
30
31
|
});
|
|
31
32
|
for (let i = 0; i < n - 1; i++) {
|
|
32
33
|
let isDuplicate;
|
|
@@ -36,6 +37,7 @@ function getFirstDegreeEquation() {
|
|
|
36
37
|
id: (0, uuid_1.v4)() + '',
|
|
37
38
|
statement: (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode((a + (0, randint_1.randint)(-7, 8, [-a])) / (b + (0, randint_1.randint)(-7, 8, [-b])))).toTex(),
|
|
38
39
|
isRightAnswer: false,
|
|
40
|
+
format: 'tex',
|
|
39
41
|
};
|
|
40
42
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
41
43
|
} while (isDuplicate);
|
|
@@ -49,6 +51,7 @@ function getFirstDegreeEquation() {
|
|
|
49
51
|
answer: (0, simplify_1.simplifyNode)(new numberNode_1.NumberNode(a / b)).toTex(),
|
|
50
52
|
keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
|
|
51
53
|
getPropositions,
|
|
54
|
+
answerFormat: 'tex',
|
|
52
55
|
};
|
|
53
56
|
return question;
|
|
54
57
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"fractionEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/fractionEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,
|
|
1
|
+
{"version":3,"file":"fractionEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/equation/fractionEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAU3E,eAAO,MAAM,gBAAgB,EAAE,QAU9B,CAAC;AAEF,wBAAgB,mBAAmB,IAAI,QAAQ,CAiE9C"}
|
|
@@ -37,6 +37,7 @@ function getFractionEquation() {
|
|
|
37
37
|
id: (0, uuid_1.v4)() + '',
|
|
38
38
|
statement: answer,
|
|
39
39
|
isRightAnswer: true,
|
|
40
|
+
format: 'tex',
|
|
40
41
|
});
|
|
41
42
|
for (let i = 0; i < n - 1; i++) {
|
|
42
43
|
let isDuplicate;
|
|
@@ -53,6 +54,7 @@ function getFractionEquation() {
|
|
|
53
54
|
id: (0, uuid_1.v4)() + '',
|
|
54
55
|
statement: wrongAnswer,
|
|
55
56
|
isRightAnswer: false,
|
|
57
|
+
format: 'tex',
|
|
56
58
|
};
|
|
57
59
|
isDuplicate = res.some((p) => p.statement === proposition.statement);
|
|
58
60
|
} while (isDuplicate);
|
|
@@ -65,6 +67,7 @@ function getFractionEquation() {
|
|
|
65
67
|
answer,
|
|
66
68
|
keys: ['x', 'S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'ou', 'emptyset'],
|
|
67
69
|
getPropositions,
|
|
70
|
+
answerFormat: 'tex',
|
|
68
71
|
};
|
|
69
72
|
return question;
|
|
70
73
|
}
|