Question

Given a boolean function 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.

How do I find out the number of repeated minterms and minus from 18?

Thanks!

Answer 1

I have absolutely no idea what this all means, I am sorry. I'm not trying to be rude, I just saw that you'd not received an answer after two days and wanted to try and help.

If you need a hand with some aspect of how you'd achieve something in Python, I'd be happy to try and work with you on it, but, to be honest, I don't even understand the notation you've used to express the problem.

If you can put it in different terms, maybe I'll be able to help out.

Answer 2

Don't worry. I totally understand. It has nothing related to Python actually. The boolean function is a function of a logic circuit. And the notations are the standard logic notations. I am not sure how I can find other ways to rewrite the notations. But you can interpret CD' as something like C*!D, which reads something like C and Not D - that's C=True and D=False.

Answer 3

Yep, I still don't really get it.

Best of luck with it though.

Answer 4

Does it test truth? I'm not able to help, but I am intrigued by it. I'm seeing it as a function that takes a bunch of arguments, each being either True or False, then returns True or False based on what the expressions evaluate to.

Am I way off??

Answer 5

It's okay. Thanks anyway. There is actually another way to do this but I was just looking for a shortcut. Kinda lazy to go through the long and tedious method.

And yea... You are pretty right. It is a function that takes in 4 parameters and then spit out a 1 for true and 0 for false.