2
$\begingroup$

I've simplified this Boolean formula quite a bit. Can it get any simpler? My definition of simple in this case is using the least amount of operators (and, or)

Title is "A or (negative A and negative B) or (B and C)"

$\endgroup$
2
  • 1
    $\begingroup$ I have always found drawing Venn diagrams surprisingly effective for thinking about such expressions. $\endgroup$
    – Mark Bennet
    Commented Sep 27, 2011 at 21:09
  • $\begingroup$ Karnaugh maps may be good approach to the such problems $\endgroup$
    – Pedja
    Commented Sep 30, 2011 at 7:00

2 Answers 2

Reset to default
7
$\begingroup$

$A+\overline{A}\,\overline{B} = (A+\overline{A})(A+\overline{B}) = (A+\overline{B})$. So you can simplify $A+\overline{A}\,\overline{B} + \overline{B}\,\overline{C}$ to $A+\overline{B} + BC$.

Likewise, $\overline{B}+BC = (\overline{B}+B)(\overline{B}+C) = \overline{B}+C$. So the entire thing is equivalent to $A+\overline{B}+C$.

$\endgroup$
5
$\begingroup$

If you make Karnaugh map for this expression you will get map as it is shown on the picture bellow.Now you have to find maximal possible groups of ones and you will get minimized disjunctive form of the formula.

enter image description here

So, minimized formula is: $ A\lor \neg B\lor C$

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .