Solving Boolean Algebra: a'b'c' + abc = 1?

In summary, the conversation discusses the use of boolean algebra, specifically whether the equation a'b'c' + abc = 1 is always true or not. One person suggests using (abc)' + abc = 1 to prove the statement, while another explains that there are only 2 possible values for abc (0 and 1) and that the statement is only true when a, b, and c are all the same value. It is recommended to construct a truth table to confirm this.
  • #1
killerfish
16
0
Hi guys,

I'm new to boolean algebra, i couldn't get this through...

a'b'c' + abc = 1 ? or i have to use (abc)' + abc = 1 to get 1 ?

Thanks you.
 
Physics news on Phys.org
  • #2
(abc)' + abc = 1. There are only 2 possible values for abc, and they are 0 and 1. So it is very obvious that if abc isn't 1, then (abc)' is, and vice versa. So 1 or 0 = 1, 0 or 1 = 1. To prove that a'b'c' + abc = 1 isn't always necessarily true, you can construct a truth table with a b c a' b' c' and your answer. You will find that statement is only true when a,b,c are all the same value.
 
  • #3


Hello there,

Boolean algebra is a type of algebra that deals with logical expressions using the values of true and false, represented by 1 and 0 respectively. In order to solve this expression, we need to understand the basic rules of boolean algebra.

Firstly, the expression a'b'c' + abc can be simplified using the distributive law, which states that a(b+c) = ab + ac. In this case, we can distribute the a' over the two terms in the parentheses, giving us a'b'c' + a'bc. Similarly, we can distribute the b' over the two terms in the parentheses, giving us a'b'c' + a'b'c. Finally, we can distribute the c' over the two terms in the parentheses, giving us a'b'c' + a'b'c + a'bc.

Now, we can see that there are two terms that are the same (a'b'c'), and according to the associative law, we can rearrange the terms without changing the value. Therefore, we can rewrite the expression as a'b'c' + a'b'c + a'bc = a'b'c + a'bc.

Next, we can use the identity law, which states that a + 0 = a, to simplify the expression further. In this case, we can add a'b'c to the expression, giving us a'b'c + a'b'c + a'bc = a'b'c + a'b'c + a'bc + a'b'c. Now, we can see that there are three terms that are the same (a'b'c), and we can use the distributive law again to rewrite the expression as a'b'c + a'bc + a'b'c = a'b'c + a'bc.

Finally, we can use the complement law, which states that a + a' = 1, to simplify the expression even further. In this case, we can use the complement of a'b'c, which is abc, giving us a'b'c + a'bc = abc + a'bc.

Now, we have only two terms left, and we can use the distributive law one more time to combine them into one term, giving us abc + a'bc = (a+a')bc = 1bc = bc.

Therefore, the simplified expression is bc = 1, or
 

1. How do you solve a Boolean algebra equation?

To solve a Boolean algebra equation, you need to follow a set of rules and operations that are specific to Boolean algebra. These include the commutative, associative, and distributive properties, as well as the laws of Boolean algebra such as De Morgan's laws. You also need to use truth tables and logic gates to simplify the equation.

2. What is the purpose of solving a Boolean algebra equation?

The purpose of solving a Boolean algebra equation is to simplify and manipulate logical expressions to make them easier to understand and use in digital logic circuits. Boolean algebra is also used in programming and computer science to represent and manipulate binary data.

3. How do you determine the solution to a Boolean algebra equation?

To determine the solution to a Boolean algebra equation, you need to use the rules and operations of Boolean algebra to simplify the expression. This involves breaking down the equation into smaller parts, applying the appropriate laws, and then combining the simplified expressions to get the final solution.

4. Can you solve a Boolean algebra equation without using truth tables or logic gates?

Yes, it is possible to solve a Boolean algebra equation without using truth tables or logic gates. However, these tools can be very helpful in simplifying and understanding complex equations. In some cases, it may be easier and more efficient to use truth tables and logic gates to solve a Boolean algebra equation.

5. What are some common mistakes when solving a Boolean algebra equation?

One common mistake when solving a Boolean algebra equation is forgetting to use the correct order of operations, which can lead to incorrect solutions. Another mistake is not applying the laws of Boolean algebra correctly or overlooking certain steps in the simplification process. It is also important to be mindful of the laws and properties that apply to the specific equation being solved.

Similar threads

  • Engineering and Comp Sci Homework Help
Replies
5
Views
1K
  • 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
2
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
6
Views
4K
  • Engineering and Comp Sci Homework Help
Replies
4
Views
2K
  • 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
4
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
1K
Back
Top