Question

In: Computer Science

Use boolean algebra to prove that: (A^- *B*C^-) + (A^- *B*C) + (A* B^- *C) +...

Use boolean algebra to prove that:

(A^- *B*C^-) + (A^- *B*C) + (A* B^- *C) + (A*B* C^-) + (A*B*C)= (A+B)*(B+C)

A^- is same as "not A"

please show steps to getting the left side to equal the right side, use boolean algebra properties such as distributive, absorption,etc

Solutions

Expert Solution

(A^- *B*C^-) + (A^- *B*C) + (A* B^- *C) + (A*B* C^-) + (A*B*C)

let A^- = A'

A'BC' + A'BC + AB'C + ABC' + ABC =

= A'B(C'+C) + AB'C + AB(C+C')   since C+C' = 1.   Boolean Complement Rule

= A'B + AB'C + AB

= B(A'+A) + AB'C   since A'+A = 1   Boolean Complement Rule

= B + AB'C     using rule A+BC = (A+B) (A+C)

= (B+A)(B+B'C)      using rule A+BC = (A+B) (A+C)

= (B+A)(B+B')(B+C) since B+B' = 1   Boolean Complement Rule

= (B+A)(B+C)

= (A+B)(B+C)


Related Solutions

Assume B is a Boolean Algebra. Prove the following statement using only the axioms for a...
Assume B is a Boolean Algebra. Prove the following statement using only the axioms for a Boolean Algebra properties of a Boolean Algebra. Uniqueness of 0: There is only one element of B that is an identity for + please include all the steps.
3. Simplify the following expressions using the properties of boolean algebra : 3A)    S(A,B,C) = A'B'C...
3. Simplify the following expressions using the properties of boolean algebra : 3A)    S(A,B,C) = A'B'C + A'BC + AB'C + ABC 3B) F(A,B,C) = A'B'C' + A'B'C + AB'C' + AB'C + ABC' + ABC
1. Use Boolean algebra to simplify the following Boolean expressions to expressions containing a minimum number...
1. Use Boolean algebra to simplify the following Boolean expressions to expressions containing a minimum number of literals: (a) A’C’ + A’BC + B’C (b) (A + B + C)’(ABC)’ (c) ABC’ + AC (d) A’B’D + A’C’D + BD (e) (A’ + B)’(A’ + C’)’(AB’C)’ (f) (AE + A’B’)(C’D’ + CD) + (AC)’ 2. Obtain the truth table of the function F = (AB + C)(B + AC), express the function F in sum-of-minterms and product-of-maxterms forms, and express...
Digital Logic Design Lab Prove the following Boolean Algebra theorems and properties by constructing Logic Circuits...
Digital Logic Design Lab Prove the following Boolean Algebra theorems and properties by constructing Logic Circuits for each theorem/properties using our educational simulation software: Q1-a) The Distributive Property:     a + ( b . c ) = ( a + b ) . ( a + c ) Q1-b) The Distributive Property:     a . ( b + c ) = ( a . b ) + ( a . c )
computer organazation , Boolean algebra1. Show the Boolean algebra reduction to minimal form for each....
computer organazation , Boolean algebra1. Show the Boolean algebra reduction to minimal form for each. Show each step, and cite the rule number which allows it.a . (AB)’ (A’ + B) (B’ + B)b . A’(A+B) + (B + A)(A + B’)
(TCO 2) Which of the following operations is not an operation of Boolean algebra? $ |...
(TCO 2) Which of the following operations is not an operation of Boolean algebra? $ | & ~
LINEAR ALGEBRA Prove or disapprove (no counterexamples): Given that sets A = {u1....un} and B =...
LINEAR ALGEBRA Prove or disapprove (no counterexamples): Given that sets A = {u1....un} and B = {v1....vn} are subsets vectors of a vector space V. If the vectors in A and B, respectively, are independent and dim(Span(u1....un)) = dim(Span(v1....vn)) then Span(u1....un) = Span(v1....vn)
Find 3 definitions of e. Prove they are equivalent (transitivity: a=b, b=c, and a=c) prove the...
Find 3 definitions of e. Prove they are equivalent (transitivity: a=b, b=c, and a=c) prove the 3 defintions of e are equivalent.
Prove the transitive property of similarity: if A~B and B~C, then A~C.
Prove the transitive property of similarity: if A~B and B~C, then A~C.
Simplify the equation using Boolean algebra properties. F = xy + xy’z + x’yz
Simplify the equation using Boolean algebra properties. F = xy + xy’z + x’yz
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT