Simplifying Boolean Algebra Equations with Distribution and DeMorgan's Law

In summary, the conversation is about using Boolean Algebra to simplify an expression. The participants discuss the use of the distributive and Demorgan properties and how to continue simplifying the expression. The final solution involves combining terms and recognizing that certain terms can be reduced to 1.
  • #1
ccky
15
0

Homework Statement


Untitled.jpg


Homework Equations



Boolean Algebra

The Attempt at a Solution


I use the distri to change the A+C'.D and Demorgan.
Should i use dis and Demorgan firstly like below?
02.jpg

Which property I should use in the next step?
If the first part is wrong,which property i should use first?
Sorry for the small pictures!
Thanks
 
Physics news on Phys.org
  • #2
Continue to use demorgan until you get down into the simplest form then apply algebra reduction rules.

So are you trying to prove:

(A + C'D)' + A + (CD + AB)' = 1

Just want to make sure we understand the problem as the bar above terms in your images looks like it might include the A term.
 
Last edited:
  • #3
jedishrfu said:
Continue to use demorgan until you get down into the simplest form then apply algebra reduction rules.

So are you trying to prove:

(A + C'D)' + A + (CD + AB)' = 1

Just want to make sure we understand the problem as the bar above terms in your images looks like it might include the A term.

Sorry for the vague picture.The bar not include in the A term.
Should i use the Demorgan in the whole question firstly including the A.
As the picture shows,then,i continue to use Distributive or Absorption,but failed.
 
  • #4
ccky said:
Sorry for the vague picture.The bar not include in the A term.
Should i use the Demorgan in the whole question firstly including the A.
As the picture shows,then,i continue to use Distributive or Absorption,but failed.

SHow your work and we can help you along the way.

In your final expression do you have any terms like this?

X + X' + ... =?= 1
 
  • #5
jedishrfu said:
SHow your work and we can help you along the way.

In your final expression do you have any terms like this?

X + X' + ... =?= 1

I continue to calculate following the picture show on the The attempt at a solution

First:
A'(C+D')+(A+C'+D')(A+A'+B') Use distributive
A'(C+D')+(A+C'+D')(1+B')
But i was wondering whether i can change to 1+B' to 1,because the list only show that 1+A=1

Second:
A'(C+D')+A+A'C'+B'C'+A'D'+B'D'
A'(C+D')+A+A'(C'+D')+B'(C'+D')
 
  • #6
It seems you are almost there. The last expression

A'(C+D')+A+A'(C'+D')+B'(C'+D')

can be expanded into

A'C + A'D' + A + A'C' + A'D' + B'C' + B'D'

and then combine some terms to get:

A'(C + C') + A + A'D' + B'C' + B' D'

Do you see how to finish it?

HINT: remember that X' + X = 1 and that 1+ANYTHING = 1 in boolean algebra
 
  • #7
jedishrfu said:
it seems you are almost there. The last expression

a'(c+d')+a+a'(c'+d')+b'(c'+d')

can be expanded into

a'c + a'd' + a + a'c' + a'd' + b'c' + b'd'

and then combine some terms to get:

A'(c + c') + a + a'd' + b'c' + b' d'

do you see how to finish it?

Hint: Remember that x' + x = 1 and that 1+anything = 1 in boolean algebra

a'+ a + a'd' + b'c' + b' d'
1+a'd' + b'c' + b' d'
1
 
  • #8
ccky said:
a'+ a + a'd' + b'c' + b' d'
1+a'd' + b'c' + b' d'
1

Thats great!

It floored me too when I got to the second to last step and thought how am I going to reduce that and then I saw the A + A' terms
and realized the other terms just didn't matter.
 
  • Like
Likes 1 person
  • #9
jedishrfu said:
Thats great!

It floored me too when I got to the second to last step and thought how am I going to reduce that and then I saw the A + A' terms
and realized the other terms just didn't matter.


Thanks you!
 

What is Boolean algebra?

Boolean algebra is a mathematical system used to represent and manipulate logical expressions. It is based on the binary values of 0 and 1, where 0 represents false and 1 represents true.

What is distribution in Boolean algebra?

Distribution in Boolean algebra refers to the property that allows us to distribute an operation over a set of parentheses. In other words, it allows us to simplify an expression by multiplying all terms inside the parentheses by a common factor.

What is DeMorgan's Law in Boolean algebra?

DeMorgan's Law is a set of rules that allow us to simplify Boolean expressions by converting them into their complement form. It involves negating both the terms and the operation in an expression.

How do you use distribution and DeMorgan's Law to simplify Boolean algebra equations?

To simplify a Boolean algebra equation using distribution, we use the distributive property to multiply the common factor to all terms within the parentheses. To simplify using DeMorgan's Law, we apply the rule of negation to both the terms and the operation in the expression.

What are some common mistakes when simplifying Boolean algebra equations with distribution and DeMorgan's Law?

One common mistake is forgetting to distribute the common factor to all terms within the parentheses when using distribution. Another mistake is incorrectly applying the rule of negation when using DeMorgan's Law, such as negating a term or operation that should not be negated.

Similar threads

  • Engineering and Comp Sci Homework Help
Replies
4
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
5
Views
5K
  • Engineering and Comp Sci Homework Help
Replies
5
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
9
Views
4K
  • Engineering and Comp Sci Homework Help
Replies
11
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
4
Views
7K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
15
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
4
Views
6K
Back
Top