|
Question 251072: Solve the given inequality. Graph the solution set on a number's line.
p+3<3 or p+1<1
Since 3 does not contain the variable to solve for, move it to the right-hand side of the inequality by subtracting 3 from both sides.
p<-3+3 and p+1<1
Add 3 to -3 to get 0.
p<0 and p+1<1
Since 1 does not contain the variable to solve for, move it to the right-hand side of the inequality by subtracting 1 from both sides.
p<0 and p<-1+1
Add 1 to -1 to get 0.
p<0 and p<0
The solution set of p<0 and p<0 is p<0. The solution set is the set of all numbers in between the inequalities, as they would appear on a number line. If the left side of the solution set is enclosed by a parentheses (, this means the number is exclusive and not included in the set. If the left side is enclosed by a bracket [, this means the number is inclusive and is included in the set. Using this convention, a < or > symbol will translate to parentheses (( or )) and a or will translate to brackets ([ or ]) in interval notation.
p<0
interval notation:
Answer by morganjd(5)   (Show Source):
You can put this solution on YOUR website! Since 3 does not contain the variable to solve for, move it to the right-hand side of the inequality by subtracting 3 from both sides.
p<-3+3 and p+1<1
Add 3 to -3 to get 0.
p<0 and p+1<1
Since 1 does not contain the variable to solve for, move it to the right-hand side of the inequality by subtracting 1 from both sides.
p<0 and p<-1+1
Add 1 to -1 to get 0.
p<0 and p<0
The solution set of p<0 and p<0 is p<0. The solution set is the set of all numbers in between the inequalities, as they would appear on a number line. If the left side of the solution set is enclosed by a parentheses (, this means the number is exclusive and not included in the set. If the left side is enclosed by a bracket [, this means the number is inclusive and is included in the set. Using this convention, a < or > symbol will translate to parentheses (( or )) and a or will translate to brackets ([ or ]) in interval notation.
p<0
interval notation:
|
|
|
| |
