NAND"" and ""NOR"" circuits are commonly used as a basis for flash memory chips. A NAND B is defined to be the negation of ""A a
nd B."" A NOR B is defined to be the negation of ""A or B."" (i) Write truth tables for NAND and NOR connectives. (ii) Show that (A NAND B) (A NOR B) is equivalent to (A NAND B). (iii) Show that (A NAND B) (A NOR B) is equivalent to (A NOR B).
1 answer:
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.
You might be interested in
Taking the square root of both sides gives two possible cases,
or
Recall that
If and
, we have
so in the equations above, we can write
Then in the first case,
(where is any integer)
and in the second,
Then the solutions that fall in the interval are