1
$\begingroup$

I have a question to solve the following expression and get it in terms of product of sums

(AB' + A'B)C

And I tried taking the compliment of this

[(AB' + A'B)C]'

[(AB' + A'B)' + C']

[(AB')'.(A'B)' + C']

[(A' + B).(A + B') + C']

[(A' + B + C').(A + B' + C')]

Is this the correct method and is this the answer? I took the compliment because of the fact that Sum of products are 1's and Products of sums are 0's

enter image description here

$\endgroup$
  • $\begingroup$ Since you started by taking the complement your answer is not equivalent to the original expression, $\endgroup$ – coffeemath Jan 3 '16 at 12:50
  • $\begingroup$ Yes but the sum of products is 1 when product of sums is 0. So it doesn't need to be equal? $\endgroup$ – Blogger Jan 3 '16 at 12:53
  • $\begingroup$ Maybe make a truth table to compare the original with your final answer. I think your process works provided one initially replaces each literal by its complement, by a duality argument, but that's only a vague memory I had. $\endgroup$ – coffeemath Jan 3 '16 at 13:07
1
$\begingroup$

As @coffeemath noted, your answer is actually the complement of the original expression. So this method is not correct.

I think the easiest way is to use the identities $(x + y)' = x'y'$ and $(xy)' = x' + y'$ (known as De Morgan's laws) and $x'' = x$. We have $$AB' + A'B = ((AB')'(A'B)')' = ((A'+B)(A+B'))'=$$ $$=(A'A + A'B' + AB + BB')' = (AB + A'B')' = (AB)'(A'B')' = (A'+B')(A+B).$$ Hence the original expression equals $$ (AB'+A'B)C = (A'+B')(A+B)C.$$

Alternatively, if you're familiar with how to get a SOP or a POS from the truth table, then you can just construct the truth table for the function $f(A, B)$ realized by the expression $AB' + A'B$ and construct a POS directly from it. In our case the truth table looks like this: $$\begin{array}{|c|c|} \hline A & B & f(A, B) \\ \hline 0 & 0 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0 \\ \hline \end{array}$$

To construct the POS representation of $f(A, B)$ you should look at pairs $(a, b)$ with $f(a, b) = 0$. With every such pair you associate a sum $A^\sigma + B^\tau$, where $A^\sigma = A$ if $a = 0$ and $A^\sigma = A'$ if $a = 1$, and same for $B^\tau$. After that you just construct the product of all these sums. In our case we have two pairs $(0, 0)$ and $(1, 1)$. Corresponding sums are $A + B$ and $A' + B'$. Finally, we have the POS $(A'+B')(A+B)$.

$\endgroup$
  • $\begingroup$ I kinda understand :) But how to put 'C' into the $(A' + B')(A + B)$ as we need the product of sum of all three terms? $\endgroup$ – Blogger Jan 3 '16 at 22:08
  • $\begingroup$ @Blogger: To obtain POS from the original expression you transform only the part of it (namely, $AB' + A'B$) and $C$ stands as it is. Final expression has the form $(A'+B')(A+B)C$ which is a POS ($C$ is just a sum consisting of one summand). $\endgroup$ – Random Jack Jan 3 '16 at 22:10
  • $\begingroup$ 1. AB'C + A'BC 2. $\Pi$(2,5) 3. (A+B'+C)(A'+B+C) 4. (A'+B+C')(A+B'+C') These are the multiple choice answers for that $\endgroup$ – Blogger Jan 3 '16 at 22:14
  • 1
    $\begingroup$ It is a different task as I understand. You're supposed to find the POS-form for the complement of the original expression, since you're a given $Y'$ and the question is about $Y$. In that case your approach works and the answer you have got is right (4). $\endgroup$ – Random Jack Jan 3 '16 at 22:37
  • 1
    $\begingroup$ Yea it was my bad I didn't mention that important part. I thought because we are taking 1's as SoP and 0's as PoS it doesn't matter. But it does it seems. Thank you very much Jack for the knowledge \m/ $\endgroup$ – Blogger Jan 3 '16 at 22:44

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.