# Simplification of Boolean Expressions

1. Aug 16, 2013

### fazer2014

Hi guys - I am really new here and am taking a very very elementary course in Logic circuits/Boolean algebra. We have been given a couple of simplification questions and I was convinced I had used all the theorems correctly but two of us got two different answers and we can't find who has gone wrong. Thankyou so much for your time.

1. Simplify the following Boolean Expression:

X = ((AB)'C(A' + (B+C)')'

Where ' indicates NOT.

2. Relevant equations

De Morgan, very basic boolean operation rules.

3. The attempt at a solution

It's much much easier to read because both solutions (we can't decide which one is correct) have been typed up - so I AM going to post images. But please don't think it's out of laziness - I legitimately think it's much easier to read! We have been trying to figure out who is correct for hours (if either of us are correct at all).....

[Broken]

[Broken]

Last edited by a moderator: May 6, 2017
2. Aug 16, 2013

### CompuChip

One thing you could try is making the truth tables for both results.

3. Aug 16, 2013

### Staff: Mentor

Hi nicola_a, [Broken]

The two answers are not different.

AB + C + AC

= C + A(B+C)

For this,
if C=0, then this evaluates as true
if C=1, then (B+C) evaluates as true, so OR'ing with B is superfluous

= C + AC

Now,
if C=0, this evaluates as true
if C=1 ........

I leave you to justify dropping the AND'ing with C here.

Last edited by a moderator: May 6, 2017
4. Aug 16, 2013

### fazer2014

Thankyou CompuChip, I realised by drawing the truth table that they are they same!
And as I was drawing the truth table, you replied Nascent, so thank you too!
I didn't think of doing that - VERY new at this (only a few lectures in to the course).
Thank you so much :) It was driving me nuts!