Simplifying equations using boolean algebra

In summary: Ok how about thisa`b`d+a`bd` +bd`+ ab`c`d+b`cd`=a`+ab`d+bd`=b`d+bd`How does it look?a`b`d+a`bd` +bd`+ ab`c`d+b`cd`=a`+ab`d+bd`=b`d+bd`
  • #1
mrlupr
4
0
I need to simplify these boolean expressions.

Homework Statement



Problem A:
a`b`d+a`bd`+bc`d`+bcd`+ab`c`d+b`cd

Problem B:
a`b`cd+a`bd+abcd+a`b`d+acd+abd+ab`c`d

Problem C:
a`b`c`d`+a`b`cd`+a`bd+ab`c`d`+bd+ab`d`

Homework Equations



abc means a AND b AND c
a+b means a OR b
a` means NOT a

The Attempt at a Solution



I have been working on these for over 6 hours and I still have a mess. I look at the rules and try to apply them, but I know my answers are incorrect.
 
Last edited:
Physics news on Phys.org
  • #2
Welcome to PF!

Hi mrlupr! Welcome to PF! :smile:

Let's start with …
mrlupr said:
Problem A:
a`b`d+a`bd`+bc`d`+bcd`+ab`c`d+b`cd

The bc`d`+bcd`part is easy …

what is that? …

and how much further can you get?

Hint: try grouping together all the terms with b`d :wink:
 
  • #3
here is what I have so far.

bc`d`+bcd`
bbc`+cd`d`
bc`+c`d
c`+bd

how does it look?
 
  • #4
mrlupr said:
here is what I have so far.

bc`d`+bcd`
bbc`+cd`d`
bc`+c`d
c`+bd

how does it look?

sorry … I've no idea what you're doing :confused:
 
  • #5
Ok how about this

bc`d`+bcd`
bd`(c`+c)
bd`1

am I any closer?
 
  • #6
mrlupr said:
Ok how about this

bc`d`+bcd`
bd`(c`+c)
bd`1

am I any closer?

Yes, that's it!

But write it with = signs, and there's no need to write 1 …

bc`d`+bcd`
= bd`(c`+c)
= bd` :smile:

ok, now have a go at all the b`d terms :wink:
 
  • #7
Ok let's go

a`b`d+a`bd` +bd`+ ab`c`d+b`cd`
=a`11+bd`+ab`d
=a`+ab`d+bd`
=b`d+bd`

How does it look?
 
  • #8
mrlupr said:
a`b`d+a`bd` +bd`+ ab`c`d+b`cd`
=a`11+bd`+ab`d

again … no idea what you're doing :confused:
 

FAQ: Simplifying equations using boolean algebra

What is boolean algebra?

Boolean algebra is a mathematical system used for solving logical expressions and simplifying equations. It is based on two values, typically represented as true and false, and uses various logical operators such as AND, OR, and NOT to manipulate and simplify expressions.

Why is boolean algebra important?

Boolean algebra is important because it allows us to simplify complex logical expressions and equations into more manageable forms. This is particularly useful in computer science, where it is used to design and optimize digital circuits.

How do you simplify equations using boolean algebra?

To simplify equations using boolean algebra, you can apply various laws and theorems, such as the distributive law, identity law, and De Morgan's laws. You can also use truth tables and Karnaugh maps to visualize and simplify expressions.

What are the basic laws of boolean algebra?

The basic laws of boolean algebra include the commutative law, associative law, distributive law, identity law, complement law, and idempotent law. These laws govern how logical expressions can be manipulated and simplified.

What are some common applications of boolean algebra?

Boolean algebra has various applications in computer science, including digital circuit design, programming, and database queries. It is also used in mathematical logic, set theory, and probability theory.

Back
Top