Question

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!

Answer 1

oh, this has to do with the Digital Design course, hmmm, you can use K-maps to find the unique number of minterms ^_^

Answer 2

But it has 5 parameters which is quite difficult to use a k-map. So I was thinking it will be better if I could use some combinatorics counting techniques.

Answer 3

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

Answer 4

It is a Digital Logic Design course. But I have a feeling that some mathematics counting technique could make this calculation a lot more faster. Expanding the whole boolean expression just to find the number of unique minterms is too time consuming.

Answer 5

Oh, I haven't taken that :( I took Digital Design and Computer Organization

Answer 6

So you would also expand out the boolean expression to count the number of unique minterms?

Answer 7

Honestly, I have no idea, the only way I know is using the K-map.

Answer 8

lol... thanks anyway.

Answer 9

^_^ np