Solving boolean expression using annihilation rule

Thread Starter

BeginnerLevel1

Joined Jan 28, 2020
1
Suppose I have a function described as: AB+(1+AB+CK+G) Can I asssume that the expression I have inside the brackets is equal to 1?
annihilation rule:0x=0,1+x=1

I need to reduce the function in order to have a minimum of logic gates.
 

WBahn

Joined Mar 31, 2012
26,156
If there any way for the expression in parens to be anything other than 1?

If you are only allowed to apply that rule to two operands, then do it incrementally.

Consider

1 + A + C
(1 + A) + C
1 + C
1
 
Top