Answer:
10
Step-by-step explanation:
arrange the number in order from smallest to largest, 4, 6, 6, 9, 11, 19, 23, 34. you then find the middle number, in this case there is no middle number, but 9 and 11 are the closest, so you add those to together to get 20, then divide by 2. this gives you ten
if you have any questions, leave them in the comments and i will try to answer them, if this helped pls give brainliest
Answer: The answer would be x < 10/7
Step-by-step explanation:
Rearrange:
Rearrange the equation by subtracting what is to the right of the greater than sign from both sides of the inequality :
7*x (10)>0
Step by step solution :
STEP
1
:
Pulling out like terms
1.1 Pull out like factors :
7x - 10 = -1 • (7x + 10)
Equation at the end of step
1
:
STEP 2
:
2.1 Multiply both sides by (-1)
Flip the inequality sign since you are multiplying by a negative number
7x+10 < 0
2.2 Divide both sides by 7
x+(10/7) < 0
Solve Basic Inequality :
2.3 Subtract 10/7 from both sides
x < 10/7
Inequality Plot :
2.4 Inequality plot for
7.000 x - 10.000 > 0
One solution was found :
x < 10/7
Answer:
5 gifts
Step-by-step explanation:
Given information:
- Cost of one gift = $4
- Total money = $50
- Money left after purchasing gifts = at least $28
Let x = greatest number of gifts James can buy
Create an inequality with the given information:
⇒ 50 - 4x ≥ 28
<u>Solve the inequality</u>
Add 4x to both sides:
⇒ 50 - 4x + 4x ≥ 28 + 4x
⇒ 50 ≥ 28 + 4x
Subtract 28 from both sides:
⇒ 50 - 28 ≥ 28 + 4x - 28
⇒ 22 ≥ 4x
Divide both sides by 4
⇒ 22 ÷ 4 ≥ 4x ÷ 4
⇒ 5.5 ≥ x
⇒ x ≤ 5.5
We must <u>round down</u> to 5 as if James buys 6 gifts, he will only have $26 remaining. Therefore, the greatest number of gifts James can buy is <u>5 gifts</u>.
They're called variables (this sounds like vary because the number that a letter could represent varies) so when i say 1 + x = 3 it is saying that they don't know the value of x yet but of course you can solve that by subtracting 1 from 3 which is 2
D(2)
C(6)
A(5)
B(4)
https://www.mathsisfun.com/definitions/coefficient.html
