How do I show using the laws of Boolean algebra that: $$ (a \wedge c) \, \vee \, (a \wedge b) \, \vee \, (b \wedge c) \equiv (\bar{a} \wedge b \wedge c) \, \vee \, (a \wedge \bar{b} \wedge c) \, \vee \, (a \wedge b \wedge \bar{c}) \, \vee \, (a \wedge b \wedge c) $$
Asked
Active
Viewed 35 times
1
-
That would depend somewhat on exactly which laws of Boolean algebra you have at your disposal. – Gerry Myerson May 11 '22 at 05:34
1 Answers
2
$a\land b = (a\land b \land c) \lor (a\land b \land \lnot c)$
$a\land c = (a\land b \land c) \lor (a\land \lnot b \land c)$
$b\land c = (a\land b \land c) \lor (\lnot a\land b \land c)$
Therefore
$(a\land b)\lor (a\land c)\lor ( b\land c)= (a\land b \land c) \lor (a\land b \land \lnot c)\lor (a\land \lnot b \land c)\lor (\lnot a\land b \land c)$
JMP
- 21,771