boolean Algebra

[cahlucas]

Hello everyone,

For a programming project I am dealing with Boolean algebra which I cannot figure out. It's about minimizing gate logic using Petricks method. For those of you who are not familiar with this, I have added a link at the bottom. The part that I can't figure out is just after the part where it says: = (K + LM) (N + LQ) (P + MQ). I cannot follow how the Bolean algebra ends up on this, given the formulas in the text. I hope that maybe someone among you is very adept at this and can explain it to me. Thanks in advance. Kind regards, Karel.

https://en.wikipedia.org/wiki/Petrick's_method

 

[Nanren888]

Sorry, which line can't you get to?
is it from
= (K+LM)(N+LQ)(P+MQ)
to
= (KN+KLQ+LMN+LMQ)(P+MQ)
.
Or was it getting to = (K+LM)(N+LQ)(P+MQ)?
.
Do not follow your " given the formulas in the text".
Do you think of (K+LM)(N+LQ) in terms of algebra or as [K or (L and M)] and [N or (L and Q)]?
.
They multiply the brackets out.