Boolean OR one
If we have an expression like:
…then for any value of 1 (because at least one is 1, so OR must be true (1)).
We know that, because of the OR truth table:
1 OR 1 = 10 OR 1 = 1, so:A OR 1 = 1- (because
Amust represent either a1or a0)
In short:
We can use this to simplify boolean algebra!
We can replace anywhere we see
flashcards
| Question | Answer |
|---|---|
| What is | |
| Why does | Because ORing anything with 1 always gives 1, as per the truth table (1 OR 1 = 1, 0 OR 1 = 1). |
| How can the rule | It can be used to simplify boolean algebra by replacing any occurrence of |