I was having trouble with the following problem in boolean algebra i.e.
A+A'B = A+B
I need to prove the above section. I mean its already reduced i can't reduce it further.
Closure: The boolean system is closed with respect to a binary operator if for every pair of boolean values it produces a boolean result. For example, logical AND is closed in the boolean system because it accepts only boolean operands and produces only boolean results.
The basic operations of Boolean algebra are as follows: Conjunction or AND operation. Disjunction or OR operation. Negation or Not operation.
According to associative law, we need to prove that x = y. Using these above equations, we can say that the relation between A, B, C and + operator doesn't change when multiplied by other variable like x, such as xy = yx = x = y.
A+A'B = A.1 + A'B = A.(1+B)+A'B = A.1+A.B+A'B = A + B.(A+A') = A + B.1 = A + B
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With