Is it possible to simplify the boolean expression $A'.B + A.B'$?

Question

I know it's just an easy question but I can't get it at all.

A'.B + A.B'

Is it possible to simplify this expression?

Actually, I got this expression from this

A'.B.C+A.B'.C+A.B.C'+A.B.C = F
C(A'.B+A.B') + A.B(C'+C) = F
C(A'.B+A.B') + A.B = F

Now, I'm stuck at here.

The first expression is simply the XOR function. The second may be rewritten $AB+CA+BC$. — Parcly Taxel, Aug 10 '22 at 17:01
Hi Parcly, Thank you! I have just edited my question to understand it clearly. — Python learner, Aug 10 '22 at 17:08

score 1 · Answer 1 · answered Aug 11 '22 at 04:53

Finally, I figured it out. I would like to share the answer here for those wondering.

A'.B.C + A.B'.C + A.B.C' + A.B.C
A'.B.C + A.B'.C + A.B(C' + C)
A'.B.C + A.B'.C + A.B
A'.B.C + A(B'.C + B)
A'.B.C + A(B + C) [Distributive law]
A'.B.C + A.B + A.C
B(A'.C + A) + A.C
B(A + C) + A.C

A.B + B.C + A.C = F //

Is it possible to simplify the boolean expression $A'.B + A.B'$?

1 Answers1