Can someone help me to reduce this boolean expression?
It´s not difficult I know, but Im not good at it.
Thanks.


L*B`*N`*T` + L*B`*N`*T + L*B`*N*T` + L*B*N`*T` + L*B*N`T

 

I'm going to use LB' ( L AND NOT B ) format instead of L*B`...

Original: LB'N'T' + LB'N'T + LB'NT' + LBN'T' + LBN'T

By distributive property, factoring out common factors LB'N' and LBN' yields:
1. LB'N'( T'+ T ) + LBN'( T'+ T ) + LB'NT'

Since ( T'+ T ) = 1 (always true) and any term ANDed with 1 is that term, this becomes
2. LB'N' + LBN' + LB'NT'

Factoring out L by distributive property:
3. L( B'N' + BN' + B'NT' )

Factor out N'
4. L[N'( B'+ B ) + B'NT']

Since ( B'+ B ) = 1 and N'(1) = N'
5. L( N'+ B'NT' )

Should be close except for a zillion typos that I've probably overlooked :blink:

Cheers,
Perion