Boolean Logic Simplification: BC + A/B + /B/C - Explained Example

  • Thread starter Thread starter geft
  • Start date Start date
AI Thread Summary
The discussion centers on simplifying the Boolean expression /ABC + A/B/C + /A/B/C + A/BC + ABC. The user presents a step-by-step simplification process, ultimately arriving at /B/C + AC + BC, while the book provides a different but valid simplification: BC + A/B + /B/C. It is noted that Boolean simplification can yield multiple correct answers, depending on the approach taken. The use of Karnaugh Maps (K-maps) is recommended for verifying solutions, especially for expressions with a limited number of variables. Both the user's and the book's answers are considered correct, highlighting the flexibility in Boolean logic simplification.
geft
Messages
144
Reaction score
0
Simplify the following Boolean logic:
Code:
/ABC + A/B/C + /A/B/C + A/BC + ABC

Here's my working:
Code:
= BC(A + /A) + /B/C(A + /A) + A/BC
= BC + /B/C + A/BC
= /B/C + C(B + A/B)
= /B/C + C(A + B)
= /B/C + AC + BC

Here's the answer given in the book:
Code:
BC + A/B + /B/C

Is there anything wrong with my working? Can Boolean simplification have different answers?
 
Physics news on Phys.org
There are often several different "correct" simplifications for a boolean expression.

Have you ever seen or used a Karnaugh Map? You can easily pick out or verify a solution using K-maps. For systems with only a few variables (say 2 to four) the K-map is a great way to perform the simplification.

Your simplification would appear to be a correct solution, as is the book's.
 
Back
Top