Simplify Product of Sums
$begingroup$
Similar question to:
Boolean Algebra - Product of Sums
I was given a truth table and asked to give the sums-of-products and the product-of-sums expressions.
I reduced the sums-of-products expression to this, which I believe is correct:
F(x,y,z) = xy + yz + xz
I have so far reduced my product-of-sums expression to this:
F(x,y,z) = (x+y+z)(x+y+z’)(x+y’+z)(x’+y+z)
but I can't figure out how to further reduce my product-of-sums, whilst still retaining the "product-of-sums" form and not converting back to "sums-of-products" form. If someone could show me how to further reduce the product-of-sums, I would be appreciative if you could explain which Boolean identity is being used at each stage of of the simplification (i.e. Distributive Law, DeMorgan's Law etc). Thanks!
logic boolean-algebra
$endgroup$
add a comment |
$begingroup$
Similar question to:
Boolean Algebra - Product of Sums
I was given a truth table and asked to give the sums-of-products and the product-of-sums expressions.
I reduced the sums-of-products expression to this, which I believe is correct:
F(x,y,z) = xy + yz + xz
I have so far reduced my product-of-sums expression to this:
F(x,y,z) = (x+y+z)(x+y+z’)(x+y’+z)(x’+y+z)
but I can't figure out how to further reduce my product-of-sums, whilst still retaining the "product-of-sums" form and not converting back to "sums-of-products" form. If someone could show me how to further reduce the product-of-sums, I would be appreciative if you could explain which Boolean identity is being used at each stage of of the simplification (i.e. Distributive Law, DeMorgan's Law etc). Thanks!
logic boolean-algebra
$endgroup$
$begingroup$
How about en.wikipedia.org/wiki/Karnaugh_map
$endgroup$
– evil999man
Apr 15 '14 at 5:46
$begingroup$
I preferably want to do this question without using K maps, as we haven't been taught them yet. I am expected to be able to achieve this without a K map I believe.
$endgroup$
– jdubbing
Apr 15 '14 at 6:41
$begingroup$
What I can think of is applying negation of negation and then de morgan in sop.
$endgroup$
– evil999man
Apr 15 '14 at 6:46
$begingroup$
Ok, so I did that. Can you confirm that, for the same truth table, if the sum-of-products is: F(x,y,z) = xy + yz + xz, then the product-of-sums would be: F(x,y,z) = (x+y)(y+z)(x+z) ? Thanks so far
$endgroup$
– jdubbing
Apr 15 '14 at 8:08
$begingroup$
Seems like it. You can always verify by a truth table. or a program.
$endgroup$
– evil999man
Apr 15 '14 at 9:05
add a comment |
$begingroup$
Similar question to:
Boolean Algebra - Product of Sums
I was given a truth table and asked to give the sums-of-products and the product-of-sums expressions.
I reduced the sums-of-products expression to this, which I believe is correct:
F(x,y,z) = xy + yz + xz
I have so far reduced my product-of-sums expression to this:
F(x,y,z) = (x+y+z)(x+y+z’)(x+y’+z)(x’+y+z)
but I can't figure out how to further reduce my product-of-sums, whilst still retaining the "product-of-sums" form and not converting back to "sums-of-products" form. If someone could show me how to further reduce the product-of-sums, I would be appreciative if you could explain which Boolean identity is being used at each stage of of the simplification (i.e. Distributive Law, DeMorgan's Law etc). Thanks!
logic boolean-algebra
$endgroup$
Similar question to:
Boolean Algebra - Product of Sums
I was given a truth table and asked to give the sums-of-products and the product-of-sums expressions.
I reduced the sums-of-products expression to this, which I believe is correct:
F(x,y,z) = xy + yz + xz
I have so far reduced my product-of-sums expression to this:
F(x,y,z) = (x+y+z)(x+y+z’)(x+y’+z)(x’+y+z)
but I can't figure out how to further reduce my product-of-sums, whilst still retaining the "product-of-sums" form and not converting back to "sums-of-products" form. If someone could show me how to further reduce the product-of-sums, I would be appreciative if you could explain which Boolean identity is being used at each stage of of the simplification (i.e. Distributive Law, DeMorgan's Law etc). Thanks!
logic boolean-algebra
logic boolean-algebra
edited Apr 13 '17 at 12:19
Community♦
1
1
asked Apr 15 '14 at 5:42
jdubbingjdubbing
112
112
$begingroup$
How about en.wikipedia.org/wiki/Karnaugh_map
$endgroup$
– evil999man
Apr 15 '14 at 5:46
$begingroup$
I preferably want to do this question without using K maps, as we haven't been taught them yet. I am expected to be able to achieve this without a K map I believe.
$endgroup$
– jdubbing
Apr 15 '14 at 6:41
$begingroup$
What I can think of is applying negation of negation and then de morgan in sop.
$endgroup$
– evil999man
Apr 15 '14 at 6:46
$begingroup$
Ok, so I did that. Can you confirm that, for the same truth table, if the sum-of-products is: F(x,y,z) = xy + yz + xz, then the product-of-sums would be: F(x,y,z) = (x+y)(y+z)(x+z) ? Thanks so far
$endgroup$
– jdubbing
Apr 15 '14 at 8:08
$begingroup$
Seems like it. You can always verify by a truth table. or a program.
$endgroup$
– evil999man
Apr 15 '14 at 9:05
add a comment |
$begingroup$
How about en.wikipedia.org/wiki/Karnaugh_map
$endgroup$
– evil999man
Apr 15 '14 at 5:46
$begingroup$
I preferably want to do this question without using K maps, as we haven't been taught them yet. I am expected to be able to achieve this without a K map I believe.
$endgroup$
– jdubbing
Apr 15 '14 at 6:41
$begingroup$
What I can think of is applying negation of negation and then de morgan in sop.
$endgroup$
– evil999man
Apr 15 '14 at 6:46
$begingroup$
Ok, so I did that. Can you confirm that, for the same truth table, if the sum-of-products is: F(x,y,z) = xy + yz + xz, then the product-of-sums would be: F(x,y,z) = (x+y)(y+z)(x+z) ? Thanks so far
$endgroup$
– jdubbing
Apr 15 '14 at 8:08
$begingroup$
Seems like it. You can always verify by a truth table. or a program.
$endgroup$
– evil999man
Apr 15 '14 at 9:05
$begingroup$
How about en.wikipedia.org/wiki/Karnaugh_map
$endgroup$
– evil999man
Apr 15 '14 at 5:46
$begingroup$
How about en.wikipedia.org/wiki/Karnaugh_map
$endgroup$
– evil999man
Apr 15 '14 at 5:46
$begingroup$
I preferably want to do this question without using K maps, as we haven't been taught them yet. I am expected to be able to achieve this without a K map I believe.
$endgroup$
– jdubbing
Apr 15 '14 at 6:41
$begingroup$
I preferably want to do this question without using K maps, as we haven't been taught them yet. I am expected to be able to achieve this without a K map I believe.
$endgroup$
– jdubbing
Apr 15 '14 at 6:41
$begingroup$
What I can think of is applying negation of negation and then de morgan in sop.
$endgroup$
– evil999man
Apr 15 '14 at 6:46
$begingroup$
What I can think of is applying negation of negation and then de morgan in sop.
$endgroup$
– evil999man
Apr 15 '14 at 6:46
$begingroup$
Ok, so I did that. Can you confirm that, for the same truth table, if the sum-of-products is: F(x,y,z) = xy + yz + xz, then the product-of-sums would be: F(x,y,z) = (x+y)(y+z)(x+z) ? Thanks so far
$endgroup$
– jdubbing
Apr 15 '14 at 8:08
$begingroup$
Ok, so I did that. Can you confirm that, for the same truth table, if the sum-of-products is: F(x,y,z) = xy + yz + xz, then the product-of-sums would be: F(x,y,z) = (x+y)(y+z)(x+z) ? Thanks so far
$endgroup$
– jdubbing
Apr 15 '14 at 8:08
$begingroup$
Seems like it. You can always verify by a truth table. or a program.
$endgroup$
– evil999man
Apr 15 '14 at 9:05
$begingroup$
Seems like it. You can always verify by a truth table. or a program.
$endgroup$
– evil999man
Apr 15 '14 at 9:05
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Note that $(x+y+z)(x+y+z')=x+y$ etc.
Enter twice the dummy term $(x+y+z)$ into $F(x,y,z)=(x+y+z)(x+y+z')(x+y'+z)(x'+y+z).$ Then $$F(x,y,z)=underbrace{(x+y+z)(x+y+z')}underbrace{color{blue}{(x+y+z)}(x+y'+z)}underbrace{color{blue}{(x+y+z)}(x'+y+z)}$$ so $$F(x,y,z)=(x+y)(x+z)(y+z).$$
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f754407%2fsimplify-product-of-sums%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Note that $(x+y+z)(x+y+z')=x+y$ etc.
Enter twice the dummy term $(x+y+z)$ into $F(x,y,z)=(x+y+z)(x+y+z')(x+y'+z)(x'+y+z).$ Then $$F(x,y,z)=underbrace{(x+y+z)(x+y+z')}underbrace{color{blue}{(x+y+z)}(x+y'+z)}underbrace{color{blue}{(x+y+z)}(x'+y+z)}$$ so $$F(x,y,z)=(x+y)(x+z)(y+z).$$
$endgroup$
add a comment |
$begingroup$
Note that $(x+y+z)(x+y+z')=x+y$ etc.
Enter twice the dummy term $(x+y+z)$ into $F(x,y,z)=(x+y+z)(x+y+z')(x+y'+z)(x'+y+z).$ Then $$F(x,y,z)=underbrace{(x+y+z)(x+y+z')}underbrace{color{blue}{(x+y+z)}(x+y'+z)}underbrace{color{blue}{(x+y+z)}(x'+y+z)}$$ so $$F(x,y,z)=(x+y)(x+z)(y+z).$$
$endgroup$
add a comment |
$begingroup$
Note that $(x+y+z)(x+y+z')=x+y$ etc.
Enter twice the dummy term $(x+y+z)$ into $F(x,y,z)=(x+y+z)(x+y+z')(x+y'+z)(x'+y+z).$ Then $$F(x,y,z)=underbrace{(x+y+z)(x+y+z')}underbrace{color{blue}{(x+y+z)}(x+y'+z)}underbrace{color{blue}{(x+y+z)}(x'+y+z)}$$ so $$F(x,y,z)=(x+y)(x+z)(y+z).$$
$endgroup$
Note that $(x+y+z)(x+y+z')=x+y$ etc.
Enter twice the dummy term $(x+y+z)$ into $F(x,y,z)=(x+y+z)(x+y+z')(x+y'+z)(x'+y+z).$ Then $$F(x,y,z)=underbrace{(x+y+z)(x+y+z')}underbrace{color{blue}{(x+y+z)}(x+y'+z)}underbrace{color{blue}{(x+y+z)}(x'+y+z)}$$ so $$F(x,y,z)=(x+y)(x+z)(y+z).$$
answered Jan 18 at 22:37
user376343user376343
3,9834829
3,9834829
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f754407%2fsimplify-product-of-sums%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
How about en.wikipedia.org/wiki/Karnaugh_map
$endgroup$
– evil999man
Apr 15 '14 at 5:46
$begingroup$
I preferably want to do this question without using K maps, as we haven't been taught them yet. I am expected to be able to achieve this without a K map I believe.
$endgroup$
– jdubbing
Apr 15 '14 at 6:41
$begingroup$
What I can think of is applying negation of negation and then de morgan in sop.
$endgroup$
– evil999man
Apr 15 '14 at 6:46
$begingroup$
Ok, so I did that. Can you confirm that, for the same truth table, if the sum-of-products is: F(x,y,z) = xy + yz + xz, then the product-of-sums would be: F(x,y,z) = (x+y)(y+z)(x+z) ? Thanks so far
$endgroup$
– jdubbing
Apr 15 '14 at 8:08
$begingroup$
Seems like it. You can always verify by a truth table. or a program.
$endgroup$
– evil999man
Apr 15 '14 at 9:05