(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Find the minimum Sum-Of-Product Expression for:

f = ab'c' + abd + ab'cd'

3. The attempt at a solution

By introducing the missing variable in term 1 and term 2 I can get an expression that has all the variables: a, b, c, and d.

I do so by:

f = ab'c'd + ab'c'd' + abcd + abc'd + ab'cd'

I can combine terms like so: (1 & 2),( 2 & 5), (3 & 4) I get:

f = ab'c' + ab'd' + abd

This hardly seems minimized from the original expression. Thanks for any help.

**Physics Forums - The Fusion of Science and Community**

# Boolean Algebra: Minimum Sum-Of-Products Expression

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Boolean Algebra: Minimum Sum-Of-Products Expression

Loading...

**Physics Forums - The Fusion of Science and Community**