Simplification of: AB + A'C + BC in boolean algebra
$begingroup$
I am trying to understand the simplification of the boolean expression:
AB + A'C + BC
I know it simplifies to
A'C + BC
And I understand why, but I cannot figure out how to perform the simplification through the expression using the boolean algebra identities. I was wondering if someone could show me the steps needed to do this. Thank you in advance.
boolean-algebra
$endgroup$
add a comment |
$begingroup$
I am trying to understand the simplification of the boolean expression:
AB + A'C + BC
I know it simplifies to
A'C + BC
And I understand why, but I cannot figure out how to perform the simplification through the expression using the boolean algebra identities. I was wondering if someone could show me the steps needed to do this. Thank you in advance.
boolean-algebra
$endgroup$
$begingroup$
If you get stuck in the future, try Karnaugh maps. They can help to simplify complicated boolean expressions.
$endgroup$
– Cameron Williams
Sep 5 '16 at 19:04
$begingroup$
Thank you for the suggestion and I know how to use them I just still don't know how to come to the answer with equation simplification.
$endgroup$
– M. S.
Sep 5 '16 at 22:12
add a comment |
$begingroup$
I am trying to understand the simplification of the boolean expression:
AB + A'C + BC
I know it simplifies to
A'C + BC
And I understand why, but I cannot figure out how to perform the simplification through the expression using the boolean algebra identities. I was wondering if someone could show me the steps needed to do this. Thank you in advance.
boolean-algebra
$endgroup$
I am trying to understand the simplification of the boolean expression:
AB + A'C + BC
I know it simplifies to
A'C + BC
And I understand why, but I cannot figure out how to perform the simplification through the expression using the boolean algebra identities. I was wondering if someone could show me the steps needed to do this. Thank you in advance.
boolean-algebra
boolean-algebra
asked Sep 5 '16 at 18:39
M. S.M. S.
1112
1112
$begingroup$
If you get stuck in the future, try Karnaugh maps. They can help to simplify complicated boolean expressions.
$endgroup$
– Cameron Williams
Sep 5 '16 at 19:04
$begingroup$
Thank you for the suggestion and I know how to use them I just still don't know how to come to the answer with equation simplification.
$endgroup$
– M. S.
Sep 5 '16 at 22:12
add a comment |
$begingroup$
If you get stuck in the future, try Karnaugh maps. They can help to simplify complicated boolean expressions.
$endgroup$
– Cameron Williams
Sep 5 '16 at 19:04
$begingroup$
Thank you for the suggestion and I know how to use them I just still don't know how to come to the answer with equation simplification.
$endgroup$
– M. S.
Sep 5 '16 at 22:12
$begingroup$
If you get stuck in the future, try Karnaugh maps. They can help to simplify complicated boolean expressions.
$endgroup$
– Cameron Williams
Sep 5 '16 at 19:04
$begingroup$
If you get stuck in the future, try Karnaugh maps. They can help to simplify complicated boolean expressions.
$endgroup$
– Cameron Williams
Sep 5 '16 at 19:04
$begingroup$
Thank you for the suggestion and I know how to use them I just still don't know how to come to the answer with equation simplification.
$endgroup$
– M. S.
Sep 5 '16 at 22:12
$begingroup$
Thank you for the suggestion and I know how to use them I just still don't know how to come to the answer with equation simplification.
$endgroup$
– M. S.
Sep 5 '16 at 22:12
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
The two expressions are not equal. The first expression is true when A and B is true and C false but the second is false in this case.
$endgroup$
$begingroup$
I might be mistaken but I believe that both equations return true in that instance. Because if A is true and C is false then A'C is true. Meaning the whole second equation is true because it is an OR.
$endgroup$
– M. S.
Sep 5 '16 at 22:05
$begingroup$
just for clarification because my notation isn't that common the two equations are (AB) + (A*(¬C)) + (BC) and the other one is (A*(¬C)) + (B*C)
$endgroup$
– M. S.
Sep 5 '16 at 22:08
$begingroup$
Okay, yes then I understand. I thought you had negation on the variable to the left of your prime character. One way to arrive at the simplified expression is: $AB+A(neg C)+BC=AB(C+(neg C))+A(neg C)(B+(neg B))+BC(A+(neg A))=ABC+AB(neg C)+AB(neg C)+A(neg B)(neg C)+ABC+(neg A)BC=ABC+AB(neg C)+A(neg B)(neg C)+(neg A)BC=BC(A+(neg A))+A(neg C)(B+(neg B))=BC+A(neg C)$
$endgroup$
– laissez_faire
Sep 6 '16 at 19:15
$begingroup$
I know this is late, but thank you very much!
$endgroup$
– M. S.
Nov 15 '16 at 2:59
add a comment |
$begingroup$
begin{align*}
&mathrel{phantom{=}}AB+A'C+BC\
&=AB+A'C+BC(A+A') quad text{($A+A'=1$, Complementarity law)}\
&=AB+A'C+ABC+A'BC\
&=AB+ABC+A'C+ABC quad text{(Associative law)}\
&=AB+A'C quad text{(Absorption law)}
end{align*}
$endgroup$
add a comment |
$begingroup$
In this way , this can be simplified
LHS = AB+A'C+BC
= AB+A'C+BC (A+A') [ A+A'=1 ]
= AB+A'C+ABC+A'BC
= AB+ABC+A'C+A'BC
= AB (1+C)+A'C (1+B)
= AB+A'C [ 1+C=1 ]
=RHS..
$endgroup$
$begingroup$
Please use Math Jax in order to produce beautiful and beautifully formatted mathematical texts.
$endgroup$
– Daniele Tampieri
Jan 22 at 21:28
add a comment |
$begingroup$
a.b+a'.c+b.c
a.b+a'.c+b.c(a+a') {Complementary Law}
a.b+a'.c+(a.b.c+a'.b.c)
(a.b+a.b.c)+(a'.c+a'.c.b)
a.b(1+c)+a'.c(1+b) {As 1+c=1 and 1+b=1}
a.b+a'.c
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f1915698%2fsimplification-of-ab-ac-bc-in-boolean-algebra%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The two expressions are not equal. The first expression is true when A and B is true and C false but the second is false in this case.
$endgroup$
$begingroup$
I might be mistaken but I believe that both equations return true in that instance. Because if A is true and C is false then A'C is true. Meaning the whole second equation is true because it is an OR.
$endgroup$
– M. S.
Sep 5 '16 at 22:05
$begingroup$
just for clarification because my notation isn't that common the two equations are (AB) + (A*(¬C)) + (BC) and the other one is (A*(¬C)) + (B*C)
$endgroup$
– M. S.
Sep 5 '16 at 22:08
$begingroup$
Okay, yes then I understand. I thought you had negation on the variable to the left of your prime character. One way to arrive at the simplified expression is: $AB+A(neg C)+BC=AB(C+(neg C))+A(neg C)(B+(neg B))+BC(A+(neg A))=ABC+AB(neg C)+AB(neg C)+A(neg B)(neg C)+ABC+(neg A)BC=ABC+AB(neg C)+A(neg B)(neg C)+(neg A)BC=BC(A+(neg A))+A(neg C)(B+(neg B))=BC+A(neg C)$
$endgroup$
– laissez_faire
Sep 6 '16 at 19:15
$begingroup$
I know this is late, but thank you very much!
$endgroup$
– M. S.
Nov 15 '16 at 2:59
add a comment |
$begingroup$
The two expressions are not equal. The first expression is true when A and B is true and C false but the second is false in this case.
$endgroup$
$begingroup$
I might be mistaken but I believe that both equations return true in that instance. Because if A is true and C is false then A'C is true. Meaning the whole second equation is true because it is an OR.
$endgroup$
– M. S.
Sep 5 '16 at 22:05
$begingroup$
just for clarification because my notation isn't that common the two equations are (AB) + (A*(¬C)) + (BC) and the other one is (A*(¬C)) + (B*C)
$endgroup$
– M. S.
Sep 5 '16 at 22:08
$begingroup$
Okay, yes then I understand. I thought you had negation on the variable to the left of your prime character. One way to arrive at the simplified expression is: $AB+A(neg C)+BC=AB(C+(neg C))+A(neg C)(B+(neg B))+BC(A+(neg A))=ABC+AB(neg C)+AB(neg C)+A(neg B)(neg C)+ABC+(neg A)BC=ABC+AB(neg C)+A(neg B)(neg C)+(neg A)BC=BC(A+(neg A))+A(neg C)(B+(neg B))=BC+A(neg C)$
$endgroup$
– laissez_faire
Sep 6 '16 at 19:15
$begingroup$
I know this is late, but thank you very much!
$endgroup$
– M. S.
Nov 15 '16 at 2:59
add a comment |
$begingroup$
The two expressions are not equal. The first expression is true when A and B is true and C false but the second is false in this case.
$endgroup$
The two expressions are not equal. The first expression is true when A and B is true and C false but the second is false in this case.
answered Sep 5 '16 at 19:02
laissez_fairelaissez_faire
384
384
$begingroup$
I might be mistaken but I believe that both equations return true in that instance. Because if A is true and C is false then A'C is true. Meaning the whole second equation is true because it is an OR.
$endgroup$
– M. S.
Sep 5 '16 at 22:05
$begingroup$
just for clarification because my notation isn't that common the two equations are (AB) + (A*(¬C)) + (BC) and the other one is (A*(¬C)) + (B*C)
$endgroup$
– M. S.
Sep 5 '16 at 22:08
$begingroup$
Okay, yes then I understand. I thought you had negation on the variable to the left of your prime character. One way to arrive at the simplified expression is: $AB+A(neg C)+BC=AB(C+(neg C))+A(neg C)(B+(neg B))+BC(A+(neg A))=ABC+AB(neg C)+AB(neg C)+A(neg B)(neg C)+ABC+(neg A)BC=ABC+AB(neg C)+A(neg B)(neg C)+(neg A)BC=BC(A+(neg A))+A(neg C)(B+(neg B))=BC+A(neg C)$
$endgroup$
– laissez_faire
Sep 6 '16 at 19:15
$begingroup$
I know this is late, but thank you very much!
$endgroup$
– M. S.
Nov 15 '16 at 2:59
add a comment |
$begingroup$
I might be mistaken but I believe that both equations return true in that instance. Because if A is true and C is false then A'C is true. Meaning the whole second equation is true because it is an OR.
$endgroup$
– M. S.
Sep 5 '16 at 22:05
$begingroup$
just for clarification because my notation isn't that common the two equations are (AB) + (A*(¬C)) + (BC) and the other one is (A*(¬C)) + (B*C)
$endgroup$
– M. S.
Sep 5 '16 at 22:08
$begingroup$
Okay, yes then I understand. I thought you had negation on the variable to the left of your prime character. One way to arrive at the simplified expression is: $AB+A(neg C)+BC=AB(C+(neg C))+A(neg C)(B+(neg B))+BC(A+(neg A))=ABC+AB(neg C)+AB(neg C)+A(neg B)(neg C)+ABC+(neg A)BC=ABC+AB(neg C)+A(neg B)(neg C)+(neg A)BC=BC(A+(neg A))+A(neg C)(B+(neg B))=BC+A(neg C)$
$endgroup$
– laissez_faire
Sep 6 '16 at 19:15
$begingroup$
I know this is late, but thank you very much!
$endgroup$
– M. S.
Nov 15 '16 at 2:59
$begingroup$
I might be mistaken but I believe that both equations return true in that instance. Because if A is true and C is false then A'C is true. Meaning the whole second equation is true because it is an OR.
$endgroup$
– M. S.
Sep 5 '16 at 22:05
$begingroup$
I might be mistaken but I believe that both equations return true in that instance. Because if A is true and C is false then A'C is true. Meaning the whole second equation is true because it is an OR.
$endgroup$
– M. S.
Sep 5 '16 at 22:05
$begingroup$
just for clarification because my notation isn't that common the two equations are (AB) + (A*(¬C)) + (BC) and the other one is (A*(¬C)) + (B*C)
$endgroup$
– M. S.
Sep 5 '16 at 22:08
$begingroup$
just for clarification because my notation isn't that common the two equations are (AB) + (A*(¬C)) + (BC) and the other one is (A*(¬C)) + (B*C)
$endgroup$
– M. S.
Sep 5 '16 at 22:08
$begingroup$
Okay, yes then I understand. I thought you had negation on the variable to the left of your prime character. One way to arrive at the simplified expression is: $AB+A(neg C)+BC=AB(C+(neg C))+A(neg C)(B+(neg B))+BC(A+(neg A))=ABC+AB(neg C)+AB(neg C)+A(neg B)(neg C)+ABC+(neg A)BC=ABC+AB(neg C)+A(neg B)(neg C)+(neg A)BC=BC(A+(neg A))+A(neg C)(B+(neg B))=BC+A(neg C)$
$endgroup$
– laissez_faire
Sep 6 '16 at 19:15
$begingroup$
Okay, yes then I understand. I thought you had negation on the variable to the left of your prime character. One way to arrive at the simplified expression is: $AB+A(neg C)+BC=AB(C+(neg C))+A(neg C)(B+(neg B))+BC(A+(neg A))=ABC+AB(neg C)+AB(neg C)+A(neg B)(neg C)+ABC+(neg A)BC=ABC+AB(neg C)+A(neg B)(neg C)+(neg A)BC=BC(A+(neg A))+A(neg C)(B+(neg B))=BC+A(neg C)$
$endgroup$
– laissez_faire
Sep 6 '16 at 19:15
$begingroup$
I know this is late, but thank you very much!
$endgroup$
– M. S.
Nov 15 '16 at 2:59
$begingroup$
I know this is late, but thank you very much!
$endgroup$
– M. S.
Nov 15 '16 at 2:59
add a comment |
$begingroup$
begin{align*}
&mathrel{phantom{=}}AB+A'C+BC\
&=AB+A'C+BC(A+A') quad text{($A+A'=1$, Complementarity law)}\
&=AB+A'C+ABC+A'BC\
&=AB+ABC+A'C+ABC quad text{(Associative law)}\
&=AB+A'C quad text{(Absorption law)}
end{align*}
$endgroup$
add a comment |
$begingroup$
begin{align*}
&mathrel{phantom{=}}AB+A'C+BC\
&=AB+A'C+BC(A+A') quad text{($A+A'=1$, Complementarity law)}\
&=AB+A'C+ABC+A'BC\
&=AB+ABC+A'C+ABC quad text{(Associative law)}\
&=AB+A'C quad text{(Absorption law)}
end{align*}
$endgroup$
add a comment |
$begingroup$
begin{align*}
&mathrel{phantom{=}}AB+A'C+BC\
&=AB+A'C+BC(A+A') quad text{($A+A'=1$, Complementarity law)}\
&=AB+A'C+ABC+A'BC\
&=AB+ABC+A'C+ABC quad text{(Associative law)}\
&=AB+A'C quad text{(Absorption law)}
end{align*}
$endgroup$
begin{align*}
&mathrel{phantom{=}}AB+A'C+BC\
&=AB+A'C+BC(A+A') quad text{($A+A'=1$, Complementarity law)}\
&=AB+A'C+ABC+A'BC\
&=AB+ABC+A'C+ABC quad text{(Associative law)}\
&=AB+A'C quad text{(Absorption law)}
end{align*}
edited Feb 12 '18 at 4:15
Saad
19.7k92352
19.7k92352
answered Feb 12 '18 at 3:52
AnirbanAnirban
111
111
add a comment |
add a comment |
$begingroup$
In this way , this can be simplified
LHS = AB+A'C+BC
= AB+A'C+BC (A+A') [ A+A'=1 ]
= AB+A'C+ABC+A'BC
= AB+ABC+A'C+A'BC
= AB (1+C)+A'C (1+B)
= AB+A'C [ 1+C=1 ]
=RHS..
$endgroup$
$begingroup$
Please use Math Jax in order to produce beautiful and beautifully formatted mathematical texts.
$endgroup$
– Daniele Tampieri
Jan 22 at 21:28
add a comment |
$begingroup$
In this way , this can be simplified
LHS = AB+A'C+BC
= AB+A'C+BC (A+A') [ A+A'=1 ]
= AB+A'C+ABC+A'BC
= AB+ABC+A'C+A'BC
= AB (1+C)+A'C (1+B)
= AB+A'C [ 1+C=1 ]
=RHS..
$endgroup$
$begingroup$
Please use Math Jax in order to produce beautiful and beautifully formatted mathematical texts.
$endgroup$
– Daniele Tampieri
Jan 22 at 21:28
add a comment |
$begingroup$
In this way , this can be simplified
LHS = AB+A'C+BC
= AB+A'C+BC (A+A') [ A+A'=1 ]
= AB+A'C+ABC+A'BC
= AB+ABC+A'C+A'BC
= AB (1+C)+A'C (1+B)
= AB+A'C [ 1+C=1 ]
=RHS..
$endgroup$
In this way , this can be simplified
LHS = AB+A'C+BC
= AB+A'C+BC (A+A') [ A+A'=1 ]
= AB+A'C+ABC+A'BC
= AB+ABC+A'C+A'BC
= AB (1+C)+A'C (1+B)
= AB+A'C [ 1+C=1 ]
=RHS..
answered Aug 3 '17 at 12:58
Priya yadavPriya yadav
1
1
$begingroup$
Please use Math Jax in order to produce beautiful and beautifully formatted mathematical texts.
$endgroup$
– Daniele Tampieri
Jan 22 at 21:28
add a comment |
$begingroup$
Please use Math Jax in order to produce beautiful and beautifully formatted mathematical texts.
$endgroup$
– Daniele Tampieri
Jan 22 at 21:28
$begingroup$
Please use Math Jax in order to produce beautiful and beautifully formatted mathematical texts.
$endgroup$
– Daniele Tampieri
Jan 22 at 21:28
$begingroup$
Please use Math Jax in order to produce beautiful and beautifully formatted mathematical texts.
$endgroup$
– Daniele Tampieri
Jan 22 at 21:28
add a comment |
$begingroup$
a.b+a'.c+b.c
a.b+a'.c+b.c(a+a') {Complementary Law}
a.b+a'.c+(a.b.c+a'.b.c)
(a.b+a.b.c)+(a'.c+a'.c.b)
a.b(1+c)+a'.c(1+b) {As 1+c=1 and 1+b=1}
a.b+a'.c
$endgroup$
add a comment |
$begingroup$
a.b+a'.c+b.c
a.b+a'.c+b.c(a+a') {Complementary Law}
a.b+a'.c+(a.b.c+a'.b.c)
(a.b+a.b.c)+(a'.c+a'.c.b)
a.b(1+c)+a'.c(1+b) {As 1+c=1 and 1+b=1}
a.b+a'.c
$endgroup$
add a comment |
$begingroup$
a.b+a'.c+b.c
a.b+a'.c+b.c(a+a') {Complementary Law}
a.b+a'.c+(a.b.c+a'.b.c)
(a.b+a.b.c)+(a'.c+a'.c.b)
a.b(1+c)+a'.c(1+b) {As 1+c=1 and 1+b=1}
a.b+a'.c
$endgroup$
a.b+a'.c+b.c
a.b+a'.c+b.c(a+a') {Complementary Law}
a.b+a'.c+(a.b.c+a'.b.c)
(a.b+a.b.c)+(a'.c+a'.c.b)
a.b(1+c)+a'.c(1+b) {As 1+c=1 and 1+b=1}
a.b+a'.c
edited Jul 8 '18 at 10:00
Martin Sleziak
44.8k10119272
44.8k10119272
answered Jul 8 '18 at 3:17
aritra dasaritra das
11
11
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%2f1915698%2fsimplification-of-ab-ac-bc-in-boolean-algebra%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$
If you get stuck in the future, try Karnaugh maps. They can help to simplify complicated boolean expressions.
$endgroup$
– Cameron Williams
Sep 5 '16 at 19:04
$begingroup$
Thank you for the suggestion and I know how to use them I just still don't know how to come to the answer with equation simplification.
$endgroup$
– M. S.
Sep 5 '16 at 22:12