boolean algebra

Depending on the choice of choice for a logic circuit, 4-bit input (N), connected, given three is doing one of the operations. a) F = 4N + X b) F = MOD (N, X) c) F = ABS (2N - 3X + 5) * MOD is modulo operation. ** ABS is absolute value operation. *** The value of X is accepted as 2 if the son of...

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.

This is a question that I'm supposed to complete. But I'm not sure if I'm on the right track. Can someone tell me if this is the right approach? I've been struggling with this module, and would appreciate some tips on going in the right direction. Here's my answer, which I'm quite certain is...