Difference between revisions of "De Morgan's Law"
(Created page with "DeMorgan's laws are the laws of how a NOT gate affects AND and OR statements. They can be easily remembered by "break the line, change the sign". The following image is how to...") |
|||
| Line 2: | Line 2: | ||
[[File:capture3.jpg]] | [[File:capture3.jpg]] | ||
| + | |||
| + | ==The Process== | ||
| + | |||
| + | ===Step 1 - Reverse the sign=== | ||
| + | ===Step 2 - Negate each term=== | ||
| + | ===Step 3 - Negate the whole expression=== | ||
Revision as of 11:08, 10 March 2017
DeMorgan's laws are the laws of how a NOT gate affects AND and OR statements. They can be easily remembered by "break the line, change the sign". The following image is how to prove De Morgan's Law...
