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.
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
oh, this has to do with the Digital Design course, hmmm, you can use K-maps to find the unique number of minterms ^_^
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.
Lol, I've never heard of such a way. Which course is this? :)
Not the answer you are looking for? Search for more explanations.
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.
Oh, I haven't taken that :( I took Digital Design and Computer Organization
So you would also expand out the boolean expression to count the number of unique minterms?
Honestly, I have no idea, the only way I know is using the K-map.