Given a boolean function of F(A,B,C,D,E) = CD' + ABD'E' + DE + A'BE, how do I find the number of unique minterms through the use of combinatorics? I had 2^2 + 2^1 + 2^3 + 2^2 = 18 but this includes the repeated terms which I don't know how to minus away to get only the unique number of minterms.
Thanks!

See more answers at brainly.com

Lol, I've never heard of such a way. Which course is this? :)

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.