math-exercises 3.0.200 → 3.0.201
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/math/calcul/fractions/fractionsSumsPrimeDenominators.js +1 -1
- package/lib/exercises/math/calcul/index.d.ts +1 -0
- package/lib/exercises/math/calcul/index.d.ts.map +1 -1
- package/lib/exercises/math/calcul/index.js +1 -0
- package/lib/exercises/math/calculLitteral/inequations/index.d.ts +1 -0
- package/lib/exercises/math/calculLitteral/inequations/index.d.ts.map +1 -1
- package/lib/exercises/math/calculLitteral/inequations/index.js +1 -0
- package/lib/exercises/math/calculLitteral/inequations/inequationCenteredInterval.d.ts +14 -0
- package/lib/exercises/math/calculLitteral/inequations/inequationCenteredInterval.d.ts.map +1 -0
- package/lib/exercises/math/calculLitteral/inequations/inequationCenteredInterval.js +263 -0
- package/lib/exercises/math/combinatory/anagrams.d.ts.map +1 -1
- package/lib/exercises/math/combinatory/anagrams.js +89 -68
- package/lib/exercises/math/combinatory/index.d.ts +1 -0
- package/lib/exercises/math/combinatory/index.d.ts.map +1 -1
- package/lib/exercises/math/combinatory/index.js +1 -0
- package/lib/exercises/math/dataRepresentations/index.d.ts +1 -1
- package/lib/exercises/math/dataRepresentations/index.d.ts.map +1 -1
- package/lib/exercises/math/dataRepresentations/index.js +5 -1
- package/lib/exercises/math/dataRepresentations/scatterPlot/index.d.ts +0 -2
- package/lib/exercises/math/dataRepresentations/scatterPlot/index.d.ts.map +1 -1
- package/lib/exercises/math/dataRepresentations/scatterPlot/index.js +2 -2
- package/lib/exercises/math/derivation/derivative/trigo/index.d.ts +2 -0
- package/lib/exercises/math/derivation/derivative/trigo/index.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/trigo/index.js +3 -0
- package/lib/exercises/math/derivation/problems/index.d.ts +0 -1
- package/lib/exercises/math/derivation/problems/index.d.ts.map +1 -1
- package/lib/exercises/math/derivation/problems/index.js +1 -1
- package/lib/exercises/math/derivation/problems/problemMovementOnLineFindSpeedAtPoint.d.ts.map +1 -1
- package/lib/exercises/math/derivation/problems/problemMovementOnLineFindSpeedAtPoint.js +5 -2
- package/lib/exercises/math/derivation/tangent/index.d.ts +0 -1
- package/lib/exercises/math/derivation/tangent/index.d.ts.map +1 -1
- package/lib/exercises/math/derivation/tangent/index.js +1 -1
- package/lib/exercises/math/derivation/variations/index.d.ts +1 -1
- package/lib/exercises/math/derivation/variations/index.d.ts.map +1 -1
- package/lib/exercises/math/derivation/variations/index.js +2 -1
- package/lib/exercises/math/derivation/variations/signVarTableAffinePlusCXLogX.d.ts +10 -0
- package/lib/exercises/math/derivation/variations/signVarTableAffinePlusCXLogX.d.ts.map +1 -0
- package/lib/exercises/math/derivation/variations/signVarTableAffinePlusCXLogX.js +222 -0
- package/lib/exercises/math/derivation/variations/signVarTableProductFExp.js +1 -1
- package/lib/exercises/math/derivation/variations/signVarTableQuotientFExp.js +1 -1
- package/lib/exercises/math/functions/affines/index.d.ts +5 -0
- package/lib/exercises/math/functions/affines/index.d.ts.map +1 -1
- package/lib/exercises/math/functions/affines/index.js +5 -0
- package/lib/exercises/math/functions/integral/index.d.ts +1 -0
- package/lib/exercises/math/functions/integral/index.d.ts.map +1 -1
- package/lib/exercises/math/functions/integral/index.js +1 -0
- package/lib/exercises/math/functions/integral/integralTrinomialOverX2.d.ts +12 -0
- package/lib/exercises/math/functions/integral/integralTrinomialOverX2.d.ts.map +1 -0
- package/lib/exercises/math/functions/integral/integralTrinomialOverX2.js +280 -0
- package/lib/exercises/math/functions/logarithm/findLargestPossibleDomainOfLogF.d.ts +13 -0
- package/lib/exercises/math/functions/logarithm/findLargestPossibleDomainOfLogF.d.ts.map +1 -0
- package/lib/exercises/math/functions/logarithm/findLargestPossibleDomainOfLogF.js +622 -0
- package/lib/exercises/math/functions/logarithm/index.d.ts +5 -0
- package/lib/exercises/math/functions/logarithm/index.d.ts.map +1 -1
- package/lib/exercises/math/functions/logarithm/index.js +5 -0
- package/lib/exercises/math/functions/logarithm/logEquationLnAXPlusBEqualsK.d.ts +10 -0
- package/lib/exercises/math/functions/logarithm/logEquationLnAXPlusBEqualsK.d.ts.map +1 -0
- package/lib/exercises/math/functions/logarithm/logEquationLnAXPlusBEqualsK.js +172 -0
- package/lib/exercises/math/functions/logarithm/logInequationIntegerSolutions.d.ts +11 -0
- package/lib/exercises/math/functions/logarithm/logInequationIntegerSolutions.d.ts.map +1 -0
- package/lib/exercises/math/functions/logarithm/logInequationIntegerSolutions.js +163 -0
- package/lib/exercises/math/functions/logarithm/logInequationLnAXPlusBInfK.d.ts +18 -0
- package/lib/exercises/math/functions/logarithm/logInequationLnAXPlusBInfK.d.ts.map +1 -0
- package/lib/exercises/math/functions/logarithm/logInequationLnAXPlusBInfK.js +330 -0
- package/lib/exercises/math/functions/logarithm/logLinearCombinationSimplifiying.d.ts +11 -0
- package/lib/exercises/math/functions/logarithm/logLinearCombinationSimplifiying.d.ts.map +1 -0
- package/lib/exercises/math/functions/logarithm/logLinearCombinationSimplifiying.js +185 -0
- package/lib/exercises/math/index.d.ts +1 -1
- package/lib/exercises/math/index.d.ts.map +1 -1
- package/lib/exercises/math/index.js +2 -1
- package/lib/exercises/math/integration/fromExpr/areaBetweenCrossingCurvesFixedPosFromExpr.d.ts +15 -0
- package/lib/exercises/math/integration/fromExpr/areaBetweenCrossingCurvesFixedPosFromExpr.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/areaBetweenCrossingCurvesFixedPosFromExpr.js +505 -0
- package/lib/exercises/math/integration/fromExpr/boundIntegralByBoundingFunctionWithAffinesFromExpr.d.ts +16 -0
- package/lib/exercises/math/integration/fromExpr/boundIntegralByBoundingFunctionWithAffinesFromExpr.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/boundIntegralByBoundingFunctionWithAffinesFromExpr.js +433 -0
- package/lib/exercises/math/integration/fromExpr/boundIntegralByManualRectanglesMethodFromExpr.d.ts +15 -0
- package/lib/exercises/math/integration/fromExpr/boundIntegralByManualRectanglesMethodFromExpr.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/boundIntegralByManualRectanglesMethodFromExpr.js +436 -0
- package/lib/exercises/math/integration/fromExpr/byParts/index.d.ts +3 -0
- package/lib/exercises/math/integration/fromExpr/byParts/index.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/byParts/index.js +2 -0
- package/lib/exercises/math/integration/fromExpr/byParts/integralOfAXPlusBTimesExpKXByParts.d.ts +9 -0
- package/lib/exercises/math/integration/fromExpr/byParts/integralOfAXPlusBTimesExpKXByParts.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/byParts/integralOfAXPlusBTimesExpKXByParts.js +234 -0
- package/lib/exercises/math/integration/fromExpr/byParts/integralOfPolynomialTimesLogXByParts.d.ts +12 -0
- package/lib/exercises/math/integration/fromExpr/byParts/integralOfPolynomialTimesLogXByParts.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/byParts/integralOfPolynomialTimesLogXByParts.js +330 -0
- package/lib/exercises/math/integration/fromExpr/checkIsPrimitiveFromExpr.d.ts +15 -0
- package/lib/exercises/math/integration/fromExpr/checkIsPrimitiveFromExpr.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/checkIsPrimitiveFromExpr.js +450 -0
- package/lib/exercises/math/integration/fromExpr/derivativeOfPrimitive.d.ts +10 -0
- package/lib/exercises/math/integration/fromExpr/derivativeOfPrimitive.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/derivativeOfPrimitive.js +261 -0
- package/lib/exercises/math/integration/fromExpr/index.d.ts +8 -0
- package/lib/exercises/math/integration/fromExpr/index.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/index.js +8 -0
- package/lib/exercises/math/integration/fromExpr/integralFromExpr.d.ts +13 -0
- package/lib/exercises/math/integration/fromExpr/integralFromExpr.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/integralFromExpr.js +359 -0
- package/lib/exercises/math/integration/fromExpr/meanValue/index.d.ts +2 -0
- package/lib/exercises/math/integration/fromExpr/meanValue/index.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/meanValue/index.js +1 -0
- package/lib/exercises/math/integration/fromExpr/meanValue/meanValueOfTrinomFromIntegralFromExpr.d.ts +14 -0
- package/lib/exercises/math/integration/fromExpr/meanValue/meanValueOfTrinomFromIntegralFromExpr.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromExpr/meanValue/meanValueOfTrinomFromIntegralFromExpr.js +429 -0
- package/lib/exercises/math/integration/fromGraph/boundIntegralByManipulatingAutomaticRectanglesMethodFromGraph.d.ts +10 -0
- package/lib/exercises/math/integration/fromGraph/boundIntegralByManipulatingAutomaticRectanglesMethodFromGraph.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromGraph/boundIntegralByManipulatingAutomaticRectanglesMethodFromGraph.js +286 -0
- package/lib/exercises/math/integration/fromGraph/imageOfPrimitiveByManipulatingIntegralBoundsFromGraph.d.ts +9 -0
- package/lib/exercises/math/integration/fromGraph/imageOfPrimitiveByManipulatingIntegralBoundsFromGraph.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromGraph/imageOfPrimitiveByManipulatingIntegralBoundsFromGraph.js +231 -0
- package/lib/exercises/math/integration/fromGraph/index.d.ts +7 -0
- package/lib/exercises/math/integration/fromGraph/index.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromGraph/index.js +6 -0
- package/lib/exercises/math/integration/fromGraph/integralOfAffineFromExprByComputingArea.d.ts +15 -0
- package/lib/exercises/math/integration/fromGraph/integralOfAffineFromExprByComputingArea.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromGraph/integralOfAffineFromExprByComputingArea.js +464 -0
- package/lib/exercises/math/integration/fromGraph/integralOfAffineFromGraph.d.ts +15 -0
- package/lib/exercises/math/integration/fromGraph/integralOfAffineFromGraph.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromGraph/integralOfAffineFromGraph.js +493 -0
- package/lib/exercises/math/integration/fromGraph/integralOfPiecewiseAffineFromGraph.d.ts +18 -0
- package/lib/exercises/math/integration/fromGraph/integralOfPiecewiseAffineFromGraph.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromGraph/integralOfPiecewiseAffineFromGraph.js +466 -0
- package/lib/exercises/math/integration/fromGraph/varTableOfPrimitiveFromGraph.d.ts +10 -0
- package/lib/exercises/math/integration/fromGraph/varTableOfPrimitiveFromGraph.d.ts.map +1 -0
- package/lib/exercises/math/integration/fromGraph/varTableOfPrimitiveFromGraph.js +192 -0
- package/lib/exercises/math/integration/index.d.ts +4 -0
- package/lib/exercises/math/integration/index.d.ts.map +1 -0
- package/lib/exercises/math/integration/index.js +3 -0
- package/lib/exercises/math/integration/integralOfPiecewiseFunctionByUsingComputedIntegrals.d.ts +14 -0
- package/lib/exercises/math/integration/integralOfPiecewiseFunctionByUsingComputedIntegrals.d.ts.map +1 -0
- package/lib/exercises/math/integration/integralOfPiecewiseFunctionByUsingComputedIntegrals.js +222 -0
- package/lib/exercises/math/limits/frac1XTimesALogXPlusBLimit.d.ts +8 -0
- package/lib/exercises/math/limits/frac1XTimesALogXPlusBLimit.d.ts.map +1 -0
- package/lib/exercises/math/limits/frac1XTimesALogXPlusBLimit.js +121 -0
- package/lib/exercises/math/limits/index.d.ts +3 -0
- package/lib/exercises/math/limits/index.d.ts.map +1 -1
- package/lib/exercises/math/limits/index.js +3 -0
- package/lib/exercises/math/limits/kLogXPlusTrinomLimit.d.ts +12 -0
- package/lib/exercises/math/limits/kLogXPlusTrinomLimit.d.ts.map +1 -0
- package/lib/exercises/math/limits/kLogXPlusTrinomLimit.js +224 -0
- package/lib/exercises/math/limits/logOfPolynomialLimit.d.ts +10 -0
- package/lib/exercises/math/limits/logOfPolynomialLimit.d.ts.map +1 -0
- package/lib/exercises/math/limits/logOfPolynomialLimit.js +154 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfLinearCombination.d.ts +12 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfLinearCombination.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfLinearCombination.js +170 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromDice.d.ts +7 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromDice.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromDice.js +163 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromProbaLaw.d.ts +14 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromProbaLaw.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/basicProbas/expectedValueOfSumFromProbaLaw.js +150 -0
- package/lib/exercises/math/probaStat/basicProbas/index.d.ts +5 -0
- package/lib/exercises/math/probaStat/basicProbas/index.d.ts.map +1 -1
- package/lib/exercises/math/probaStat/basicProbas/index.js +5 -0
- package/lib/exercises/math/probaStat/basicProbas/varianceOfLinearCombination.d.ts +12 -0
- package/lib/exercises/math/probaStat/basicProbas/varianceOfLinearCombination.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/basicProbas/varianceOfLinearCombination.js +193 -0
- package/lib/exercises/math/probaStat/basicProbas/varianceOfMean.d.ts +13 -0
- package/lib/exercises/math/probaStat/basicProbas/varianceOfMean.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/basicProbas/varianceOfMean.js +171 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialExpectedValueFromSituation.d.ts +9 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialExpectedValueFromSituation.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialExpectedValueFromSituation.js +125 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindParamsFromSituation.d.ts +9 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindParamsFromSituation.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindParamsFromSituation.js +126 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindProbaOfAtLeastOneSuccessFromSituation.d.ts +8 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindProbaOfAtLeastOneSuccessFromSituation.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindProbaOfAtLeastOneSuccessFromSituation.js +150 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindProbaOfXCompKFromSituation.d.ts +15 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindProbaOfXCompKFromSituation.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindProbaOfXCompKFromSituation.js +386 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindThresholdForNFromSituation.d.ts +14 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindThresholdForNFromSituation.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialFindThresholdForNFromSituation.js +248 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialSituations.d.ts +47 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialSituations.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/binomialSituations.js +184 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/buildTreeBernoulliFromSituation.d.ts +9 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/buildTreeBernoulliFromSituation.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/buildTreeBernoulliFromSituation.js +120 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/index.d.ts +7 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/index.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/binomial/fromSituation/index.js +6 -0
- package/lib/exercises/math/probaStat/binomial/index.d.ts +1 -0
- package/lib/exercises/math/probaStat/binomial/index.d.ts.map +1 -1
- package/lib/exercises/math/probaStat/binomial/index.js +1 -0
- package/lib/exercises/math/probaStat/index.d.ts +1 -0
- package/lib/exercises/math/probaStat/index.d.ts.map +1 -1
- package/lib/exercises/math/probaStat/index.js +1 -0
- package/lib/exercises/math/probaStat/tchebychev/index.d.ts +5 -0
- package/lib/exercises/math/probaStat/tchebychev/index.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/tchebychev/index.js +4 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/index.d.ts +4 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/index.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/index.js +3 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevFindRadiusToMinorizeProbaOfMeanInCenteredInterval.d.ts +11 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevFindRadiusToMinorizeProbaOfMeanInCenteredInterval.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevFindRadiusToMinorizeProbaOfMeanInCenteredInterval.js +273 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevMajorizeProbaOfMeanOutOfCenteredInterval.d.ts +14 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevMajorizeProbaOfMeanOutOfCenteredInterval.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevMajorizeProbaOfMeanOutOfCenteredInterval.js +219 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevMinorizeProbaOfMeanInCenteredInterval.d.ts +14 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevMinorizeProbaOfMeanInCenteredInterval.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/tchebychev/mean/tchebychevMinorizeProbaOfMeanInCenteredInterval.js +245 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevFindRadiusToMajorizeProbaOfXOutOfCenteredInterval.d.ts +10 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevFindRadiusToMajorizeProbaOfXOutOfCenteredInterval.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevFindRadiusToMajorizeProbaOfXOutOfCenteredInterval.js +191 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevMajorizeProbaOfXOutOfCenteredInterval.d.ts +10 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevMajorizeProbaOfXOutOfCenteredInterval.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevMajorizeProbaOfXOutOfCenteredInterval.js +135 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevMinorizeProbaOfXInCenteredInterval.d.ts +10 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevMinorizeProbaOfXInCenteredInterval.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/tchebychev/tchebychevMinorizeProbaOfXInCenteredInterval.js +155 -0
- package/lib/exercises/math/probaStat/trees/buildTreeBernoulli.d.ts +9 -0
- package/lib/exercises/math/probaStat/trees/buildTreeBernoulli.d.ts.map +1 -0
- package/lib/exercises/math/probaStat/trees/buildTreeBernoulli.js +124 -0
- package/lib/exercises/math/probaStat/trees/index.d.ts +1 -0
- package/lib/exercises/math/probaStat/trees/index.d.ts.map +1 -1
- package/lib/exercises/math/probaStat/trees/index.js +1 -0
- package/lib/exercises/math/sequences/geometric/graph/index.d.ts +4 -0
- package/lib/exercises/math/sequences/geometric/graph/index.d.ts.map +1 -1
- package/lib/exercises/math/sequences/geometric/graph/index.js +4 -0
- package/lib/exercises/math/sequences/geometric/index.d.ts +2 -0
- package/lib/exercises/math/sequences/geometric/index.d.ts.map +1 -1
- package/lib/exercises/math/sequences/geometric/index.js +2 -0
- package/lib/exercises/math/sequences/geometric/situations/geometricFindRankFromSituation.d.ts.map +1 -1
- package/lib/exercises/math/sequences/geometric/situations/geometricFindRankFromSituation.js +71 -48
- package/lib/exercises/math/sequences/geometric/situations/index.d.ts +2 -1
- package/lib/exercises/math/sequences/geometric/situations/index.d.ts.map +1 -1
- package/lib/exercises/math/sequences/geometric/situations/index.js +2 -2
- package/lib/exercises/math/sets/index.d.ts +3 -0
- package/lib/exercises/math/sets/index.d.ts.map +1 -1
- package/lib/exercises/math/sets/index.js +3 -0
- package/lib/exercises/math/spaceGeometry/basis/index.d.ts +6 -0
- package/lib/exercises/math/spaceGeometry/basis/index.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/basis/index.js +6 -0
- package/lib/exercises/math/spaceGeometry/basis/lineLineRelativePositionsFromCubeOuterPoints.d.ts +11 -0
- package/lib/exercises/math/spaceGeometry/basis/lineLineRelativePositionsFromCubeOuterPoints.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/basis/lineLineRelativePositionsFromCubeOuterPoints.js +576 -0
- package/lib/exercises/math/spaceGeometry/basis/linePlaneRelativePositionsFromCubeOuterPoints.d.ts +11 -0
- package/lib/exercises/math/spaceGeometry/basis/linePlaneRelativePositionsFromCubeOuterPoints.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/basis/linePlaneRelativePositionsFromCubeOuterPoints.js +595 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfPointInCubeCoordSystem.d.ts +11 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfPointInCubeCoordSystem.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfPointInCubeCoordSystem.js +501 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfPointInCubeCoordSystemFromVecPath.d.ts +16 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfPointInCubeCoordSystemFromVecPath.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfPointInCubeCoordSystemFromVecPath.js +753 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfVectorInCubeCoordSystem.d.ts +12 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfVectorInCubeCoordSystem.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfVectorInCubeCoordSystem.js +546 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceVectorLinearCombinationFromCoords.d.ts +13 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceVectorLinearCombinationFromCoords.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/basis/spaceVectorLinearCombinationFromCoords.js +233 -0
- package/lib/exercises/math/spaceGeometry/collinearity/checkAlignedSpacePointsFromCoords.d.ts +11 -0
- package/lib/exercises/math/spaceGeometry/collinearity/checkAlignedSpacePointsFromCoords.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/collinearity/checkAlignedSpacePointsFromCoords.js +192 -0
- package/lib/exercises/math/spaceGeometry/collinearity/checkAlignedSpacePointsFromVecPathsFromCubeOuterPoints.d.ts +15 -0
- package/lib/exercises/math/spaceGeometry/collinearity/checkAlignedSpacePointsFromVecPathsFromCubeOuterPoints.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/collinearity/checkAlignedSpacePointsFromVecPathsFromCubeOuterPoints.js +511 -0
- package/lib/exercises/math/spaceGeometry/collinearity/index.d.ts +3 -0
- package/lib/exercises/math/spaceGeometry/collinearity/index.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/collinearity/index.js +2 -0
- package/lib/exercises/math/spaceGeometry/index.d.ts +5 -0
- package/lib/exercises/math/spaceGeometry/index.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/index.js +5 -1
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.d.ts +22 -0
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.js +366 -0
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.d.ts +2 -0
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.js +2 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/index.d.ts +3 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/index.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/index.js +2 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/lineLineRelativePositionsFromParametricLines.d.ts +14 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/lineLineRelativePositionsFromParametricLines.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/lineLineRelativePositionsFromParametricLines.js +325 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/parametricLineFromPointAndDirectionVector.d.ts +13 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/parametricLineFromPointAndDirectionVector.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/parametricLine/parametricLineFromPointAndDirectionVector.js +181 -0
- package/lib/exercises/math/spaceGeometry/planes/checkIsPointBelongingToPlane.d.ts +10 -0
- package/lib/exercises/math/spaceGeometry/planes/checkIsPointBelongingToPlane.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/planes/checkIsPointBelongingToPlane.js +208 -0
- package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlaneEquation.d.ts +8 -0
- package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlaneEquation.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlaneEquation.js +255 -0
- package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.d.ts +10 -0
- package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.js +232 -0
- package/lib/exercises/math/spaceGeometry/planes/index.d.ts +5 -1
- package/lib/exercises/math/spaceGeometry/planes/index.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/planes/index.js +6 -2
- package/lib/exercises/math/spaceGeometry/planes/planeEquationFromNormalVectorAndContainedPoint.d.ts +10 -0
- package/lib/exercises/math/spaceGeometry/planes/planeEquationFromNormalVectorAndContainedPoint.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/planes/planeEquationFromNormalVectorAndContainedPoint.js +273 -0
- package/lib/exercises/math/spaceGeometry/planes/planeEquationFromOrthogonalLineAndContainedPoint.d.ts +12 -0
- package/lib/exercises/math/spaceGeometry/planes/planeEquationFromOrthogonalLineAndContainedPoint.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/planes/planeEquationFromOrthogonalLineAndContainedPoint.js +398 -0
- package/lib/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.d.ts +22 -0
- package/lib/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.js +509 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.d.ts +8 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.js +229 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalLinesFromParametricReps.d.ts +9 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalLinesFromParametricReps.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalLinesFromParametricReps.js +200 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalSpaceVecsFromCoords.d.ts +8 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalSpaceVecsFromCoords.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalSpaceVecsFromCoords.js +176 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsSpaceVecOrthogonalToPlaneFromCoords.d.ts +9 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsSpaceVecOrthogonalToPlaneFromCoords.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsSpaceVecOrthogonalToPlaneFromCoords.js +263 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/index.d.ts +6 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/index.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/index.js +6 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/scalarProductFromCubeOuterPoints.d.ts +14 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/scalarProductFromCubeOuterPoints.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/scalarProductFromCubeOuterPoints.js +497 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/scalarProductFromSpacePointCoords.d.ts +8 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/scalarProductFromSpacePointCoords.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/scalarProductFromSpacePointCoords.js +173 -0
- package/lib/exercises/math/spaceGeometry/vectors/findLinearDecompositionWrtCoplanarUVFromCoords.d.ts +10 -0
- package/lib/exercises/math/spaceGeometry/vectors/findLinearDecompositionWrtCoplanarUVFromCoords.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/vectors/findLinearDecompositionWrtCoplanarUVFromCoords.js +236 -0
- package/lib/exercises/math/spaceGeometry/vectors/index.d.ts +2 -0
- package/lib/exercises/math/spaceGeometry/vectors/index.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/vectors/index.js +2 -0
- package/lib/exercises/math/spaceGeometry/vectors/spacePointsDistanceCalculation.d.ts +8 -0
- package/lib/exercises/math/spaceGeometry/vectors/spacePointsDistanceCalculation.d.ts.map +1 -0
- package/lib/exercises/math/spaceGeometry/vectors/spacePointsDistanceCalculation.js +156 -0
- package/lib/exercises/math/trigonometry/functions/index.d.ts +1 -0
- package/lib/exercises/math/trigonometry/functions/index.d.ts.map +1 -1
- package/lib/exercises/math/trigonometry/functions/index.js +1 -0
- package/lib/exercises/utils/data/randomDataTable.d.ts +4 -1
- package/lib/exercises/utils/data/randomDataTable.d.ts.map +1 -1
- package/lib/exercises/utils/data/randomDataTable.js +1 -2
- package/lib/exercises/vea/varLineVEA.d.ts.map +1 -1
- package/lib/exercises/vea/varLineVEA.js +15 -2
- package/lib/exercises/vea/xTableLineVEA.d.ts.map +1 -1
- package/lib/exercises/vea/xTableLineVEA.js +13 -2
- package/lib/index.d.ts +539 -34
- package/lib/index.d.ts.map +1 -1
- package/lib/latexTester.d.ts.map +1 -1
- package/lib/latexTester.js +9 -7
- package/lib/math/geometry/parametricLine.d.ts +1 -1
- package/lib/math/geometry/parametricLine.d.ts.map +1 -1
- package/lib/math/geometry/parametricLine.js +2 -2
- package/lib/math/geometry/spaceVector.d.ts +11 -1
- package/lib/math/geometry/spaceVector.d.ts.map +1 -1
- package/lib/math/geometry/spaceVector.js +18 -4
- package/lib/math/probability/randomVariable.d.ts +3 -2
- package/lib/math/probability/randomVariable.d.ts.map +1 -1
- package/lib/math/probability/randomVariable.js +14 -8
- package/lib/math/systems/generalSystem.d.ts +3 -3
- package/lib/math/systems/generalSystem.d.ts.map +1 -1
- package/lib/math/systems/generalSystem.js +20 -17
- package/lib/math/utils/functions/functionComparison.d.ts.map +1 -1
- package/lib/math/utils/functions/functionComparison.js +2 -45
- package/lib/math/utils/functions/functionComposition.d.ts +3 -1
- package/lib/math/utils/functions/functionComposition.d.ts.map +1 -1
- package/lib/math/utils/functions/functionComposition.js +17 -17
- package/lib/math/utils/integration/rectanglesMethod.d.ts +6 -0
- package/lib/math/utils/integration/rectanglesMethod.d.ts.map +1 -0
- package/lib/math/utils/integration/rectanglesMethod.js +66 -0
- package/lib/math/utils/polynomial/polynomialUtils.d.ts +9 -1
- package/lib/math/utils/polynomial/polynomialUtils.d.ts.map +1 -1
- package/lib/math/utils/polynomial/polynomialUtils.js +66 -7
- package/lib/math/utils/sequences/situations/seqGeometricSituations.d.ts +34 -2
- package/lib/math/utils/sequences/situations/seqGeometricSituations.d.ts.map +1 -1
- package/lib/math/utils/sequences/situations/seqGeometricSituations.js +288 -47
- package/lib/tests/questionTest.d.ts.map +1 -1
- package/lib/tests/questionTest.js +5 -2
- package/lib/tests/singleExo.test.js +2 -2
- package/lib/tree/nodes/functions/cosNode.d.ts +1 -1
- package/lib/tree/nodes/functions/cosNode.d.ts.map +1 -1
- package/lib/tree/nodes/functions/cosNode.js +5 -2
- package/lib/tree/nodes/functions/factorialNode.d.ts +1 -0
- package/lib/tree/nodes/functions/factorialNode.d.ts.map +1 -1
- package/lib/tree/nodes/functions/factorialNode.js +16 -1
- package/lib/tree/nodes/functions/logNode.d.ts.map +1 -1
- package/lib/tree/nodes/functions/logNode.js +2 -1
- package/lib/tree/nodes/operators/binomialCoefficientNode.d.ts +2 -0
- package/lib/tree/nodes/operators/binomialCoefficientNode.d.ts.map +1 -1
- package/lib/tree/nodes/operators/binomialCoefficientNode.js +34 -0
- package/lib/tree/nodes/sets/discreteSetNode.d.ts.map +1 -1
- package/lib/tree/nodes/sets/discreteSetNode.js +1 -0
- package/lib/tree/utilities/nodeComparator.d.ts +7 -0
- package/lib/tree/utilities/nodeComparator.d.ts.map +1 -1
- package/lib/tree/utilities/nodeComparator.js +59 -0
- package/lib/tree/utilities/nodeInspector.d.ts +2 -0
- package/lib/tree/utilities/nodeInspector.d.ts.map +1 -1
- package/lib/tree/utilities/nodeInspector.js +23 -1
- package/lib/tree/utilities/nodeRewriter.d.ts.map +1 -1
- package/lib/tree/utilities/nodeRewriter.js +4 -1
- package/lib/types/keyIds.d.ts +1 -1
- package/lib/types/keyIds.d.ts.map +1 -1
- package/lib/utils/strings/splitAndKeep.d.ts +2 -0
- package/lib/utils/strings/splitAndKeep.d.ts.map +1 -0
- package/lib/utils/strings/splitAndKeep.js +13 -0
- package/package.json +1 -1
package/lib/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.js
ADDED
|
@@ -0,0 +1,229 @@
|
|
|
1
|
+
import { addValidProp, shuffleProps, tryToAddWrongProp, propWhile, } from "../../../../exercises/exercise.js";
|
|
2
|
+
import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
|
|
3
|
+
import { numberVEA } from "../../../../exercises/vea/numberVEA.js";
|
|
4
|
+
import { SpacePoint, SpacePointConstructor, } from "../../../../math/geometry/spacePoint.js";
|
|
5
|
+
import { SpaceVector } from "../../../../math/geometry/spaceVector.js";
|
|
6
|
+
import { randint } from "../../../../math/utils/random/randint.js";
|
|
7
|
+
import { round } from "../../../../math/utils/round.js";
|
|
8
|
+
import { arccos } from "../../../../tree/nodes/functions/arccosNode.js";
|
|
9
|
+
import { sqrt } from "../../../../tree/nodes/functions/sqrtNode.js";
|
|
10
|
+
import { PiNode } from "../../../../tree/nodes/numbers/piNode.js";
|
|
11
|
+
import { add } from "../../../../tree/nodes/operators/addNode.js";
|
|
12
|
+
import { frac } from "../../../../tree/nodes/operators/fractionNode.js";
|
|
13
|
+
import { multiply } from "../../../../tree/nodes/operators/multiplyNode.js";
|
|
14
|
+
import { square } from "../../../../tree/nodes/operators/powerNode.js";
|
|
15
|
+
import { substract } from "../../../../tree/nodes/operators/substractNode.js";
|
|
16
|
+
import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
|
|
17
|
+
import { coinFlip } from "../../../../utils/alea/coinFlip.js";
|
|
18
|
+
import { zip } from "../../../../utils/arrays/arrayZip.js";
|
|
19
|
+
import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
|
|
20
|
+
import { alignTex } from "../../../../utils/latex/alignTex.js";
|
|
21
|
+
const norm3DRaw = (spaceVector) => {
|
|
22
|
+
return sqrt(add(square(spaceVector.x), add(square(spaceVector.y), square(spaceVector.z))));
|
|
23
|
+
};
|
|
24
|
+
const spaceVectorFromPointsRaw = (spacePointStart, spacePointEnd) => {
|
|
25
|
+
return new SpaceVector(`${spacePointStart.name}${spacePointEnd.name}`, substract(spacePointEnd.x, spacePointStart.x), substract(spacePointEnd.y, spacePointStart.y), substract(spacePointEnd.z, spacePointStart.z));
|
|
26
|
+
};
|
|
27
|
+
const simplifySpaceVector = (vec, opts = {}) => {
|
|
28
|
+
return new SpaceVector(vec.name, vec.x.simplify(opts), vec.y.simplify(opts), vec.z.simplify(opts));
|
|
29
|
+
};
|
|
30
|
+
const getHydrated = (identifiers) => {
|
|
31
|
+
const { spacePointIds } = identifiers;
|
|
32
|
+
const [A, B, C] = spacePointIds.map((spacePointIds) => SpacePointConstructor.fromIdentifiers(spacePointIds));
|
|
33
|
+
const [vecBA, vecBC] = [
|
|
34
|
+
[B, A],
|
|
35
|
+
[B, C],
|
|
36
|
+
].map(([spacePointStart, spacePointEnd]) => spaceVectorFromPointsRaw(spacePointStart, spacePointEnd));
|
|
37
|
+
const [vecBASimplified, vecBCSimplified] = [vecBA, vecBC].map((vec) => simplifySpaceVector(vec, { towardsDistribute: true }));
|
|
38
|
+
const nodeScalarProduct = vecBASimplified.scalarProduct(vecBCSimplified);
|
|
39
|
+
const [nodeNormBA, nodeNormBC] = [vecBASimplified, vecBCSimplified].map((vec) => norm3DRaw(vec));
|
|
40
|
+
const nodeCosABC = frac(nodeScalarProduct.simplify(), multiply(nodeNormBA.simplify(), nodeNormBC.simplify()));
|
|
41
|
+
const nodeABC = arccos(nodeCosABC.simplify());
|
|
42
|
+
return {
|
|
43
|
+
A,
|
|
44
|
+
B,
|
|
45
|
+
C,
|
|
46
|
+
vecBA,
|
|
47
|
+
vecBASimplified,
|
|
48
|
+
vecBC,
|
|
49
|
+
vecBCSimplified,
|
|
50
|
+
nodeScalarProduct,
|
|
51
|
+
nodeCosABC,
|
|
52
|
+
nodeABC,
|
|
53
|
+
nodeNormBA,
|
|
54
|
+
nodeNormBC,
|
|
55
|
+
};
|
|
56
|
+
};
|
|
57
|
+
const getInstruction = (identifiers) => {
|
|
58
|
+
const { spacePointIds } = identifiers;
|
|
59
|
+
const [A, B, C] = spacePointIds.map((spacePointIds) => SpacePointConstructor.fromIdentifiers(spacePointIds));
|
|
60
|
+
return `Soient trois points $A$,$B$ et $C$ de coordonnées :
|
|
61
|
+
|
|
62
|
+
${alignTex([A, B, C].map((spacePoint) => [spacePoint.toTexWithCoords()]))}
|
|
63
|
+
|
|
64
|
+
Combien vaut $\\widehat{ABC}$ arrondi au degré près ?`;
|
|
65
|
+
};
|
|
66
|
+
const getAnswer = (identifiers) => {
|
|
67
|
+
const { nodeABC } = getHydrated(identifiers);
|
|
68
|
+
const nodeABCInDegrees = multiply(frac(180, PiNode), nodeABC);
|
|
69
|
+
return round(nodeABCInDegrees.evaluate(), 0).frenchify();
|
|
70
|
+
};
|
|
71
|
+
const getHint = () => {
|
|
72
|
+
const vecU = new SpaceVector("u", new VariableNode("u_{x}"), new VariableNode("u_{y}"), new VariableNode("u_{z}"));
|
|
73
|
+
const vecV = new SpaceVector("v", new VariableNode("v_{x}"), new VariableNode("v_{y}"), new VariableNode("v_{z}"));
|
|
74
|
+
return `Pour commencer, calcule les coordonnées de $\\overrightarrow{BA}$ et de $\\overrightarrow{BC}$.
|
|
75
|
+
|
|
76
|
+
Puis, tu peux calculer $\\cos(\\widehat{ABC})$ en reliant les deux façons d'écrire le produit scalaire $\\overrightarrow{BA} \\cdot \\overrightarrow{BC}$.
|
|
77
|
+
|
|
78
|
+
La première façon en utlisant les coordonnées (si on pose $\\overrightarrow{u}=\\overrightarrow{BA}$ et $\\overrightarrow{v}=\\overrightarrow{BC}$) :
|
|
79
|
+
|
|
80
|
+
${alignTex([
|
|
81
|
+
["", "\\overrightarrow{BA} \\cdot \\overrightarrow{BC}"],
|
|
82
|
+
["=", "\\overrightarrow{u} \\cdot \\overrightarrow{v}"],
|
|
83
|
+
["=", vecU.scalarProduct(vecV).toTex()],
|
|
84
|
+
])}
|
|
85
|
+
|
|
86
|
+
et la deuxième façon en utilisant l'angle $\\widehat{ABC}$ :
|
|
87
|
+
|
|
88
|
+
${alignTex([
|
|
89
|
+
["", "\\overrightarrow{BA} \\cdot \\overrightarrow{BC}"],
|
|
90
|
+
[
|
|
91
|
+
"=",
|
|
92
|
+
"\\lVert{\\overrightarrow{BA}}\\rVert \\times \\lVert{\\overrightarrow{BC}}\\rVert \\times \\cos(\\widehat{ABC})",
|
|
93
|
+
],
|
|
94
|
+
])}
|
|
95
|
+
|
|
96
|
+
`;
|
|
97
|
+
};
|
|
98
|
+
const getCorrection = (identifiers) => {
|
|
99
|
+
const { vecBA, vecBC, vecBASimplified, vecBCSimplified, nodeScalarProduct, nodeABC, nodeCosABC, nodeNormBA, nodeNormBC, } = getHydrated(identifiers);
|
|
100
|
+
const nodeAnswer = (() => {
|
|
101
|
+
const nodeABCInDegrees = multiply(frac(180, PiNode), nodeABC);
|
|
102
|
+
return round(nodeABCInDegrees.evaluate(), 0).toTree();
|
|
103
|
+
})();
|
|
104
|
+
return `On a :
|
|
105
|
+
|
|
106
|
+
${alignTex([
|
|
107
|
+
[vecBA, vecBASimplified],
|
|
108
|
+
[vecBC, vecBCSimplified],
|
|
109
|
+
].flatMap(([vec, vecSimplified]) => [
|
|
110
|
+
[vec.toTex(), "=", vec.toCoordsTex()],
|
|
111
|
+
["", "=", vecSimplified.toCoordsTex()],
|
|
112
|
+
]))}
|
|
113
|
+
|
|
114
|
+
Par conséquent :
|
|
115
|
+
|
|
116
|
+
${alignTex([
|
|
117
|
+
[
|
|
118
|
+
"\\overrightarrow{BA} \\cdot \\overrightarrow{BC}",
|
|
119
|
+
"=",
|
|
120
|
+
nodeScalarProduct.toTex({
|
|
121
|
+
forceNoSimplification: true,
|
|
122
|
+
forceTimesSign: true,
|
|
123
|
+
}),
|
|
124
|
+
],
|
|
125
|
+
["", "=", nodeScalarProduct.simplify({ towardsDistribute: true }).toTex()],
|
|
126
|
+
])}
|
|
127
|
+
|
|
128
|
+
Or :
|
|
129
|
+
|
|
130
|
+
$$
|
|
131
|
+
\\overrightarrow{AB} \\cdot \\overrightarrow{AC} = \\lVert{\\overrightarrow{BA}}\\rVert \\times \\lVert{\\overrightarrow{BC}}\\rVert \\times \\cos(\\widehat{ABC})
|
|
132
|
+
$$
|
|
133
|
+
|
|
134
|
+
et
|
|
135
|
+
|
|
136
|
+
${alignTex([
|
|
137
|
+
["\\lVert{\\overrightarrow{BA}}\\rVert", "=", nodeNormBA.toTex()],
|
|
138
|
+
["", "=", nodeNormBA.simplify().toTex()],
|
|
139
|
+
])}
|
|
140
|
+
|
|
141
|
+
${alignTex([
|
|
142
|
+
["\\lVert{\\overrightarrow{BC}}\\rVert", "=", nodeNormBC.toTex()],
|
|
143
|
+
["", "=", nodeNormBC.simplify().toTex()],
|
|
144
|
+
])}
|
|
145
|
+
|
|
146
|
+
Donc :
|
|
147
|
+
|
|
148
|
+
$$
|
|
149
|
+
\\cos(\\widehat{ABC}) = ${nodeCosABC.toTex()}
|
|
150
|
+
$$
|
|
151
|
+
|
|
152
|
+
$$
|
|
153
|
+
\\widehat{ABC} = ${nodeABC.toTex()}
|
|
154
|
+
$$
|
|
155
|
+
|
|
156
|
+
L'angle mesure donc environ $${nodeAnswer.toTex()}°$.`;
|
|
157
|
+
};
|
|
158
|
+
const getPropositions = (n, { answer }) => {
|
|
159
|
+
const propositions = [];
|
|
160
|
+
addValidProp(propositions, answer);
|
|
161
|
+
propWhile(propositions, n, () => {
|
|
162
|
+
const identifiersWrong = createRandomIdentifiers();
|
|
163
|
+
tryToAddWrongProp(propositions, getAnswer(identifiersWrong));
|
|
164
|
+
});
|
|
165
|
+
return shuffleProps(propositions, n);
|
|
166
|
+
};
|
|
167
|
+
const getKeys = () => {
|
|
168
|
+
return ["semicolon"]; //pas gentil
|
|
169
|
+
};
|
|
170
|
+
const isAnswerValid = (ans, { answer }) => {
|
|
171
|
+
try {
|
|
172
|
+
return numberVEA(ans, answer);
|
|
173
|
+
}
|
|
174
|
+
catch (err) {
|
|
175
|
+
return handleVEAError(err);
|
|
176
|
+
}
|
|
177
|
+
};
|
|
178
|
+
const createRandomIdentifiers = () => {
|
|
179
|
+
const funcRand1 = () => randint(-3, 4, coinFlip() ? [0] : []).toTree();
|
|
180
|
+
const funcRand2 = () => randint(-6, 7, coinFlip() ? [0] : []).toTree();
|
|
181
|
+
const funcRand3 = () => randint(-9, 10, coinFlip() ? [0] : []).toTree();
|
|
182
|
+
const [vecU, vecV] = zip(["u", "v"], [
|
|
183
|
+
[funcRand1, funcRand2, funcRand3],
|
|
184
|
+
[funcRand3, funcRand2, funcRand1],
|
|
185
|
+
]).map(([name, [funcRandX, funcRandY, funcRandZ]]) => new SpaceVector(name, funcRandX(), funcRandY(), funcRandZ()));
|
|
186
|
+
const A = new SpacePoint("A", randint(-5, 6).toTree(), randint(-5, 6).toTree(), randint(-5, 6).toTree());
|
|
187
|
+
const [B, C] = [
|
|
188
|
+
["B", vecU],
|
|
189
|
+
["C", vecV],
|
|
190
|
+
].map(([name, vec]) => {
|
|
191
|
+
const spacePointRaw = vec.getEndPoint(A);
|
|
192
|
+
return new SpacePoint(name, spacePointRaw.x, spacePointRaw.y, spacePointRaw.z);
|
|
193
|
+
});
|
|
194
|
+
const identifiers = {
|
|
195
|
+
spacePointIds: [A, B, C].map((vec) => new SpacePoint(vec.name, vec.x, vec.y, vec.z).toIdentifiers()),
|
|
196
|
+
};
|
|
197
|
+
return identifiers;
|
|
198
|
+
};
|
|
199
|
+
const getAngleFromScalarProductFromSpacePointCoordsQuestion = () => {
|
|
200
|
+
const identifiers = createRandomIdentifiers();
|
|
201
|
+
return getQuestionFromIdentifiers(identifiers);
|
|
202
|
+
};
|
|
203
|
+
const getQuestionFromIdentifiers = (identifiers, _opts) => {
|
|
204
|
+
const question = {
|
|
205
|
+
answer: getAnswer(identifiers),
|
|
206
|
+
instruction: getInstruction(identifiers),
|
|
207
|
+
keys: getKeys(identifiers),
|
|
208
|
+
answerFormat: "tex",
|
|
209
|
+
identifiers,
|
|
210
|
+
hint: getHint(identifiers),
|
|
211
|
+
correction: getCorrection(identifiers),
|
|
212
|
+
};
|
|
213
|
+
return question;
|
|
214
|
+
};
|
|
215
|
+
export const angleFromScalarProductFromSpacePointCoords = {
|
|
216
|
+
id: "angleFromScalarProductFromSpacePointCoords",
|
|
217
|
+
label: "Déterminer une mesure de l'angle géométrique $\\widehat{ABC}$ à partir des coordonnées de $A$, $B$ et $C$",
|
|
218
|
+
isSingleStep: true,
|
|
219
|
+
generator: (nb, opts) => getDistinctQuestions(() => getAngleFromScalarProductFromSpacePointCoordsQuestion(opts), nb),
|
|
220
|
+
qcmTimer: 60,
|
|
221
|
+
freeTimer: 60,
|
|
222
|
+
getPropositions,
|
|
223
|
+
isAnswerValid,
|
|
224
|
+
subject: "Mathématiques",
|
|
225
|
+
getQuestionFromIdentifiers,
|
|
226
|
+
getHint,
|
|
227
|
+
getCorrection,
|
|
228
|
+
hasHintAndCorrection: true,
|
|
229
|
+
};
|
package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalLinesFromParametricReps.d.ts
ADDED
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
import { Exercise } from "../../../../exercises/exercise.js";
|
|
2
|
+
import { SpacePointIdentifiers } from "../../../../math/geometry/spacePoint.js";
|
|
3
|
+
type Identifiers = {
|
|
4
|
+
spacePointIdsForAB: SpacePointIdentifiers[];
|
|
5
|
+
spacePointIdsForUV: SpacePointIdentifiers[];
|
|
6
|
+
};
|
|
7
|
+
export declare const checkIsOrthogonalLinesFromParametricReps: Exercise<Identifiers>;
|
|
8
|
+
export {};
|
|
9
|
+
//# sourceMappingURL=checkIsOrthogonalLinesFromParametricReps.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"checkIsOrthogonalLinesFromParametricReps.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalLinesFromParametricReps.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAY3C,KAAK,WAAW,GAAG;IACjB,kBAAkB,EAAE,qBAAqB,EAAE,CAAC;IAC5C,kBAAkB,EAAE,qBAAqB,EAAE,CAAC;CAC7C,CAAC;AA2PF,eAAO,MAAM,wCAAwC,EAAE,QAAQ,CAAC,WAAW,CAmB1E,CAAC"}
|
package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalLinesFromParametricReps.js
ADDED
|
@@ -0,0 +1,200 @@
|
|
|
1
|
+
import { addValidProp, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
|
|
2
|
+
import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
|
|
3
|
+
import { ParametricLine } from "../../../../math/geometry/parametricLine.js";
|
|
4
|
+
import { SpacePoint, SpacePointConstructor, } from "../../../../math/geometry/spacePoint.js";
|
|
5
|
+
import { SpaceVector } from "../../../../math/geometry/spaceVector.js";
|
|
6
|
+
import { randint } from "../../../../math/utils/random/randint.js";
|
|
7
|
+
import { opposite } from "../../../../tree/nodes/functions/oppositeNode.js";
|
|
8
|
+
import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
|
|
9
|
+
import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
|
|
10
|
+
import { coinFlip } from "../../../../utils/alea/coinFlip.js";
|
|
11
|
+
import { random } from "../../../../utils/alea/random.js";
|
|
12
|
+
import { shuffle } from "../../../../utils/alea/shuffle.js";
|
|
13
|
+
import { zip } from "../../../../utils/arrays/arrayZip.js";
|
|
14
|
+
import { alignTex } from "../../../../utils/latex/alignTex.js";
|
|
15
|
+
const getHydrated = (identifiers) => {
|
|
16
|
+
const { spacePointIdsForAB, spacePointIdsForUV } = identifiers;
|
|
17
|
+
const [A, B] = spacePointIdsForAB.map((pointIds) => SpacePointConstructor.fromIdentifiers(pointIds));
|
|
18
|
+
const [vecU, vecV] = spacePointIdsForUV.map((pointIds) => {
|
|
19
|
+
const spacePoint = SpacePointConstructor.fromIdentifiers(pointIds);
|
|
20
|
+
return new SpaceVector(spacePoint.name, spacePoint.x, spacePoint.y, spacePoint.z);
|
|
21
|
+
});
|
|
22
|
+
const [lineU, lineV] = [
|
|
23
|
+
[A, vecU],
|
|
24
|
+
[B, vecV],
|
|
25
|
+
].map(([spacePoint, spaceVector]) => new ParametricLine(spacePoint, spaceVector));
|
|
26
|
+
const nodeScalarProduct = vecU.scalarProduct(vecV);
|
|
27
|
+
return {
|
|
28
|
+
lineU,
|
|
29
|
+
lineV,
|
|
30
|
+
vecU,
|
|
31
|
+
vecV,
|
|
32
|
+
nodeScalarProduct,
|
|
33
|
+
};
|
|
34
|
+
};
|
|
35
|
+
const getInstruction = (identifiers) => {
|
|
36
|
+
const { lineU, lineV } = getHydrated(identifiers);
|
|
37
|
+
return `Soient deux droites $d_{1}$ et $d_{2}$ dont les équations paramétriques sont :
|
|
38
|
+
|
|
39
|
+
$$
|
|
40
|
+
d_{1}: ${lineU.toTex()}
|
|
41
|
+
$$
|
|
42
|
+
|
|
43
|
+
$$
|
|
44
|
+
d_{2}: ${lineV.toTex()}
|
|
45
|
+
$$
|
|
46
|
+
|
|
47
|
+
Les droites $d_{1}$ et $d_{2}$ sont-elles orthogonales ?`;
|
|
48
|
+
};
|
|
49
|
+
const getAnswer = (identifiers) => {
|
|
50
|
+
const { nodeScalarProduct } = getHydrated(identifiers);
|
|
51
|
+
const isOrthogonalVecs = NodeComparator.isEqualViaSub(nodeScalarProduct, (0).toTree());
|
|
52
|
+
return isOrthogonalVecs ? "Oui" : "Non";
|
|
53
|
+
};
|
|
54
|
+
const getHint = () => {
|
|
55
|
+
const A = new SpacePoint("A", new VariableNode("a_{x}"), new VariableNode("a_{y}"), new VariableNode("a_{z}"));
|
|
56
|
+
const vecU = new SpaceVector("u", new VariableNode("u_{x}"), new VariableNode("u_{y}"), new VariableNode("u_{z}"));
|
|
57
|
+
const line = new ParametricLine(A, vecU);
|
|
58
|
+
return `Deux droites sont orthogonales si et seulement si leurs vecteurs directeurs sont orthogonaux.
|
|
59
|
+
|
|
60
|
+
Si $d$ est une droite d'équation paramétrique :
|
|
61
|
+
|
|
62
|
+
$$
|
|
63
|
+
d: ${line.toTex()}
|
|
64
|
+
$$
|
|
65
|
+
|
|
66
|
+
alors on peut extraire le vecteur directeur :
|
|
67
|
+
|
|
68
|
+
$$
|
|
69
|
+
\\overrightarrow{u} = ${vecU.toCoordsTex()}
|
|
70
|
+
$$
|
|
71
|
+
|
|
72
|
+
`;
|
|
73
|
+
};
|
|
74
|
+
const getCorrection = (identifiers) => {
|
|
75
|
+
const { vecU, vecV, nodeScalarProduct } = getHydrated(identifiers);
|
|
76
|
+
const isOrthogonalVecs = NodeComparator.isEqualViaSub(nodeScalarProduct, (0).toTree());
|
|
77
|
+
return `Soient $\\overrightarrow{u}$ et $\\overrightarrow{v}$ les vecteurs directeurs respectifs des droites $d_{1}$ et $d_{2}$ :
|
|
78
|
+
|
|
79
|
+
$$
|
|
80
|
+
\\overrightarrow{u} = ${vecU.toCoordsTex()}
|
|
81
|
+
$$
|
|
82
|
+
|
|
83
|
+
$$
|
|
84
|
+
\\overrightarrow{v} = ${vecV.toCoordsTex()}
|
|
85
|
+
$$
|
|
86
|
+
|
|
87
|
+
On calcule :
|
|
88
|
+
|
|
89
|
+
${alignTex([
|
|
90
|
+
[
|
|
91
|
+
"\\overrightarrow{u} \\cdot \\overrightarrow{v}",
|
|
92
|
+
"=",
|
|
93
|
+
nodeScalarProduct.toTex({
|
|
94
|
+
forceNoSimplification: true,
|
|
95
|
+
forceTimesSign: true,
|
|
96
|
+
}),
|
|
97
|
+
],
|
|
98
|
+
["", "=", nodeScalarProduct.simplify({ towardsDistribute: true }).toTex()],
|
|
99
|
+
!isOrthogonalVecs ? ["", "\\neq", "0"] : [],
|
|
100
|
+
])}
|
|
101
|
+
|
|
102
|
+
${(() => {
|
|
103
|
+
if (isOrthogonalVecs) {
|
|
104
|
+
return `Le produit scalaire est nul donc les vecteurs directeurs sont orthogonaux. Les droites $d_{1}$ et $d_{2}$ sont donc orthogonales.`;
|
|
105
|
+
}
|
|
106
|
+
else {
|
|
107
|
+
return `Le produit scalaire n'est pas nul donc les vecteurs directeurs ne sont pas orthogonaux. Les droites $d_{1}$ et $d_{2}$ ne sont donc pas orthogonales.`;
|
|
108
|
+
}
|
|
109
|
+
})()}`;
|
|
110
|
+
};
|
|
111
|
+
const getPropositions = (_n, { answer }) => {
|
|
112
|
+
const propositions = [];
|
|
113
|
+
["Oui", "Non", "On ne peut pas savoir"].forEach((str) => {
|
|
114
|
+
if (str === answer) {
|
|
115
|
+
addValidProp(propositions, str, "raw");
|
|
116
|
+
}
|
|
117
|
+
else {
|
|
118
|
+
tryToAddWrongProp(propositions, str, "raw");
|
|
119
|
+
}
|
|
120
|
+
});
|
|
121
|
+
return propositions;
|
|
122
|
+
};
|
|
123
|
+
const createRandomIdentifiers = () => {
|
|
124
|
+
const funcRand1 = () => randint(-3, 4, coinFlip() ? [0] : []).toTree();
|
|
125
|
+
const funcRand2 = () => randint(-6, 7, coinFlip() ? [0] : []).toTree();
|
|
126
|
+
const funcRand3 = () => randint(-9, 10, coinFlip() ? [0] : []).toTree();
|
|
127
|
+
function createRandomOrthogonalVector(vecSrc) {
|
|
128
|
+
const [nodeX, nodeY, nodeZ] = [vecSrc.x, vecSrc.y, vecSrc.z];
|
|
129
|
+
const nodeZero = (0).toTree();
|
|
130
|
+
const vec1 = new SpaceVector("v1", opposite(nodeY), nodeX, nodeZero);
|
|
131
|
+
const vec2 = new SpaceVector("v2", nodeZero, opposite(nodeZ), nodeY);
|
|
132
|
+
const vec3 = new SpaceVector("v3", opposite(nodeZ), nodeZero, nodeX);
|
|
133
|
+
const [factor1, factor2, factor3] = shuffle(random([
|
|
134
|
+
[coinFlip(), false, false],
|
|
135
|
+
[coinFlip(), coinFlip(), false],
|
|
136
|
+
])).map((isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree());
|
|
137
|
+
return vec1
|
|
138
|
+
.times(factor1)
|
|
139
|
+
.add(vec2.times(factor2))
|
|
140
|
+
.add(vec3.times(factor3));
|
|
141
|
+
}
|
|
142
|
+
const [vecR, vecS] = zip(["r", "s"], [
|
|
143
|
+
[funcRand1, funcRand2, funcRand3],
|
|
144
|
+
[funcRand3, funcRand2, funcRand1],
|
|
145
|
+
]).map(([name, [funcRandX, funcRandY, funcRandZ]]) => new SpaceVector(name, funcRandX(), funcRandY(), funcRandZ()));
|
|
146
|
+
const isOrthogonalVecs = coinFlip();
|
|
147
|
+
const [vecU, vecV] = (() => {
|
|
148
|
+
const [vecURaw, vecVRaw] = shuffle([vecR, vecS]);
|
|
149
|
+
const vecU = new SpaceVector("u", vecURaw.x, vecURaw.y, vecURaw.z);
|
|
150
|
+
if (isOrthogonalVecs) {
|
|
151
|
+
const vecV = (() => {
|
|
152
|
+
const vecRaw = createRandomOrthogonalVector(vecU);
|
|
153
|
+
return new SpaceVector("v", vecRaw.x, vecRaw.y, vecRaw.z);
|
|
154
|
+
})();
|
|
155
|
+
return [vecU, vecV];
|
|
156
|
+
}
|
|
157
|
+
else {
|
|
158
|
+
const nodeFactor = randint(-4, 5, [0]).toTree();
|
|
159
|
+
const vecVRawRescaled = vecVRaw.times(nodeFactor);
|
|
160
|
+
const vecV = new SpaceVector("v", vecVRawRescaled.x, vecVRawRescaled.y, vecVRawRescaled.z);
|
|
161
|
+
return [vecU, vecV];
|
|
162
|
+
}
|
|
163
|
+
})();
|
|
164
|
+
const [A, B] = ["A", "B"].map((name) => new SpacePoint(name, randint(-4, 5).toTree(), randint(-4, 5).toTree(), randint(-4, 5).toTree()));
|
|
165
|
+
const identifiers = {
|
|
166
|
+
spacePointIdsForAB: [A, B].map((spacePoint) => spacePoint.toIdentifiers()),
|
|
167
|
+
spacePointIdsForUV: [vecU, vecV].map((vec) => new SpacePoint(vec.name, vec.x, vec.y, vec.z).toIdentifiers()),
|
|
168
|
+
};
|
|
169
|
+
return identifiers;
|
|
170
|
+
};
|
|
171
|
+
const getCheckIsOrthogonalLinesFromParametricRepsQuestion = () => {
|
|
172
|
+
const identifiers = createRandomIdentifiers();
|
|
173
|
+
return getQuestionFromIdentifiers(identifiers);
|
|
174
|
+
};
|
|
175
|
+
const getQuestionFromIdentifiers = (identifiers, _opts) => {
|
|
176
|
+
const question = {
|
|
177
|
+
answer: getAnswer(identifiers),
|
|
178
|
+
instruction: getInstruction(identifiers),
|
|
179
|
+
answerFormat: "tex",
|
|
180
|
+
identifiers,
|
|
181
|
+
hint: getHint(identifiers),
|
|
182
|
+
correction: getCorrection(identifiers),
|
|
183
|
+
};
|
|
184
|
+
return question;
|
|
185
|
+
};
|
|
186
|
+
export const checkIsOrthogonalLinesFromParametricReps = {
|
|
187
|
+
id: "checkIsOrthogonalLinesFromParametricReps",
|
|
188
|
+
label: "Déterminer si deux droites dont on donne les représentations paramétriques sont orthogonales",
|
|
189
|
+
isSingleStep: true,
|
|
190
|
+
generator: (nb, opts) => getDistinctQuestions(() => getCheckIsOrthogonalLinesFromParametricRepsQuestion(opts), nb),
|
|
191
|
+
qcmTimer: 60,
|
|
192
|
+
freeTimer: 60,
|
|
193
|
+
getPropositions,
|
|
194
|
+
subject: "Mathématiques",
|
|
195
|
+
getQuestionFromIdentifiers,
|
|
196
|
+
getHint,
|
|
197
|
+
getCorrection,
|
|
198
|
+
hasHintAndCorrection: true,
|
|
199
|
+
answerType: "QCU",
|
|
200
|
+
};
|
package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalSpaceVecsFromCoords.d.ts
ADDED
|
@@ -0,0 +1,8 @@
|
|
|
1
|
+
import { Exercise } from "../../../../exercises/exercise.js";
|
|
2
|
+
import { SpacePointIdentifiers } from "../../../../math/geometry/spacePoint.js";
|
|
3
|
+
type Identifiers = {
|
|
4
|
+
spacePointIdsForVecs: SpacePointIdentifiers[];
|
|
5
|
+
};
|
|
6
|
+
export declare const checkIsOrthogonalSpaceVecsFromCoords: Exercise<Identifiers>;
|
|
7
|
+
export {};
|
|
8
|
+
//# sourceMappingURL=checkIsOrthogonalSpaceVecsFromCoords.d.ts.map
|
package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalSpaceVecsFromCoords.d.ts.map
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"checkIsOrthogonalSpaceVecsFromCoords.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalSpaceVecsFromCoords.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAErC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAY3C,KAAK,WAAW,GAAG;IACjB,oBAAoB,EAAE,qBAAqB,EAAE,CAAC;CAC/C,CAAC;AAmNF,eAAO,MAAM,oCAAoC,EAAE,QAAQ,CAAC,WAAW,CAkBtE,CAAC"}
|
package/lib/exercises/math/spaceGeometry/scalarProduct/checkIsOrthogonalSpaceVecsFromCoords.js
ADDED
|
@@ -0,0 +1,176 @@
|
|
|
1
|
+
import { addValidProp, tryToAddWrongProp, } from "../../../../exercises/exercise.js";
|
|
2
|
+
import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
|
|
3
|
+
import { SpacePoint, SpacePointConstructor, } from "../../../../math/geometry/spacePoint.js";
|
|
4
|
+
import { SpaceVector } from "../../../../math/geometry/spaceVector.js";
|
|
5
|
+
import { randint } from "../../../../math/utils/random/randint.js";
|
|
6
|
+
import { opposite } from "../../../../tree/nodes/functions/oppositeNode.js";
|
|
7
|
+
import { VariableNode } from "../../../../tree/nodes/variables/variableNode.js";
|
|
8
|
+
import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
|
|
9
|
+
import { coinFlip } from "../../../../utils/alea/coinFlip.js";
|
|
10
|
+
import { random } from "../../../../utils/alea/random.js";
|
|
11
|
+
import { shuffle } from "../../../../utils/alea/shuffle.js";
|
|
12
|
+
import { zip } from "../../../../utils/arrays/arrayZip.js";
|
|
13
|
+
import { alignTex } from "../../../../utils/latex/alignTex.js";
|
|
14
|
+
const getHydrated = (identifiers) => {
|
|
15
|
+
const { spacePointIdsForVecs } = identifiers;
|
|
16
|
+
const [vecU, vecV] = spacePointIdsForVecs.map((pointIds) => {
|
|
17
|
+
const spacePoint = SpacePointConstructor.fromIdentifiers(pointIds);
|
|
18
|
+
return new SpaceVector(spacePoint.name, spacePoint.x, spacePoint.y, spacePoint.z);
|
|
19
|
+
});
|
|
20
|
+
const nodeScalarProduct = vecU.scalarProduct(vecV);
|
|
21
|
+
return {
|
|
22
|
+
vecU,
|
|
23
|
+
vecV,
|
|
24
|
+
nodeScalarProduct,
|
|
25
|
+
};
|
|
26
|
+
};
|
|
27
|
+
const getInstruction = (identifiers) => {
|
|
28
|
+
const { vecU, vecV } = getHydrated(identifiers);
|
|
29
|
+
return `Soient deux vecteurs $\\overrightarrow{u}$ et $\\overrightarrow{v}$ tels que :
|
|
30
|
+
|
|
31
|
+
$$
|
|
32
|
+
\\overrightarrow{u} = ${vecU.toCoordsTex()}
|
|
33
|
+
$$
|
|
34
|
+
|
|
35
|
+
$$
|
|
36
|
+
\\overrightarrow{v} = ${vecV.toCoordsTex()}
|
|
37
|
+
$$
|
|
38
|
+
|
|
39
|
+
Les vecteurs $\\overrightarrow{u}$ et $\\overrightarrow{v}$ sont-ils orthogonaux ?`;
|
|
40
|
+
};
|
|
41
|
+
const getAnswer = (identifiers) => {
|
|
42
|
+
const { nodeScalarProduct } = getHydrated(identifiers);
|
|
43
|
+
const isOrthogonalVecs = NodeComparator.isEqualViaSub(nodeScalarProduct, (0).toTree());
|
|
44
|
+
return isOrthogonalVecs ? "Oui" : "Non";
|
|
45
|
+
};
|
|
46
|
+
const getHint = () => {
|
|
47
|
+
const vecU = new SpaceVector("u", new VariableNode("u_{x}"), new VariableNode("u_{y}"), new VariableNode("u_{z}"));
|
|
48
|
+
const vecV = new SpaceVector("v", new VariableNode("v_{x}"), new VariableNode("v_{y}"), new VariableNode("v_{z}"));
|
|
49
|
+
return `Soit $${vecU.toTex()}$ et $${vecV.toTex()}$ deux vecteurs tels que :
|
|
50
|
+
|
|
51
|
+
${alignTex([vecU, vecV].map((vec) => [vec.toTexWithCoords()]))}
|
|
52
|
+
|
|
53
|
+
Les vecteurs $${vecU.toTex()}$ et $${vecV.toTex()}$ sont orthogonaux si et seulement si :
|
|
54
|
+
|
|
55
|
+
${alignTex([
|
|
56
|
+
["", "\\overrightarrow{u} \\cdot \\overrightarrow{v}", "=", "0"],
|
|
57
|
+
["\\Leftrightarrow", vecU.scalarProduct(vecV).toTex(), "=", "0"],
|
|
58
|
+
])}
|
|
59
|
+
|
|
60
|
+
`;
|
|
61
|
+
};
|
|
62
|
+
const getCorrection = (identifiers) => {
|
|
63
|
+
const { nodeScalarProduct } = getHydrated(identifiers);
|
|
64
|
+
const isOrthogonalVecs = NodeComparator.isEqualViaSub(nodeScalarProduct, (0).toTree());
|
|
65
|
+
return `On calcule :
|
|
66
|
+
|
|
67
|
+
${alignTex([
|
|
68
|
+
[
|
|
69
|
+
"\\overrightarrow{u} \\cdot \\overrightarrow{v}",
|
|
70
|
+
"=",
|
|
71
|
+
nodeScalarProduct.toTex({
|
|
72
|
+
forceNoSimplification: true,
|
|
73
|
+
forceTimesSign: true,
|
|
74
|
+
}),
|
|
75
|
+
],
|
|
76
|
+
["", "=", nodeScalarProduct.simplify({ towardsDistribute: true }).toTex()],
|
|
77
|
+
!isOrthogonalVecs ? ["", "\\neq", "0"] : [],
|
|
78
|
+
])}
|
|
79
|
+
|
|
80
|
+
${(() => {
|
|
81
|
+
if (isOrthogonalVecs) {
|
|
82
|
+
return `Le produit scalaire est nul donc les deux vecteurs sont orthogonaux.`;
|
|
83
|
+
}
|
|
84
|
+
else {
|
|
85
|
+
return `Le produit scalaire n'est pas nul donc les deux vecteurs ne sont pas orthogonaux.`;
|
|
86
|
+
}
|
|
87
|
+
})()}`;
|
|
88
|
+
};
|
|
89
|
+
const getPropositions = (_n, { answer }) => {
|
|
90
|
+
const propositions = [];
|
|
91
|
+
["Oui", "Non", "On ne peut pas savoir"].forEach((str) => {
|
|
92
|
+
if (str === answer) {
|
|
93
|
+
addValidProp(propositions, str, "raw");
|
|
94
|
+
}
|
|
95
|
+
else {
|
|
96
|
+
tryToAddWrongProp(propositions, str, "raw");
|
|
97
|
+
}
|
|
98
|
+
});
|
|
99
|
+
return propositions;
|
|
100
|
+
};
|
|
101
|
+
const createRandomIdentifiers = () => {
|
|
102
|
+
const funcRand1 = () => randint(-3, 4, coinFlip() ? [0] : []).toTree();
|
|
103
|
+
const funcRand2 = () => randint(-6, 7, coinFlip() ? [0] : []).toTree();
|
|
104
|
+
const funcRand3 = () => randint(-9, 10, coinFlip() ? [0] : []).toTree();
|
|
105
|
+
function createRandomOrthogonalVector(vecSrc) {
|
|
106
|
+
const [nodeX, nodeY, nodeZ] = [vecSrc.x, vecSrc.y, vecSrc.z];
|
|
107
|
+
const nodeZero = (0).toTree();
|
|
108
|
+
const vec1 = new SpaceVector("v1", opposite(nodeY), nodeX, nodeZero);
|
|
109
|
+
const vec2 = new SpaceVector("v2", nodeZero, opposite(nodeZ), nodeY);
|
|
110
|
+
const vec3 = new SpaceVector("v3", opposite(nodeZ), nodeZero, nodeX);
|
|
111
|
+
const [factor1, factor2, factor3] = shuffle(random([
|
|
112
|
+
[coinFlip(), false, false],
|
|
113
|
+
[coinFlip(), coinFlip(), false],
|
|
114
|
+
])).map((isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree());
|
|
115
|
+
return vec1
|
|
116
|
+
.times(factor1)
|
|
117
|
+
.add(vec2.times(factor2))
|
|
118
|
+
.add(vec3.times(factor3));
|
|
119
|
+
}
|
|
120
|
+
const [vecR, vecS] = zip(["r", "s"], [
|
|
121
|
+
[funcRand1, funcRand2, funcRand3],
|
|
122
|
+
[funcRand3, funcRand2, funcRand1],
|
|
123
|
+
]).map(([name, [funcRandX, funcRandY, funcRandZ]]) => new SpaceVector(name, funcRandX(), funcRandY(), funcRandZ()));
|
|
124
|
+
const isOrthogonalVecs = coinFlip();
|
|
125
|
+
const [vecU, vecV] = (() => {
|
|
126
|
+
const [vecURaw, vecVRaw] = shuffle([vecR, vecS]);
|
|
127
|
+
const vecU = new SpaceVector("u", vecURaw.x, vecURaw.y, vecURaw.z);
|
|
128
|
+
if (isOrthogonalVecs) {
|
|
129
|
+
const vecV = (() => {
|
|
130
|
+
const vecRaw = createRandomOrthogonalVector(vecU);
|
|
131
|
+
return new SpaceVector("v", vecRaw.x, vecRaw.y, vecRaw.z);
|
|
132
|
+
})();
|
|
133
|
+
return [vecU, vecV];
|
|
134
|
+
}
|
|
135
|
+
else {
|
|
136
|
+
const nodeFactor = randint(-4, 5, [0]).toTree();
|
|
137
|
+
const vecVRawRescaled = vecVRaw.times(nodeFactor);
|
|
138
|
+
const vecV = new SpaceVector("v", vecVRawRescaled.x, vecVRawRescaled.y, vecVRawRescaled.z);
|
|
139
|
+
return [vecU, vecV];
|
|
140
|
+
}
|
|
141
|
+
})();
|
|
142
|
+
const identifiers = {
|
|
143
|
+
spacePointIdsForVecs: [vecU, vecV].map((vec) => new SpacePoint(vec.name, vec.x, vec.y, vec.z).toIdentifiers()),
|
|
144
|
+
};
|
|
145
|
+
return identifiers;
|
|
146
|
+
};
|
|
147
|
+
const getCheckIsOrthogonalSpaceVecsFromCoordsQuestion = () => {
|
|
148
|
+
const identifiers = createRandomIdentifiers();
|
|
149
|
+
return getQuestionFromIdentifiers(identifiers);
|
|
150
|
+
};
|
|
151
|
+
const getQuestionFromIdentifiers = (identifiers, _opts) => {
|
|
152
|
+
const question = {
|
|
153
|
+
answer: getAnswer(identifiers),
|
|
154
|
+
instruction: getInstruction(identifiers),
|
|
155
|
+
answerFormat: "tex",
|
|
156
|
+
identifiers,
|
|
157
|
+
hint: getHint(identifiers),
|
|
158
|
+
correction: getCorrection(identifiers),
|
|
159
|
+
};
|
|
160
|
+
return question;
|
|
161
|
+
};
|
|
162
|
+
export const checkIsOrthogonalSpaceVecsFromCoords = {
|
|
163
|
+
id: "checkIsOrthogonalSpaceVecsFromCoords",
|
|
164
|
+
label: "Déterminer si deux vecteurs de coordonnées données sont orthogonaux",
|
|
165
|
+
isSingleStep: true,
|
|
166
|
+
generator: (nb, opts) => getDistinctQuestions(() => getCheckIsOrthogonalSpaceVecsFromCoordsQuestion(opts), nb),
|
|
167
|
+
qcmTimer: 60,
|
|
168
|
+
freeTimer: 60,
|
|
169
|
+
getPropositions,
|
|
170
|
+
subject: "Mathématiques",
|
|
171
|
+
getQuestionFromIdentifiers,
|
|
172
|
+
getHint,
|
|
173
|
+
getCorrection,
|
|
174
|
+
hasHintAndCorrection: true,
|
|
175
|
+
answerType: "QCU",
|
|
176
|
+
};
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
import { Exercise } from "../../../../exercises/exercise.js";
|
|
2
|
+
import { SpacePointIdentifiers } from "../../../../math/geometry/spacePoint.js";
|
|
3
|
+
type Identifiers = {
|
|
4
|
+
spacePointIdsForVecW: SpacePointIdentifiers;
|
|
5
|
+
spacePointIdsForPlane: SpacePointIdentifiers[];
|
|
6
|
+
};
|
|
7
|
+
export declare const checkIsSpaceVecOrthogonalToPlaneFromCoords: Exercise<Identifiers>;
|
|
8
|
+
export {};
|
|
9
|
+
//# sourceMappingURL=checkIsSpaceVecOrthogonalToPlaneFromCoords.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"checkIsSpaceVecOrthogonalToPlaneFromCoords.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/spaceGeometry/scalarProduct/checkIsSpaceVecOrthogonalToPlaneFromCoords.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,6BAA6B,CAAC;AAErC,OAAO,EAGL,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAiC3C,KAAK,WAAW,GAAG;IACjB,oBAAoB,EAAE,qBAAqB,CAAC;IAC5C,qBAAqB,EAAE,qBAAqB,EAAE,CAAC;CAChD,CAAC;AA+UF,eAAO,MAAM,0CAA0C,EAAE,QAAQ,CAAC,WAAW,CAoB1E,CAAC"}
|