Simplifying Boolean algebra expression without K-map

2 replies · 5K views · last reply
FocusedWolf
Messages
81
Reaction score
0
Hi,

This is a question about a boolean "law" type behavior I've noticed in my homework a couple of times.

Basically i can't find a boolean algebra law that permits this optimization short of using a k-map.

Handwritten Karnaugh map with columns labelled 00, 01, 11, 10 and rows D and C, with loops grouping cells, plus handwritten Boolean simplification steps ending in CD + BD.


So I'm just wondering if theirs some way to optimize the one equation using just boolean algebra in order to get the second one (the output of the k-map).
 
Nvm i found it in the solutions for that homework.

It's called the "consensus theorem"

where:

xy' + xz' +y'z =xz' + y'z

Had a feeling it was some obscure identity/law lol
 
Last edited:
OK apparently theirs two or more forms: xy + x'z + yz = xy + x'z

found this one in a book, and matched wikipedia.