Answer:
both statements are fine
Step-by-step explanation:
To find the price of a product after decreasing it, they can be done in the two ways that the statement tells us,
First, calculate that% that was decreased and then subtract it from the original price or simply multiply that original price by the percentage in which the new price would remain.
For example:
let "x" be the original price
in the first case it would be:
0.2 * x and then subtract from x, i.e .:
x - 0.2 * x
in the second case it is:
1 - 0.2 = 0.8
that is, the new price would be 0.8 * x
Answer:
Step-by-step explanation:
Use the intercept method of graphing a straight line:
Let x = 0. We get y = 1. This is the y-intercept (0, 1).
Let y = 0. We get x = 6/11. This is the x-intercept (6/11, 0).
Plot both points and then draw a straight line through them.
Answer:
Sorry this is late and I think this is right.
They are both parallel, they have the same slope, and do <em>not </em>intersect. If you were to draw a slope out for it, you would find this to be true.
For example: Say the question called for you to explain why there aren't any solutions to these system of inequalities:
<em>y < - 1/2x -3</em>
<em>y > 1/2x + 2</em>
<em>y= -x/2 -3</em> and <em>y= -x/2 + 2 </em>have the same exact slope, are parallel, and never intersect. The first line is 5 units below the second line when x = 0. Because the lines are parallel, it is always below the second line. The solutions of y < - x/2 -3 are the points in the plane below the first line. The solutions of y > 1/2 + 2 are points above the second line.
I hope this helps you. Good luck on whatever you're working on and stay safe! Please let me know if this helped you or didn't.
Answer:
(i) A truth table shows how the truth or falsity of a compound statement depends on the truth or falsity of the simple statements from which it's constructed.
Since A ∧ B (the symbol ∧ means A and B) is true only when both A and B are true, its negation A NAND B is true as long as one of A or B is false.
Since A ∨ B (the symbol ∨ means A or B) is true when one of A or B is true, its negation A NOR B is only true when both A and B are false.
Below are the truth tables for NAND and NOR connectives.
(ii) To show that (A NAND B)∨(A NOR B) is equivalent to (A NAND B) we build the truth table.
Since the last column (A NAND B)∨(A NOR B) is equal to (A NAND B) it follows that the statements are equivalent.
(iii) To show that (A NAND B)∧(A NOR B) is equivalent to (A NOR B) we build the truth table.
Since the last column (A NAND B)∧(A NOR B) is equal to (A NOR B) it follows that the statements are equivalent.
