Boolean logic expansion issue (POS -> CPOS)

  • Thread starter Thread starter QuarkCharmer
  • Start date Start date
  • Tags Tags
    Expansion Logic
QuarkCharmer
Messages
1,049
Reaction score
3

Homework Statement


Convert f=(x'+y)(x+z)(y+z) from product of sums form, into the canonical product of sums.


Homework Equations


boolean logic, et al.


The Attempt at a Solution



This is boolean logic (so + is "or" and * is "and" etc..)

There has to be some stupidly simple thing I am overlooking here. I chose to break it down and work each Maxterm by itself.

So the first thing to expand is:
(x'+y)
and so:
(x'+y) = x' + y + zz' since zz' = 0 this is okay.

Now here is the part I am not following.

I know that x' + y + zz' = (x' + y + z)(x' + y + z')

but I don't know how this expansion is happening.
 
Physics news on Phys.org
This is just the distribution rule: ##A \cup (B \cap C) = (A \cup B) \cap (A \cup C)##.

PS. Learn the rules by heart, there aren't too many of them.
 
oh god your right.

Thanks.

I should have just wrote it out without all the + and * nonsense and I would have seen that.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top