Which graph shows the solution of the inequality −|x − 2| + 9 > 6?
1 answer:
answer is -1 < x < 5
-|x - 2|+ 9 > 6
Rearrange the terms
-|x - 2| > 6 - 9
-|x - 2| > - 3
then divide both sides of the inequality by the co- efficient of variable
|x - 2| < 3
convert the absolute inequality to standard inequality
-3 <x - 2 < 3
separate compound inequalities into system of inequality
{x - 2}> -3
{x - 2 < 3}
Rearrange variable to the left side of the equation
x > -3 + 2
calculate the sum or difference
x > -1
x -2 < 3
Rearrange variable to the left side of the equation
x < 3 + 2
calculate the sum or difference
x < 5
x > -1 and x < 5
Find intersection
-1 < x < 5
Equations and inequalities are both mathematical sentences formed by relating two expressions to each other. In an equation, the two expressions are deemed equal which is shown by the symbol =. Where as in an inequality, the two expressions are not necessarily equal which is indicated by the symbols: >, <, ≤ or ≥.
learn more about inequality equation here :https://brainly.in/question/15934172
SPJ9
You might be interested in
Answer:
The probability of Steve agreeing with the company’s claim is 0.50502.
Step-by-step explanation:
Let <em>X</em> denote the number of green candies.
The probability of green candies is, <em>p</em> = 0.20.
Steve buys 30 bags of 30 candies, randomly selects one candy from each, and counts the number of green candies.
So, <em>n</em> = 30 candies are randomly selected.
All the candies are independent of each other.
The random variable <em>X</em> follows a binomial distribution with parameter <em>n</em> = 30 and <em>p</em> = 0.20.
It is provided that if there are 5, 6, or 7 green candies, Steve will conclude that the company’s claim is correct.
Compute the probability of 5, 6 and 7 green candies as follows:
Then the probability of Steve agreeing with the company’s claim is:
P (Accepting the claim) = P (X = 5) + P (X = 6) + P (X = 7)
= 0.17228 + 0.17946 + 0.15328
= 0.50502
Thus, the probability of Steve agreeing with the company’s claim is 0.50502.
Answer:
min = a_1
for i:= 2 to n:
if < min then min =
return min
Step-by-step explanation:
We call the algorithm "minimum" and a list of natural numbers
So lets first set the minimum to
min = a_1
now we want to check all the other numbers.
We can use a simple for loop, to find the minimum
min = a_1
for i:= 2 to n:
if < min then min =
return min