Problem with Simplifying Boolean Expression

In summary, The conversation is about proving the equation AB + BC'D' + A'BC + C'D = B + C'D. The conversation participants suggest using a Karnaugh map to help with the algebraic manipulations and provide a step-by-step explanation of the process. Eventually, it is determined that the equation can be simplified to B + C'D, and the participants express gratitude for the help.
  • #1
mr_coffee
1,629
1
Hello everyone I'm having problems proving this:
note: A' will stand for complemented;

AB + BC'D' + A'BC + C'D = B + C'D
B(A+C'D')
B(A+C'+D')
BA + BC' + BD' + A'BC + C'D
BA + BD' + A'BC + C'(B+D)
B(A + D' + A'C) + C'(B+D)
now I'm stuck, i don't see how that is going to work out. Any help would be great.
 
Engineering news on Phys.org
  • #2
It works on a Karnaugh map. Try mapping it out to help you with the algebra. Look for combinations on the map that you can use as tricks in the algebraic manipulations.
 
  • #3
OK this is going to be long but i but a lot off steps for explanation so you can skip some
steps

AB+BC'D'+A'BC+C'D
B(A+A'C)+BC'D'+C'D
B((A+A').(A+C))+BC'D'+C'D
B((1).(A+C))+BC'D'+C'D
AB+BC+BC'D'+C'D
B(C+C'D')+AB+C'D
B((C+C').(C+D'))+AB+C'D
BC+BD'+AB+C'D
BC.(D+D')+BD'+AB+C'D
BCD+BCD'+BD'+AB+C'D
BCD+BD'+AB+C'D
D(C'+BC)+BD'+AB
D((C'+C).(C'+B))+BD'+AB
D((1).(C'+B))+BD'+AB
CD'+BD+BD'+AB
C'D+B+AB
B(A+1)+C'D
B+C'D = RHS
 
  • #4
awesome, thanks for the help guys!
 
  • #5
Your welcome
 

Related to Problem with Simplifying Boolean Expression

1. What is boolean algebra?

Boolean algebra is a branch of mathematics and logic that deals with the manipulation of variables that can only have two possible values: true or false. It is used to solve problems in computer science, electronics, and other fields.

2. What are the basic operations in boolean algebra?

The basic operations in boolean algebra are AND, OR, and NOT. AND represents the logical conjunction, OR represents the logical disjunction, and NOT represents the logical negation.

3. How is boolean algebra used in computer programming?

Boolean algebra is used in computer programming to control the flow of a program by making decisions based on certain conditions. It is also used in logic gates to perform logical operations and in conditional statements to determine whether a certain block of code should be executed.

4. What are some common problems in boolean algebra?

Some common problems in boolean algebra include simplifying complex boolean expressions, converting between boolean and logical expressions, and finding the inverse of a boolean function.

5. How can one improve their understanding of boolean algebra?

To improve understanding of boolean algebra, one can practice solving problems and working with boolean expressions, read books or articles on the subject, and seek out online tutorials or courses. It can also be helpful to understand the connections between boolean algebra and other branches of mathematics, such as set theory and logic.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
1
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
11
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
5
Views
1K
  • Precalculus Mathematics Homework Help
Replies
12
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
6
Views
4K
  • Engineering and Comp Sci Homework Help
Replies
9
Views
4K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
2K
Back
Top