Can XOR Gates Substitute OR Gates in Boolean Expressions?

  • Thread starter Thread starter jeffy
  • Start date Start date
  • Tags Tags
    Gate
AI Thread Summary
The discussion revolves around whether XOR gates can replace OR gates in the Boolean expression x(y+z)=f. The user attempts to manipulate the equation to show that y+z can be expressed as z XOR y XOR zy. A suggestion is made to create a truth table to verify the equivalence before attempting an algebraic proof. The importance of validating the relationship through truth tables is emphasized as a foundational step. This approach aids in understanding the logical equivalence between the expressions.
jeffy
Messages
16
Reaction score
0

Homework Statement



i have the equation x(y+z)=f some how it becomes x(z xor y xor zy)

Homework Equations





The Attempt at a Solution


xy+xz
xy(z+NOTz)+x(y+NOTy)z
x(yz+(y XOR z))


Thanks
 
Physics news on Phys.org
jeffy said:

Homework Statement



i have the equation x(y+z)=f some how it becomes x(z xor y xor zy)
You are wanting to show that y+z = z ⨂ y ⨂ zy ?

I suggest that you first draw up a truth table to demonstrate that it holds true, before trying to prove it algebraically.
 
Back
Top