|a| = b gives
a =b or a = -b
so,
|-x| = -10
gives
-x = -10 or -x = 10
x = 10, -10
now let us verify,
when x = 10, |-10| = +10 and it is not = -10
so, x= 10 is NOT a solution.
when x = -10, |-(-10)| = |10| = 10 and it is not = -10
so, x= -10 is NOT a solution.
hence, this equation does not have a solution.
If we know that |...| can never be negative, we can directly deduce that this equation does not have any solution.
Answer:
34,220
Step-by-step explanation:
Because order doesn't matter, but the numbers can't be repeated, we need to find the number of combinations where 3 individual numbers can be chosen out of 60 possible numbers using the binomial coefficient:
Thus, Elias can make 34,220 unique 3-number codes given 60 different numbers.
Answer:
13
Step-by-step explanation:
do u want me to elaborate on how I found it>
Answer:
H0: µd = 0 (claim)
H1: µd ≠ 0
This is a two-tail t-test for µd
Step-by-step explanation:
This is a paired (dependent) sample test, with its hypothesis is written as :
H0: µd = 0
H1: µd ≠ 0
From the equality sign used in the hypothesis declaration, a not equal to ≠ sign in the alternative hypothesis is used for a two tailed t test
The data isn't attached, however bce the test statistic cannot be obtained. However, the test statistic formular for a paired sample is given as :
T = dbar / (Sd/√n)
dbar = mean of the difference ; Sd = standard deviation of the difference.
