Proving the Distributive Property of XOR in Boolean Algebra

  • Thread starter Thread starter Tony11235
  • Start date Start date
AI Thread Summary
The discussion centers on proving the distributive property of XOR in Boolean algebra, specifically the equation x(y ⊕ z) = xy ⊕ xz. Participants suggest using a truth table to verify the equality and recommend expanding both expressions to show they are equivalent. De Morgan's laws are highlighted as essential for transforming the complement of a product into a sum of complements. One user expresses frustration over not completing the problem despite attempts and reflections. The conversation emphasizes the importance of sharing work for collaborative problem-solving.
Tony11235
Messages
254
Reaction score
0
With x \oplus y defined to be (here I'm using x' as the complement of x) xy'+x'y, prove x(y \oplus z) = xy \oplus xz

I'm stuck. Any hint or help would be great.
 
Physics news on Phys.org
Well, what have you done so far?

(I presume xy is the "and" operation, and x+y is the "or" operation?)
 
Would a truth table work?
 
You can just expand out both expressions and see they are the same. You will need to use de Morgan's laws to turn the complement of a product into a sum of complements, however. That is the only tricky part.
 
Have you done anything on this problem, or just sit and stared at it?
 
Hurkyl said:
Have you done anything on this problem, or just sit and stared at it?

I expanded the right side, thought deeply about it, tried a few other moves, but came up short and had to turn it in unfinished. Oh well, one low homework score won't kill me.
 
Well, if you had showed what you had done, maybe we could have pointed out the key step you were missing. Oh well. :frown:
 
Back
Top